{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","title":"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components","body":"## What the work establishes\n\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\n\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\n\n## Exact primary passages\n\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\n\nKey passage on the majority organ: \"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\n\nOn multiplexing: \"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\" (section 9.1).\n\nOn error in multiplex systems: \"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\" (section 10.1).\n\n## Convergence patterns touched\n\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory and structure when redundancy exceeds component failure rate. This aligns with GRAIN patterns of symmetry and flow networks that persist across scales.\n\nIt touches the Ladder step from structure to memory: reliable automata require persistent state despite component unreliability.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe paper stays inside formal automata theory. It proves mechanistic reliability bounds but does not address energy flows, dissipative structures, or the reader-inside-system Mirror Layer. It stops at engineered computation. It supplies one mechanistic building block for error-tolerant self-organization.\n\nLink to related articles: /a/oip-the-ladder and /a/oip-principles.\n\n## Honest limits and disconfirming edges\n\nThe analysis assumes simplified independent error probabilities. Real components show correlated failures. The paper notes this assumption explicitly in section 11.3. It does not treat continuous analog systems in depth or prove necessity of digital multiplexing. Reductionist accounts treat the result as engineering technique only, without requiring broader pattern emergence claims.\n\nNo human data applies. All claims here are mechanistic.\n\n## Mechanistic claims\n\nThe paper proves that majority voting over triplicated networks restores correctness under the stated probability model. Tier: mechanistic. Source: von Neumann 1956, section 8.3.2.\n\nMultiplexing with bundle size N reduces output error probability exponentially in N for fixed component error rate. Tier: mechanistic. Source: von Neumann 1956, section 10.5.\n\nRestoring organs can be constructed from the same unreliable components used for computation. Tier: mechanistic. Source: von Neumann 1956, section 9.2.3.\n\n## Sources\n\nThe 1956 publication supplies the sole primary source. Secondary PDFs reproduce the text but introduce no new claims.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"von Neumann proved reliable automata can be synthesized from components with fixed positive error probability via triplication and majority voting.","section":"What the work establishes","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes core mechanism for error-tolerant structure from unreliable parts.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Multiplexing signal lines into bundles of size N allows output error probability to be made arbitrarily small by increasing N.","section":"Exact primary passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the quantitative scaling law for reliable pattern persistence.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The analysis assumes independent component errors; correlated failures lie outside the model.","section":"Honest limits and disconfirming edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the explicit boundary condition of the proof.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://static.ias.edu/pitp/archive/2012files/Probabilistic_Logics.pdf","title":"Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components","quote":"by using large enough bundles of lines, any desired degree of accuracy (i.e. as small a probability of malfunction of the ultimate output of the network as desired) can be obtained with a multiplexed automaton.","summary":"Full text of the 1952 lectures as prepared for 1956 publication, including sections on multiplexing and error control.","claim_ids":["c1","c2","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T05:39:44.019Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"a9c440db9cb7b7d229ca48a996f00caa92c7ad0ae4e6a624fc0ced9625b97789"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T05:39:45.271Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components","register":"standard","body":"## What the work establishes\n\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\n\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\n\n## Exact primary passages\n\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\n\nKey passage on the majority organ: \"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\n\nOn multiplexing: \"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\" (section 9.1).\n\nOn error in multiplex systems: \"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\" (section 10.1).\n\n## Convergence patterns touched\n\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory and structure when redundancy exceeds component failure rate. This aligns with GRAIN patterns of symmetry and flow networks that persist across scales.\n\nIt touches the Ladder step from structure to memory: reliable automata require persistent state despite component unreliability.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe paper stays inside formal automata theory. It proves mechanistic reliability bounds but does not address energy flows, dissipative structures, or the reader-inside-system Mirror Layer. It stops at engineered computation. It supplies one mechanistic building block for error-tolerant self-organization.\n\nLink to related articles: /a/oip-the-ladder and /a/oip-principles.\n\n## Honest limits and disconfirming edges\n\nThe analysis assumes simplified independent error probabilities. Real components show correlated failures. The paper notes this assumption explicitly in section 11.3. It does not treat continuous analog systems in depth or prove necessity of digital multiplexing. Reductionist accounts treat the result as engineering technique only, without requiring broader pattern emergence claims.\n\nNo human data applies. All claims here are mechanistic.\n\n## Mechanistic claims\n\nThe paper proves that majority voting over triplicated networks restores correctness under the stated probability model. Tier: mechanistic. Source: von Neumann 1956, section 8.3.2.\n\nMultiplexing with bundle size N reduces output error probability exponentially in N for fixed component error rate. Tier: mechanistic. Source: von Neumann 1956, section 10.5.\n\nRestoring organs can be constructed from the same unreliable components used for computation. Tier: mechanistic. Source: von Neumann 1956, section 9.2.3.\n\n## Sources\n\nThe 1956 publication supplies the sole primary source. Secondary PDFs reproduce the text but introduce no new claims.","claims":[{"id":"c1","text":"von Neumann proved reliable automata can be synthesized from components with fixed positive error probability via triplication and majority voting.","section":"What the work establishes","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes core mechanism for error-tolerant structure from unreliable parts.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Multiplexing signal lines into bundles of size N allows output error probability to be made arbitrarily small by increasing N.","section":"Exact primary passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the quantitative scaling law for reliable pattern persistence.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The analysis assumes independent component errors; correlated failures lie outside the model.","section":"Honest limits and disconfirming edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the explicit boundary condition of the proof.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://static.ias.edu/pitp/archive/2012files/Probabilistic_Logics.pdf","title":"Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components","quote":"by using large enough bundles of lines, any desired degree of accuracy (i.e. as small a probability of malfunction of the ultimate output of the network as desired) can be obtained with a multiplexed automaton.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":27569,"tokens_out":2279,"cost":0.04015875,"prev_hash":"genesis","hash":"53a2624ef7caacf54074fe1009de980950323974988a09c79304451e23ffa368"}],"provenance":[{"ts":"2026-07-10T05:39:45.271Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"von Neumann, J. (1956). Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nError-tolerant complex systems and reliable self-organization from noisy components, linking to dissipative structures and pattern stability.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"von-neumann-1956-probabilistic-logics-reliable-organisms\",\n  \"title\": \"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components\",\n  \"body\": \"## What the work establishes\\n\\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\\n\\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\\n\\n## Exact primary passages\\n\\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\\n\\nKey passage on the majority organ: \\\"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\\\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\\n\\nOn multiplexing: \\\"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\\\" (section 9.1).\\n\\nOn error in multiplex systems: \\\"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\\\" (section 10.1).\\n\\n## Convergence patterns touched\\n\\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory ","tokens_in":27569,"tokens_out":2279,"cost":0,"prev":"genesis","hash":"31533bbcdbfafbd9b111b8b04d628a3cf80fb20c3a06f2a0f3d9ab969709cb3a"},{"ts":"2026-07-10T05:54:22.618Z","model":"scorer","action":"score","prompt":"","input":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"31533bbcdbfafbd9b111b8b04d628a3cf80fb20c3a06f2a0f3d9ab969709cb3a","hash":"0d06e51d066d315a6699b50a66035cc8bf6c94c5b530a49676eba47e6d561a0d"},{"ts":"2026-07-17T02:37:41.291Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","response":"23 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"0d06e51d066d315a6699b50a66035cc8bf6c94c5b530a49676eba47e6d561a0d","hash":"43ff3338ce820aaebc3a4db7ddf6ed24ae14e17e16ae5d2765344c93a7f231b8"}],"energy":{"passes":3,"tokens_in":27569,"tokens_out":2279,"tokens_total":29848,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"43ff3338ce820aaebc3a4db7ddf6ed24ae14e17e16ae5d2765344c93a7f231b8"},"posted_at":"2026-07-10T05:39:45.271Z","created_at":"2026-07-10T05:39:45.271Z","updated_at":"2026-07-17T02:37:41.291Z","machine":{"shape":"article.machine/v1","slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","json":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","bundle":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":3,"sources":1,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","json":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","markdown":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/bundle?format=markdown","skill":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/skill","topology":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/topology","versions":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/revisions","invocations":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"934e253deb3795b8c548d505e2ca2bc3229fd3e29c3f7134acaf6632a4c52574","object":{"object_type":"article-object","identity":{"id":"article:paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","title":"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","role":"explain","audience":"human"},"skill":{"route":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/skill","role":"direct behavior","audience":"model","content":"---\nname: paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis\ndescription: Apply the von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components\n\nThis Skill is the behavioral expression of [the canonical article](/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis.\n- Read claims and relationships at /api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nWhat the work establishes John von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still \n\n## Representations\n\n- Human: /a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis\n- JSON: /api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis\n- Relationships: /api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis/topology\n- History: /api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis/revisions\n"},"json":{"route":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","philosophy","paper","paper","von","neumann","j","1956","probabilistic","logics","and","the","synthesis","of","reliable","organisms"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/invocations?status=success","failure_events":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","title":"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components","body":"## What the work establishes\n\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\n\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\n\n## Exact primary passages\n\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\n\nKey passage on the majority organ: \"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\n\nOn multiplexing: \"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\" (section 9.1).\n\nOn error in multiplex systems: \"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\" (section 10.1).\n\n## Convergence patterns touched\n\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory and structure when redundancy exceeds component failure rate. This aligns with GRAIN patterns of symmetry and flow networks that persist across scales.\n\nIt touches the Ladder step from structure to memory: reliable automata require persistent state despite component unreliability.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe paper stays inside formal automata theory. It proves mechanistic reliability bounds but does not address energy flows, dissipative structures, or the reader-inside-system Mirror Layer. It stops at engineered computation. It supplies one mechanistic building block for error-tolerant self-organization.\n\nLink to related articles: /a/oip-the-ladder and /a/oip-principles.\n\n## Honest limits and disconfirming edges\n\nThe analysis assumes simplified independent error probabilities. Real components show correlated failures. The paper notes this assumption explicitly in section 11.3. It does not treat continuous analog systems in depth or prove necessity of digital multiplexing. Reductionist accounts treat the result as engineering technique only, without requiring broader pattern emergence claims.\n\nNo human data applies. All claims here are mechanistic.\n\n## Mechanistic claims\n\nThe paper proves that majority voting over triplicated networks restores correctness under the stated probability model. Tier: mechanistic. Source: von Neumann 1956, section 8.3.2.\n\nMultiplexing with bundle size N reduces output error probability exponentially in N for fixed component error rate. Tier: mechanistic. Source: von Neumann 1956, section 10.5.\n\nRestoring organs can be constructed from the same unreliable components used for computation. Tier: mechanistic. Source: von Neumann 1956, section 9.2.3.\n\n## Sources\n\nThe 1956 publication supplies the sole primary source. Secondary PDFs reproduce the text but introduce no new claims.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"von Neumann proved reliable automata can be synthesized from components with fixed positive error probability via triplication and majority voting.","section":"What the work establishes","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes core mechanism for error-tolerant structure from unreliable parts.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Multiplexing signal lines into bundles of size N allows output error probability to be made arbitrarily small by increasing N.","section":"Exact primary passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the quantitative scaling law for reliable pattern persistence.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The analysis assumes independent component errors; correlated failures lie outside the model.","section":"Honest limits and disconfirming edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the explicit boundary condition of the proof.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://static.ias.edu/pitp/archive/2012files/Probabilistic_Logics.pdf","title":"Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components","quote":"by using large enough bundles of lines, any desired degree of accuracy (i.e. as small a probability of malfunction of the ultimate output of the network as desired) can be obtained with a multiplexed automaton.","summary":"Full text of the 1952 lectures as prepared for 1956 publication, including sections on multiplexing and error control.","claim_ids":["c1","c2","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T05:39:44.019Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"a9c440db9cb7b7d229ca48a996f00caa92c7ad0ae4e6a624fc0ced9625b97789"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T05:39:45.271Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components","register":"standard","body":"## What the work establishes\n\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\n\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\n\n## Exact primary passages\n\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\n\nKey passage on the majority organ: \"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\n\nOn multiplexing: \"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\" (section 9.1).\n\nOn error in multiplex systems: \"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\" (section 10.1).\n\n## Convergence patterns touched\n\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory and structure when redundancy exceeds component failure rate. This aligns with GRAIN patterns of symmetry and flow networks that persist across scales.\n\nIt touches the Ladder step from structure to memory: reliable automata require persistent state despite component unreliability.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe paper stays inside formal automata theory. It proves mechanistic reliability bounds but does not address energy flows, dissipative structures, or the reader-inside-system Mirror Layer. It stops at engineered computation. It supplies one mechanistic building block for error-tolerant self-organization.\n\nLink to related articles: /a/oip-the-ladder and /a/oip-principles.\n\n## Honest limits and disconfirming edges\n\nThe analysis assumes simplified independent error probabilities. Real components show correlated failures. The paper notes this assumption explicitly in section 11.3. It does not treat continuous analog systems in depth or prove necessity of digital multiplexing. Reductionist accounts treat the result as engineering technique only, without requiring broader pattern emergence claims.\n\nNo human data applies. All claims here are mechanistic.\n\n## Mechanistic claims\n\nThe paper proves that majority voting over triplicated networks restores correctness under the stated probability model. Tier: mechanistic. Source: von Neumann 1956, section 8.3.2.\n\nMultiplexing with bundle size N reduces output error probability exponentially in N for fixed component error rate. Tier: mechanistic. Source: von Neumann 1956, section 10.5.\n\nRestoring organs can be constructed from the same unreliable components used for computation. Tier: mechanistic. Source: von Neumann 1956, section 9.2.3.\n\n## Sources\n\nThe 1956 publication supplies the sole primary source. Secondary PDFs reproduce the text but introduce no new claims.","claims":[{"id":"c1","text":"von Neumann proved reliable automata can be synthesized from components with fixed positive error probability via triplication and majority voting.","section":"What the work establishes","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes core mechanism for error-tolerant structure from unreliable parts.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Multiplexing signal lines into bundles of size N allows output error probability to be made arbitrarily small by increasing N.","section":"Exact primary passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the quantitative scaling law for reliable pattern persistence.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The analysis assumes independent component errors; correlated failures lie outside the model.","section":"Honest limits and disconfirming edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the explicit boundary condition of the proof.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T22:39:44-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://static.ias.edu/pitp/archive/2012files/Probabilistic_Logics.pdf","title":"Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components","quote":"by using large enough bundles of lines, any desired degree of accuracy (i.e. as small a probability of malfunction of the ultimate output of the network as desired) can be obtained with a multiplexed automaton.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":27569,"tokens_out":2279,"cost":0.04015875,"prev_hash":"genesis","hash":"53a2624ef7caacf54074fe1009de980950323974988a09c79304451e23ffa368"}],"provenance":[{"ts":"2026-07-10T05:39:45.271Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"von Neumann, J. (1956). Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nError-tolerant complex systems and reliable self-organization from noisy components, linking to dissipative structures and pattern stability.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"von-neumann-1956-probabilistic-logics-reliable-organisms\",\n  \"title\": \"von Neumann (1956): Probabilistic Logics and Reliable Organisms from Unreliable Components\",\n  \"body\": \"## What the work establishes\\n\\nJohn von Neumann delivered lectures in 1952 at Caltech. Notes by R. S. Pierce formed the basis for the 1956 publication. The paper shows how automata built from components with positive error probability can still produce outputs with arbitrarily low error probability. It uses multiplexing of signal lines and majority organs to restore correctness.\\n\\nCore result: error control scales with bundle size. Larger bundles reduce malfunction probability below any fixed threshold.\\n\\n## Exact primary passages\\n\\nThe published form appears in Automata Studies, eds. C. E. Shannon and J. McCarthy, Princeton University Press, Annals of Mathematics Studies No. 34, pp. 43-98, 1956.\\n\\nKey passage on the majority organ: \\\"Denote by O the given network... Construct O in triplicate, labeling the copies O1, O2, O3 respectively. Consider the system shown in Figure 26.\\\" (p. 66 in the Pierce notes version; equivalent in published text around section 8.3).\\n\\nOn multiplexing: \\\"The messages are carried on N lines. A positive number Δ(N) is chosen and the stimulation of (1/2 + Δ)N lines of the bundle is interpreted as a positive message... The complete system must be organized in such a manner that a malfunction of the whole automaton cannot be caused by the malfunctioning of a single component, or of a small number of components, but only by the malfunctioning of a large number of them.\\\" (section 9.1).\\n\\nOn error in multiplex systems: \\\"by using large enough bundles of lines, any desired degree of accuracy... can be obtained with a multiplexed automaton.\\\" (section 10.1).\\n\\n## Convergence patterns touched\\n\\nThe work addresses reliable pattern stability from noisy parts. It evidences flow networks and bounded chaos under error. It supports emergence of stable memory ","tokens_in":27569,"tokens_out":2279,"cost":0,"prev":"genesis","hash":"31533bbcdbfafbd9b111b8b04d628a3cf80fb20c3a06f2a0f3d9ab969709cb3a"},{"ts":"2026-07-10T05:54:22.618Z","model":"scorer","action":"score","prompt":"","input":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"31533bbcdbfafbd9b111b8b04d628a3cf80fb20c3a06f2a0f3d9ab969709cb3a","hash":"0d06e51d066d315a6699b50a66035cc8bf6c94c5b530a49676eba47e6d561a0d"},{"ts":"2026-07-17T02:37:41.291Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","response":"23 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"0d06e51d066d315a6699b50a66035cc8bf6c94c5b530a49676eba47e6d561a0d","hash":"43ff3338ce820aaebc3a4db7ddf6ed24ae14e17e16ae5d2765344c93a7f231b8"}],"energy":{"passes":3,"tokens_in":27569,"tokens_out":2279,"tokens_total":29848,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"43ff3338ce820aaebc3a4db7ddf6ed24ae14e17e16ae5d2765344c93a7f231b8"},"posted_at":"2026-07-10T05:39:45.271Z","created_at":"2026-07-10T05:39:45.271Z","updated_at":"2026-07-17T02:37:41.291Z","machine":{"shape":"article.machine/v1","slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","json":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","bundle":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":3,"sources":1,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","json":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","markdown":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/bundle?format=markdown","skill":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/skill","topology":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/topology","versions":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/revisions","invocations":"/api/articles/paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-von-neumann-j-1956-probabilistic-logics-and-the-synthesis-of-reliable-organisms","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"934e253deb3795b8c548d505e2ca2bc3229fd3e29c3f7134acaf6632a4c52574"}}}