> For the complete documentation index, see [llms.txt](https://cvnnt.gitbook.io/documentation/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cvnnt.gitbook.io/documentation/resources/references.md).

# References

1. Poon, J., Dryja, T. (2016). The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments. Retrieved from <https://lightning.network/lightning-network-paper.pdf> , *Retrieved* *September 06, 2025*
2. Qtum Team (2020). Qtum Whitepaper. Retrieved from <https://qtumorg.s3.ap-northeast-2.amazonaws.com/Qtum_New_Whitepaper_en.pdf> , *Retrieved* *September 06, 2025*
3. Liu, S., Zhang, R., Liu, C., Wang, J. (2022). An Improved PBFT Consensus Algorithm Based on Grouping and Credit Grading. Retrieved from <https://www.researchgate.net/publication/362820377_An_improved_PBFT_consensus_algorithm_based_on_grouping_and_credit_grading> , *Retrieved* *September 06, 2025*
4. Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The EigenTrust Algorithm for Reputation Management in P2P Networks. Retrieved from <https://nlp.stanford.edu/pubs/eigentrust.pdf> , *Retrieved* *September 06, 2025*
5. Fan, X., Liu,  L., Li, M., Su, Z. (2012). EigenTrust++: Attack Resilient Trust Management. Retrieved from <https://www.researchgate.net/publication/261093756_EigenTrust_Attack_Resilient_Trust_Management> , *Retrieved* *September 06, 2025*
6. Komlo, C., Goldberg, I. (2020). FROST: Flexible Round-Optimized Schnorr Threshold Signatures. Retrieved from <https://eprint.iacr.org/2020/852.pdf> , *Retrieved* *September 06, 2025*
7. Chen, Y.-H., Lindell, Y. (2024). Feldman’s Verifiable Secret Sharing for a Dishonest Majority. Retrieved from <https://eprint.iacr.org/2024/031.pdf> , *Retrieved* *September 06, 2025*
8. Schindler, P., Judmayer, A., Stifter, N.,Weippl, E. (2019). EthDKG: Distributed Key Generation with Ethereum Smart Contracts. Retrieved from [*https://eprint.iacr.org/2019/985.pdf*](https://eprint.iacr.org/2019/985.pdf) *, Retrieved* *January 08, 2026*
9. Dahlberg, R., Pulls, T., & Peeters, R. (2016). Efficient Sparse Merkle Trees. Caching Strategies and Secure (Non-)Membership Proofs. Retrieved from <https://eprint.iacr.org/2016/683.pdf> , *Retrieved* *September 06, 2025*
10. Budish, E., Lewis-Pye, A., Roughgarden, T. (2024). The Economic Limits of Permissionless Consensus. Retrieved from <https://arxiv.org/pdf/2405.09173> , *Retrieved* *November 18, 2025*
11. Sheng, P., Wang, G., Nayak, K., Kannan, S., Viswanath, P. (2021). BFT Protocol Forensics. Retrieved from <https://arxiv.org/pdf/2010.06785> *, Retrieved* *February 08, 2026*

\ <br>