<?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="review-article" dtd-version="1.3" xml:lang="ru">
  <front>
    <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>
      <article-id pub-id-type="publisher-id">8</article-id>
      <article-id pub-id-type="doi">10.18721/JCSTCS.18408</article-id>
      <title-group>
        <article-title>Mitigating data growth in PoW blockchains: Storage reduction methods for scalability without compromising decentralization</article-title>
        <trans-title-group xml:lang="ru">
          <trans-title>Оптимизация хранения данных в Proof-of-Work блокчейн- системах: методы сокращения объема и обеспечение масштабируемости в условиях децентрализации</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 contrib-type="author">
          <contrib-id contrib-id-type="scopus">6603839750</contrib-id>
          <name>
            <surname>Sergey M. Ustinov</surname>
            <given-names>Сергей</given-names>
          </name>
          <xref ref-type="aff" rid="aff2"/>
          <email>usm50@yandex.ru</email>
        </contrib>
      </contrib-group>
      <aff id="aff1">Peter the Great St. Petersburg Polytechnic University; Lomonosov Moscow State University</aff>
      <aff id="aff2">Peter the Great St.Petersburg Polytechnic University</aff>
      <pub-date publication-format="electronic" date-type="pub" iso-8601-date="2025-12-30">
        <day>30</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <volume>18</volume>
      <issue>4</issue>
      <fpage>87</fpage>
      <lpage>101</lpage>
      <abstract xml:lang="en">
        <p>The exponential growth of data volume in Proof-of-Work (PoW) blockchains threatens their decentralization. The article provides a systematic analysis of data growth mitigation methods (sharding, block pruning, off-chain storage etc.), identifying their key flaws: compromised auditability, increased synchronization complexity or centralization. To address the issue, a novel Periodic Aggregation with Dual Hash Anchoring (PADHA) method is proposed. Its key innovation is the synergy of data pruning and the controlled use of chameleon hash functions. The method enables linear reduction of stored history by creating final state aggregators and subsequent secure “cleansing” of blocks from past epochs. PADHA preserves cryptographic chain integrity and PoW support without trusted third parties. The method is designed for Fact-Oriented Blockchains that store final data states (facts), making it promising for registries, IoT and other applications where current information, not its change history, is critical.</p>
      </abstract>
      <kwd-group xml:lang="en">
        <kwd>distributed registries</kwd>
        <kwd>decentralized systems</kwd>
        <kwd>blockchain</kwd>
        <kwd>scalability</kwd>
        <kwd>decentralization</kwd>
        <kwd>block pruning</kwd>
      </kwd-group>
    </article-meta>
  </front>
</article>
