<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xml:lang="en">
  <front xmlns:xlink="http://www.w3.org/1999/xlink">
    <journal-meta>
      <journal-title-group>
        <journal-title>Computing, Telecommunication and Control</journal-title>
        <trans-title-group xml:lang="ru">
          <trans-title>Информатика, телекоммуникации и управление</trans-title>
        </trans-title-group>
      </journal-title-group>
      <issn pub-type="epub">2687-0517</issn>
    </journal-meta>
    <article-meta xmlns:xlink="http://www.w3.org/1999/xlink">
      <article-id pub-id-type="publisher-id">11</article-id>
      <article-id pub-id-type="doi">10.18721/JCSTCS.19311</article-id>
      <title-group>
        <article-title>Multi-Layer Hash Anchoring method with waterfall consensus for fact-oriented blockchain</article-title>
        <trans-title-group xml:lang="ru">
          <trans-title>Метод многослойной привязки хешей с водопадным консенсусом для факто-ориентированных блокчейнов</trans-title>
        </trans-title-group>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Razuvaev</surname>
            <given-names>Daniil</given-names>
          </name>
          <xref ref-type="aff" rid="aff1"/>
          <email>Razuvaev_DD@mail.ru</email>
        </contrib>
      </contrib-group>
      <aff id="aff1">Peter the Great St. Petersburg Polytechnic University; Lomonosov Moscow State University</aff>
      <pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-09-30">
        <day>30</day>
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <volume>19</volume>
      <issue>3</issue>
      <fpage>130</fpage>
      <lpage>147</lpage>
      <self-uri xmlns:xlink="http://www.w3.org/1999/xlink" content-type="pdf" xlink:href="https://infocom.spbstu.ru/userfiles/files/articles/2026/3/130-147.pdf"/>
      <abstract xml:lang="en">
        <p>The paper proposes a method based on the ideas of classical Proof-of-Work (PoW) for building a distributed registry (Multi-Layer Hash Anchoring, MLHA) based on redundancy of PoW block headers. Each block contains links to the last blocks of all layers, determined by the number of leading hash zeros, which allows you to highlight the sparse skeleton of the waterfall chain. The properties of the waterfall are investigated: uniqueness, determinism, and logarithmic growth of average length. The criterion for the safe deletion of blocks not included in the waterfall is proved, and the possibility of a trustless audit of deleted data is shown. A consensus mechanism based on a lexicographic comparison of waterfall vectors is proposed, consistent with the principle of maximum performance. A single security window has been introduced linking the network hashrate, the minimum mining complexity and the allowable probability of an attack; an upper bound on this probability has been obtained. The simulation results confirm the theoretical estimates. The method does not require a trusted installation, has post-quantum stability and can be used in lightweight decentralized systems.</p>
      </abstract>
      <kwd-group xml:lang="en">
        <kwd>Proof-of-Work</kwd>
        <kwd>blockchain</kwd>
        <kwd>data compression</kwd>
        <kwd>logarithmic growth</kwd>
        <kwd>consensus</kwd>
        <kwd>waterfall</kwd>
        <kwd>MLHA</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="ref1">
        <mixed-citation publication-type="journal">Razuvaev D.D., Ustinov S.M. Mitigating data growth in PoW blockchains: Storage reduction methods for scalability without compromising decentralization. Computing, Telecommunications and Control, 2025, Vol. 18, No. 4, Pp. 87–101. DOI: 10.18721/JCSTCS.18408</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation publication-type="journal">Kaveshnikov A.V., Bragin D.S., Vaizov V.Kh., Kaveshnikov V.S. The possibilities of blockchain technologies application in the healthcare sector. Siberian Scientific Medical Journal, 2025, Vol. 45, No. 5, Pp. 78–90. DOI: 10.18699/SSMJ20250507</mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation publication-type="journal">Pal T., Bommisetti V., Suvarnakanti P., Dudala S.S., Asha S., Jaiswal V. The revolutionary role of blockchain technology in the agri-food sector focusing on the food supply chain. Food Reviews Internatio-nal, 2025, Vol. 41, No. 3, Pp. 770–801. DOI: 10.1080/87559129.2024.2418464</mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation publication-type="journal">Lingeshwaran G., Raman J.M.H. Blockchain enhanced IoT devices: Review. International Journal of Nexus of Knowledge, 2025, Vol. 1, No. 2.</mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation publication-type="journal">Altarawneh A., Herschberg T., Medury S., Kandah F., Skjellum A. Buterin’s Scalability Trilemma viewed through a State-change-based Classification for Common Consensus Algorithms. 2020 10th Annual Computing and Communication Workshop and Conference (CCWC), 2020, Pp. 0727–0736. DOI: 10.1109/CCWC47524.2020.9031204</mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation publication-type="journal">Miller L., Pacaud D., Derousseaux-Lebert N., Anceaume E., Ludinard R. Mining in Logarithmic Space with Variable Difficulty. Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communicati-ons Security, 2025, Pp. 888–902. DOI: 10.1145/3719027.3744874</mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation publication-type="journal">Al-Janabi S. Post-Quantum Blockchain: Challenges and Opportunities. arXiv:2508.17071, 2025. DOI: 10.48550/arXiv.2508.17071</mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation publication-type="journal">Sezer B.B., Akleylek S., Nuriyev U. PP-PQB: PP-PQB: Privacy-Preserving in Post-Quantum Blockchain-Based Systems: A Systematization of Knowledge. IEEE Access, 2025, Vol. 13, Pp. 41382–41405. DOI: 10.1109/ACCESS.2025.3545943</mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation publication-type="journal">Heo J.W., Ramachandran G.S., Dorri A., Jurdak R. Blockchain data storage optimisations: a com-prehensive survey. ACM Computing Surveys, 2024, Vol. 56, No. 7, Art. no. 179. DOI: 10.1145/3645104</mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation publication-type="journal">Morsidi M., Tajuddin S., Shah Newaz S.H., Patchmuthu R.K., Lee G.M. A Review on Blockchain Sharding for Improving Scalability. Future Internet, 2025, Vol. 17, No. 10, Art. no. 481. DOI: 10.3390/fi17100481</mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation publication-type="journal">Shor P.W. Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, Pp. 124–134. DOI: 10.1109/SFCS.1994.365700</mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation publication-type="journal">Boughdiri M., Abdellatif T., Guegan C.G. A systematic literature review on blockchain storage sca-lability. IEEE Access, 2025, Vol. 13, Pp. 102194–102219. DOI: 10.1109/ACCESS.2025.3578451</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>
