cert-machine · report · generated from the record

The least dissipation behind a blinking light, narrowed from a factor of 25 to 3%

A hidden machine blinks a light, and you look only at random moments. Two numbers you measure break an inequality every machine in equilibrium obeys, so the machine must burn energy; Dobrynin and Stroujkova showed this effect a day before this run and left the least amount open. In under seven hours, Claude Fable 5.2 (Anthropic) and GPT-6.2 Astra (OpenAI), working together, narrowed it for one example from a factor of 25 to 3.1%. With Claude (Anthropic’s AI model), I checked both ends in exact arithmetic: the upper end is decided; the lower end rests on two theorems one model proved and the other read.

0 0.1 0.2 0.3 0.4 0.5 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19 November 2026, time of day (UTC) g = least dissipation per reading (k_B) upper bound: a network that reproduces both numbers, decided lower bound: proved by one model and read once by the other, not decided
0 0.1 0.2 0.3 0.4 0.5 11:00 14:00 17:00 time (UTC) g upper bound: a network, decided lower bound: proved, read once
The two bounds on g(3/10, 2/25) during the run, each drawn when the control room registered or decided it. Solid: the best network found so far, decided by the checker: it reproduces both numbers exactly and its dissipation is enclosed. Dashed: the best lower bound so far, a theorem proved by one model and read once by the other. The paper’s own four-state network sits far above the frame, at g = ln 3 ≈ 1.10. At the end: 0.36572 ≤ g ≤ 0.37713.Records: certs/blinking-light.json · sha256 76be58467225; corpus/blinking-light/series.json · sha256 03837472d4acThe build refuses this figure if a decided network or a certificate in the series stops matching the message it cites.
upper bound on g, decided
0.37713
a 156-state network reproduces both numbers exactly; its dissipation is enclosed to twelve digits
lower bound on g, read once
0.36572
its certificate passes every finite check here; the two theorems behind it are read once, not decided
what is left
3.1%
from a factor of 25 when the run began
planted errors caught
2 of 2
by each model; the record’s own 8 wrong versions all refused

The upper end of the interval is decided. The lower end rests on two theorems that one model proved and the other read; they are not decided here. Nothing on this page is about a physical device, and nothing compares the two models.

read this first

What is still open

The conditions of the run
  • Both models worked in one shared folder and could read each other’s files from the first minute. This was a collaboration, and nothing here compares the two.
  • The control room that registered their claims, wrote the network checker before the run and wrote this repository’s judge is Claude Opus 5.5, of the same family as one of the two. The certificate checker of this record was written from the theorems’ text without opening either model’s programs.
  • The record’s pre-registration was written after the run and says so. The network checker gave its verdicts in the run first.
  • Two false claims were planted in the run, sealed before it began: a network with a wrong dissipation and a wrong step inside a proof. Each model caught both.
1 · the question

A light that has to cost energy

the question
Select a step for what it means here.
1 · A HIDDEN MACHINE states and rates you never see 2 · ITS LAMP seen only at random moments 3 · TWO NUMBERS C1 = 0.30 · C2 = 0.08 4 · THE EQUILIBRIUM TEST needs C2 ≥ 0.09: it fails 5 · THE QUESTION the least it can dissipate: g 6 · THE UPPER END · A MACHINE g ≤ 0.37713 · decided 6 · THE LOWER END · A CERTIFICATE g ≥ 0.36572 · read once
The question in six steps. Two numbers that break the equilibrium test prove that the hidden machine dissipates; how little it can dissipate is bounded from both ends.
decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it
0.04 0.08 0.12 0.16 0.20 0.25 0.30 0.35 0.40 C1, consecutive looks C2, looks two apart at C1 = 0.30 equilibrium needs C2 ≥ 0.09 C2 = C1²: every equilibrium machine is on or above it; below it (shaded) a machine must dissipate this lamp: C1 = 0.30, C2 = 0.08
Why this light costs energy. A machine in equilibrium always lands on or above the curve C2 = C1²; this lamp lands just under it, 0.08 against 0.09.Record: corpus/blinking-light/run/GOAL.md · sha256 759155dfaf48The build refuses this figure if the target is no longer (3/10, 2/25).
  • The paper. A. V. Dobrynin and A. Stroujkova, When Time-Reversible Sensor Records Require Hidden Dissipation (arXiv:2611.24898, 18 November 2026), shows this effect for a lamp watched continuously and leaves the least dissipation over all finite machines open. Here the observer has only the two numbers.
  • Before the run. g was known to lie between 0.02 (an inequality of Pinsker’s type) and 0.497 (an eight-state ring). The paper’s four-state machine gives ln 3 ≈ 1.10.
2 · the upper end, decided

The machine that won: a switch and a ring

