RANDOMIZED BLOCK CONFIRMATION IN BLOCKCHAIN SYSTEMS
DOI:
https://doi.org/10.32782/mathematical-modelling/2025-8-2-7Keywords:
blockchain, random selection, checkpoints, nodes, validationAbstract
The article proposes a method called «Randomized Block Verification» designed to improve the security, decentralization, and efficiency of blockchain networks of various scales. The method is based on randomly selecting nodes to verify transactions and implementing checkpoints to ensure data consistency, failure recovery, and error correction. Randomness in the selection of verifying nodes makes centralized manipulation of the network impossible, reduces the risk of collusion and malicious influence by large participants, and makes attacks much more difficult and less predictable. Checkpoints allow the system to regularly check the state of the blockchain, automatically correct inaccuracies, and provide adaptive recovery from technical failures or targeted attacks, including 51% attacks, double blocking, and attempts to censor transactions. To reliably store critical data, checkpoints are duplicated on several super-nodes, which are randomly selected with a hash verification mechanism based on cryptographically protected random numbers, which makes it impossible to forge or change information. The implementation of random node selection also reduces the computational burden on participants, increases the performance and scalability of the system, allows for faster confirmation of blocks and processing of a larger number of transactions. The method demonstrates an effective combination of the principles of decentralization, cryptographic protection and adaptive data control. It aims to eliminate some of the short-comings of classical systems, such as the centralization of validators, high vulnerability to system interference, data forgery and falsification, and the inability to retrospectively verify data, and opens up new opportunities for creating secure, scalable and reliable blockchain networks with high resistance to malicious actions and technical failures. The random selection of participants is intended to make it more difficult to manipulate the blockchain, as it is not possible to predict who will validate blocks. This should make the network more resistant to attacks such as «51%» attacks, where attackers can control most of the network's capacity.
References
Horelikova T.O. Enhanced data protection in blockchain: mitigating tampering and deletion through randomized checkpoints. Infocommunication and Computer Technologies. 2024. Т. 2. P. 40–47. https://doi.org/10.36994/2788-5518-2024-02-08-05
Горелікова Т.О. Механізм захисту інформації від підміни та видалення у блокчейн-мережах. Екзистенційні виклики освіти, науки, безпеки та здоров’я в сучасних умовах: дослідження молодих учених, м. Одеса, 12 грудня 2024 р. Одеса, 2024. С. 89. https://doi.org/10.32782/2663-5682/2024/41/19
Saad M., Spaulding J., Njilla L., Kamhoua C., Shetty S., Nyang D. Aziz Mohaisen, Exploring the Attack Surface of Blockchain: A Systematic Overview. IEEE Communications Surveys & Tutorials. 2020. https://doi.org/10.1109/COMST.2020.2975999
Guru A., Mohanta B.K., Mohapatra H., Al-Turjman F., Altrjman,C., Yadav A. A Survey on Consensus Protocols and Attacks on Blockchain Technology. Journals Applied Sciences. 2023. Т. 13, № 4. Р. 2604. https://doi.org/10.3390/app13042604
Neu J., Kiayias A., Danezis G. Incentive Analysis of Ethereum’s Proof-of-Stake Protocol. IEEE Symposium on Security and Privacy. 2023. https://doi.org/10.1109/SP46215.2023.00108
Kiayias A., Russell A. Ouroboros-BFT: A Simple Byzantine Fault Tolerant Consensus Protocol [Cryptology ePrint Archive. 2018]. URL: https://eprint.iacr.org/2018/1049.pdf
David B., Gaži P., Kiayias A., Russell A. Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol. Edinburgh Research Explorer. 2017. P. 573. https://doi.org/10.1007/978-3-319-78375-8_3
Neuder M., Moroz D. Rithvik Rao R., Parks D. Defending Against Malicious Reorgs in Tezos Proof-of-Stake. AFT '20: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, New York, October 21–23. NY, United States. 2020. P. 46–58. https://doi.org/10.48550/arXiv.2009.0541
Gilad Y., Hemo R., Micali S., Vlachos G., Zeldovich N. Algorand : Scaling Byzantine Agreements for Cryptocurrencies. 2017. URL: https://people.csail.mit.edu/nickolai/papers/gilad-algorand-eprint.pdf (дата звернення: 11.10.2025).







