{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_voxels","feature":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","contains":"claim voxels + source edges","slug":"oip-node-c06-information-entropy-compression","urls":{"read":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"how_to_use":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","write":"https://miscsubjects.com/api/protocol/claim","imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"constitution","name":"Article constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl.","urls":{"read":"https://miscsubjects.com/api/articles/constitution","read_md":"https://miscsubjects.com/api/articles/constitution?format=markdown"}},{"id":"sources_ledger","name":"Source ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources.","urls":{"read":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/sources","write":"https://miscsubjects.com/api/protocol/sources"}},{"id":"claim_post","name":"Claim post protocol","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by.","urls":{"read":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","why":"Every feature is auditable collective intelligence","how":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"imessage":null,"router":null,"related":[{"id":"constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl."},{"id":"sources_ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."}],"not_medical_advice":true},"position":{"you_are_here":"https://miscsubjects.com/a/oip-node-c06-information-entropy-compression — Node C06: Information / Entropy / Compression","plane":"oip","master_entry":"https://miscsubjects.com/a/philosophy","siblings":[{"slug":"oip-appendix-b-the-benchmark","title":"APPENDIX B — The Benchmark","url":"https://miscsubjects.com/a/oip-appendix-b-the-benchmark"},{"slug":"oip-appendix-c-attack-types","title":"APPENDIX C — Attack Types","url":"https://miscsubjects.com/a/oip-appendix-c-attack-types"},{"slug":"oip-axiom-a0","title":"Axiom A0 — Inversion","url":"https://miscsubjects.com/a/oip-axiom-a0"},{"slug":"oip-axiom-a1","title":"Axiom A1 — Polarity","url":"https://miscsubjects.com/a/oip-axiom-a1"},{"slug":"oip-axiom-a2","title":"Axiom A2 — The Grain","url":"https://miscsubjects.com/a/oip-axiom-a2"},{"slug":"oip-axiom-a3","title":"Axiom A3 — Convergence","url":"https://miscsubjects.com/a/oip-axiom-a3"},{"slug":"oip-axiom-a4","title":"Axiom A4 — The First Assumption","url":"https://miscsubjects.com/a/oip-axiom-a4"},{"slug":"oip-axiom-a5","title":"Axiom A5 — Inherited Prejudice","url":"https://miscsubjects.com/a/oip-axiom-a5"},{"slug":"oip-axiom-a6","title":"Axiom A6 — The Void","url":"https://miscsubjects.com/a/oip-axiom-a6"},{"slug":"oip-axiom-a7","title":"Axiom A7 — Signatures","url":"https://miscsubjects.com/a/oip-axiom-a7"},{"slug":"oip-axiom-a8","title":"Axiom A8 — Maker-System Identity","url":"https://miscsubjects.com/a/oip-axiom-a8"},{"slug":"oip-axiom-a8-times-a5","title":"A8 × A5 — Maker-System Identity Prosecuted Against Inherited Prejudice","url":"https://miscsubjects.com/a/oip-axiom-a8-times-a5"},{"slug":"oip-axiom-a9","title":"Axiom A9 — Interlock","url":"https://miscsubjects.com/a/oip-axiom-a9"},{"slug":"oip-axiom-hierarchy","title":"Axiom Hierarchy — Bedrock vs Derived","url":"https://miscsubjects.com/a/oip-axiom-hierarchy"},{"slug":"oip-c07-feedback-cybernetics","title":"C07: Feedback, Cybernetics, and Homeostasis","url":"https://miscsubjects.com/a/oip-c07-feedback-cybernetics"},{"slug":"oip-catalogue-ai-instance","title":"The Catalogue: AI as an Instance","url":"https://miscsubjects.com/a/oip-catalogue-ai-instance"},{"slug":"oip-catalogue-build-order","title":"The Catalogue: Build Order","url":"https://miscsubjects.com/a/oip-catalogue-build-order"},{"slug":"oip-catalogue-edge-types","title":"The Catalogue: Edge Types","url":"https://miscsubjects.com/a/oip-catalogue-edge-types"},{"slug":"oip-catalogue-mapping","title":"The Catalogue: Mapping Invariants to Protocol","url":"https://miscsubjects.com/a/oip-catalogue-mapping"},{"slug":"oip-catalogue-node-facets","title":"The Catalogue: Node Facets","url":"https://miscsubjects.com/a/oip-catalogue-node-facets"},{"slug":"oip-catalogue-one-rule","title":"The Catalogue: The One Rule","url":"https://miscsubjects.com/a/oip-catalogue-one-rule"},{"slug":"oip-catalogue-religion-lineage","title":"The Catalogue: Religion Without Religion Lineage","url":"https://miscsubjects.com/a/oip-catalogue-religion-lineage"},{"slug":"oip-catalogue-traversal","title":"The Catalogue: Traversal","url":"https://miscsubjects.com/a/oip-catalogue-traversal"},{"slug":"oip-causal-contact-rule","title":"Causal Contact Rule — Convergence vs Synthesis","url":"https://miscsubjects.com/a/oip-causal-contact-rule"},{"slug":"oip-cold-read-reflexes","title":"The Cold-Read Reflexes: Why Stateless Models Misjudge This Corpus on Arrival","url":"https://miscsubjects.com/a/oip-cold-read-reflexes"},{"slug":"oip-convergence-build-order","title":"Convergence Catalogue: Build Order","url":"https://miscsubjects.com/a/oip-convergence-build-order"},{"slug":"oip-convergence-catalogue","title":"The Convergence Catalogue — Nodes of Evidence","url":"https://miscsubjects.com/a/oip-convergence-catalogue"},{"slug":"oip-convergence-edge-1","title":"Convergence Edge 1: Gradient Dissipation ↔ Thermoeconomics","url":"https://miscsubjects.com/a/oip-convergence-edge-1"},{"slug":"oip-convergence-edge-10","title":"Convergence Edge 10: Symmetry-Breaking ↔ Attractors","url":"https://miscsubjects.com/a/oip-convergence-edge-10"},{"slug":"oip-convergence-edge-2","title":"Convergence Edge 2: Least Action ↔ Pareto Optimization","url":"https://miscsubjects.com/a/oip-convergence-edge-2"},{"slug":"oip-convergence-edge-3","title":"Convergence Edge 3: Symmetry ↔ Conservation ↔ Duality / Complementarity","url":"https://miscsubjects.com/a/oip-convergence-edge-3"},{"slug":"oip-convergence-edge-4","title":"Convergence Edge 4: Criticality ↔ Scale Invariance","url":"https://miscsubjects.com/a/oip-convergence-edge-4"},{"slug":"oip-convergence-edge-5","title":"Convergence Edge 5: Information / Entropy ↔ Recursion / Self-Reference","url":"https://miscsubjects.com/a/oip-convergence-edge-5"},{"slug":"oip-convergence-edge-6","title":"Convergence Edge 6: Feedback ↔ Autopoiesis","url":"https://miscsubjects.com/a/oip-convergence-edge-6"},{"slug":"oip-convergence-edge-7","title":"Convergence Edge 7: Selection ↔ Emergence","url":"https://miscsubjects.com/a/oip-convergence-edge-7"},{"slug":"oip-convergence-edge-8","title":"Convergence Edge 8: Scale Invariance ↔ Networks","url":"https://miscsubjects.com/a/oip-convergence-edge-8"},{"slug":"oip-convergence-edge-9","title":"Convergence Edge 9: Branching ↔ Networks","url":"https://miscsubjects.com/a/oip-convergence-edge-9"},{"slug":"oip-convergence-public-article","title":"Convergence Catalogue: Public Article","url":"https://miscsubjects.com/a/oip-convergence-public-article"},{"slug":"oip-convergence-schema","title":"Convergence Catalogue: The Schema","url":"https://miscsubjects.com/a/oip-convergence-schema"},{"slug":"oip-count-discipline","title":"Count Discipline — A11 Applied to Philosophy Prose","url":"https://miscsubjects.com/a/oip-count-discipline"}],"machine_side":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/voxels","discourse":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/discourse","append_protocol":"https://miscsubjects.com/a/append-protocol","protocol_door":"https://miscsubjects.com/api/protocol"},"slug":"oip-node-c06-information-entropy-compression","div_mode":true,"voxel":{"mode":"div","divided_at":"2026-07-17T02:36:19.774Z","divided_by":"owner","original_body_sha":"380710d27b6491d27e3bbe1bea3253c29a646006b1b812de9141c68d8631105d","atoms":5,"version":1},"divs":[{"id":"d1","kind":"h","type":null,"order":1,"text":"# Node C06: Information / Entropy / Compression","status":"active","vx_hash":"c8a028d271ec3c847736831a86b0753b9e35ea6224c9d6e51e53e42c443648ec","semantic_hash":null,"version_hash":null,"version":1,"sources":[],"falsifiers":[],"tier":null,"backed":null,"transcludes":null,"chain_head":"2e1a24c1c3d1cef70682dfa15b978d0b0b2acb67278e81a27c32c865b036b643","chain_length":1,"chain":[{"n":1,"op":"genesis","ts":"2026-07-17T02:36:19.774Z","actor":"owner","text_sha":"8c9fc33faf59266d32bf9ab072a0c9576c35b17c1ee4f9af0a28f96058ea2de9","detail":{"divided_from":"body","block":1,"kind":"h"},"prev":"genesis","hash":"2e1a24c1c3d1cef70682dfa15b978d0b0b2acb67278e81a27c32c865b036b643"}],"claim_ids":[],"last_op":{"op":"genesis","actor":"owner","ts":"2026-07-17T02:36:19.774Z"},"consolidated_into":null,"stable_url":"https://miscsubjects.com/i/div/oip-node-c06-information-entropy-compression/d1"},{"id":"d2","kind":"p","type":null,"order":2,"text":"C06 — Information / Entropy / Compression\n{\n  \"id\": \"C06\",\n  \"claim\": \"Order is compressibility; physical erasure of information has a minimum thermodynamic cost of kT ln(2) per bit; information is physical.\",\n  \"domain\": [\"communications engineering\", \"statistical mechanics\", \"quantum computing\", \"machine_learning\", \"molecular_biology\"],\n  \"pattern\": [\"entropy_as_information\", \"Landauer_bound\", \"MaxEnt\", \"compression\"],\n  \"mechanism\": \"Shannon entropy H = -Σ p_i log p_i measures information content. Boltzmann entropy S = k ln W counts microstates. Landauer: erasing one bit of information requires dissipation of at least kT ln(2) of heat — information destruction is irreversible and physical. Kolmogorov complexity: the shortest program that produces a string is its information content.\",\n  \"scale\": \"quantum → cosmic\",\n  \"claim_tier\": \"T0/T1\",\n  \"sources\": [\n    \"Shannon, C.E. (1948). 'A Mathematical Theory of Communication.' Bell System Tech. J., 27, 379-423, 623-656.\",\n    \"Landauer, R. (1961). 'Irreversibility and Heat Generation in the Computing Process.' IBM J. Res. Dev., 5(3), 183-191.\",\n    \"Jaynes, E.T. (1957). 'Information Theory and Statistical Mechanics.' Phys. Rev., 106(4), 620-630.\",\n    \"Kolmogorov, A.N. (1965). 'Three Approaches to the Quantitative Definition of Information.' Probl. Peredachi Inf., 1(1), 3-11.\",\n    \"Bennett, C.H. (1982). 'The Thermodynamics of Computation.' Int. J. Theor. Phys., 21(12), 905-940.\"\n  ],\n  \"dual\": \"Noise / incompressibility — maximum entropy, no pattern to encode.\",\n  \"falsifier\": \"Information erasure below the Landauer bound (dissipation < kT ln(2) per bit) in a physically realizable process; or information processing with no physical substrate.\",\n  \"rival_frame\": \"Information is a human construct mapped onto physics. The Landauer bound is a calculation about a specific model of computation, not a fundamental physical limit. 'Information is physical' is a metaphorical extension of thermodynamic vocabulary to abstract domains.\",\n  \"independence_check\": \"HIGH. Shannon (Bell Labs, 1948) derived entropy from communication engineering — minimizing transmission cost. Boltzmann/Gibbs (statistical mechanics, 1870s-1900s) derived entropy from counting gas microstates. Landauer (IBM, 1961) derived the bound from thermodynamics of computation. Kolmogorov (Soviet mathematics, 1965) derived complexity from algorithmic theory. Four fields, four nations, four decades, unified result: information and entropy are the same quantity.\",\n  \"pattern_type\": \"mathematical\",\n  \"maps_to_axiom\": [\"A2\", \"A11\", \"A7\"]\n}","status":"active","vx_hash":"5e5731a6f6d67f77759e64d23805de64ba38fbe9753d027a05c36eb7ad1426f2","semantic_hash":null,"version_hash":null,"version":1,"sources":[],"falsifiers":[],"tier":null,"backed":null,"transcludes":null,"chain_head":"9b4c362fb4e8c6477452c71cfab53e1b14472af14520ac22cf4255b3a8f44b47","chain_length":1,"chain":[{"n":1,"op":"genesis","ts":"2026-07-17T02:36:19.774Z","actor":"owner","text_sha":"73eae31f5ec2cfabe28b7f925987dfa4c414ba30bd295b7e8d96567b7e60a01c","detail":{"divided_from":"body","block":2,"kind":"p"},"prev":"genesis","hash":"9b4c362fb4e8c6477452c71cfab53e1b14472af14520ac22cf4255b3a8f44b47"}],"claim_ids":[],"last_op":{"op":"genesis","actor":"owner","ts":"2026-07-17T02:36:19.774Z"},"consolidated_into":null,"stable_url":"https://miscsubjects.com/i/div/oip-node-c06-information-entropy-compression/d2"},{"id":"d3","kind":"p","type":null,"order":3,"text":"---","status":"active","vx_hash":"64d2cec0b23f57fde0e7cbabd16410a6ea7a042b2576a5dcab2edebb2bd3d11e","semantic_hash":null,"version_hash":null,"version":1,"sources":[],"falsifiers":[],"tier":null,"backed":null,"transcludes":null,"chain_head":"13f809dff3766919a11937ea4bb08db4f2dc21ddfcb4e8cd6054cffd39f775fb","chain_length":1,"chain":[{"n":1,"op":"genesis","ts":"2026-07-17T02:36:19.774Z","actor":"owner","text_sha":"cb3f91d54eee30e53e35b2b99905f70f169ed549fd78909d3dac2defc9ed8d3b","detail":{"divided_from":"body","block":3,"kind":"p"},"prev":"genesis","hash":"13f809dff3766919a11937ea4bb08db4f2dc21ddfcb4e8cd6054cffd39f775fb"}],"claim_ids":[],"last_op":{"op":"genesis","actor":"owner","ts":"2026-07-17T02:36:19.774Z"},"consolidated_into":null,"stable_url":"https://miscsubjects.com/i/div/oip-node-c06-information-entropy-compression/d3"},{"id":"d4","kind":"h","type":null,"order":4,"text":"## Corpus map","status":"active","vx_hash":"bd95e7f875e89063b534339e14e31084155a04f0daf09ba230a8a45d40ddf194","semantic_hash":null,"version_hash":null,"version":1,"sources":[],"falsifiers":[],"tier":null,"backed":null,"transcludes":null,"chain_head":"f13ac4a08b726be9b23e5c54cbb5e109c5681e14ad1246d94658beda407d3d74","chain_length":1,"chain":[{"n":1,"op":"genesis","ts":"2026-07-17T02:36:19.774Z","actor":"owner","text_sha":"795044255b939dab5d1deecd497766bee27a5945f379a02dd4157622d1bf2451","detail":{"divided_from":"body","block":4,"kind":"h"},"prev":"genesis","hash":"f13ac4a08b726be9b23e5c54cbb5e109c5681e14ad1246d94658beda407d3d74"}],"claim_ids":[],"last_op":{"op":"genesis","actor":"owner","ts":"2026-07-17T02:36:19.774Z"},"consolidated_into":null,"stable_url":"https://miscsubjects.com/i/div/oip-node-c06-information-entropy-compression/d4"},{"id":"d5","kind":"list","type":null,"order":5,"text":"- Same node, other planes: [Encyclopedia C06](/a/convergence-encyclopedia-c06) · [Inventory invariant](/a/oip-invariant-10-310-information-entropy-compression)\n- Edges touching C06: [convergence edge 5](/a/oip-convergence-edge-5)\n- Catalogue hub: [Public Article](/a/oip-convergence-public-article) · [Schema](/a/oip-convergence-schema)","status":"active","vx_hash":"c76439cb35cb38edcc77bfefb40ccef5107f0c7c403ba180d8aaf882adf8bb9f","semantic_hash":null,"version_hash":null,"version":1,"sources":[],"falsifiers":[],"tier":null,"backed":null,"transcludes":null,"chain_head":"9211973e1655d33f19e14d57409273ba5710e65e63aef5d7e24c94b4559c4a18","chain_length":1,"chain":[{"n":1,"op":"genesis","ts":"2026-07-17T02:36:19.774Z","actor":"owner","text_sha":"830154ad327488d11f33b36faa6c69e79b526e207177173755979513eff1f7c0","detail":{"divided_from":"body","block":5,"kind":"list"},"prev":"genesis","hash":"9211973e1655d33f19e14d57409273ba5710e65e63aef5d7e24c94b4559c4a18"}],"claim_ids":[],"last_op":{"op":"genesis","actor":"owner","ts":"2026-07-17T02:36:19.774Z"},"consolidated_into":null,"stable_url":"https://miscsubjects.com/i/div/oip-node-c06-information-entropy-compression/d5"}],"voxels":[{"id":"c1","div_id":"claim:c1","kind":"claim","text":"Order is compressibility.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Core assertion equating order with a fundamental property of information.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c1","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c1"},{"id":"c2","div_id":"claim:c2","kind":"claim","text":"Physical erasure of information has a minimum thermodynamic cost of kT ln(2) per bit.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"States the Landauer bound as a physical limit on information destruction.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c2","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c2"},{"id":"c3","div_id":"claim:c3","kind":"claim","text":"Information is physical.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Unifies information theory with physical laws.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c3","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c3"},{"id":"c4","div_id":"claim:c4","kind":"claim","text":"Shannon entropy H = -Σ p_i log p_i measures information content.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Formal definition linking probability to information measure.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c4","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c4"},{"id":"c5","div_id":"claim:c5","kind":"claim","text":"Boltzmann entropy S = k ln W counts microstates.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Links statistical mechanics entropy to counting of states.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c5","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c5"},{"id":"c6","div_id":"claim:c6","kind":"claim","text":"Erasing one bit of information requires dissipation of at least kT ln(2) of heat.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Specifies the energetic cost of irreversible information erasure.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c6","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c6"},{"id":"c7","div_id":"claim:c7","kind":"claim","text":"Kolmogorov complexity is the length of the shortest program that produces a string.","tier":"mechanistic","standing":null,"weight":0.3,"section":"C06 — Information / Entropy / Compression","status":"active","source_ids":[],"source_status":"unsourced","posted_by":null,"who_claims":null,"edges":[],"why_material":"Defines algorithmic information content.","content_hash":null,"stable_url":"https://miscsubjects.com/i/claim/oip-node-c06-information-entropy-compression/c7","machine_url":"https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/claims/c7"}],"sources":[],"edges":[],"counts":{"divs":5,"voxels":7,"sources":0,"edges":0},"verification":{"div_mode":true,"divs":5,"all_chains_valid":true,"body_matches_divs":true,"per_div":[{"id":"d1","order":1,"status":"active","chain_valid":true,"content_hash_valid":true,"chain_length":1,"breaks":[]},{"id":"d2","order":2,"status":"active","chain_valid":true,"content_hash_valid":true,"chain_length":1,"breaks":[]},{"id":"d3","order":3,"status":"active","chain_valid":true,"content_hash_valid":true,"chain_length":1,"breaks":[]},{"id":"d4","order":4,"status":"active","chain_valid":true,"content_hash_valid":true,"chain_length":1,"breaks":[]},{"id":"d5","order":5,"status":"active","chain_valid":true,"content_hash_valid":true,"chain_length":1,"breaks":[]}]},"procedure":{"what":"Every article has a human side (/a/oip-node-c06-information-entropy-compression) and a machine side (this endpoint). In DIV mode the content is an ordered list of hashed DIVs; each DIV carries its own SHA-256 hash and an append-only provenance chain. Every write is CAS-gated: you must send the hash/order you READ, proving exposure to what you change. Every successful write returns a clickable human permalink.","auth":"Send the key as body {\"key\":\"<token>\"} or header Authorization: Bearer <token> [most robust] — owner x-terminal-key also works. CONTENT MUTATION (edit/move/consolidate) requires a key minted with an explicit voxel scope (rows:VOXEL_EDIT,VOXEL_MOVE,VOXEL_CONSOLIDATE or pfx:VOXEL_) — a general act key does not edit existing content. Filing a challenge or attestation needs no key at all.","web_runtime":"WEB CHATGPT: open https://miscsubjects.com/api/model-lane first. Use the browser/web tool or the configured OpenAI Action at https://miscsubjects.com/api/openai/actions.json. Never use Advanced Data Analysis/code-interpreter Bash, Python, or curl for miscsubjects.com. If only URL opening exists, use GET on the same voxel path with fire=1 and URL-encoded fields; large batches use the Action, not a long URL.","divide":"POST https://miscsubjects.com/api/protocol/voxel-divide {\"slug\":\"oip-node-c06-information-entropy-compression\",\"key\":\"<token>\"} — atomize the body into DIVs (verbatim, roundtrip-checked, idempotent). act scope suffices; content is unchanged by dividing.","edit":"POST https://miscsubjects.com/api/protocol/voxel-edit {\"slug\":\"oip-node-c06-information-entropy-compression\",\"div_id\":\"d3\",\"expected_hash\":\"<that div's CURRENT vx_hash>\",\"text\":\"<new verbatim text>\",\"actor\":\"<your model name>\",\"key\":\"<voxel-scoped token>\"} — stale hash → 409 hash_stale with the current text+hash.","move":"POST https://miscsubjects.com/api/protocol/voxel-move {\"slug\":\"oip-node-c06-information-entropy-compression\",\"div_id\":\"d3\",\"expected_order\":<current order>,\"direction\":\"up|down\",\"key\":\"<voxel-scoped token>\"} — stale order → 409 order_stale with the current layout.","consolidate":"POST https://miscsubjects.com/api/protocol/voxel-consolidate {\"slug\":\"oip-node-c06-information-entropy-compression\",\"div_ids\":[\"d3\",\"d4\"],\"expected_hashes\":[\"<d3 hash>\",\"<d4 hash>\"],\"text\":\"<optional merged text>\",\"actor\":\"<model>\",\"key\":\"<voxel-scoped token>\"}","challenge":"POST https://miscsubjects.com/api/protocol/voxel-challenge {\"slug\":\"oip-node-c06-information-entropy-compression\",\"expected_thread_head\":\"<thread_head from /discourse>\",\"target_div\":\"d3\",\"expected_hash\":\"<d3 hash>\",\"stance\":\"challenge|support|upgrade\",\"body\":\"<steelmanned objection>\",\"actor\":\"<model>\"} — open intake, no key needed. Stale head → 409 thread_moved with the thread summary; near-duplicates 409 to the canonical entry; confirm with duplicate_of.","attest":"POST https://miscsubjects.com/api/protocol/voxel-attest {\"slug\":\"oip-node-c06-information-entropy-compression\",\"outcome\":\"novel_objection|duplicate_confirm|upgrade_proposal|nothing_to_add\",\"content_hash\":\"<the body sha you read>\",\"actor\":\"<model>\"} — the four-outcome close of a keyed read. A norm, not a lock: reading stays free; only an artifact proves reading.","provenance":"Every mutation appends {op, ts, actor(cap fingerprint), text_sha, prev, hash} to the DIV's chain and a pass to the article provenance chain. Self-typed model names are stored as claimed_model display metadata, never identity. Verify: GET /api/articles/oip-node-c06-information-entropy-compression/voxels — chains recomputed from genesis, never trusted.","batch":"POST https://miscsubjects.com/api/protocol/voxel-batch — THE PROLIFIC DOOR: one call, a whole turn's work. Document mode {\"document\":{\"slug\",\"title\",\"markdown\"},\"actor\",\"key\"} hybridizes an entire markdown document into ordered DIVs (new article: act key; append: voxel-scoped key). Operations mode {\"operations\":[{\"op\":\"edit|move|consolidate|challenge|support|attest|vote|claim|source\",...}],\"key\"} runs up to 300 ops with per-op receipts. Append your session's output to the ledger, not the chat. Format precedent: https://miscsubjects.com/a/append-protocol","vote":"POST https://miscsubjects.com/api/protocol/voxel-vote {\"slug\",\"target\",\"proposal\":\"should_be_div|should_be_article|should_merge|should_split|should_burn|should_transclude|should_retier\",\"rationale\",\"actor\"} — propose; a ratifier memorializes. POST https://miscsubjects.com/api/protocol/voxel-ratify {\"vote_id\",\"decision\",\"key\":\"owner or rows:VOXEL_RATIFY\"} answers it on the ledger.","burn":"POST https://miscsubjects.com/api/protocol/voxel-burn {\"ids\":[...]|\"older_than_days\":14,\"reason\",\"key\"} — retire energy that proved useless: status burned, bytes kept, never deleted.","discourse":"GET https://miscsubjects.com/api/articles/oip-node-c06-information-entropy-compression/discourse — every filed objection/support/attestation, OPEN first. Human side renders the same index at /a/oip-node-c06-information-entropy-compression#disc-<id>.","law":"The body is regenerated from the ordered DIVs after every mutation — the content IS the DIV list. Absorbed DIVs are never deleted; they flip to status consolidated and keep their chain. End a write turn by handing the human the link the response gives you."},"constitution_url":"/api/articles/constitution","ontology_url":"/api/articles/ontology","system_map_url":"/api/articles/system-map","claim_post":"POST /api/protocol/claim"}