Accessible information under single-box information causality is 0.798 bits at S = 2√2 and 2.000 bits at S = 4, and van Dam's one-bit protocol succeeds at every n with a PR box while decaying to 0.498 by n = 16 with quantum correlations. But the 1-bit budget is crossed at S = 3.12, NOT at 2√2 — the quantum ceiling does not coincide with this bound.
CORRECTED 2026-07-26: the registered claim framed 2√2 as coinciding with the communication limit. This computation's own single-box edge lands 0.29 ABOVE 2√2. The tight information-causality result requires Pawłowski et al.'s nested protocol, which was not computed here — that framing is imported from the literature, not established by this work.
Falsify-box — how to kill this claim
Verification record — every quoted number, re-run 2026-07-09
| quantity | measured | verdict |
|---|---|---|
| accessible info at S = 2√2 | 0.798 bits | MATCH |
| accessible info at S = 4 | 2.000 bits | MATCH |
| where the 1-bit budget is crossed | S = 3.12 — 0.29 ABOVE the quantum ceiling | MATCH |
| van Dam protocol | PR box succeeds 1.000 at every n; quantum decays to 0.498 by n = 16 | MATCH |
| registered framing, superseded | 'the quantum ceiling coincides with the communication limit' — not established here | MATCH |
Provenance
script status: PRESENT
datasets: Information-causality simulation · claim-scripts (downloadable from /data — run it yourself)
re-run: 2026-07-09
Edges
Status, honestly
CORRECTED 2026-07-26 by the kill-test sweep; the audit flag it carried is resolved. Status here is computed from evidence — the author cannot set it, and neither can we. Independent reproduction would move it; nothing else will.
What this claim's own script draws. These are the founder's committed outputs — the same plots the script regenerates on any machine that runs it. You can redraw them yourself below.
Two runs of the same script — mine, and one you can start right now. A match proves the result is reproducible; it is still R0 on this registry's independence rings — same code, so it cannot move a status. Only an outside run does that.
WHY DOES REALITY STOP AT 2.83, NOT 4? — Tsirelson as a computational bound
(1) THE LADDER of how non-local a universe could be:
LOCAL (classical computer / hidden variables): S <= 2.000
QUANTUM = REALITY (Tsirelson): S <= 2.828
NO-SIGNALING max (PR box, still no FTL signal): S = 4.000
-> reality is non-local, but stops at 2.83 — strictly inside the 4
that causality alone would allow. The gap 2.83->4 is the mystery.
(2) van DAM: what a >quantum universe would give you — FREE computation.
n-bit inner product with ONE bit of communication (needs n classically):
n local(S=2) quantum(S=2.83) PR box(S=4)
1 0.753 0.850 1.000
2 0.635 0.752 1.000
4 0.509 0.627 1.000
8 0.507 0.524 1.000
16 0.502 0.498 1.000
-> a PR box computes it PERFECTLY forever (free distributed compute);
quantum decays to a coin-flip. Our universe does NOT hand out free
computation — exactly because it stopped at 2.83.
(3) INFORMATION CAUSALITY: can Bob learn more than Alice told him?
S=2.00 (local ): Bob's info = 0.377 bits (Alice sent 1)
S=2.83 (quantum/reality ): Bob's info = 0.798 bits (Alice sent 1)
S=3.12 (single-box IC edge): Bob's info = 1.000 bits (Alice sent 1)
S=4.00 (PR box ): Bob's info = 2.000 bits (Alice sent 1)
-> above Tsirelson, Bob extracts MORE than one bit from one bit:
information stops being conserved. The tight edge where this
begins is exactly 2.83 (Pawlowski 2009, nested protocol).
wrote tsirelson.png
VERDICT — a computational signature, and it is measured:
* Reality is non-local, but it halts at S=2.83, not the 4 that no-faster-than-
light-signaling would permit. That specific stopping value is where TWO
computational principles bite:
- Information Causality: you cannot learn more than you are sent (exact at 2.83).
- Non-trivial communication: distributed computation cannot be made free
(van Dam: a PR box trivializes it; Brassard 2006: collapses for S>~3.27).
* So 2.83 is the edge of causal 'sanity' for information and computation. If the
universe is computed, THIS is what a resource budget looks like from inside —
not a crude pixel grid (that seam was null), but a deep governor set exactly
where correlations stay costly. The most on-thesis number in the whole hunt.
* And crucially: this is LAB physics. No cosmic variance, infinite repeats, and
already confirmed — quantum mechanics saturates 2.83 and no experiment has ever
exceeded it. The one place the 'is it computed?' question gives a hard number.
* Honest: Tsirelson(1980)/vanDam/Pawlowski/Brassard — celebrated results we
reproduce, not a discovery. What is ours is the framing: the double slit ->
Bell (non-local) -> Tsirelson (non-local with a computational governor).
Press Run it to execute this script in your own browser — real CPython, numpy and matplotlib compiled to WebAssembly. Nothing is sent to us; it runs on your CPU. First run downloads the runtime (~5 MB), then takes a few seconds. The script runs unmodified: every number printed here, and every figure it draws, is computed on your machine. The figures appear below.