DOI
10.34229/KCA2522-9664.26.2.9
UDC 621.391:519.2:519.7
L.V. Kovalchuk
Institute of Physics and Technology of the National Technical University “Igor Sikorsky Kyiv Polytechnic Institute;”
G.E. Pukhov Institute for Modelling in Energy Engineering, National Academy of Sciences of Ukraine,
Kyiv, Ukraine, 
lusi.kovalchuk@gmail.com
M.S. Kondratenko
G.E. Pukhov Institute for Modelling in Energy Engineering, National Academy
of Sciences of Ukraine, Kyiv, Ukraine, nikolay.ns95@gmail.com
DETERMINING THE NUMBER OF CONFIRMATION BLOCKS IN A TWO-LEVEL
BLOCKCHAIN WITH PROOF-OF-PROOF CONSENSUS PROTOCOL FOR DIFFERENT
CONSENSUS TYPES IN MAINCHAIN/SIDECHAIN TO PREVENT DOUBLE-SPEND ATTACK
II. PoW IN MAINCHAIN/PoS IN SIDECHAIN
Abstract. The paper investigates the issues of secure functioning of a two-level blockchain with a complex mixed consensus protocol — Proof-of-Work in the main blockchain (mainchain) and Proof-of-Stake in the secondary (sidechain). The principle of building such a blockchain is based on the Proof-of-Proof protocol, where a stable blockchain (mainchain) is used to ensure the stability of the sidechain, by referring the mainchain blocks to the sidechain blocks using special transactions. Such a structure allows for faster block generation in the sidechain and, accordingly, faster processing of transactions without reducing stability and without increasing the block size. In turn, such a two-level blockchain is of the greatest interest for the creation of a cascade system of state registers, which will be guaranteed to be protected against the substitution and forgery of documents. The main results of the work areexplicit analytical expressions for estimates of the probability of double spend attack on such a two-level blockchain, under the condition of an adversary in the sidechain and in the mainchain. The expressions obtained allow finding the number of confirmation blocks in the sidechain, which guarantees security against the attack with a probability no less than a preset value.
Keywords: blockchain, mainchain, sidechain, cryptocurrencies, mining, Proof-of-Proof consensus protocol, double spend attack.
full text
REFERENCES
- 1. Kovalchuk L.V., Kuchynska N.V., Kondratenko M.S. Determining the number of confirmation blocks in a two-level blockchain with Proof-of-Proof consensus protocol for different consensus types in mainchain / sidechain to prevent double spend attack. I. PoS in mainchain PoW in sidechain. Cybern. Syst. Anal. 2024. Vol. 61, N 4. P. 646–655. https://doi.org/10.1007/s10559-024-00703-5.
- 2. Zhang H., Wu J., Liu Y., Yu J. VaryBlock: A novel approach for object detection in remote sensed images. Sensors. 2019. Vol. 19. P. 5284. https://doi.org/10.3390/s19235284.
- 3. Lashkari B., Musilek P. A comprehensive review of blockchain consensus mechanisms. IEEE Access. 2021. Vol. 9. P. 43620–43652. URL: https://www.researchgate.net/publication/ 350031088_A_Comprehensives_Review_of _Blockchain_Consensus_Mechanisms.
- 4. Arbitrum chains overview. Arbitrum.io. URL: https://docs.arbitrum.io/build-decentralized-apps/public-chains (date of access: 18.06.2025).
- 5. Optimizm overview. Mintingm.com. URL: https://mintingm.com/research/optimism-layer-2-blockchain/.
- 6. Polygon technology. URL: https://polygon.technology/.
- 7. Gai F., Niu J., Jalalzai M., Tabatabaee S., Feng C. A secure sidechain for decentralized trading in internet of things. IEEE Internet of Things Journal. 2024. Vol. 11, N 3. P. 4029–4046.1. https://doi.org/10.1109/JIOT.2023.3300051.
- 8. Deng Z., Li T., Tang C., He D., Zheng Z. PSSC: Practical and secure sidechain construction for heterogeneous blockchains orienting IoT. IEEE Internet of Things Journal. 1 Feb.1, 2024. Vol. 11, N 3. P. 4600–4613. https://doi.org/10.1109/JIOT.2023.3302291.
- 9. Yin L., Xu J., Liang K.. Zhang Z. Sidechains with optimally succinct proof. IEEE Transactions on Dependable and Secure Computing. July–Aug. 2024. Vol. 21, N 4. P. 3375–3389. https://doi.org/10.1109/TDSC.2023.3328430.
- 10. Dibya D.K., Mohan M. Sidechain: A scalable blockchain. International Conference on Applied Artificial Intelligence and Computing (ICAAIC). Salem, India, 2022. P. 1337–1342. https://doi.org/10.1109/ICAAIC53929.2022.9793041.
- 11. Nakamoto S. A peer-to-peer electronic cash system, 2008. URL: https://bitcoin.org/bitcoin.pdf.
- 12. Kovalchuk L., Kostanda V., Marukhnenko O., Pozhylenkov O. Achieving security in Proof-of-Proof protocol with non-zero synchronization time. Mathematics. 2022. Vol. 10, N 14. https://doi.org/10.3390/math10142422.
- 13. Saleh F. Blockchain without waste: Proof-of-Stake. The review of financial studies. 2021. Vol. 34, Iss. 3. P. 1156–1190. https://doi.org/10.1093/rfs/hhaa075.
- 14. Kondratenko M. Determining the number of confirmation blocks in the blockchain that hosts the second-level registry in the case that both blockchains use the PoS-consensus protocol. Collection of materials of the XLІ Scientific and technical conference of young scientists and specialists of G.E. Pukhov Institute for Modelling in Energy Engineering of National Academy of Sciences of Ukraine/PIMEE of NAS of Ukraine, 2023. P. 188–190. URL: https:// ipme.kiev.ua/wp-content/uploads/2023/05/Матеріали-конференції-2023.pdf.
- 15. Kiayias A., Russell A., David B., Oliynykov R. Ouroboros: A provably secure Proof-of-Stake blockchain protocol. Lecture Notes in Comp. Sci. 2017. Vol. 10401. https://doi.org/10.1007/978-3-319-63688-7_12.
- 16. Kovalchuk L., Rodinko M., Oliynykov R., Kaidalov D., Nastenko A. Probability of double spend attack for network with non-zero time delay. 2022. Vol. 100, Iss. Supplementum. P. 597–615. https://doi.org/10.5486/pmd.2022.suppl.4.
- 17. Kovalchuk L., Kaidalov D., Nastenko A., Rodinko M., Shevtsov O., Oliynykov R. Decreasing security threshold against double spend attack in networks with slow synchronization. Computer Communications. 2020. Vol. 154. P. 75–81. https://doi.org/10.1016/j.comcom.2020.01.079.
- 18. Grunspan C., Perez-Marco R. Double spend races. International journal of theoretical and applied finance. 2018. Vol. 21, N 8. 1850053. https://doi.org/10.48550/arXiv.1702.02867.
