IMPLEMENTATION OF A PRIVATE DISTRIBUTED LEDGER BASED ON HASH CHAINING FOR TRANSPARENCY IN PARKING FEES
Keywords:
Permissioned Distributed Ledger, Hash Chaining, Tamper-Evident, Quorum, Audit TrailAbstract
The management of public on-street parking faces risks of record discrepancies, transaction manipulation, and weak audit trails. This study develops a prototype parking payment system using a permissioned distributed ledger based on hash chaining, incorporating models for transaction validation, auditing, and recovery. The main contribution lies not in SHA-256 or database replication, but in the integration of block sealing, cross-node validation, tamper-evident detection, and application-level approval quorum for recovery. VPS 1 forms blocks, VPS 2 validates the current hash and previous hash, while the laptop is used solely for monitoring. In the event of a conflict, a hash mismatch results in a “TAMPERED” status, and corrections can only be approved after the primary node and backup node meet the application quorum. Test results show that normal blocks can be validated and replicated, while direct manipulation of data can be detected. This research does not claim to use PBFT, PoA, or a formal distributed consensus algorithm; therefore, the architecture is positioned as a permissioned, hash-chaining-based distributed ledger that adopts blockchain concepts and provides audit and recovery mechanisms. The main limitations are that there are still only two validators and a lack of Byzantine fault tolerance.