Payment Channel Network Optimization Composed of Merkle Tree with Election Mechanism

On-chain methods fail to improve the scalability of cryptocurrencies since they are constrained by block size and block creation rate. As a result, Payment Channel Networks (PCNs) have surfaced as a vital off-chain alternative for achieving scalability. In our prior research, we introduced a scheme called Accountable Assertions Performance optimization (A²PO) designed to identify malicious users in PCNs while optimizing computational efficiency and maintaining security. The original A²PO scheme assumed the third-party supervisor to be trustworthy; however, the potential for malicious behavior exists in reality. Consequently, we present an improved A²PO framework that incorporates an election mechanism. Supervisors for each transaction are automatically elected by calculating user balances. We offer a thorough security analysis, as well as the results of our evaluation show that the suggested scheme keeps the original A²PO’s benefits in terms of computing performance while enhancing security to thwart hostile supervisor operations.