Constant-Size Accumulators Unlock Truly Stateless Blockchain Architecture → Research

A sophisticated, multi-component device showcases transparent blue panels revealing complex internal mechanisms and a prominent silver control button. The modular design features stacked elements, suggesting specialized functionality and robust construction

The image showcases a micro-electronic circuit board with a camera lens and a metallic component, possibly a secure element, partially submerged in a translucent blue, ice-like substance. This intricate hardware setup is presented against a blurred background of similar crystalline material

Briefing

The core research problem is the critical state bloat that threatens the decentralization of blockchain networks by imposing prohibitive storage costs on full nodes. This paper proposes a foundational breakthrough → novel batching techniques for cryptographic accumulators in groups of unknown order, which allows for the non-interactive aggregation of numerous membership proofs into a single, constant-sized witness. This mechanism fundamentally changes the storage complexity of a full node from being linear with the state size (O(N)) to a constant size (O(1)), providing the single most important implication of cryptographically guaranteeing the feasibility of a truly stateless blockchain architecture.

A high-tech, white modular apparatus is depicted in a state of connection, with two primary sections slightly apart, showcasing complex internal mechanisms illuminated by intense blue light. A brilliant, pulsating blue energy stream, representing a secure data channel, actively links the two modules

Context

The prevailing limitation in decentralized systems is the “state problem,” where the set of all unspent transaction outputs (UTXOs) or account balances grows perpetually, demanding storage proportional to the network’s history. Before this work, authenticated data structures like Merkle trees offered logarithmic proof sizes (O(log N)), which was insufficient for achieving true statelessness, as nodes still required significant storage to verify the Merkle root and process proofs, creating a centralizing pressure on the network’s validating set.

$A pristine white spherical device with a luminous blue central lens is depicted, partially encased within a shattered, ice-like structure. The fractured outer shell reveals the inner workings and the radiant blue light emanating from its core, symbolizing the intricate protocol architecture of an advanced Decentralized Autonomous Agent$

Analysis

The core idea is the development of a universal accumulator that operates without a trusted setup by leveraging groups of unknown order, specifically RSA groups. The new mechanism is a set of succinct proof systems that allow a prover to generate a single, constant-sized proof that simultaneously validates the inclusion or exclusion of a large batch of elements against the accumulator commitment. This fundamentally differs from prior approaches, which required a separate proof for each element or a proof size that grew with the logarithm of the set size, by using advanced zero-knowledge proofs of correct exponentiation to non-interactively aggregate these witnesses.

A central, intricate structure composed of translucent blue blocks, partially covered in white granular material, serves as the focal point, connected by several metallic pathways extending outwards. A perfectly spherical white object, also covered in a fine white texture, rests on one of these pathways adjacent to the central blue assembly

Parameters

Node Storage Complexity → O(1) – The required storage for a full node to participate in consensus is reduced to a constant size, independent of the total state size.
Membership Proof Size → Constant Size – The aggregated proof for any number of elements remains fixed, enabling highly efficient on-chain verification.
Proof Verification Operations → Constant Number – The verification of the aggregated proof requires a fixed number of group operations, independent of the batch size.

The image depicts two white, modular cylindrical units, partially covered in vibrant blue, ice-like structures, facing each other on a dark background. A luminous blue energy conduit, accompanied by numerous small glowing particles, forms a connection between their core interfaces

Outlook

This foundational work unlocks a strategic roadmap toward ultra-lightweight, high-throughput decentralized systems. In the next 3-5 years, this primitive is expected to be integrated into next-generation blockchain state layers, enabling mobile devices to act as full validating nodes and eliminating the storage bottleneck for rollup state verification. The research opens new avenues for constructing highly efficient Interactive Oracle Proofs (IOPs) and developing more robust, decentralized public key infrastructure without relying on trusted intermediaries.

A futuristic white and silver mechanical structure, shaped like a segmented torus, features a central aperture from which a bright, concentrated beam of blue, glowing data streams outward. This beam consists of countless tiny luminous particles and intertwined conduits, extending into the background

Verdict

This cryptographic primitive is a decisive architectural breakthrough, resolving the long-standing state bloat problem and mathematically guaranteeing the path to fully decentralized, constant-storage full nodes.

Cryptographic Accumulators, Groups of Unknown Order, Stateless Blockchain, Constant Storage, Proof Aggregation, Batch Verification, Vector Commitments, Non-Membership Proofs, Succinct Proof Systems, Zero-Knowledge Proofs, Decentralized Storage, State Bloat Mitigation, Full Node Efficiency, Constant Time Verification, Universal Accumulator, RSA Accumulator, Public Key Infrastructure Signal Acquired from → IACR ePrint Archive