## §SELF — miscsubjects (paste without context) **Principle:** Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next. **This widget:** `article_bundle` — **LLM article bundle** Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution. - **article slug:** `landauer-1961` - **contains:** body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest - **how to use:** Paste entire block into Grok/GPT/Gemini. Section §SELF explains the system. - **read:** https://miscsubjects.com/api/articles/landauer-1961/bundle?format=markdown ### Logical proof (verify each step) 1. Articles are voxel graphs of tiered claims, not prose blobs. → https://miscsubjects.com/api/articles/constitution 2. Claims link to hash-chained sources via source_ids. → https://miscsubjects.com/api/articles/landauer-1961/sources 3. Ask reads topology; ingest/claim append to ledger. → https://miscsubjects.com/api/protocol 4. Models queue growth: populate → collaborate → repair → reflex. → https://miscsubjects.com/api/protocol/grow 5. Graph proves its own shape (reflex) and $/claim (yield). → https://miscsubjects.com/graph.html?layer=reflex 6. Full feature index + _explain on every API response. → https://miscsubjects.com/api/articles/system-map ### Related features (explains other parts of the system) - **topology** — Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER. · https://miscsubjects.com/api/articles/landauer-1961/topology - **voxels** — Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance. · https://miscsubjects.com/api/articles/landauer-1961/voxels - **ask** — Answer only from topology; creates question_node with gaps and ingest_hint. · https://miscsubjects.com/api/articles/landauer-1961/prompts - **ingest** — Parse pasted evidence → source ledger + claims + evidence_ingest node. - **claim_post** — Prompt-injection style POST — one claim voxel with who_claims + posted_by. · https://miscsubjects.com/api/articles/landauer-1961/voxels - **llm_manifest** — Machine-readable read/write contract for external LLMs. · https://miscsubjects.com/api/articles/llm-manifest ### Full index - JSON: https://miscsubjects.com/api/articles/system-map - Markdown: https://miscsubjects.com/api/articles/system-map?format=markdown *Not medical advice. Tier-honest. Cite claim/source ids.* --- # miscsubjects article bundle > Paste this entire block into Grok, GPT, or Gemini. They can READ the ledger below and RETURN evidence via ingest (see § LLM manifest). ## Article - **slug:** `landauer-1961` - **title:** Landauer 1961 — Irreversibility and Heat Generation in the Computing Process - **url:** https://miscsubjects.com/a/landauer-1961 - **register:** source - **updated:** 2026-07-04T20:41:33.640Z - **tags:** source, grain, convergence, landauer ## Body ## The Source Rolf Landauer. "Irreversibility and Heat Generation in the Computing Process." *IBM Journal of Research and Development*, Vol. 5, No. 3, pp. 183–191, July 1961. DOI: [10.1147/rd.53.0183](https://doi.org/10.1147/rd.53.0183). ## The Claim Erasing one bit costs at least $k_B T \ln(2)$ joules. Information is physical. The bridge from bits to joules is a one-way toll — you cannot forget without heating the room. ## The Context 1961. IBM Thomas J. Watson Research Center, Yorktown Heights, New York. The transistor age roars. Computers fill rooms and dissipate kilowatts. Von Neumann had claimed every elementary act of computation must cost energy. [SOURCE:neumann-1966|type:theoretical] Landauer asked the sharper question: *which* operations pay the tax? His answer: only the irreversible ones. Erasure is the crime. Copying is free. Reversible computation avoids the cost entirely. [SOURCE:bennett-1973|type:theoretical] The intellectual climate was a tug-of-war. Shannon had made information abstract and clean — bits floating in a mathematical vacuum. [SOURCE:shannon-1948|type:mathematical] Boltzmann had tied entropy to microstates — disorder as counting. [SOURCE:boltzmann-1877|type:mathematical] Szilard's demon haunted the halls — could a tiny intelligence extract work from heat without penalty? [SOURCE:szilard-1929|type:theoretical] Landauer closed the loophole. The demon must pay. Erasure is the bill. ## The Evidence Landauer derived the bound from Liouville's theorem and the Second Law. Consider a single bit — two states, 0 or 1. To erase it means resetting to 0 *regardless* of input. The phase space halves. Entropy drops by $k \ln(2)$. The Second Law demands that entropy appear elsewhere. That elsewhere is heat: $Q \geq k_B T \ln(2)$. At room temperature this is ~$2.87 \times 10^{-21}$ joules per bit. A modern CMOS transistor dissipates $10^4$ to $10^6$ times this limit. [SOURCE:conte-2019|type:empirical] The bound is not a practical ceiling. It is a physical law. In 2012 Bérut et al. trapped a single 2-micrometer colloidal particle in a modulated double-well laser potential. They measured the heat dissipated during bit erasure. The mean dissipated heat saturated at the Landauer limit in the quasi-static regime. [SOURCE:berut-2012|type:empirical] The principle holds. Yan et al. extended confirmation to the quantum regime with a single trapped $^{40}\text{Ca}^+$ ion in 2018. [SOURCE:yan-2018|type:empirical] ## The Convergence Landauer instantiates **C06 — Order is Compressibility; Information is Physical**. [SOURCE:grain-c06|type:philosophical] Four fields. Four nations. Four decades. One quantity. Shannon at Bell Labs (1948) measured information by compressibility — how many bits to transmit a message. [SOURCE:shannon-1948|type:mathematical] Boltzmann in Vienna (1870s) counted gas microstates. [SOURCE:boltzmann-1877|type:mathematical] Kolmogorov in Moscow (1965) defined complexity as the shortest program that generates a string. [SOURCE:kolmogorov-1965|type:mathematical] Landauer at IBM (1961) proved erasure costs heat. Independently derived. Unrelated methods. Same result: information and entropy are the same thing wearing different hats. Landauer also bridges to **C08 — Recursion / Self-Reference**. [SOURCE:grain-c08|type:philosophical] A system's description of itself is not external. It is a physical process with physical costs. DNA is a self-describing molecule. [SOURCE:watson-crick-1953|type:empirical] It pays the Landauer cost every time it replicates — error correction, proofreading, repair enzymes. Memory is not abstract. The substrate pays. [SOURCE:grain-p7|type:philosophical] ## The Honest Limits Landauer only bound *irreversibly erased* information. Bennett showed reversible computation can avoid the cost entirely — run backward, no heat. [SOURCE:bennett-1973|type:theoretical] The bound is about forgetting, not computing. The principle assumes thermal equilibrium. Non-equilibrium reservoirs can cheat the bound. Konopik et al. (2020) demonstrated nonequilibrium information erasure below $kT \ln(2)$. [SOURCE:konopik-2020|type:empirical] The Landauer limit is not universal. It is a thermal-equilibrium theorem. Earman and Norton posed the sharper dilemma in 1999. If Maxwell's demon is already governed by the Second Law, Landauer's principle is redundant. If not, it is insufficient. [SOURCE:earman-norton-1999|type:philosophical] Bennett conceded this was "the objection of greatest merit." The philosophical status remains contested even as the experiments confirm the bound. Landauer solved a physics problem. He did not see the ethics bridge. He did not see the node-grain identity. He did not see that injustice is unbounded dissipation — extraction that consumes its own preconditions faster than regeneration. [SOURCE:grain-ethics|type:philosophical] The thermodynamics of computation stops at the machine room door. ## The Receipt > "Information is physical." Landauer, 1991 — but the seed was already in the 1961 paper. The exact bound: $$Q \geq k_B T \ln(2)$$ Erasing one bit. At temperature $T$. In joules. Not a metaphor. A meter reading. The GRAIN receipt is sharper: "Landauer: erasing one bit of information requires dissipation of at least $kT \ln(2)$ of heat — information destruction is irreversible and physical." Four fields, four nations, four decades: unified result. [SOURCE:grain-convergence-catalogue|type:philosophical] ## Related Sources - [shannon-1948](/article/shannon-1948) — The abstract half of the bridge. Information as reduction of uncertainty. - [boltzmann-1877](/article/boltzmann-1877) — The statistical half. Entropy as missing microscopic information. - [bennett-1973](/article/bennett-1973) — The escape hatch. Reversible computation and logical reversibility. - [prigogine-1977](/article/prigogine-1977) — Dissipative structures. Order that persists by burning gradients. - [schrodinger-1944](/article/schrodinger-1944) — Life feeds on negative entropy. The biological bridge. - [kolmogorov-1965](/article/kolmogorov-1965) — Compressibility as the signature of structure. - [szilard-1929](/article/szilard-1929) — The demon that started it all. ## Claims (7) - **c1** [system w=1] Erasing one bit of information in thermal equilibrium dissipates at least k_B T ln(2) joules of heat. - sources: landauer-1961 - **c2** [system w=0.95] Only irreversible operations pay the energy tax; copying and reversible computation can avoid the cost entirely. - sources: landauer-1961, bennett-1973 - **c3** [system w=0.9] Information is physical — the bridge from bits to joules is a one-way toll; you cannot forget without heating the room. - sources: landauer-1961 - **c4** [system w=0.85] Maxwell's demon must pay the erasure cost; the demon cannot extract work from heat without eventually erasing information and paying the Landauer toll. - sources: landauer-1961, szilard-1929 - **c5** [system w=0.8] The Landauer bound assumes thermal equilibrium; non-equilibrium reservoirs can achieve information erasure below kT ln(2). - sources: konopik-2020 - **c6** [speculative w=0.7] If Maxwell's demon is already governed by the Second Law, Landauer's principle is redundant; if not, it is insufficient. - sources: earman-norton-1999 - **c7** [speculative w=0.6] Four independently derived methods (Shannon, Boltzmann, Kolmogorov, Landauer) converge on the same result: information and entropy are the same thing wearing different hats. - sources: shannon-1948, boltzmann-1877, kolmogorov-1965, landauer-1961 ## Voxel graph (7 atoms · 12 edges) - full graph: https://miscsubjects.com/api/articles/landauer-1961/voxels ## Article constitution - full: https://miscsubjects.com/api/articles/constitution ## Source ledger (5) - chain valid: no · head: `` ### bennett-1973 · adjacent - title: Bennett 1973 — Logical Reversibility of Computation - url: https://miscsubjects.com/article/bennett-1973 - summary: Shows that reversible computation can avoid the Landauer cost entirely by running backward with no heat dissipation. - claim_ids: c2 - hash: `` ### earman-norton-1999 · rival - title: Earman & Norton 1999 — Exorcist XIV: The Wrath of Maxwell's Demon - summary: Philosophical challenge arguing Landauer's principle is either redundant (if the demon is already governed by the Second Law) or insufficient (if not). Bennett conceded this was 'the objection of greatest merit.' - claim_ids: c6 - hash: `` ### konopik-2020 · rival - title: Konopik et al. 2020 — Non-equilibrium information erasure below kT ln(2) - summary: Demonstrated that non-equilibrium reservoirs can enable information erasure below the Landauer limit, showing the bound is not universal but a thermal-equilibrium theorem. - claim_ids: c5 - hash: `` ### landauer-1961 · primary - title: Irreversibility and Heat Generation in the Computing Process - url: https://doi.org/10.1147/rd.53.0183 - summary: The original 1961 IBM paper deriving the minimum heat dissipation bound for irreversible bit erasure from Liouville's theorem and the Second Law of Thermodynamics. - quote: Information is physical. - claim_ids: c1, c2, c3, c4 - hash: `` ### berut-2012 · adjacent - title: Experimental verification of Landauer's principle linking information and thermodynamics - url: https://doi.org/10.1038/nature10872 - summary: Bérut et al. (2012) trapped a colloidal particle in a double-well laser potential and measured heat dissipation during bit erasure, showing saturation at the Landauer limit in the quasi-static regime. - claim_ids: c1 - hash: `` ## Provenance (0 model passes) - chain valid: yes · head: `genesis` ## Question graph - questions: 0 · evidence ingests: 0 ## LLM manifest — how to communicate with this ledger - system map: https://miscsubjects.com/api/articles/system-map?format=markdown - topology (ranked): https://miscsubjects.com/api/articles/landauer-1961/topology - ingest: POST https://miscsubjects.com/api/protocol/ingest - claim: POST https://miscsubjects.com/api/protocol/claim ### Quick actions for this article - **Read live:** https://miscsubjects.com/api/articles/landauer-1961/topology - **Ask (API):** POST https://miscsubjects.com/api/protocol/ask `{"slug":"landauer-1961","question":"..."}` - **Ingest your findings:** POST https://miscsubjects.com/api/protocol/ingest or text `ingest landauer-1961|your evidence` - **Post one claim:** POST https://miscsubjects.com/api/protocol/claim or text `claim landauer-1961|tier|assertion` - **iMessage ask:** `landauer-1961|your question` - **System map:** https://miscsubjects.com/api/articles/system-map?format=markdown --- ## §SELF — miscsubjects (paste without context) **Principle:** Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next. **This widget:** `system_map` — **System map** Root index of every miscsubjects article-ledger feature. Start here if you have zero context. - **article slug:** `landauer-1961` - **contains:** body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest - **how to use:** Root index of every miscsubjects article-ledger feature. Start here if you have zero context. - **read:** https://miscsubjects.com/api/articles/system-map ### Logical proof (verify each step) 1. Articles are voxel graphs of tiered claims, not prose blobs. → https://miscsubjects.com/api/articles/constitution 2. Claims link to hash-chained sources via source_ids. → https://miscsubjects.com/api/articles/landauer-1961/sources 3. Ask reads topology; ingest/claim append to ledger. → https://miscsubjects.com/api/protocol 4. Models queue growth: populate → collaborate → repair → reflex. → https://miscsubjects.com/api/protocol/grow 5. Graph proves its own shape (reflex) and $/claim (yield). → https://miscsubjects.com/graph.html?layer=reflex 6. Full feature index + _explain on every API response. → https://miscsubjects.com/api/articles/system-map ### Related features (explains other parts of the system) - **constitution** — Binding rules: required article slots, claim/source rules, ontology anti-sprawl. · https://miscsubjects.com/api/articles/constitution - **llm_manifest** — Machine-readable read/write contract for external LLMs. · https://miscsubjects.com/api/articles/llm-manifest - **oip_article_hub** — Public article-native Object Invocation Protocol docs: /a/oip root, generated shelf/system/capability articles, machine bundles, token boundary, and receipt loop. · https://miscsubjects.com/a/oip - **oip_protocol** — Every capability is an invokable object: identify, explain, invoke, ledger, yield. · https://miscsubjects.com/a/oip - **bundle** — Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution. · https://miscsubjects.com/api/articles/landauer-1961/bundle?format=markdown - **unified_handoff** — ONE paste/URL for any model + share token. Same self-explaining pattern as article bundle, but whole build. · https://miscsubjects.com/api/handoff?format=markdown ### Full index - JSON: https://miscsubjects.com/api/articles/system-map - Markdown: https://miscsubjects.com/api/articles/system-map?format=markdown *Not medical advice. Tier-honest. Cite claim/source ids.*