Federation payment tree: An improved payment channel for scaling and efficient ZK-hash time lock commitment framework in blockchain technology

Federation Payment Tree, a new Off-chain with zero-knowledge hash time lock commitment setup is proposed in this paper. The security of blockchain is based on consensus protocols that delay when number of concurrent transactions processed in given throughput framework. The scalability of blockchain is the ability to perform support increasing workload transaction. The FP-Tree provides zero knowledge hash lock commitment connect with off-chain protocols by using the payment channel, which enables execution of off-chain protocol that allows interaction between the parties without involving the consensus protocol. It allows to make payment across an authorization path of payment channel. Such a payment tree requires two commitment scheme is T i m e l o c k and F u n d l o c k , each party lock fund for a time period. The main challenges we faced in this paper is that the computational power, storage and cryptography. Furthermore, we discussed many attacks on off-chain payment channel that allows a malicious adversary to make fund lose. The FP-Tree supports multi-parti computation (MPC) merging transactions into single hash value in payment tree. We enable the parties to generate single hash value by consumes both less than 0 ( l o g 2 N ) and space less than 0 ( l o g 2 N ) time combine element over length of single hash. The results were discussed in this paper and efficiency of FP-Tree is well suited for the blockchain technology. We achieved the accuracy of 60.2% in federated payment tree when compared with the proof of work and proof of authority.