The Trust-Free Aggregation Layer of the Unicity Infrastructure

• URL: http://arxiv.org/abs/2608.05316v1
• Date: Wed, 05 Aug 2026 18:18:16 GMT
• Title: The Trust-Free Aggregation Layer of the Unicity Infrastructure
• Abstract summary: Unicity is a novel blockchain infrastructure for enabling users to execute off-chain peer-to-peer token transactions.<n>A key component of the infrastructure is the Aggregation Layer responsible for storing information about the spent states of tokens.<n>Our implementation uses no trusted setup, achieves throughput of 10,000 insertions per second and millisecond range verification time on a single consumer-class CPU.
• Score: 1.1766230941766413
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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 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.

Related papers

• KeyPooling: Measuring Where LLM API Relay Paths Collapse Prompt Cache Isolation [53.952294884822955]
  Large language model (LLM) API relays authenticate customers separately but often forward requests through shared provider credentials.<n>We present KeyPooling, a measurement method that traces customer identity through cache lookup and write.<n>We derive a defense contract: every customer must enter a provider-enforced domain.
  arXiv  Detail & Related papers  (2026-08-18T08:12:34Z)
• Hierarchical Residual Policy Optimization for Generative Recommendations [46.030303420508254]
  We propose a post-training framework that converts item-level outcomes into dense, token-aligned learning signals.<n>Experiments on a public dataset and an online A/B test in a large-scale commercial system show consistent gains in session-level utility and key business metrics.
  arXiv  Detail & Related papers  (2026-08-01T16:33:15Z)
• snaproot: Decentralized File Integrity Verification Using Blockchain-Anchored Cryptographic Hashing [0.0]
  We present snaproot, a lightweight system that implements the hash-anchoring paradigm of Haber and Stornetta on the Solana blockchain.<n> snaproot generates a SHA-256 hash of a file and stores it immutably on-chain as a permanent reference record.<n>We present a formal threat model, a security analysis grounded in the second-preimage resistance of SHA-256, and an empirical evaluation on Solana Devnet across file sizes from 1 KB to 500 MB.
  arXiv  Detail & Related papers  (2026-06-09T09:25:49Z)
• Revocation-Ready CP-ABE Key Management for Blockchain-Based IoT Data Sharing [0.0]
  This paper presents a revocation-ready key management layer that replaces online key release with ciphertext key publication.<n>We implement a minimal end-to-end prototype using a local content-addressed store, a hash-chained ledger, and a CP-ABE backend.
  arXiv  Detail & Related papers  (2026-05-05T20:31:12Z)
• Send the Key in Cleartext: Halving Key Consumption while Preserving Unconditional Security in QKD Authentication [59.664950447941386]
  Quantum Key Distribution (QKD) protocols require Information-Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key.<n>Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net secure key rate.<n>We present a novel ITS authentication scheme based on $varepsilon$-Almost Strongly Universal$ ($varepsilon$-ASU$)
  arXiv  Detail & Related papers  (2026-03-26T14:36:05Z)
• Hierarchical Token Prepending: Enhancing Information Flow in Decoder-based LLM Embeddings [52.49524240846879]
  We propose Hierarchical Token Prepending to mitigate attention-level compression and readout-level over-squashing.<n>HTP partitions the input into blocks and prepends block-level summary tokens to subsequent blocks, creating pathways for backward information flow.<n>As a simple, architecture-agnostic method, HTP enhances both zero-shot and finetuned models, offering a scalable route to superior long-document embeddings.
  arXiv  Detail & Related papers  (2025-11-18T19:37:40Z)
• AlDBaran: Towards Blazingly Fast State Commitments for Blockchains [52.39305978984572]
  AlDBaran is an authenticated data structure capable of handling state updates efficiently at a network throughput of 50 Gbps.<n>AlDBaran provides support for historical state proofs, which facilitates a wide array of novel applications.<n>On consumer-level portable hardware, it achieves approximately 8 million updates/s in an in-memory setting and 5 million updates/s with snapshots at sub-second intervals.
  arXiv  Detail & Related papers  (2025-08-14T09:52:15Z)
• Advanced DAG-Based Ranking (ADR) Protocol for Blockchain Scalability [2.6649708444847677]
  This paper proposes the Advanced DAG-based Ranking protocol to enhance blockchain scalability and throughput.<n>It follows a three-step approach to secure the network against double-spending and enhance performance.<n> Simulation results demonstrate that ADR significantly improves transaction throughput and network liveness compared to existing DAG-based blockchains.
  arXiv  Detail & Related papers  (2025-08-06T01:27:33Z)
• Thetacrypt: A Distributed Service for Threshold Cryptography [0.0]
  Thetacrypt is a versatile library for integrating many threshold schemes into one language.<n>It offers a way to easily build distributed systems using threshold cryptography and is agnostic to their implementation.<n>The library currently includes six cryptographic schemes that span ciphers, signatures, and randomness generation.
  arXiv  Detail & Related papers  (2025-02-05T15:03:59Z)
• Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer [1.9262692180149905]
  pod is a novel notion of consensus whose first priority is to achieve the physically-optimal latency of $2delta$.<n>Clients send transactions directly to all replicas, which independently process transactions and append them to local logs.<n>We show pod-core, a protocol that satisfies properties such as transaction confirmation within $2delta$, censorship resistance against Byzantine replicas, and accountability for safety violations.
  arXiv  Detail & Related papers  (2025-01-24T21:41:03Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.