CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◬ AI & Machine Learning Aug 07, 2026

The Trust-Free Aggregation Layer of the Unicity Infrastructure

arXiv Security Archived Aug 07, 2026 ✓ Full text saved

arXiv:2608.05316v1 Announce Type: new Abstract: Unicity is a novel blockchain infrastructure for enabling users to execute off-chain peer-to-peer token transactions while preventing parallel states of tokens (double-spending) with minimal blockchain complexity and storage. A key component of the infrastructure is the Aggregation Layer responsible for storing information about the spent states of tokens and providing compact cryptographic proofs of no double-spending for the users without making

Full text archived locally
✦ AI Summary · Claude Sonnet


    Computer Science > Cryptography and Security [Submitted on 5 Aug 2026] The Trust-Free Aggregation Layer of the Unicity Infrastructure Risto Laanoja, Mike Gault, Dirk Draheim, Ahto Buldas Unicity is a novel blockchain infrastructure for enabling users to execute off-chain peer-to-peer token transactions while preventing parallel states of tokens (double-spending) with minimal blockchain complexity and storage. A key component of the infrastructure is the Aggregation Layer responsible for storing information about the spent states of tokens and providing compact cryptographic proofs of no double-spending for the users without making any compromises in trust. Aggregation Layer is a layer 2 style service that holds an append-only key-value repository that periodically certifies its state using a traditional blockchain that we call the Consensus Layer. Every time while certifying a changed state the Aggregation Layer provides a cryptographic proof to the Consensus Layer about the append-only consistency of the key-value store. We use the Radix Sparse Merkle Trees (RSMTs) to create the cryptographic digest r_i of the store in every round i and authentication paths of special type in order to prove that the next digest r_{i+1} was obtained while only adding some key-value pairs (k,v) to the repository. The proof verification code is implemented as an Algebraic Intermediate Representation (AIR) circuit on top of the Plonky3 STARK toolkit. Our implementation uses no trusted setup, achieves throughput of 10,000 insertions per second and and millisecond range verification time on a single consumer-class CPU. Comments: 42 pages, 7 figures, 4 tables Subjects: Cryptography and Security (cs.CR) MSC classes: 68M25 ACM classes: H.0 Cite as: arXiv:2608.05316 [cs.CR]   (or arXiv:2608.05316v1 [cs.CR] for this version)   https://doi.org/10.48550/arXiv.2608.05316 Focus to learn more Submission history From: Dirk Draheim [view email] [v1] Wed, 5 Aug 2026 18:18:16 UTC (74 KB) Access Paper: HTML (experimental) view license Current browse context: cs.CR < prev   |   next > new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Security
    Category
    ◬ AI & Machine Learning
    Published
    Aug 07, 2026
    Archived
    Aug 07, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