pith. sign in
Pith Number

pith:BXLXWU4T

pith:2026:BXLXWU4TFJD635I2LQTKY7ULZ4
not attested not anchored not stored refs pending

RNG: Flat Datacenter Networks at Scale

Chinchu Merine Joseph, C. Seshadhri, Elizabeth Tennent, Enrico Carlesso, Giacomo Bernardi, Luiza Popa, Pavan Manikonda, Randy Ram, Ratul Mahajan, Saurabh Kumar, Steven Robinson

RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost.

arxiv:2604.15261 v3 · 2026-04-16 · cs.NI

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{BXLXWU4TFJD635I2LQTKY7ULZ4}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon.

C2weakest assumption

The quasi-random graph topology combined with the new distributed routing protocol can consistently locate a large number of edge-disjoint paths at production scale, and the passive optical shuffling device introduces no new reliability or performance penalties in real deployments.

C3one line summary

RNG is the first flat datacenter network deployed in production, based on quasi-random graphs with a scalable routing protocol and optical shuffling device, matching fat tree performance at up to 45% lower cost and now default at Amazon for most workloads.

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-22T01:04:02.470188Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854

Aliases

arxiv: 2604.15261 · arxiv_version: 2604.15261v3 · doi: 10.48550/arxiv.2604.15261 · pith_short_12: BXLXWU4TFJD6 · pith_short_16: BXLXWU4TFJD635I2 · pith_short_8: BXLXWU4T
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "e5e6e2e29dc1f26df19a54aaac76aac6b48b7353b1cab9b7ebe5ef475bfd73d5",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.NI",
    "submitted_at": "2026-04-16T17:37:04Z",
    "title_canon_sha256": "7461b5b1f73b173b8858830f5466e6df098b1feaa07ed7e7ef833beb6168c207"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.15261",
    "kind": "arxiv",
    "version": 3
  }
}