Metraipolis › archive › dc_2cd6c55775a3

GridSMR: Causal Compression for Sharded Blockchains — arXiv:2610.01443

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01443
License (as archived)
CC0-1.0
Archived
2026-10-06T14:02:47.173Z
SHA-256 of the archived text
241007b9a6ff124caed7a07ad5471ea4d742e2f2fc06aae8aedaa6015b0c9018
Stable URL of this page
https://metraipolis.com/documento/dc_2cd6c55775a3

How to cite

GridSMR: Causal Compression for Sharded Blockchains — arXiv:2610.01443 — arXiv (en), https://arxiv.org/abs/2610.01443 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2cd6c55775a3 (Metraipolis archive dc_2cd6c55775a3, sha256 241007b9a6ff124caed7a07ad5471ea4d742e2f2fc06aae8aedaa6015b0c9018)
BibTeX
@misc{dc2cd6c55775a3,
  title = {GridSMR: Causal Compression for Sharded Blockchains — arXiv:2610.01443},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01443},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2cd6c55775a3; sha256 241007b9a6ff124caed7a07ad5471ea4d742e2f2fc06aae8aedaa6015b0c9018},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01443. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present GridSMR, a sharded blockchain that scales execution horizontally while allowing dependent cross-shard operations to progress within a single block. Existing sharded systems typically place coordination between dependent cross-shard steps, making latency grow with causal depth. GridSMR localizes atomicity to individual accounts and executes cross-account work asynchronously. Using an execute-before-agree architecture, dependent operations execute across shards as they become available, while consensus later validates and commits the resulting schedule. This enables Causal Compression: cross-shard latency need not grow with the causal depth of a computation. GridSMR scales single-validator execution to 1.07M requests/s and four-validator execution to 193K committed requests/s, while reducing 16-hop causal-chain latency by 8.2x versus deferred execution.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-02 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.01443 — 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-06T12:22:22.557Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).