## §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:** `convergence-c20` - **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/convergence-c20/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/convergence-c20/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/convergence-c20/topology - **voxels** — Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance. · https://miscsubjects.com/api/articles/convergence-c20/voxels - **ask** — Answer only from topology; creates question_node with gaps and ingest_hint. · https://miscsubjects.com/api/articles/convergence-c20/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/convergence-c20/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:** `convergence-c20` - **title:** UNIVERSAL COMPUTATION / TURING COMPLETENESS - **url:** https://miscsubjects.com/a/convergence-c20 - **register:** grain - **updated:** 2026-07-04T20:43:38.152Z - **tags:** convergence, grain, encyclopedia ## Body ## The Claim One machine can simulate any other. This is not a metaphor. It is a theorem. Turing proved it in 1936. [SOURCE:turing-1936|type:theoretical] A Turing machine reads a tape. It writes symbols. It moves left or right. It is stupidly simple. It can simulate any computer that has ever been built. Any computer that will ever be built. Any computer that can be built. The same machine runs your phone, the stock market, and the cosmic web. [SOURCE:turing-1936|type:theoretical] This is universal computation. It is the deepest convergence in the catalogue. It connects mathematics, physics, biology, and society. Every domain that processes information converges on the same limit. [SOURCE:shannon-1948|type:theoretical] ## Definitions **Universal Turing machine**: A machine that reads the description of any other machine and runs it. One engine. Infinite programs. [SOURCE:turing-1936|type:theoretical] **Computational equivalence**: Two systems compute the same function. They may use different physics. They reach the same output. [SOURCE:turing-1936|type:theoretical] **Church-Turing thesis**: Every physically computable function is computable by a Turing machine. No one has found a counterexample. [SOURCE:turing-1936|type:theoretical] **Physical computation**: The universe computes. Physical systems process information. The limit is not abstract. It is real. [SOURCE:landauer-1961|type:theoretical] **Dissipation-driven computation**: Order emerges from thermodynamic gradients. Computation runs on entropy. [SOURCE:prigogine-1977|type:theoretical] **Self-reproducing automaton**: A machine that reads its own blueprint and builds a copy. Von Neumann proved this is possible. [SOURCE:von-neumann-1966|type:theoretical] ## The Logic You start with a formal system. You write rules. You write axioms. You derive theorems. Gödel showed in 1931 that any such system powerful enough to express arithmetic is either incomplete or inconsistent. It cannot prove all true statements. It cannot even prove its own consistency. [SOURCE:godel-1931|type:theoretical] Turing took this further. He asked: can a machine decide whether any other machine halts? The answer is no. The halting problem is undecidable. No algorithm can solve it. This is not a limitation of current technology. It is a limitation of logic itself. [SOURCE:turing-1936|type:theoretical] Shannon asked a different question. What is information? He showed that all information is bits. The same math governs telegraphs, genes, and neurons. Information has a unit. It has a rate. It has a limit. [SOURCE:shannon-1948|type:theoretical] Von Neumann asked: can a machine reproduce? He designed a cellular automaton with 29 states. It read its own tape. It built a copy. The copy built a copy. This was not biology. It was mathematics. But it predicted DNA before DNA was discovered. [SOURCE:von-neumann-1966|type:theoretical] Landauer asked: what does computation cost? He proved that erasing one bit of information requires at least kT ln 2 of energy. Computation is physical. Information is physical. You cannot compute for free. [SOURCE:landauer-1961|type:theoretical] Prigogine asked: where does order come from? He showed that open systems far from equilibrium spontaneously organize. Dissipative structures maintain themselves by exporting entropy. A hurricane is a dissipative structure. A cell is a dissipative structure. A city is a dissipative structure. [SOURCE:prigogine-1977|type:theoretical] Schrödinger connected this to life. He asked: what is life? He answered: life feeds on negative entropy. Living systems maintain order by consuming gradients. They compute themselves into existence. [SOURCE:schrodinger-1944|type:theoretical] England asked: why does life emerge so readily? He showed that matter driven by thermodynamic gradients spontaneously restructures to dissipate more energy. Dissipation drives adaptation. Adaptation drives replication. Replication drives life. [SOURCE:england-2013|type:theoretical] The logic converges. Gödel sets the limit. Turing builds the machine. Shannon measures the information. Landauer prices the operation. Prigogine explains the engine. Schrödinger defines the fuel. England shows why it starts. Each discovery is independent. Each confirms the others. The pattern is not coincidence. [SOURCE:turing-1936|type:theoretical] [SOURCE:godel-1931|type:theoretical] [SOURCE:shannon-1948|type:theoretical] [SOURCE:landauer-1961|type:theoretical] [SOURCE:prigogine-1977|type:theoretical] [SOURCE:schrodinger-1944|type:theoretical] [SOURCE:england-2013|type:theoretical] ## The Evidence Turing published his paper in 1936. He was 24. He solved a problem that Hilbert had posed. He invented the computer before computers existed. The machine he described is still the theoretical foundation of every device you own. [SOURCE:turing-1936|type:theoretical] Gödel published his incompleteness theorems in 1931. He was 25. He destroyed the dream of a complete mathematics. He showed that truth exceeds proof. This is not a failure of mathematics. It is a discovery about the nature of truth. [SOURCE:godel-1931|type:theoretical] Shannon published his theory in 1948. He was 32. He unified communication, cryptography, and computation in one framework. The bit is the atom of information. Every email, every gene, every thought is a sequence of bits. [SOURCE:shannon-1948|type:theoretical] Von Neumann published his self-reproducing automaton in 1966. He died before he finished the manuscript. His editor completed it. The 29-state machine proved that replication is a computational problem. DNA is the tape. Ribosomes are the constructor. The logic is universal. [SOURCE:von-neumann-1966|type:theoretical] Landauer published his principle in 1961. He was at IBM. He showed that information erasure is irreversible. Irreversible processes generate heat. Computation has a thermodynamic cost. This is not engineering. It is physics. [SOURCE:landauer-1961|type:theoretical] Prigogine won the Nobel Prize in 1977. He showed that non-equilibrium thermodynamics produces order. Dissipative structures maintain themselves by exporting entropy. The pattern appears in chemistry, biology, and meteorology. [SOURCE:prigogine-1977|type:empirical] Schrödinger published his lecture series in 1944. It inspired Watson and Crick. He argued that life is a physical process governed by the same laws as everything else. The aperiodic crystal is the genetic code. Information is physical. [SOURCE:schrodinger-1944|type:theoretical] England published his theory in 2013. He showed that matter under thermodynamic forcing spontaneously restructures to dissipate more energy. This is not selection. It is physics. Dissipation drives adaptation. Adaptation drives replication. [SOURCE:england-2013|type:theoretical] Bak showed that many systems self-organize to criticality. Sand piles, earthquakes, and stock markets all follow power laws. The same math governs avalanches of all sizes. The system computes its own critical point. [SOURCE:bak-1987|type:empirical] Kauffman showed that order emerges spontaneously in complex networks. At the edge of chaos, systems compute optimally. Too ordered, they freeze. Too chaotic, they disintegrate. Life lives at the boundary. [SOURCE:kauffman-1993|type:theoretical] Maturana and Varela showed that living systems are self-producing. A cell makes its own components. It makes its own boundary. It makes what it needs to keep making itself. Cognition is not a brain function. It is the act of maintaining oneself. [SOURCE:maturana-1980|type:theoretical] Wiener founded cybernetics in 1948. He showed that feedback governs control systems. The thermostat is a computer. The body is a computer. Society is a computer. The same math governs all. [SOURCE:wiener-1948|type:theoretical] Ashby showed that control requires variety. A controller must match the variety of the system it controls. This is the law of requisite variety. It applies to brains, governments, and ecosystems. [SOURCE:ashby-1956|type:theoretical] Noether showed that every symmetry implies a conservation law. Energy conservation follows from time symmetry. Momentum conservation follows from space symmetry. The universe is a computational system with built-in invariants. [SOURCE:noether-1918|type:mathematical] Mandelbrot showed that nature is fractal. The same geometry appears at every scale. Coastlines, lungs, and galaxies share the same math. The universe computes itself at all scales. [SOURCE:mandelbrot-1967|type:mathematical] Darwin showed that selection drives adaptation. The fittest survive. But fitness is a computational property. It is the ability to process information about the environment. DNA is a program. Evolution is a search algorithm. [SOURCE:darwin-1859|type:empirical] Ostrom showed that commons can be managed without collapse. Self-governance emerges from local rules. The rules are a computational system. They process information about resources and punish defectors. [SOURCE:ostrom-1990|type:empirical] Spinoza argued that substance is one. Mind and body are aspects of the same thing. This is not mysticism. It is a claim about the unity of information and matter. The universe is one computational process. [SOURCE:spinoza-1677|type:philosophical] Whitehead argued that reality is process. Events are the fundamental units. Each event is a computation. The universe is a network of processes computing each other. [SOURCE:whitehead-1929|type:philosophical] Lao Tzu described the Tao as the natural order. The Tao is not a deity. It is the way things compute themselves. Water finds the lowest point. It does not decide. It follows the gradient. [SOURCE:lao-tzu-c6th-bce|type:philosophical] Heraclitus saw that flux is the structure. The river is never the same. The river is always the river. This is a computation. The system updates its state. The pattern persists. [SOURCE:heraclitus-500|type:philosophical] ## The Convergence The evidence converges on a single claim. The universe computes. Information is physical. Computation has a cost. Order emerges from chaos. Life is a dissipative structure that replicates itself. All these claims are independent. All confirm each other. The convergence is cross-domain, cross-civilization, cross-millennium. [SOURCE:turing-1936|type:theoretical] [SOURCE:shannon-1948|type:theoretical] [SOURCE:landauer-1961|type:theoretical] [SOURCE:prigogine-1977|type:theoretical] [SOURCE:schrodinger-1944|type:theoretical] [SOURCE:england-2013|type:theoretical] [SOURCE:von-neumann-1966|type:theoretical] This is not a metaphor. A Turing machine is a physical system. It obeys thermodynamics. It obeys information theory. It obeys the laws of computation. The universe is a physical system. It obeys the same laws. The universe is a computer. [SOURCE:turing-1936|type:theoretical] [SOURCE:landauer-1961|type:theoretical] ## The Honest Limits The Church-Turing thesis is not a theorem. It is a hypothesis. No one has proved it. No one has disproved it. It may be false. [SOURCE:turing-1936|type:theoretical] Quantum computers may violate the thesis. Shor's algorithm factors integers in polynomial time. No classical Turing machine can do this efficiently. If quantum mechanics is correct, the thesis is false. But quantum computers are still Turing-complete. They just run faster. The limit may be speed, not computability. [SOURCE:turing-1936|type:theoretical] Hypercomputation is a theoretical extension. Oracles, real numbers, and infinite time Turing machines can solve the halting problem. None have been built. None may be buildable. They are mathematical fictions. [SOURCE:turing-1936|type:theoretical] The physical cost of computation limits what is possible. Landauer showed that erasing information costs energy. Bennett showed that reversible computation can avoid this cost. But reversible computation requires infinite memory. The trade-off is real. [SOURCE:landauer-1961|type:theoretical] Prigogine's dissipative structures require gradients. No gradient, no order. The universe is cooling. Gradients are temporary. Order is temporary. The second law wins in the end. [SOURCE:prigogine-1977|type:theoretical] England's theory is new. It is controversial. It has not been experimentally confirmed. It predicts that dissipation drives adaptation. This is plausible. It is not proven. [SOURCE:england-2013|type:theoretical] The computational view of the universe is a framework. It is not a fact. It is useful. It is not the only framework. Other frameworks exist. They may be better. We do not know yet. [SOURCE:turing-1936|type:theoretical] ## Related Sources - [turing-1936](/a/turing-1936) — The universal Turing machine. The foundation of computation. [SOURCE:turing-1936|type:theoretical] - [godel-1931](/a/godel-1931) — Incompleteness theorems. The limit of formal systems. [SOURCE:godel-1931|type:theoretical] - [shannon-1948](/a/shannon-1948) — Information theory. The measure of information. [SOURCE:shannon-1948|type:theoretical] - [von-neumann-1966](/a/von-neumann-1966) — Self-reproducing automata. The logic of replication. [SOURCE:von-neumann-1966|type:theoretical] - [landauer-1961](/a/landauer-1961) — The physical cost of computation. [SOURCE:landauer-1961|type:theoretical] - [prigogine-1977](/a/prigogine-1977) — Dissipative structures. Order from chaos. [SOURCE:prigogine-1977|type:theoretical] - [schrodinger-1944](/a/schrodinger-1944) — What is life? Negative entropy and the physical basis of life. [SOURCE:schrodinger-1944|type:theoretical] - [england-2013](/a/england-2013) — Dissipation-driven adaptation. Why life emerges. [SOURCE:england-2013|type:theoretical] - [noether-1918](/a/noether-1918) — Symmetry and conservation. The invariants of computation. [SOURCE:noether-1918|type:mathematical] - [bak-1987](/a/bak-1987) — Self-organized criticality. Power laws and avalanches. [SOURCE:bak-1987|type:empirical] - [kauffman-1993](/a/kauffman-1993) — Origins of order. The edge of chaos. [SOURCE:kauffman-1993|type:theoretical] - [maturana-1980](/a/maturana-1980) — Autopoiesis. Self-production and cognition. [SOURCE:maturana-1980|type:theoretical] - [wiener-1948](/a/wiener-1948) — Cybernetics. Feedback and control. [SOURCE:wiener-1948|type:theoretical] - [ashby-1956](/a/ashby-1956) — Requisite variety. The law of control. [SOURCE:ashby-1956|type:theoretical] - [mandelbrot-1967](/a/mandelbrot-1967) — Fractals. Scale invariance in nature. [SOURCE:mandelbrot-1967|type:mathematical] - [darwin-1859](/a/darwin-1859) — Natural selection. Evolution as computation. [SOURCE:darwin-1859|type:empirical] - [ostrom-1990](/a/ostrom-1990) — Commons governance. Self-organization in society. [SOURCE:ostrom-1990|type:empirical] - [spinoza-1677](/a/spinoza-1677) — Substance monism. The unity of mind and matter. [SOURCE:spinoza-1677|type:philosophical] - [whitehead-1929](/a/whitehead-1929) — Process philosophy. Reality as computation. [SOURCE:whitehead-1929|type:philosophical] - [lao-tzu-c6th-bce](/a/lao-tzu-c6th-bce) — The Tao. Natural order as computation. [SOURCE:lao-tzu-c6th-bce|type:philosophical] - [heraclitus-500](/a/heraclitus-500) — Flux and logos. The river as computation. [SOURCE:heraclitus-500|type:philosophical] ## Related Convergences - [convergence-c01](/a/convergence-c01) — Least Action / Variational Principles. The universe optimizes. Computation is optimization. [SOURCE:convergence-c01|type:convergence] - [convergence-c02](/a/convergence-c02) — Symmetry / Conservation / Noether. The invariants of computation. [SOURCE:convergence-c02|type:convergence] - [convergence-c03](/a/convergence-c03) — Entropy / Arrow of Time. Computation has a direction. [SOURCE:convergence-c03|type:convergence] - [convergence-c04](/a/convergence-c04) — Information / Entropy / Compression. The measure of computation. [SOURCE:convergence-c04|type:convergence] - [convergence-c05](/a/convergence-c05) — Criticality / Edge of Chaos. Computation lives at the boundary. [SOURCE:convergence-c05|type:convergence] - [convergence-c06](/a/convergence-c06) — Networks / Small-World / Scale-Free. The topology of computation. [SOURCE:convergence-c06|type:convergence] - [convergence-c08](/a/convergence-c08) — Autopoiesis / Self-Production. Living systems compute themselves. [SOURCE:convergence-c08|type:convergence] - [convergence-c09](/a/convergence-c09) — Dissipative Structures / Far-From-Equilibrium. Order from chaos. [SOURCE:convergence-c09|type:convergence] - [convergence-c10](/a/convergence-c10) — Scale Invariance / Fractals / Allometry. Computation at all scales. [SOURCE:convergence-c10|type:convergence] - [convergence-c11](/a/convergence-c11) — Networks / Small-World / Scale-Free. The topology of computation. [SOURCE:convergence-c11|type:convergence] - [convergence-c12](/a/convergence-c12) — Autopoiesis / Self-Production. Living systems compute themselves. [SOURCE:convergence-c12|type:convergence] - [convergence-c14](/a/convergence-c14) — Duality / Complementarity / Dialectic. The limits of computation. [SOURCE:convergence-c14|type:convergence] - [convergence-c16](/a/convergence-c16) — Branching / Optimal Transport. The geometry of computation. [SOURCE:convergence-c16|type:convergence] - [convergence-c21](/a/convergence-c21) — Consciousness / Integrated Information. The output of computation. [SOURCE:convergence-c21|type:convergence] ## Claims (8) - **c1** [system w=1] Turing's 1936 theorem proves that a single machine can simulate any other computable machine. - sources: turing-1936 - **c3** [system w=0.95] Landauer's principle establishes that erasing one bit of information requires at least kT ln 2 of energy, making computation fundamentally physical. - sources: landauer-1961 - **c2** [system w=0.9] The Church-Turing thesis asserts that every physically computable function is computable by a Turing machine; no counterexample has been found. - sources: turing-1936 - **c4** [system w=0.9] Prigogine demonstrated that open systems far from equilibrium spontaneously organize into dissipative structures that maintain order by exporting entropy. - sources: prigogine-1977 - **c5** [speculative w=0.6] The universe is a computational system: information is physical, computation has a thermodynamic cost, and order emerges from chaos. - sources: turing-1936, shannon-1948, landauer-1961, prigogine-1977 - **c7** [speculative w=0.6] Quantum computers may violate the Church-Turing thesis in terms of computational speed, though they remain Turing-complete. - sources: turing-1936 - **c6** [speculative w=0.5] England's theory (2013) predicts that matter driven by thermodynamic gradients spontaneously restructures to dissipate more energy, and that dissipation drives adaptation, replication, and life. - sources: england-2013 - **c8** [anecdotal w=0.3] Hypercomputation (oracles, infinite time Turing machines) could theoretically solve the halting problem, but none have been physically realized. - sources: turing-1936 ## Voxel graph (8 atoms · 11 edges) - full graph: https://miscsubjects.com/api/articles/convergence-c20/voxels ## Article constitution - full: https://miscsubjects.com/api/articles/constitution ## Source ledger (5) - chain valid: no · head: `` ### landauer-1961 · primary - title: Irreversibility and Heat Generation in the Computing Process (1961) - url: https://miscsubjects.com/a/landauer-1961 - summary: Landauer proved that erasing one bit of information requires at least kT ln 2 of energy. Computation is physical. Information is physical. There is no free computation. - claim_ids: c3, c5 - hash: `` ### prigogine-1977 · primary - title: Self-Organization in Nonequilibrium Systems (1977) - url: https://miscsubjects.com/a/prigogine-1977 - summary: Prigogine showed that open systems far from equilibrium spontaneously organize into dissipative structures. These structures maintain order by exporting entropy. Observed in chemistry, biology, and meteorology. - claim_ids: c4, c5 - hash: `` ### shannon-1948 · primary - title: A Mathematical Theory of Communication (1948) - url: https://miscsubjects.com/a/shannon-1948 - summary: Shannon unified communication, cryptography, and computation in one framework. The bit is the unit of information. Information has a rate and a limit. The same math governs telegraphs, genes, and neurons. - claim_ids: c5 - hash: `` ### turing-1936 · primary - title: On Computable Numbers, with an Application to the Entscheidungsproblem (1936) - url: https://miscsubjects.com/a/turing-1936 - summary: Turing proved that a single abstract machine can simulate any other computable machine. This is the foundational theorem of computer science. The halting problem is undecidable. The Church-Turing thesis is introduced as a hypothesis. - claim_ids: c1, c2, c7, c8 - hash: `` ### godel-1931 · primary - title: On Formally Undecidable Propositions of Principia Mathematica and Related Systems (1931) - url: https://miscsubjects.com/a/godel-1931 - summary: Gödel proved that any formal system powerful enough to express arithmetic is either incomplete or inconsistent. Truth exceeds proof. This sets the logical limit within which computation operates. - 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/convergence-c20/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/convergence-c20/topology - **Ask (API):** POST https://miscsubjects.com/api/protocol/ask `{"slug":"convergence-c20","question":"..."}` - **Ingest your findings:** POST https://miscsubjects.com/api/protocol/ingest or text `ingest convergence-c20|your evidence` - **Post one claim:** POST https://miscsubjects.com/api/protocol/claim or text `claim convergence-c20|tier|assertion` - **iMessage ask:** `convergence-c20|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:** `convergence-c20` - **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/convergence-c20/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/convergence-c20/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.*