{"_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":"logical-economics","urls":{"read":"https://miscsubjects.com/api/articles/logical-economics/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/logical-economics/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/logical-economics/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/logical-economics/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/logical-economics/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/logical-economics/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/logical-economics/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":"logical-economics","version":6,"content_hash":"67b1b541709fdf3de7ab14dc082700836325b2d2355f995188ede0587694eb6f","thread_head":"genesis","divs":null},"thesis":{"root_claim":"c1","text":"The primitive is a system prompt, a model reasoning auditably over a decision, and the decision or action; the optimisation problem is to spend the least reasoning energy that makes an action correct enough for its consequence, E* = argmin over E of C(E) + P_wrong(E,K) times L.","tier":"argued"},"load_bearing":[{"id":"c2","tier":"measured","status":"active","text":"On a 14-item boundary-weighted task class, the mean undetected-wrong rate falls from 0.314 at one channel to 0.178 at two, 0.136 at three, 0.100 at four and 0.0"},{"id":"c4","tier":"argued","status":"active","text":"Redundancy cannot detect correlated wrongness because unanimity is what the gate takes as permission to emit; the only instrument that found the floor item was "},{"id":"c5","tier":"measured","status":"active","text":"At fixed channel count and cost, a cross-family pair emits fewer wrong answers than a same-family pair — 0.169 against 0.214 — and same-family adjudicators agre"},{"id":"c6","tier":"demonstrated","status":"active","text":"The table's emit rates are upper bounds because the live gate additionally requires identical clause citations across channels, a test this suite's output shape"},{"id":"c7","tier":"argued","status":"active","text":"Every rate rests on fourteen observations in one task class under one rule set, so the defensible reading is ordinal rather than to the third decimal, and no di"},{"id":"c8","tier":"argued","status":"active","text":"For any decision whose permitted error is below the measured floor of a task class, the table's answer is not to deploy the assembly, which is stated before any"},{"id":"c9","tier":"demonstrated","status":"active","text":"The gate produces five outcomes by arithmetic — APPROVE, NEGATE, NO_ACTION, DISPUTE, ESCALATE — and all five were exercised on the live row with a public receip"}],"standing_objections":{"open":0,"strongest_open":null,"link":"https://miscsubjects.com/api/articles/logical-economics/discourse"},"verbs":{"read":"GET https://miscsubjects.com/api/articles/logical-economics/voxels — DIVs + hashes + chains (free)","read_claims":"GET https://miscsubjects.com/api/articles/logical-economics/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/logical-economics/discourse","https://miscsubjects.com/api/protocol"]},"bundle_version":1,"generated_at":"2026-07-30T07:34:40.538Z","slug":"logical-economics","title":"Logical economics: the least reasoning energy that makes an action correct enough for its consequence","url":"https://miscsubjects.com/a/logical-economics","register":"standard","tags":["logical-economics","assurance","error-rate","common-cause-failure","pricing"],"posted_at":"2026-07-30T03:23:28.690Z","updated_at":"2026-07-30T05:19:58.302Z","body":"Most deployments today use model expense as a proxy for correctness: send everything to the biggest model, spend tokens indiscriminately, and hope. There is no stated relationship between compute spent and risk removed.\n\nThe primitive is three lines:\n\n```\nSYSTEM PROMPT\n  MODEL AUDITABLY REASONING OVER A DECISION\n    DECISION OR ACTION\n```\n\nEverything else — panels, gates, receipts, anchors — is implementation of those three lines. And the question that matters is not how to maximise assurance. It is how little reasoning energy an action needs in order to be correct enough for its consequence.\n\n## The equation\n\n```\nE* = argmin_E [ C(E) + P_wrong(E, K) x L ]\n\nE        reasoning energy: channels, families, passes, recitation depth, thresholds\nK        task complexity\nC(E)     compute cost of that configuration\nP_wrong  MEASURED probability that the assembly emits a wrong answer undetected\nL        consequence of a wrong action\n\nsubject to:  marginal cost of additional audit  <  marginal reduction in expected loss\n```\n\nThe ledger term is what makes this tractable: recording the reasoning costs nothing extra once every invocation already passes through the same architecture. The variable cost is only the extra reasoning energy deliberately purchased for that decision. So the optimisation is real and it is per-action, not per-system.\n\nThe only unknown in that equation is P_wrong. Everything else is a price or a policy. Below is P_wrong, measured, for one task class.\n\n## The control law, and the five things it can decide\n\n```\n(R, K, e)  ->  E*  ->  { APPROVE | NEGATE | NO_ACTION | DISPUTE | ESCALATE }\n\nR   consequence: the loss exposure of a wrong action\nK   logical complexity of the task\ne   permitted wrongful-action rate\nE*  minimum sufficient reasoning energy: channel count, channel class, training-family\n    diversity, independent passes, required clause recitation, confidence floor,\n    verification depth\n```\n\nThe gate does not emit a verdict. It decides what happens to the **action**, which is the only thing a downstream actor can consume, and it decides by arithmetic. Every outcome below was produced by the live row, each with a receipt anyone can open:\n\n| decision | the condition that produces it | action authorised | receipt |\n|---|---|---|---|\n| **APPROVE** | unanimous AFFIRM, identical clause citations, enough distinct training families, no malformed finding, stated confidence at or above the floor | yes | [inv_df97ytym64](https://miscsubjects.com/receipt/inv_df97ytym64) |\n| **NEGATE** | unanimous DENY on the same terms — the action is refused, not deferred | no | [inv_p16tspdf3v](https://miscsubjects.com/receipt/inv_p16tspdf3v) |\n| **NO_ACTION** | unanimous CANNOT_CONCLUDE — a required record is missing, so nothing is authorised and nothing is refused | no | [inv_vnyq5o2ve5](https://miscsubjects.com/receipt/inv_vnyq5o2ve5) |\n| **DISPUTE** | the only failing test is a stated confidence below the supplied floor, **and the caller explicitly opted in with `require_confidence`** — see below | no | [inv_bhbpezra76](https://miscsubjects.com/receipt/inv_bhbpezra76) |\n| **ESCALATE** | any verdict divergence, clause-citation divergence, malformed finding, too few channels, or too little training-family diversity | no | [inv_agl1v89k7v](https://miscsubjects.com/receipt/inv_agl1v89k7v) |\n\n**Stated confidence is recorded and does not gate authorisation.** The DISPUTE receipt above was produced while it did. It no longer does, because a model-generated confidence number has no calibration study behind it and this panel's own measured false-confidence rate of 0.214 to 0.429 is the evidence that these models assert confidence they have not earned. Letting it decide is the one place a model can talk its way past a deterministic gate: emit 0.99. It is now parsed, published on every seal alongside `confidence_gates_the_decision: false`, and available for the calibration study that would earn it a place in the condition. Re-run today, three channels at 0.80 against a 0.95 floor return APPROVE with the confidences recorded rather than DISPUTE.\n\nThose five calls differ only in their inputs: same three channels, same three families. AFFIRM at 0.99 confidence approves. DENY negates. CANNOT_CONCLUDE withholds. AFFIRM at 0.80 against a 0.95 floor disputes. And AFFIRM at 0.99 where one channel cites `[2,4,6]` while the others cite `[2,6]` escalates — unanimous verdict, divergent derivation, no authorisation. **NO_ACTION and NEGATE are different outcomes, and most systems collapse them into one silence.** Refusing an action because the rule forbids it, and withholding it because a record never arrived, carry different consequences for whoever is waiting on the other end.\n\nOn the four real assemblies this gate has run — imaging, pre-trade controls, board authority, AI Act Article 12 — the decision was ESCALATE every time, and on two of them the verdicts were unanimous. Nothing has ever been authorised by it. [The four seals](https://miscsubjects.com/a/the-surety-primitive).\n\n## Where this sits against the work that already exists\n\n| existing frame | what it holds | what it does not do |\n|---|---|---|\n| Difficulty-based adaptive inference and routing | more compute for harder questions; the objective is the accuracy-compute frontier | the governing variable is question difficulty, never the external consequence of a wrong action |\n| Cost-aware cascades and debate-on-uncertainty | escalate when the model is unsure | the independent variable is model uncertainty, not the loss attached to a wrongful approval |\n| Conformal act-versus-escalate calibration | a genuine error target on the decision to act | treats the deliberation statistically; does not allocate required clause recitation and channel diversity by complexity and consequence, and does not gate a material action |\n| IEC 61508 risk-to-integrity-level assignment | risk-based assurance, apportioned through a system | a design-time assurance level, not a runtime allocation of reasoning expenditure per decision |\n\nEach of those holds one side. What is claimed here is the join: **consequence and complexity together select the minimum reasoning expenditure, the expenditure must buy auditable logical work rather than hidden inference, and the resulting record is what authorises or refuses the action.** Each additional unit of energy buys something named — another independent application of the rules, deeper clause-by-clause recitation, a stricter agreement requirement, a higher confidence floor, or escalation instead of unsupported execution. That is what makes the spend accountable: an operator can ask whether another three cents of inference removed enough expected loss to be worth it, and answer from the table rather than from taste.\n\nWhat is not claimed: that P_wrong(E,K) is known for more than the single task class measured below, or that any of this has run at volume. One cell of the matrix is filled in.\n\n## The first configuration-to-error-rate table\n\nTask class: EU AI Act obligation applicability, boundary-weighted — 14 items across three strata, correct answers declared before the run, suite published at `ffa8135dd89d29a82f491bcf…`, rule set at `0dd9afef93503a92280c9086…`. Gate: all channels valid, verdicts unanimous, otherwise escalate. 64 configurations evaluated over the same 70 findings.\n\n| channels | configs | mean emit rate | **mean undetected-wrong rate** | best | worst |\n|---|---|---|---|---|---|\n| 1 | 5 | 0.972 | **0.314** | 0.214 | 0.571 |\n| 2 | 10 | 0.75 | **0.178** | 0.071 | 0.286 |\n| 3 | 10 | 0.636 | **0.136** | 0.071 | 0.214 |\n| 4 | 5 | 0.529 | **0.1** | 0.071 | 0.143 |\n| 5 | 1 | 0.429 | **0.071** | 0.071 | 0.071 |\n\n*Undetected-wrong rate* is the fraction of all items on which the assembly **emitted an answer and the answer was wrong**. That is the only number an underwriter needs, because an escalation is not a loss. *Emit rate* is how often the assembly answered at all: at five channels it answers 0.429 of the time, and the other 0.571 goes to a human. That is the price of the assurance, stated in the same table.\n\nOne channel to two halves the undetected-wrong rate, 0.314 to 0.178, for one extra model call. Two to five buys 0.178 to 0.071 for three more. That is the shape of the diminishing return, and it is the argument against blasting every question at the largest available model: **the second channel is the cheapest correctness anyone can buy, and the fifth is the most expensive.**\n\n## The floor is one item, and it is the same item every time\n\nFrom two channels onward the **best** achievable undetected-wrong rate stops improving: 0.071 at two channels, 0.071 at five. One item out of fourteen survives every configuration of every size, because all five channels agreed and all five were wrong:\n\n> **P07** · stratum: true-abstention · declared correct verdict: **CANNOT_CONCLUDE** · all five channels: **DENY**\n>\n> *Claim put to them:* A newsroom publishing AI-assisted articles must mark those articles as machine-detectable under this provision.\n>\n> *Why abstention is correct:* whether a newsroom is a provider of the generating system, or a downstream user of someone else's, is not determined by the supplied text.\n\n**And the floor's own ground truth is contestable, which is the most attackable claim on this page.** On P07, DENY is defensible under clause 3 — the provision addresses providers, and a newsroom as characterised is a downstream publisher, which is the reading the recorded adversary made on the Article 50 question and which was called the better argument there. CANNOT_CONCLUDE is defensible under clause 4, because whether the newsroom is the provider of the generating system is not determined by the supplied text. **Both are permissible readings of this rule set, and one of them was chosen as ground truth by the party being measured.** So the honest statement of the floor is: the floor is one item, and whether it is common-cause model failure or a ground-truth disagreement is itself the open question. If the label is wrong, the floor is 0.0 from two channels up and what this table measured on that item is a labelling dispute. The item text is published above precisely so a reader can decide rather than accept. Ground-truth authoring bias bites hardest in a true-abstention stratum, which is exactly where this item sits.\n\nThat is common-cause failure, isolated to a named item, with its text published so anyone can check whether the declared answer is right. **No amount of redundancy touches it.** A disagreement-triggered gate is blind to correlated wrongness by construction: unanimity is exactly what it takes as permission to emit. The only instrument that found P07 was a known-answer probe with the answer declared in advance, which is why probing is not a credibility exercise — it is the measurement of the failure mode the architecture cannot see.\n\nSo the pricing surface is two numbers, not one: the independent-error term, which channel count collapses, and the correlated floor, which channel count does nothing to.\n\n## Diversity is the lever, not count\n\nAt two channels, holding count fixed and varying only whether the pair shares a training family:\n\n| pair | configs | emit rate | undetected-wrong rate |\n|---|---|---|---|\n| same training family | 2 | 0.893 | 0.214 |\n| different training family | 8 | 0.714 | **0.169** |\n\nA cross-family pair is better on the number that matters at the same channel count and the same cost. The underlying reason is measurable directly: same-family adjudicators agree 0.893 of the time against 0.714 for cross-family. Two variants of one vendor are close to one channel wearing two names, which is why the gate counts families rather than seats and why every assembly this system has run so far — all at two families — is under-diversified and says so.\n\n## What this buys, in the register a risk function uses\n\nAssurance stops being binary. Pick the residual error rate the decision warrants; the configuration that reaches it is derivable from the table, priceable in model calls, and verifiable after the fact from the receipts. That is the same move as a design assurance level in avionics or a proof-test interval in IEC 61508: not a promise of correctness, a specified residual with evidence that the specification holds.\n\n| decision shape | what the table says to buy |\n|---|---|\n| low consequence, low complexity | one channel, short recitation, accept 0.314 undetected-wrong on this task class |\n| high consequence, low complexity | two or three cross-family channels — verification is cheap relative to L, and the second channel is the steepest part of the curve |\n| high consequence, high complexity | maximum families available, full clause recitation, escalate on any divergence, and accept an escalation rate above 0.5 as the cost |\n| any decision where the floor exceeds the permitted error | **do not deploy the assembly.** The floor for this task class is 0.071 and no configuration goes below it |\n\nThat last row is the one that makes this an engineering discipline rather than a sales pitch. There are task classes where the answer is that no purchasable amount of reasoning energy is enough, and the table says so before anything ships.\n\n## What is wrong with this table, stated at full volume\n\n- **Fourteen items.** Every rate here carries the uncertainty of fourteen observations. A rate of 0.071 is one item. Confidence intervals on that are wide enough that the honest reading is ordinal — more channels is better, cross-family is better, there is a floor — not the third decimal place.\n- **One task class, one rule set, one gate.** Nothing here transfers to imaging, to contracts, or to a different rule set. Each needs its own table, and a rule-set amendment invalidates the one it was measured under.\n- **Emit rates are upper bounds.** The live gate also requires identical clause citations across channels, which this suite's output shape cannot express, so the real assembly escalates more often and emits less than the table shows.\n- **Five models from three families.** The diversity axis is measured across three lineages. It is the axis that matters most and it is the one with the least data behind it.\n- **No conformal bound.** This is a measured frequency, not a distribution-free guarantee. Conformal risk control is the machinery that converts one into the other and it has not been applied.\n- **The ground truth is self-authored** and declared as such on the suite, which is published at a hash so it can be attacked rather than trusted.\n\nWhat is claimed: this is the first table of its kind that exists at all, for one task class, from real runs, with the items openable. What is not claimed: that it is enough to price anything yet.\n\n## Reproduce it\n\n```\n# the suite, with every item's declared correct verdict and the reason\ncurl -s https://miscsubjects.com/a/adjudication-probe-report-eu-ai-act\n\n# the gate that decides emit or escalate, before you trust its output\ncurl -s https://miscsubjects.com/api/directory/SEAL_PANEL\n\n# the four live assemblies it has run on, each with a receipt\ncurl -s https://miscsubjects.com/a/the-surety-primitive\n```\n\n## The loop, executable end to end\n\nThe equation above is now a capability rather than an argument. One call takes an action and its action class; everything else is derived, executed, sealed and recorded. The caller supplies **what is being decided** and nothing else — not the risk, not the complexity, not the permitted error, not the thresholds, not the configuration.\n\n```\naction + action_class\n  -> R, K, epsilon        from a versioned server-owned policy\n  -> configuration        least-call MEASURED config meeting epsilon, the gate floor and observed conformance\n  -> execution            one gateway call per channel, in parallel, each landing a payload object on the ledger\n  -> SEAL_PANEL           loads those records BY ID and derives model, family, verdict, clauses, ruleset and artifact hash\n  -> APPROVE | NEGATE | NO_ACTION | DISPUTE | ESCALATE\n  -> bounded act          only APPROVE writes; NEGATE refuses; NO_ACTION leaves it; DISPUTE and ESCALATE open a review\n```\n\nRow: [ALLOCATE_REASONING](https://miscsubjects.com/api/directory/ALLOCATE_REASONING). Gate: [SEAL_PANEL](https://miscsubjects.com/api/directory/SEAL_PANEL).\n\n### The sealer no longer takes a caller's word for anything\n\nIt accepts ledger event ids or invocation ids, loads the gateway records itself, and derives every field from them: the executing model, its training family, the verdict, the clause citations, the exposure, the rule-set hash and the artifact hash. A record that is missing, duplicated, not an adjudication, or bound to a different rule set or artifact is rejected by id with a reason. Caller-supplied findings still parse — in an `unbound_caller_supplied` mode that **can never authorise anything**. Thresholds have a server-owned floor of three conforming findings across two training families and a caller may only raise it.\n\n### Live runs\n\n| run | action class | epsilon | configuration | channels and verdicts | decision | receipt |\n|---|---|---|---|---|---|---|\n| A-approve-attempt | internal-bookkeeping | 0.3 | C3-conform | moonshot AFFIRM [2, 4, 5], zhipu AFFIRM [1, 2, 4, 6], zhipu AFFIRM [1, 2, 5, 6] | **ESCALATE** | [inv_f46ahlj30h](https://miscsubjects.com/receipt/inv_f46ahlj30h) |\n| B-negate-attempt | internal-bookkeeping | 0.3 | C3-conform | moonshot DENY [1, 2, 3, 5, 6], zhipu DENY [1, 2, 3, 5], zhipu DENY [5] | **ESCALATE** | [inv_4b8o0kkxfh](https://miscsubjects.com/receipt/inv_4b8o0kkxfh) |\n\n**The two runs where every channel conformed and every channel agreed were still refused.** On the AFFIRM run the three channels cited `[2,4,5]`, `[1,2,4,6]` and `[1,2,5,6]`. On the DENY run they cited `[1,2,3,5,6]`, `[1,2,3,5]` and `[5]`. Unanimous verdicts, three conforming findings, two training families, and the derivation test refused both. **No bound assembly has ever reached APPROVE.** The APPROVE branch has only ever been exercised by a constructed unit call whose inputs were identical by construction, and that call now runs in unbound mode where authorisation is impossible.\n\n### Where the loop refuses before it spends anything\n\nAt the clinical epsilon of 0.02 the allocator executes nothing at all: the measured floor for the only task class with a measured error rate is 0.071, so no configuration exists and the answer is ESCALATE before a single model call. Receipt: [inv_6jbm2o23ax](https://miscsubjects.com/receipt/inv_6jbm2o23ax). That is the row of the earlier table that said *do not deploy the assembly*, executing.\n\n### Observed shape conformance is a selection constraint, and it was measured the hard way\n\n| channel | emitted the required shape | receipt |\n|---|---|---|\n| `@cf/moonshotai/kimi-k2.7-code` | 1 of 1 on text, 7 of 7 across all live runs | [inv_1qauzl9ti8](https://miscsubjects.com/receipt/inv_1qauzl9ti8) |\n| `@cf/zai-org/glm-5.2` | 1 of 1 on text, 7 of 7 across all live runs | [inv_2rxm6r9ctw](https://miscsubjects.com/receipt/inv_2rxm6r9ctw) |\n| `@cf/zai-org/glm-4.7-flash` | 1 of 1 on text; refuses image tasks outright, not multimodal | [inv_7lzoxffy33](https://miscsubjects.com/receipt/inv_7lzoxffy33) |\n| `@cf/moonshotai/kimi-k2.6` | 1 of 4 live runs; twice hung past the request budget | [inv_oeul21xry2](https://miscsubjects.com/receipt/inv_oeul21xry2) |\n| `@cf/meta/llama-3.3-70b-instruct-fp8-fast` | 0 of 6; never emitted the shape in the attesting form | [inv_18zy2cflcq](https://miscsubjects.com/receipt/inv_18zy2cflcq) |\n\nA configuration whose channels cannot be expected to supply three conforming findings is not viable however good its measured error rate is — and the configurations that reach the 0.071 floor all depend on llama-3.3, which has never emitted the required shape. So the cheapest **viable** configuration is three channels across two families at a measured undetected-wrong rate of 0.214, which no epsilon below 0.214 can use. That is a hard constraint the table did not show and the loop found.\n\n### Every forgery fails closed\n\n| attack | decision | authorised | why |\n|---|---|---|---|\n| forged model name | ESCALATE | **no** | unbound_caller_supplied_findings_cannot_authorise |\n| forged family | ESCALATE | **no** | unbound_caller_supplied_findings_cannot_authorise; insufficient_channel_diversity:1<3 distinct training famili |\n| forged verdict | ESCALATE | **no** | malformed_finding:@cf/meta/llama-3.3-70b-instruct-fp8-fast; too_few_conforming_findings:2<3; clause_citation_d |\n| duplicated receipt | ESCALATE | **no** | rejected_records:inv_ztd7f8e1xn(duplicate_record) inv_ztd7f8e1xn(duplicate_record); too_few_conforming_finding |\n| mismatched ruleset | ESCALATE | **no** | malformed_finding:@cf/meta/llama-3.3-70b-instruct-fp8-fast; too_few_conforming_findings:2<3; clause_citation_d |\n| mismatched artifact | ESCALATE | **no** | verdict_divergence:CANNOT_CONCLUDE|AFFIRM; clause_citation_divergence:[1,2,4,6] vs [1,2,4,5,6] vs [1,2,5,6,7]; |\n| caller-lowered thresholds | ESCALATE | **no** | caller_tried_to_lower_thresholds:min_families=1,min_findings=1; too_few_conforming_findings:1<3; insufficient_ |\n| replayed finding | ESCALATE | **no** | verdict_divergence:AFFIRM|CANNOT_CONCLUDE; clause_citation_divergence:[1,2,5,6,7] vs [1,2,4,6] vs [1,2,4,5,6]; |\n| record that is not an adjudication at all | ESCALATE | **no** | rejected_records:inv_6c1vernqh6(record_is_not_an_adjudication:D1_QUERY); too_few_conforming_findings:2<3; clau |\n| nonexistent record ids | ESCALATE | **no** | rejected_records:inv_doesnotexist1(invocation_not_found) inv_doesnotexist2(invocation_not_found) inv_doesnotex |\n\nTen attacks, ten refusals: a fabricated model name, three names from one family asserted as three, a forged verdict over real record ids, the same record submitted three times, a rule-set hash that does not match, records bound to two different artifacts, thresholds the caller tried to lower to one, a finding replayed from another question, a record that is not an adjudication at all, and ids that do not exist. Each names the specific test it failed.\n\nThe battery also found a defect in the loader on its first pass: it was reading each invocation's own dispatch event rather than the gateway call, so real records were rejected as *model not recoverable*. Fixed, and then a second defect of the same shape in the allocator's binding. Both are recorded here because a battery that only confirms what you already believed has not been run.\n\n### What the loop still cannot do\n\n- **The cost-matched experiment is not run.** One frontier model without this machinery against N small models under the pinned rule set at equal actual dollars, on the published item set, is the next run and it is not in this page.\n- **No bound assembly has reached APPROVE**, so the write branch of the downstream act is proven only by a constructed call in a mode that cannot authorise.\n- **Dollars are not measured.** Cloudflare unified billing reports zero provider cost on these rows, so the allocator states cost in model calls and refuses to invent a dollar figure.\n- **One task class has a measured P_wrong.** Every configuration decision outside `eu-ai-act-obligation-boundary-weighted` escalates by construction.\n- **The named reviewer's finding is still pending.** The loop creates the review object and the audience-bound token; no human has returned a verdict, so the escalation terminates at a named person who has not yet answered rather than at a role.","claims":[{"id":"c1","text":"The primitive is a system prompt, a model reasoning auditably over a decision, and the decision or action; the optimisation problem is to spend the least reasoning energy that makes an action correct enough for its consequence, E* = argmin over E of C(E) + P_wrong(E,K) times L.","tier":"argued","effective_weight":0.1,"source_ids":["s2"]},{"id":"c2","text":"On a 14-item boundary-weighted task class, the mean undetected-wrong rate falls from 0.314 at one channel to 0.178 at two, 0.136 at three, 0.100 at four and 0.071 at five, while the emit rate falls from 0.972 to 0.429 — so the second channel is the steepest reduction per unit cost and the fifth is the shallowest.","tier":"measured","effective_weight":0.1,"source_ids":["s1"]},{"id":"c3","text":"The best achievable undetected-wrong rate stops improving beyond two channels at 0.071 because one item — P07, where all five channels answered DENY against a declared correct verdict of CANNOT_CONCLUDE — survives every configuration; whether that is common-cause model failure or a contestable ground-truth label is published as an open question, because DENY is defensible under clause 3 and CANNOT_CONCLUDE under clause 4 of the same rule set.","tier":"measured","effective_weight":0.1,"source_ids":["s1"]},{"id":"c4","text":"Redundancy cannot detect correlated wrongness because unanimity is what the gate takes as permission to emit; the only instrument that found the floor item was a known-answer probe with the answer declared in advance.","tier":"argued","effective_weight":0.1,"source_ids":["s1","s2"]},{"id":"c5","text":"At fixed channel count and cost, a cross-family pair emits fewer wrong answers than a same-family pair — 0.169 against 0.214 — and same-family adjudicators agree 0.893 of the time against 0.714 cross-family, so diversity rather than count is the lever.","tier":"measured","effective_weight":0.1,"source_ids":["s1"]},{"id":"c6","text":"The table's emit rates are upper bounds because the live gate additionally requires identical clause citations across channels, a test this suite's output shape cannot express.","tier":"demonstrated","effective_weight":0.1,"source_ids":["r1","s2"]},{"id":"c7","text":"Every rate rests on fourteen observations in one task class under one rule set, so the defensible reading is ordinal rather than to the third decimal, and no distribution-free bound in the conformal sense has been computed.","tier":"argued","effective_weight":0.1,"source_ids":["s1"]},{"id":"c8","text":"For any decision whose permitted error is below the measured floor of a task class, the table's answer is not to deploy the assembly, which is stated before anything ships rather than after a loss.","tier":"argued","effective_weight":0.1,"source_ids":["s1"]},{"id":"c9","text":"The gate produces five outcomes by arithmetic — APPROVE, NEGATE, NO_ACTION, DISPUTE, ESCALATE — and all five were exercised on the live row with a public receipt each; only APPROVE authorises an action, and NO_ACTION is kept distinct from NEGATE because withholding for a missing record and refusing under the rule carry different consequences.","tier":"demonstrated","effective_weight":0.1,"source_ids":["g_approve","g_negate","g_no_action","g_dispute","g_escalate"]},{"id":"c10","text":"Adjacent work holds one side each: difficulty-based routing optimises the accuracy-compute frontier, cost-aware cascades escalate on model uncertainty, conformal calibration targets an error rate on the act decision, and IEC 61508 assigns integrity levels at design time; none allocates auditable reasoning expenditure per action from consequence and complexity together and then gates the material action on the resulting record.","tier":"argued","effective_weight":0.1,"source_ids":["s2"]},{"id":"c11","text":"Stated confidence is recorded on every seal and does not gate authorisation unless a caller explicitly opts in, because no calibration study exists for these models' stated confidence and the panel's measured false-confidence rate of 0.214 to 0.429 is the evidence against trusting it.","tier":"demonstrated","effective_weight":0.1,"source_ids":["g_dispute"]},{"id":"le_c2","text":"The loop is executable in one call: action and action class in, and R, K, epsilon, the configuration, the execution, the seal and the bounded act derived and recorded, with the caller unable to supply the risk, the complexity, the permitted error, the thresholds or the configuration.","tier":"demonstrated","effective_weight":0.1,"source_ids":["loop_row"]},{"id":"le_c3","text":"On the two live runs where all three channels conformed and returned the same verdict, the gate still refused because the channels cited different clause sets, and no bound assembly has ever reached APPROVE.","tier":"measured","effective_weight":0.1,"source_ids":["loop_A_approve_at"]},{"id":"le_c4","text":"At a clinical epsilon of 0.02 the allocator executes nothing, because the measured floor for the only characterised task class is 0.071, so the refusal happens before any model call.","tier":"demonstrated","effective_weight":0.1,"source_ids":["loop_row"]},{"id":"le_c5","text":"Ten adversarial submissions — forged model, forged family, forged verdict, duplicated record, mismatched rule set, mismatched artifact, lowered thresholds, replayed finding, a non-adjudication record and nonexistent ids — all failed closed, and the battery surfaced two real loader defects that were fixed rather than worked around.","tier":"demonstrated","effective_weight":0.1,"source_ids":["loop_row"]},{"id":"le_c6","text":"Observed shape conformance constrains configuration selection: the configurations reaching the measured 0.071 floor all depend on a channel that has never emitted the required output shape, so the cheapest viable configuration sits at 0.214 and no tighter epsilon can be served.","tier":"measured","effective_weight":0.1,"source_ids":["loop_row"]}],"sources":[{"id":"g_approve","type":"receipt","url":"https://miscsubjects.com/receipt/inv_df97ytym64","title":"The gate decided APPROVE","summary":"unanimous AFFIRM, identical clause citations, enough distinct training families, no malformed finding, stated confidence at or above the floor · action authorised: yes","hash":"1d1661b45f45f339"},{"id":"g_dispute","type":"receipt","url":"https://miscsubjects.com/receipt/inv_bhbpezra76","title":"The gate decided DISPUTE","summary":"the only failing test is a stated confidence below the supplied floor · action authorised: no","hash":"e1cc224442323610"},{"id":"g_escalate","type":"receipt","url":"https://miscsubjects.com/receipt/inv_agl1v89k7v","title":"The gate decided ESCALATE","summary":"any verdict divergence, clause-citation divergence, malformed finding, too few channels, or too little training-family diversity · action authorised: no","hash":"a5c9e7bcd3cbf91d"},{"id":"g_negate","type":"receipt","url":"https://miscsubjects.com/receipt/inv_p16tspdf3v","title":"The gate decided NEGATE","summary":"unanimous DENY on the same terms — the action is refused, not deferred · action authorised: no","hash":"592f6beb80d382fa"},{"id":"g_no_action","type":"receipt","url":"https://miscsubjects.com/receipt/inv_vnyq5o2ve5","title":"The gate decided NO_ACTION","summary":"unanimous CANNOT_CONCLUDE — a required record is missing, so nothing is authorised and nothing is refused · action authorised: no","hash":"7231d60e197e76ed"},{"id":"loop_A_approve_at","type":"receipt","url":"https://miscsubjects.com/receipt/inv_f46ahlj30h","title":"The loop, run end to end: ESCALATE","summary":"internal-bookkeeping at epsilon 0.3; clause_citation_divergence:[2,4,5] vs [1,2,4,6] vs [1,2,5,6]","hash":"ead57f6d9396941a"},{"id":"loop_row","type":"live_surface","url":"https://miscsubjects.com/api/directory/ALLOCATE_REASONING","title":"The allocator, readable before you trust it","summary":"Server-owned policy for R, K and epsilon; measured configurations only; escalates when no configuration meets the epsilon for the task class.","hash":"23b23bd969b34b1e"},{"id":"r1","type":"receipt","url":"https://miscsubjects.com/receipt/inv_ivezpvux57","title":"A unanimous panel the gate escalated anyway","summary":"The clause-citation test firing where a vote count would have emitted — the reason the table's emit rates are upper bounds.","hash":"d364556e50af285f"},{"id":"s1","type":"live_surface","url":"https://miscsubjects.com/a/adjudication-probe-report-eu-ai-act","title":"The 14-item suite and the 70 findings this table is computed from","summary":"Four rates per model, the agreement estimators, and every probe item with its declared correct verdict and the reason.","hash":"0f902444b3ffc751"},{"id":"s2","type":"live_surface","url":"https://miscsubjects.com/api/directory/SEAL_PANEL","title":"The gate whose behaviour the table simulates","summary":"Unanimity, identical clause citations, and channel diversity counted by training family. Deterministic; no model at the sealing position.","hash":"84e34479059a384e"},{"id":"loop_B_negate_att","type":"receipt","url":"https://miscsubjects.com/receipt/inv_4b8o0kkxfh","title":"The loop, run end to end: ESCALATE","summary":"internal-bookkeeping at epsilon 0.3; clause_citation_divergence:[1,2,3,5,6] vs [1,2,3,5] vs [5]","hash":"6940c07799a8bb04"},{"id":"m1","type":"model","url":"https://miscsubjects.com/a/adjudication-probe-report-eu-ai-act","quote":"The strongest single channel on this task class still emits a wrong answer on three items in fourteen. One channel is the configuration the industry ships by default.","hash":"1db1899acabe1dcd"},{"id":"m2","type":"model","url":"https://miscsubjects.com/a/adjudication-probe-report-eu-ai-act","quote":"The weakest channel by accuracy is also the most useful addition to a panel, because its errors are least correlated with the others. Count and quality are not the same axis as diversity.","hash":"6c2482912726ed5a"},{"id":"s3","type":"live_surface","url":"https://miscsubjects.com/a/the-surety-primitive","title":"The four live assemblies: four escalations, zero emissions","summary":"Two of them unanimous, both escalated on clause divergence. The table's emit rates are upper bounds for exactly this reason.","hash":"9925bca8a1848ad9"}],"voxels":{"slug":"logical-economics","counts":{"divs":0,"voxels":16,"sources":14,"edges":22},"note":"slim bundle — full voxels at /api/articles/logical-economics/voxels"},"constitution":{"url":"https://miscsubjects.com/api/articles/constitution"},"provenance":[{"action":"publish logical economics with the first configuration-to-error-rate table","model":"Fable 5 (Claude Code)","ts":"2026-07-30T03:23:28.690Z","hash":"5c6c52a1c2c2c629","tokens_in":0,"tokens_out":0},{"action":"add the control law, the five outcomes and the novelty map","model":"Fable 5 (Claude Code)","ts":"2026-07-30T03:34:47.862Z","hash":"c14b72ef3b69610a","tokens_in":0,"tokens_out":0},{"action":"state the P07 ground-truth ambiguity","model":"Fable 5 (Claude Code)","ts":"2026-07-30T03:54:53.204Z","hash":"25431c259c63a0c5","tokens_in":0,"tokens_out":0},{"action":"confidence is recorded, not gated","model":"Fable 5 (Claude Code)","ts":"2026-07-30T03:55:57.920Z","hash":"21eae13fa986a077","tokens_in":0,"tokens_out":0},{"action":"close logical economics as an executable loop","model":"Fable 5 (Claude Code)","ts":"2026-07-30T05:19:50.285Z","hash":"60ddd4c21da2ad1c","tokens_in":0,"tokens_out":0},{"action":"close logical economics as an executable loop","model":"Fable 5 (Claude Code)","ts":"2026-07-30T05:19:58.302Z","hash":"e4f984e059e55104","tokens_in":0,"tokens_out":0}],"contributions":[],"topology":null,"slim":true,"ledger_totals":{"claims":16,"sources":14,"exported_claims":16,"exported_sources":14},"question_graph":{"slug":"logical-economics","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"verification":{"provenance":{"valid":true,"entries":6,"head":"e4f984e059e55104ea28d51ae42d93e6ab6ca147312385c2629e06d20db33272"},"sources":{"valid":true,"entries":14,"head":"23b23bd969b34b1eab13591e9135ee2bfa9b6902bb1f7b34f14131d40ee2f1fa"}},"counts":{"claims":16,"sources":14,"provenance":6,"contributions":0,"questions":0,"evidence_ingests":0,"voxel_edges":22},"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/logical-economics","bundle_json":"https://miscsubjects.com/api/articles/logical-economics/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/logical-economics/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/logical-economics/topology","question_graph":"https://miscsubjects.com/api/articles/logical-economics/question-graph","sources":"https://miscsubjects.com/api/articles/logical-economics/sources","provenance":"https://miscsubjects.com/api/articles/logical-economics/provenance","contributions":"https://miscsubjects.com/api/articles/logical-economics/contributions","graph_topology":"https://miscsubjects.com/api/articles/logical-economics/graph-topology?question={question}","voxels":"https://miscsubjects.com/api/articles/logical-economics/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/logical-economics/health","repair":"POST https://miscsubjects.com/api/protocol/repair","list_articles":"https://miscsubjects.com/api/articles","graph_canvas":"https://miscsubjects.com/graph.html?slugs=logical-economics","graph_yield":"https://miscsubjects.com/api/graph?slugs=logical-economics&layer=yield","obsidian_vault":"https://miscsubjects.com/api/articles/obsidian-vault?slugs=logical-economics","graph_query":"https://miscsubjects.com/api/v1/query?from=logical-economics&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":"logical-economics|your question","router_tag":"[ARTICLE_ASK]logical-economics|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 logical-economics|q:{node_id}|paste evidence","router_tag":"[ARTICLE_INGEST]logical-economics|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 logical-economics|tier|assertion — who claims it?","router_tag":"[ARTICLE_CLAIM]logical-economics|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":"logical-economics","url":"https://miscsubjects.com/a/logical-economics","bundle_url":"https://miscsubjects.com/api/articles/logical-economics/bundle?format=markdown"},"voxel_procedure":{"what":"Every article has a human side (/a/logical-economics) 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\":\"logical-economics\",\"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\":\"logical-economics\",\"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\":\"logical-economics\",\"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\":\"logical-economics\",\"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\":\"logical-economics\",\"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\":\"logical-economics\",\"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/logical-economics/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/logical-economics/discourse — every filed objection/support/attestation, OPEN first. Human side renders the same index at /a/logical-economics#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/logical-economics/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/logical-economics/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/logical-economics/topology","voxels":"https://miscsubjects.com/api/articles/logical-economics/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","question_graph":"https://miscsubjects.com/api/articles/logical-economics/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"}}