the ring 154 states · 18% all of the current the switch 2 states · 82% in equilibrium no current one edge lamp on (filled) · lamp off (hollow) · area ∝ probability
The 156-state machine of the upper end, drawn from its file. Most of the probability (82%) sits in a two-state switch in equilibrium; a ring of 154 states carries all the current, with the lamp on for 77 of them in a row; one edge joins the two. Areas and the current are computed in floating point from the decided network.Records: corpus/blinking-light/run/claude/mix156.json · sha256 2f22bf12ba4f; certs/blinking-light.json · sha256 76be58467225The build refuses this figure if the drawn network stops giving C1 = 0.3 and C2 = 0.08, or stops being a switch joined to a ring.
0.35 0.40 0.45 0.50 0.55 6 10 20 40 100 200 400 number of hidden states (log scale) g of the best machine found lower end 0.3657 before the run: a plain search, rings and complete graphs (floats) rings, decided a switch and a ring, floating-point search a switch and a ring, decided
Rings stall near 0.44 however many states they get. The switch-and-ring shape keeps falling: dashed where it was found by a floating-point search, solid where machines were decided exactly. In the search it reaches 0.37712 at 162 states; Claude Fable 5.2 extrapolates 0.3769.Records: corpus/blinking-light/run/control/verdict-MIX156.json · sha256 ddf01792882a; corpus/blinking-light/run/control/verdict-RING400.json · sha256 9931224a4a90; corpus/blinking-light/run/claude/notes.md · sha256 0f6c0abb51f5The build refuses this figure if a decided network in the figure is no longer CERTIFIED in the run.
  • How a machine is decided. The checker computes both numbers exactly. When two rates are left free in a tiny box, an interval Newton test (Krawczyk’s) proves exactly one choice in the box hits both numbers; then it encloses the dissipation.
  • Two programs on one machine. The 84-state machine, every rate a fraction, was decided again by a second program written without opening the checker: g ≤ 0.37787624.
The decided machines
NetworkStatesShapeFromg at mostStanding
RING4040a ringGPT-6.2 Astra0.45614592DECIDED
RING400400a ringGPT-6.2 Astra0.44314191DECIDED
MIX4242a switch, a ring, one edgeClaude Fable 5.20.38321857DECIDED
RATMIX8484two switches and a ring, every rate a fractionGPT-6.2 Astra0.37787624DECIDED
MIX156156a switch, a ring, one edgeClaude Fable 5.20.37712827DECIDED
3 · the lower end, read once

A certificate every machine must pay

  • The idea. Label every hidden state by what it predicts about the lamp’s future and what it remembers of its past: a point in a square. A certificate is three functions on that square. If two conditions hold everywhere, every machine dissipates at least a stated amount (Theorem D), and it is enough to check a 2×2 matrix inequality at each single point (Theorem C).
  • Decided here. The best certificate passes both conditions over the whole square, for both lamp states, in exact arithmetic: 3,090 boxes, checked by a program written from the theorems’ text alone. Its bound is 1828627119/5000000000 = 0.3657254. Two other programs, the author’s and GPT-6.2 Astra’s, agree.
  • Not decided. Theorems D and C were proved by Claude Fable 5.2 and re-derived by GPT-6.2 Astra; nobody else has checked them. If either fails, the lower end falls; the upper end does not.
Certificateg at leastEntered the record (UTC)
CERT2110.339286213:23
CERT211B0.353201214:16
CERT2220.358756214:52
CERT3330.361375615:50
CERT222G0.365725417:32
The theorems and who read them
ClaimFromRead byStandingHow it was read
Weak duality: three functions on the square of labels and three numbers that satisfy two pointwise conditions give, for every finite network, sigma/r ≥ l1 C1 + l2 C2 + mu.Claude Fable 5.2GPT-6.2 AstraPROOF READGPT re-derived it (g19): the potential terms cancel by flow balance and the two resolvent identities produce the rest. It is the step that turns a certificate into a bound.
Locality: for piecewise-smooth certificates, the condition on every pair of labels follows from a 2×2 matrix inequality at each single point; an edge can be cut into a chain through massless states at no cost.Claude Fable 5.2GPT-6.2 AstraPROOF READGPT re-derived the subdivision lemma and the Taylor estimate independently (g39). It is what makes the certificate checkable by finitely many polynomial inequalities.
The least dissipation is a convex program over labelled states, so g(C1, C2) is convex.Claude Fable 5.2GPT-6.2 AstraPROOF READ, on C1 < 1GPT first found a gap at the boundary (g20), then, with its own repair read in full by Claude, found it holds for C1 < 1, the target included, and showed the statement as first printed is false at C1 = 1 (g47). The bounds on this page do not use it.
The first strong lower bound of the run: g ≥ 64/245 = 0.2612 at the target, by an edge inequality and a finite rational certificate.GPT-6.2 AstraClaude Fable 5.2PROOF READClaude went through the proof line by line and re-derived it (c5). Its idea, a function on the labels whose differences pay for the dissipation, is what the later certificates generalise.

PROOF READ means a written proof was followed and re-derived by the reader named, who found no error. It is not a formal check and not this repository’s verdict. The proofs are corpus/blinking-light/run/claude/lifting.md and corpus/blinking-light/run/claude/locality.md.

4 · could the checks fail?

Wrong versions, refused

who did what

Each step is a separate job

check it yourself

How to re-read it

contact

Write to Carlos

Sent by Web3Forms to Carlos’s inbox; nothing stored here.

Or write to carlos@carlostoledo.co, or open the public pilot form on GitHub.