Briefing
The core research problem in succinct data structures is the computational bottleneck of RSA-based dynamic accumulators, which previously required the slow process of mapping every element to a unique prime number. This paper proposes a novel construction for an RSA-based dynamic universal accumulator that completely eliminates the need for this prime representation. This foundational breakthrough allows for substantial efficiency gains, enabling efficient batching of set operations and aggregation of membership witnesses. The single most important implication is the practical realization of constant-size, updatable, and verifiable set-membership proofs, which is critical for scalable stateless clients and privacy-preserving protocols across all future blockchain architectures.
Context
Before this research, cryptographic accumulators were theoretically powerful, offering constant-size proofs for set membership and non-membership, but their practical utility was severely limited by implementation constraints. RSA-based schemes, while offering the most efficient witness updates, were hampered by the requirement to securely and efficiently map all accumulated elements into the space of prime numbers, a step that introduced prohibitive computational overhead and rendered them too slow for high-throughput, dynamic decentralized applications.
Analysis
The breakthrough centers on a mathematical re-framing of the accumulator’s update function, allowing the accumulation of composite numbers directly within the RSA modulus’s unknown-order group. The new primitive is a dynamic universal accumulator that achieves security based on the strong RSA assumption without relying on the costly “hashing to primes” function. Conceptually, instead of ensuring every element is a prime factor of the accumulated value, the scheme uses a technique that maintains the one-way property and collision resistance even when the elements are composites, thereby drastically reducing the computational cost of element addition and deletion. This fundamentally differs from prior approaches by shifting the security burden from the element’s structure to the new, optimized accumulation function.
Parameters
- Key Metric → Elimination of Hashing to Primes → The computationally expensive step of mapping elements to unique primes is removed, which was the primary bottleneck in previous RSA accumulator implementations.
- Witness Operations → Efficient batching of additions and deletions is enabled, dramatically improving the throughput of set updates.
- Proof Size → Membership and non-membership witnesses remain constant size, typically equivalent to the size of an RSA modulus.
Outlook
This new primitive opens immediate avenues for research into highly efficient, privacy-preserving systems. Potential applications in the next three to five years include scalable certificate revocation for decentralized identity systems, fully stateless blockchain clients that can verify the entire state with a single, constant-size proof, and advanced zero-knowledge systems that rely on succinct set operations for anonymous credentials. The next step is the formal integration of this scheme into production-grade cryptographic libraries to validate its performance gains in real-world decentralized environments.
Verdict
The elimination of the prime-hashing requirement transforms RSA accumulators from a theoretical curiosity into a foundational, deployable primitive for the next generation of scalable and privacy-focused blockchain infrastructure.
