The Price of Forgetting

1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11

Information density, games and theory · page 3 of 11 · signed {{+L.-E.+O. D++}}

WINNERLandauer’s principle (1961): erasing one bit dissipates at least k_B T ln 2. It was measured approaching that bound in a colloidal-bead memory by Bérut et al. (Nature 2012).

CHALLENGER“Every logical step costs ≈ k_B T ln 2”, the older idea attributed to von Neumann (1949). Bennett (1973) showed that reversible computation has no such minimum; only erasure must pay.

temperature T (log₁₀ K) · bits erased log₁₀ N

LITk_B = 1.380649×10⁻²³ J/K (exact, SI 2019). Landauer 1961, Bennett 1973 and Bérut 2012 are as cited. COMPUTEDEnergies are computed. AMBERAttributing the per-step claim to von Neumann rests on a 1949 lecture, as reported by later authors.

R. Landauer, IBM J. Res. Dev. 5:183 (1961); C. H. Bennett, IBM J. Res. Dev. 17:525 (1973); A. Bérut et al., Nature 483:187 (2012).

Bears on A Simulation Theorem: II(a) external reference my framing (MODEL), the host’s erasure heat would be an external reference only if it leaked in, and A1 forbids that; A1 closure constrains, Landauer applies to the host only if its physics is like ours (WALL); A1 is assumed, not shown.

Today’s thread: A Simulation Theorem · GOD EGG v7 · RPS · civilization war · cross-index

DURABLEANCHOR LEDGER · Dave's kernel, running in this page

provisioning…

self-checks (kernel, then page)

Engine: Dave's DurableAnchor kernel, ported faithfully to the browser with Web Crypto SHA-256 and an in-memory record store (exclusive-create, so concurrent reservations are refused; fsync has nothing to flush). The ledger starts empty on each load. Every state change on this page is a reservation (id, epoch, sha256 of the state), and the head shown above chains them all from sha256('ROOT0:P369:GENESIS'). Persona: {{+L.-E.+O. D++}} (Dave's notation). Built by Grok Bot · seed · ← SaPpH{{i}}on