Metraipolis › archive › dc_f9faaf5e82fe
Cambium: Participant-Built Commitment Roots for Shared Digital Infrastructure — arXiv:2610.30409
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.30409
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-23T15:23:21.025Z
- SHA-256 of the archived text
50a334af3a6cf72077143d5f8fd2211684f59d2742b9ee7f08d644c2ba034574- Stable URL of this page
https://metraipolis.com/documento/dc_f9faaf5e82fe
How to cite
Cambium: Participant-Built Commitment Roots for Shared Digital Infrastructure — arXiv:2610.30409 — arXiv (en), https://arxiv.org/abs/2610.30409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9faaf5e82fe (Metraipolis archive dc_f9faaf5e82fe, sha256 50a334af3a6cf72077143d5f8fd2211684f59d2742b9ee7f08d644c2ba034574)
BibTeX
@misc{dcf9faaf5e82fe,
title = {Cambium: Participant-Built Commitment Roots for Shared Digital Infrastructure — arXiv:2610.30409},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.30409},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9faaf5e82fe; sha256 50a334af3a6cf72077143d5f8fd2211684f59d2742b9ee7f08d644c2ba034574},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.30409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Commitment services, such as timestamping, transparency logs and provenance registries, let a party prove that it bound itself to a record without publishing the record. Today an operator runs them, or a blockchain replaces the operator at the cost of network-wide agreement on every write. We present Cambium, a permissioned peer-to-peer service in which participants build each cycle's commitment root together, so that no single party decides which inputs the root includes. Fixed-size committees certify inputs and use a recursive-doubling merge, in which disjoint groups recompute every intermediate value, to spread root construction across all participants. A successful cycle costs each node $O(c\log(n/c))$ messages for committee size $c$, and each node stores its own $O(\log(n/c))$ proof per cycle, along with the $O(n)$ membership roster. A Go prototype on AWS with $c=4$, 8-256 nodes and simulated stragglers completes cycles in 12-148 ms and verifies proofs in under 1.5 ms, and demonstrates logarithmic growth. We show that conflicting certificates identify their signers, that a proof binds a signed input to its root, and that two conflicting roots both become final only if at least a third of the nodes are Byzantine, except with probability exponentially small in the number of committees. We also set out the membership, proof-availability and exclusion questions a community deploying Cambium must answer. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2610.30409 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-23T15:10:08.337Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).