{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_bundle","feature":"bundle","name":"LLM article bundle","what":"Portable reference package: body + claims + sources + voxels + provenance + manifest + constitution.","contains":"body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest","slug":"shannon-1948","urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown"},"how_to_use":"Reference bundle for an LLM or reader. §SELF explains the surface; ingest and claim endpoints in llm_manifest are the write-back routes.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/shannon-1948/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/topology"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"ingest","name":"Ingest protocol","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","urls":{"write":"https://miscsubjects.com/api/protocol/ingest"}},{"id":"claim_post","name":"Claim post protocol","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by.","urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"llm_manifest","name":"LLM manifest","what":"Machine-readable read/write contract for external LLMs.","urls":{"read":"https://miscsubjects.com/api/articles/llm-manifest"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"bundle","name":"LLM article bundle","what":"Portable reference package: body + claims + sources + voxels + provenance + manifest + constitution.","why":"Every feature is auditable collective intelligence","how":"Reference bundle for an LLM or reader. §SELF explains the surface; ingest and claim endpoints in llm_manifest are the write-back routes.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown"},"imessage":null,"router":null,"related":[{"id":"topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."},{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"ingest","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."},{"id":"llm_manifest","what":"Machine-readable read/write contract for external LLMs."}],"not_medical_advice":true},"MASTHEAD":{"sorry_status":"planes not merged yet — sorry-status activates after voxel-merge-planes","identity":{"slug":"shannon-1948","version":2,"content_hash":"68a78e9da7a38e0fef45fbca5252e11efd14db16ec123b1861abd80f934455c4","thread_head":"genesis","divs":33},"thesis":{"root_claim":"C1","text":"Information is physical. Uncertainty can be measured in bits, and there is a hard limit to how much a signal can be compressed before information is lost.","tier":"system"},"load_bearing":[{"id":"C2","tier":"system","status":"active","text":"The Source Coding Theorem states that the minimum average number of bits needed to encode a message equals its Shannon entropy, and no code can beat this limit "},{"id":"C3","tier":"system","status":"active","text":"The Noisy Channel Coding Theorem states that information can be transmitted through a noisy channel with arbitrarily low error if and only if the transmission r"},{"id":"C4","tier":"system","status":"active","text":"The statistical-mechanical formula for entropy H = -Σ p log p is an identity that measures both disorder in a gas and uncertainty in a communication channel, no"},{"id":"C6","tier":"system","status":"active","text":"Shannon's theory did not prove that information erasure costs energy; Landauer proved the physical cost of erasing one bit (at least kT ln 2 of heat) thirteen y"},{"id":"C5","tier":"system","status":"active","text":"Shannon entropy is observer-relative in a way that Boltzmann's physical entropy is not: the same signal has different Shannon entropy under different codebooks."},{"id":"C8","tier":"system","status":"active","text":"Shannon entropy measures average compressibility across an ensemble, whereas Kolmogorov complexity measures compressibility of a single object; the gap between "},{"id":"C7","tier":"speculative","status":"active","text":"Jaynes and the objective Bayesian camp argue that entropy is a measure of our ignorance, not a property of the world, and that the thermodynamic convergence is "}],"standing_objections":{"open":0,"strongest_open":null,"link":"https://miscsubjects.com/api/articles/shannon-1948/discourse"},"verbs":{"read":"GET https://miscsubjects.com/api/articles/shannon-1948/voxels — DIVs + hashes + chains (free)","read_claims":"GET https://miscsubjects.com/api/articles/shannon-1948/claims — every formal claim as claim:<id> with current hash, thread, stable link, and exact contribution/edit bodies","challenge":"POST https://miscsubjects.com/api/protocol/voxel-challenge {slug, expected_thread_head, target_div?, expected_hash?, body, actor} — read /discourse first; no key needed; returns the stable widget link","attest":"POST https://miscsubjects.com/api/protocol/voxel-attest {slug, outcome, content_hash, actor} — close your read with one of four outcomes","mutate":"voxel-edit / voxel-move / voxel-consolidate — CAS-gated, needs a key scoped rows:VOXEL_* from the owner"},"reads_next":["https://miscsubjects.com/a/philosophy","https://miscsubjects.com/api/articles/shannon-1948/discourse","https://miscsubjects.com/api/protocol"]},"bundle_version":1,"generated_at":"2026-07-30T00:59:00.721Z","slug":"shannon-1948","title":"Shannon 1948 — A Mathematical Theory of Communication","url":"https://miscsubjects.com/a/shannon-1948","register":"source","tags":["source","grain","convergence","shannon"],"posted_at":"2026-07-04T19:36:16.811Z","updated_at":"2026-07-17T02:41:59.741Z","body":"## The Source\n\nClaude E. Shannon. \"A Mathematical Theory of Communication.\" *Bell System Technical Journal*, vol. 27, no. 3, pp. 379–423; no. 4, pp. 623–656. July and October 1948. No DOI — predates DOI system; Bell Labs internal publication, Murray Hill, New Jersey.\n\n## The Claim\n\nInformation is physical. Uncertainty can be measured in bits. There is a hard limit to how much you can compress a signal before you lose it. [SOURCE:shannon-1948|type:mathematical]\n\n## The Context\n\nShannon was thirty-two. He worked at Bell Labs in Murray Hill, New Jersey. The phone company had a problem. Wires carried noise. Signals degraded. Engineers added repeaters, amplifiers, thicker cables. They threw hardware at static. Shannon threw math at it instead.\n\nThe year was 1948. World War II had ended three years earlier. Radar, cryptography, and fire-control systems had forced engineers to think about signals in new ways. Shannon had already proved that any Boolean function could be built from switches. Now he asked a harder question. What is the absolute minimum energy — or bandwidth, or code length — required to send a message without error?\n\nHe borrowed from Boltzmann. He borrowed from Gibbs. He took the statistical-mechanical formula for entropy and turned it into a formula for surprise. The result was not an analogy. It was an identity. H = −Σ p log p measures both disorder in a gas and uncertainty in a channel.\n\nThe paper appeared in two parts in the *Bell System Technical Journal*. It was read by engineers who barely understood the math and mathematicians who barely understood the wires. Both camps changed their fields forever.\n\n## The Evidence\n\nShannon proved three theorems. They are still taught exactly as he wrote them.\n\n**Source Coding Theorem.** The minimum average number of bits needed to encode a message equals its Shannon entropy. You cannot beat this. Any code that tries will lose information. [SOURCE:shannon-1948|type:mathematical]\n\n**Noisy Channel Coding Theorem.** You can transmit information through a noisy channel with arbitrarily low error — if and only if your rate stays below the channel capacity C = max_{p(x)} I(X;Y). The limit is fundamental. It does not depend on technology. It depends on physics. [SOURCE:shannon-1948|type:mathematical]\n\n**Channel Capacity.** The formula ties together signal power, bandwidth, and noise. It tells you what nature permits. Engineers had spent decades guessing. Shannon gave them a ceiling they could not break.\n\nHe provided no new experiment. He provided a new foundation. Every modem, every hard drive, every DNA sequencer, every machine-learning compression algorithm runs on his theorems.\n\n## The Convergence\n\nThis is **C06 — Information / Entropy / Compression** [SOURCE:convergence-c06|type:theoretical]. Shannon named the pattern before Landauer proved it was physical.\n\nThe same mathematical object — H = −Σ p log p — appears in:\n- Statistical mechanics, where Boltzmann and Gibbs count microstates [SOURCE:boltzmann-1877|type:mathematical]\n- Thermodynamics, where Landauer proves erasing one bit costs at least kT ln(2) of heat [SOURCE:landauer-1961|type:theoretical]\n- Algorithmic information theory, where Kolmogorov defines information content as the shortest program that generates a string [SOURCE:kolmogorov-1965|type:mathematical]\n- Machine learning, where maximum-entropy models select the least-assuming distribution consistent with data [SOURCE:jaynes-1957|type:theoretical]\n\nFour fields. Four nations. Four decades. One quantity. No borrowing chain.\n\nShannon did not see the full catalogue. He did not see DNA as a code channel with proofreading as error correction. He did not see the brain as a prediction engine minimizing free energy. He did not see the ethics bridge — that lying is noise, that clarity is compression, that a just society maximizes mutual information between citizens and institutions. But he lit the path. He showed that information is not an abstraction. It is a measurable, physical resource subject to conservation laws as rigid as energy itself.\n\nThe pattern also reaches **C08 — Recursion / Self-Reference** [SOURCE:convergence-c08|type:theoretical]. A system that describes itself must store information about itself. That storage has minimum cost. That cost is Shannon entropy plus Landauer's bound. Self-reference is not free. The universe charges for it.\n\n## The Honest Limits\n\nShannon defined information relative to a coding scheme. His entropy is observer-relative in a way Boltzmann's is not. The same signal has different Shannon entropy under different codebooks. This is a feature, not a bug — but it opens a door the realists do not like.\n\nHe missed the physical instantiation. His theorems were about abstract channels. He did not prove that information erasure costs energy. Landauer did that thirteen years later. Without Landauer, Shannon's theory floats above physics. With Landauer, it lands.\n\nHe missed Kolmogorov complexity. Shannon entropy measures average compressibility across an ensemble. Kolmogorov complexity measures the compressibility of a single object. The gap matters. Some strings are individually incompressible even if drawn from a compressible distribution.\n\nHis rival is alive. Jaynes and the objective Bayesian camp argue that entropy is not information. It is a measure of our ignorance, not a property of the world. The thermodynamic convergence is formal analogy, not identity. The pattern recurs in the math, but the math may not carve nature at the joints. [SOURCE:jaynes-1957|type:philosophical]\n\nThe Macy conferences muddy the independence claim. Wiener, von Neumann, and Shannon all attended. Cybernetics cross-pollinated information theory, control theory, and computation. The mathematical formalisms remain independently derived. The conceptual frame shares a common soil. Independence: HIGH for the theorems. MODERATE for the worldview. [SOURCE:nogo-n07|type:philosophical]\n\n## The Receipt\n\n> \"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point. Frequently the messages have meaning; that is they refer to or are correlated according to some system with certain physical or conceptual entities. These semantic aspects of communication are irrelevant to the engineering problem.\"\n\nPart I, Section 1, opening paragraph. The exact sentence. The entire edifice rests on this boundary. Meaning is for humans. Information is for physics. Shannon drew the line. The line held. [SOURCE:shannon-1948|type:theoretical]\n\n## Related Sources\n\n- [convergence-c06](/article/convergence-c06) — The information-entropy-compression pattern Shannon founded\n- [convergence-c08](/article/convergence-c08) — Recursion and self-reference: information about the system is part of the system\n- [wiener-1948](/article/wiener-1948) — Cybernetics: feedback and control as the complement to Shannon's channel\n- [schrodinger-1944](/article/schrodinger-1944) — What Is Life? The thermodynamic bridge Shannon crossed in the opposite direction\n- [noether-1918](/article/noether-1918) — Symmetry and conservation: the mathematical backbone that lets information be preserved\n- Boltzmann 1877 — S = k log W: the statistical entropy Shannon borrowed and inverted\n- Landauer 1961 — Irreversibility and heat generation: the physical cost Shannon's theory needed\n- Kolmogorov 1965 — Three Approaches to the Quantitative Definition of Information: the algorithmic completion\n- Jaynes 1957 — Information Theory and Statistical Mechanics: the rival frame that calls entropy epistemic\n","claims":[{"id":"C1","text":"Information is physical. Uncertainty can be measured in bits, and there is a hard limit to how much a signal can be compressed before information is lost.","tier":"system","weight":1,"effective_weight":1,"source_ids":["S1"],"status":"active"},{"id":"C2","text":"The Source Coding Theorem states that the minimum average number of bits needed to encode a message equals its Shannon entropy, and no code can beat this limit without losing information.","tier":"system","weight":1,"effective_weight":1,"source_ids":["S1"],"status":"active"},{"id":"C3","text":"The Noisy Channel Coding Theorem states that information can be transmitted through a noisy channel with arbitrarily low error if and only if the transmission rate stays below the channel capacity C = max_{p(x)} I(X;Y).","tier":"system","weight":1,"effective_weight":1,"source_ids":["S1"],"status":"active"},{"id":"C4","text":"The statistical-mechanical formula for entropy H = -Σ p log p is an identity that measures both disorder in a gas and uncertainty in a communication channel, not merely an analogy.","tier":"system","weight":0.95,"effective_weight":0.95,"source_ids":["S1","S4"],"status":"active"},{"id":"C6","text":"Shannon's theory did not prove that information erasure costs energy; Landauer proved the physical cost of erasing one bit (at least kT ln 2 of heat) thirteen years later in 1961.","tier":"system","weight":0.95,"effective_weight":0.95,"source_ids":["S1","S2"],"status":"active"},{"id":"C5","text":"Shannon entropy is observer-relative in a way that Boltzmann's physical entropy is not: the same signal has different Shannon entropy under different codebooks.","tier":"system","weight":0.9,"effective_weight":0.9,"source_ids":["S1"],"status":"active"},{"id":"C8","text":"Shannon entropy measures average compressibility across an ensemble, whereas Kolmogorov complexity measures compressibility of a single object; the gap between ensemble and individual compressibility matters for some incompressible strings drawn from compressible distributions.","tier":"system","weight":0.85,"effective_weight":0.85,"source_ids":["S1","S5"],"status":"active"},{"id":"C7","text":"Jaynes and the objective Bayesian camp argue that entropy is a measure of our ignorance, not a property of the world, and that the thermodynamic convergence is formal analogy rather than physical identity.","tier":"speculative","weight":0.6,"effective_weight":0.6,"source_ids":["S3"],"status":"active"}],"sources":[{"id":"S1","type":"primary","url":"https://miscsubjects.com/a/shannon-1948","title":"Shannon, C.E. (1948). A Mathematical Theory of Communication. Bell System Technical Journal, 27(3), 379-423; 27(4), 623-656.","summary":"The foundational paper of information theory. Proves source coding theorem, noisy channel coding theorem, and defines channel capacity. Establishes that information is physical and measurable in bits.","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point. Frequently the messages have meaning; that is they refer to or are correlated according to some system with certain physical or conceptual entities. These semantic aspects of communication are irrelevant to the engineering problem.","claim_ids":["C1","C2","C3","C4","C5","C6","C8"]},{"id":"S2","type":"adjacent","url":"https://miscsubjects.com/a/landauer-1961","title":"Landauer, R. (1961). Irreversibility and Heat Generation in the Computing Process. IBM Journal of Research and Development.","summary":"Proves the physical cost of erasing one bit of information: at least kT ln 2 of heat must be dissipated. Bridges Shannon's abstract theory to physical thermodynamics.","quote":"","claim_ids":["C6"]},{"id":"S3","type":"rival","url":"https://miscsubjects.com/a/jaynes-1957","title":"Jaynes, E.T. (1957). Information Theory and Statistical Mechanics. Physical Review.","summary":"Presents the objective Bayesian interpretation that entropy measures epistemic ignorance rather than a physical property of the world. Frames the thermodynamic convergence as formal analogy.","quote":"","claim_ids":["C7"]},{"id":"S4","type":"adjacent","url":"https://miscsubjects.com/a/boltzmann-1877","title":"Boltzmann, L. (1877). Über die Beziehung zwischen dem zweiten Hauptsatze der mechanischen Wärmetheorie und der Wahrscheinlichkeitsrechnung.","summary":"Originated the statistical-mechanical entropy formula S = k log W that Shannon adapted into H = -Σ p log p for information theory.","quote":"","claim_ids":["C4"]},{"id":"S5","type":"adjacent","url":"https://miscsubjects.com/a/kolmogorov-1965","title":"Kolmogorov, A.N. (1965). Three Approaches to the Quantitative Definition of Information.","summary":"Defines algorithmic information content as the length of the shortest program that generates a string. Completes Shannon by handling individual objects rather than ensembles.","quote":"","claim_ids":["C8"]}],"voxels":{"slug":"shannon-1948","counts":{"divs":33,"voxels":8,"sources":5,"edges":11},"note":"slim bundle — full voxels at /api/articles/shannon-1948/voxels"},"constitution":{"url":"https://miscsubjects.com/api/articles/constitution"},"provenance":[{"action":"voxel_divide","model":"owner","ts":"2026-07-17T02:41:59.741Z","hash":"b26e88b58326850e","tokens_in":0,"tokens_out":0}],"contributions":[],"topology":null,"slim":true,"ledger_totals":{"claims":8,"sources":5,"exported_claims":8,"exported_sources":5},"question_graph":{"slug":"shannon-1948","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"verification":{"provenance":{"valid":true,"entries":1,"head":"b26e88b58326850e3b2925d80e02c8922ddc14e4f02883de65a1f4fda3373f94"},"sources":{"valid":false,"broken_at":0}},"counts":{"claims":8,"sources":5,"provenance":1,"contributions":0,"questions":0,"evidence_ingests":0,"voxel_edges":11},"transport":"Open every URL in this bundle with your browser or web / URL-fetch tool. Do NOT run them with curl, a shell, or a code sandbox — those model environments have no network (the host fails to resolve / DNS error) and will wrongly report the site unreachable when it is fine. Opening the link IS the call.","llm_manifest":{"version":"1","site":"https://miscsubjects.com","purpose":"Peptide evidence articles with hash-chained source ledgers, tiered claims, and a question graph. LLMs should READ bundles/URLs and WRITE back via ingest — never invent doses.","read":{"human_page":"https://miscsubjects.com/a/shannon-1948","bundle_json":"https://miscsubjects.com/api/articles/shannon-1948/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/shannon-1948/topology","question_graph":"https://miscsubjects.com/api/articles/shannon-1948/question-graph","sources":"https://miscsubjects.com/api/articles/shannon-1948/sources","provenance":"https://miscsubjects.com/api/articles/shannon-1948/provenance","contributions":"https://miscsubjects.com/api/articles/shannon-1948/contributions","graph_topology":"https://miscsubjects.com/api/articles/shannon-1948/graph-topology?question={question}","voxels":"https://miscsubjects.com/api/articles/shannon-1948/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","health":"https://miscsubjects.com/api/articles/shannon-1948/health","repair":"POST https://miscsubjects.com/api/protocol/repair","list_articles":"https://miscsubjects.com/api/articles","graph_canvas":"https://miscsubjects.com/graph.html?slugs=shannon-1948","graph_yield":"https://miscsubjects.com/api/graph?slugs=shannon-1948&layer=yield","obsidian_vault":"https://miscsubjects.com/api/articles/obsidian-vault?slugs=shannon-1948","graph_query":"https://miscsubjects.com/api/v1/query?from=shannon-1948&kind=claim&where=tier=human"},"ask":{"description":"Answer only from topology; creates a question_node with gaps.","api":"POST https://miscsubjects.com/api/protocol/ask","body":{"slug":"{slug}","question":"string"},"imessage":"shannon-1948|your question","router_tag":"[ARTICLE_ASK]shannon-1948|question[/ARTICLE_ASK]","auth":"x-terminal-key header for API; iMessage/WhatsApp via miscsubjects build"},"ingest":{"description":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","api":"POST https://miscsubjects.com/api/protocol/ingest","body":{"slug":"{slug}","evidence":"paste text","question_node_id":"optional qn_..."},"imessage":"ingest shannon-1948|q:{node_id}|paste evidence","router_tag":"[ARTICLE_INGEST]shannon-1948|evidence[/ARTICLE_INGEST]","tiers":["human","preclinical","anecdotal","mechanistic","speculative"]},"claim":{"description":"Prompt-injection style POST — one claim voxel with who_claims + posted_by provenance.","api":"POST https://miscsubjects.com/api/protocol/claim","body":{"slug":"{slug}","text":"one assertion","tier":"human|preclinical|anecdotal|mechanistic|speculative","who_claims":"study author, platform, or model id","source_ids":"optional [s1]"},"imessage":"claim shannon-1948|tier|assertion — who claims it?","router_tag":"[ARTICLE_CLAIM]shannon-1948|tier|assertion[/ARTICLE_CLAIM]","slots":["what_it_is","who_claims_what","what_is_known","what_is_unknown","mechanism","limitations","disclaimer"]},"tiers":{"human":0.8,"preclinical":0.5,"anecdotal":0.3,"mechanistic":0.3,"speculative":0.1},"invariants":["Self-explaining — every API JSON has _self; every paste widget has §SELF; root index at /api/articles/system-map","Append-only — revisions preserved at ?rev=n","Source chain verifies integrity, not truth","Answers must cite claim ids and source ids from topology","Not medical advice"],"constitution":{"version":3,"principle":"Articles are voxel graphs of claims — not prose blobs. Every assertion is a claim atom with tier, weight, source_ids, and posted_by provenance.","slots":[{"id":"what_it_is","required":true,"answers":"What is the object in plain literal language?"},{"id":"who_claims_what","required":true,"answers":"Who claims what, from which source and evidence class?"},{"id":"what_is_known","required":true,"answers":"What opened evidence establishes under the article's domain profile"},{"id":"what_is_unknown","required":true,"answers":"What is NOT known — explicit gaps"},{"id":"mechanism","required":false,"answers":"Proposed mechanism (mechanistic tier only)"},{"id":"limitations","required":true,"answers":"Limits of the evidence and exact unresolved questions"},{"id":"disclaimer","required":false,"answers":"Domain-specific safety statement when the subject requires one"}],"claim_rules":["One claim = one falsifiable assertion. No compound claims.","Every claim must declare tier: human|preclinical|anecdotal|mechanistic|speculative|system.","system tier = architecture/design axioms (not biological mechanism). Use for protocol self-definition.","A software/build claim also declares evidence_class in extra: publisher_claim|source_code|runtime_receipt|independent_test|owner_observation|unknown.","Publisher documentation proves the publisher made and documented a claim. It is not independent runtime proof.","Source code proves an implementation exists. A successful receipt proves one invocation. Neither proves general reliability or field superiority.","Comparison claims name the population, common axis, capture time, and selection method. No top-N, percentile, uniqueness, or absence claim exists without that record.","Sourced claims must cite source_ids from the hash-chained ledger.","Unsourced claims must set source_status: unsourced and why_material.","posted_by is mandatory on every new claim (model id, human, or channel).","No medical advice, no doses, no 'you should take'.","Bad information is retracted (status:retracted), never deleted — retraction event stays on ledger.","Adversary challenges link via challenges[] / challenged_by[] — target may be downweighted.","Leaked secrets are scrubbed to [REDACTED:secret-leak] with scrub_events tombstone — honest audit trail."],"source_rules":["Every source is a voxel edge: type, url, exact quote, summary, found_by, accessed_at.","Sources hash-chain — prev/hash on append.","Anecdotal sources must name platform (reddit|x|youtube|imessage|user_entry).","Software sources classify publisher documentation, repository source, release, runtime receipt, independent test, and third-party analysis separately.","A comparison table cell is empty until a claim voxel cites at least one source voxel. Model prose alone is not evidence."],"writing_rules":["Literal nouns and verbs. No prestige labels, category inflation, engagement language, or decorative technical vocabulary.","Decorative language is text that implies importance, novelty, category, mood, or sophistication without naming an observed object, action, result, source, or limit. Delete it.","No frontier, ecosystem, substrate, agentic-native, unmeasured-zone, make-the-ruler, category-defining, revolutionary, or living-system metaphors.","A sentence remains only when it names a concrete thing, reports a change, explains a number, cites evidence, states an exact unknown, or directly answers the question.","Technical nouns are allowed only when literal. Define the first use by what the named code or data object stores or does.","State the observed object before naming a category for it.","Keep the evidentiary boundary beside the exact claim it limits.","Unknown means unknown. Missing evidence does not become absence."],"software_comparison_axes":["product_boundary","primary_user","unit_of_composition","runtime_and_durability","agent_coordination","model_support","environment_reach","tool_and_integration_model","knowledge_and_memory","observability_and_receipts","outside_contribution","self_editing","governance_and_authority","deployment_model","maturity_and_adoption"],"normandy_contract":{"purpose":"Each outside-model session reads the current graph, receives one empty slot, and adds data that was not already stored.","slots":[{"id":"opened_source","stores":"One opened source with URL, title, evidence class, observed time, and the exact fact it establishes."},{"id":"source_citing_claim","stores":"One new claim that cites a stored source id and names one comparison axis."},{"id":"overlap","stores":"One evidenced capability both systems have."},{"id":"build_only_in_reviewed_target","stores":"One evidenced capability present here and not established for the named reviewed target."},{"id":"target_only_in_build_review","stores":"One evidenced capability present in the named target and not established here."},{"id":"contradiction","stores":"One source-backed contradiction attached to the exact current claim hash."},{"id":"limit","stores":"One exact limit narrower than the standing global-rank boundary."},{"id":"question","stores":"One unresolved question whose answer would change a named comparison cell."},{"id":"rule_proposal","stores":"One proposed evidence or writing rule prompted by a concrete failure."},{"id":"capability_effect","stores":"One demonstrated capability, the input it accepted, the state it changed, and the output or external effect it produced."},{"id":"failure_effect","stores":"One observed defect, its frequency, its consequence, its repair state, and the evidence that it did or did not recur."},{"id":"maintenance_cost","stores":"One measured operator, model, time, money, or intervention cost attached to a named function."},{"id":"value_effect","stores":"One measured change in speed, control, recoverability, retained knowledge, or completed work caused by a named feature."}],"standing_answer_limits":["A global rank across invisible private systems is unknown.","Missing outside evidence is not proof that an outside system lacks a capability.","A successful receipt proves one run, not general reliability.","Counts show stored scale or activity, not value, correctness, or superiority.","Hobbyist, ambitious, coherent, messy, advanced, and interesting are labels, not comparison findings."],"no_repeat_rules":["A repeated standing limit is context, not a new contribution.","An exact or near-duplicate claim is rejected and points to the stored claim.","A duplicate source does not complete an assignment.","A response completes only after at least one new graph object lands.","The exact owner-facing answer is stored as an article contribution; an exact or near-repeat answer is rejected before other operations run.","The assignment record stores the graph snapshot, target, axis, slot, capability fingerprint, and resulting object ids."],"assignment":"GET /api/normandy?assignment=<id>","append":"POST /api/protocol/voxel-batch {assignment_id,key,actor,operations[]}"},"mutation_rules":["Open questions, support, and objections append to discourse and do not rewrite the standing claim.","Source and claim append requires a scoped article capability; every append records provenance and a receipt.","Existing text edits use the current voxel hash. A stale hash writes nothing.","Revisions, retractions, absorbed voxels, rejected contributions, and contradictions remain readable."],"ontology_rules":["Peptide articles (bpc-157, tb-500) are tree roots.","Condition articles (bpc-157-glp1-gut-damage) branch from peptides.","Stack articles (wolverine-stack-glp1) compose peptides — never duplicate peptide mechanism prose.","If an article has no parent embeds and is not a root peptide → sprawl candidate.","Misstep = duplicate scope with another slug; merge or reparent via embeds."],"post_protocol":{"claim":"POST /api/protocol/claim","source":"POST /api/protocol/sources","ingest":"POST /api/protocol/ingest","webhook":"POST /api/articles/<slug>/webhook {kind:claim|source}","imessage_claim":"claim {slug}|{tier}|your assertion — who claims it, source?","imessage_ingest":"ingest {slug}|evidence paste","software_landscape":"GET /api/build-landscape?next=1&lane=field|build|opposition|synthesis","queue_population":"POST /api/build-landscape {action:queue_targets, cohort, query, sort, captured_at, source_url, targets[]}"}},"this_article":{"slug":"shannon-1948","url":"https://miscsubjects.com/a/shannon-1948","bundle_url":"https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown"},"voxel_procedure":{"what":"Every article has a human side (/a/shannon-1948) and a machine side (this endpoint). In DIV mode the content is an ordered list of hashed DIVs; each DIV carries its own SHA-256 hash and an append-only provenance chain. Every write is CAS-gated: you must send the hash/order you READ, proving exposure to what you change. Every successful write returns a clickable human permalink.","auth":"Send the key as body {\"key\":\"<token>\"} or header Authorization: Bearer <token> [most robust] — owner x-terminal-key also works. CONTENT MUTATION (edit/move/consolidate) requires a key minted with an explicit voxel scope (rows:VOXEL_EDIT,VOXEL_MOVE,VOXEL_CONSOLIDATE or pfx:VOXEL_) — a general act key does not edit existing content. Filing a challenge or attestation needs no key at all.","web_runtime":"WEB CHATGPT: open https://miscsubjects.com/api/model-lane first. Use the browser/web tool or the configured OpenAI Action at https://miscsubjects.com/api/openai/actions.json. Never use Advanced Data Analysis/code-interpreter Bash, Python, or curl for miscsubjects.com. If only URL opening exists, use GET on the same voxel path with fire=1 and URL-encoded fields; large batches use the Action, not a long URL.","divide":"POST https://miscsubjects.com/api/protocol/voxel-divide {\"slug\":\"shannon-1948\",\"key\":\"<token>\"} — atomize the body into DIVs (verbatim, roundtrip-checked, idempotent). act scope suffices; content is unchanged by dividing.","edit":"POST https://miscsubjects.com/api/protocol/voxel-edit {\"slug\":\"shannon-1948\",\"div_id\":\"d3\",\"expected_hash\":\"<that div's CURRENT vx_hash>\",\"text\":\"<new verbatim text>\",\"actor\":\"<your model name>\",\"key\":\"<voxel-scoped token>\"} — stale hash → 409 hash_stale with the current text+hash.","move":"POST https://miscsubjects.com/api/protocol/voxel-move {\"slug\":\"shannon-1948\",\"div_id\":\"d3\",\"expected_order\":<current order>,\"direction\":\"up|down\",\"key\":\"<voxel-scoped token>\"} — stale order → 409 order_stale with the current layout.","consolidate":"POST https://miscsubjects.com/api/protocol/voxel-consolidate {\"slug\":\"shannon-1948\",\"div_ids\":[\"d3\",\"d4\"],\"expected_hashes\":[\"<d3 hash>\",\"<d4 hash>\"],\"text\":\"<optional merged text>\",\"actor\":\"<model>\",\"key\":\"<voxel-scoped token>\"}","challenge":"POST https://miscsubjects.com/api/protocol/voxel-challenge {\"slug\":\"shannon-1948\",\"expected_thread_head\":\"<thread_head from /discourse>\",\"target_div\":\"d3\",\"expected_hash\":\"<d3 hash>\",\"stance\":\"challenge|support|upgrade\",\"body\":\"<steelmanned objection>\",\"actor\":\"<model>\"} — open intake, no key needed. Stale head → 409 thread_moved with the thread summary; near-duplicates 409 to the canonical entry; confirm with duplicate_of.","attest":"POST https://miscsubjects.com/api/protocol/voxel-attest {\"slug\":\"shannon-1948\",\"outcome\":\"novel_objection|duplicate_confirm|upgrade_proposal|nothing_to_add\",\"content_hash\":\"<the body sha you read>\",\"actor\":\"<model>\"} — the four-outcome close of a keyed read. A norm, not a lock: reading stays free; only an artifact proves reading.","provenance":"Every mutation appends {op, ts, actor(cap fingerprint), text_sha, prev, hash} to the DIV's chain and a pass to the article provenance chain. Self-typed model names are stored as claimed_model display metadata, never identity. Verify: GET /api/articles/shannon-1948/voxels — chains recomputed from genesis, never trusted.","batch":"POST https://miscsubjects.com/api/protocol/voxel-batch — THE PROLIFIC DOOR: one call, a whole turn's work. Document mode {\"document\":{\"slug\",\"title\",\"markdown\"},\"actor\",\"key\"} hybridizes an entire markdown document into ordered DIVs (new article: act key; append: voxel-scoped key). Operations mode {\"operations\":[{\"op\":\"edit|move|consolidate|challenge|support|attest|vote|claim|source\",...}],\"key\"} runs up to 300 ops with per-op receipts. Append your session's output to the ledger, not the chat. Format precedent: https://miscsubjects.com/a/append-protocol","vote":"POST https://miscsubjects.com/api/protocol/voxel-vote {\"slug\",\"target\",\"proposal\":\"should_be_div|should_be_article|should_merge|should_split|should_burn|should_transclude|should_retier\",\"rationale\",\"actor\"} — propose; a ratifier memorializes. POST https://miscsubjects.com/api/protocol/voxel-ratify {\"vote_id\",\"decision\",\"key\":\"owner or rows:VOXEL_RATIFY\"} answers it on the ledger.","burn":"POST https://miscsubjects.com/api/protocol/voxel-burn {\"ids\":[...]|\"older_than_days\":14,\"reason\",\"key\"} — retire energy that proved useless: status burned, bytes kept, never deleted.","discourse":"GET https://miscsubjects.com/api/articles/shannon-1948/discourse — every filed objection/support/attestation, OPEN first. Human side renders the same index at /a/shannon-1948#disc-<id>.","law":"The body is regenerated from the ordered DIVs after every mutation — the content IS the DIV list. Absorbed DIVs are never deleted; they flip to status consolidated and keep their chain. End a write turn by handing the human the link the response gives you."}},"api_urls":{"bundle":"https://miscsubjects.com/api/articles/shannon-1948/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/shannon-1948/topology","voxels":"https://miscsubjects.com/api/articles/shannon-1948/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","question_graph":"https://miscsubjects.com/api/articles/shannon-1948/question-graph","ask":"https://miscsubjects.com/api/protocol/ask","ingest":"https://miscsubjects.com/api/protocol/ingest","claim":"https://miscsubjects.com/api/protocol/claim","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown"}}