@lapxo/obligations 0.4.4 → 0.4.6

package/TARGET.bound

@@ -1,4 +1,7 @@
 bound-lock/1 about="# Contributing\n\nClone, `npm ci && npm run build`. Bring a counterexample with its inputs and printed output.\n\nOpen research demands are named in `TARGET.bound`; a result needs its model, conditions and falsifier. No count is inferred from missing observations.\n\nLines land through the instrument. Submit proposed lines for review rather than editing an admitted lock or its rendered pages.\n" at=witness:041/retain-declared-documentation by=target form=alphabet measure=text role=writes scope=prose/en/guide shape=CONTRIBUTING.md value=lock
+bound-lock/1 about="# Experiment 1a: protocol, no measurement\n\nThe versioned model-collapse-1a protocol is prepared independently of dataset selection. No owner-selected dataset, license, bound training/aggregation model or finite analysis design has been supplied; no data were retrieved and no empirical experiment was run. The result is unmeasured, not zero, pass, fail or a law.\n\nFreeze the protocol digest before retrieval. A separate run manifest must bind the owner-selected snapshot/license, model and training provenance, lineage mechanism, volume grid, truth/quality endpoint, sampling units/dependence blocks, exploratory/holdout split, seed, stopping rule, finite hypothesis, effect threshold and valid uncertainty. Freeze its digest before retrieval, and freeze the final exploratory analysis before opening holdout. Digests identify bytes; they do not certify a signed admission or delivery.\n\nRecord prior exposure, including this session; unknown training exposure remains unknown. Keep related units and duplicates from leaking across splits. Reuse O5 uncertainty only under its actual sampling/calibration hypotheses. Preserve failed runs and report every prespecified outcome whether the falsifier succeeds or fails. No posthoc endpoint or optional stopping is authorized.\n\nA finite within-lineage curve that continues falling is a candidate empirical challenge only to a specified finite prediction or justified bound. It does not by itself refute a positive asymptotic floor. The training process, quality and lineage assumptions must be supplied; no model is invented from the experiment title. Causal interpretations, including the unspecified historical (ii)/(iii), remain unmeasured without an observable intervention, justified assignment and a defined estimand. Descriptive observations cannot close causal identification.\n\nConditional lineage identification, causal subgroup recovery and oracle-free reference remain open. This protocol changes no algebra, M/3-M/4, wire, signed base or protocol instrument.\n" at=witness:obligations046/O9 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/model-collapse-1a shape=docs/contracts/model-collapse-1a.md value=lock
+bound-lock/1 about="# Extension, named lineage and effective participation\n\nExtension is the supplied set of coordinate/interval pairs in A5, compared at fixed coordinate interpretation, resolution and context. Equal extensions identify one extensional class under that convention. They do not identify historical actors, establish a shared cause or prove probabilistic independence. A named lineage is a declared model grouping with a supplied generative/ancestry mechanism, membership and weights. Its name is not observational evidence.\n\nJoint independence is factorization of the declared joint probability law for all joint events. A conditional statement names its conditioning variable and requires factorization in every positive-mass stratum. Different names, disjoint extensions and pairwise zero covariance do not suffice. The fair-bit XOR triple has independent pairs and fails joint factorization.\n\nFor finite nonnegative masses with positive total, set w_i=a_i/sum(a) and K_eff=1/sum(w_i^2). It is dimensionless weight participation, between1 and the positive-support size; equal positive weights give that size. It is not a count of causally independent extensions. For a symmetric PSD covariance C with positive trace, normalized nonnegative eigenvalues instead give spectral participation trace(C)^2/tr(C^2). These are different inputs and need a model before they can be equated. Existing participationRatio checks symmetry and nonnegative diagonal but does not certify PSD. A true covariance constructed from the declared error rows supplies PSD; passing arbitrary matrices directly does not. Zero variation is unmeasured. In O4, K_eff=K and identification from population moments apply only in the declared uniform known-p family; nonuniform moment collisions remain.\n\nA7 concerns fixed coordinates, resolution, context and ceilings under added live narrowing constraints. Withdrawal and witnessed local widening may reopen freedom on the same coordinate. A sum of coordinate log-cardinal freedoms is not automatically joint Shannon entropy. T90 equates log-cardinality with entropy for nonempty finite uniformly distributed admissible states at fixed resolution; it does not establish the identity for arbitrary priors or a physical phase interpretation.\n\nA9 is a representation convention, not a convergence theorem. T99 concerns finite records and worlds, an acyclic reachable dependency graph and total supplied lattice operations: evaluation takes finitely many operations. Reachable ancestral cycles reject, while unreachable cycles do not affect a query. An arbitrary monotone iteration still needs its carrier, operator, seed and progress/height hypotheses; a monotone reflection on incomparable singleton intervals has a two-cycle. Different hypotheses and missing proofs are not a fork.\n\nThe historical C1 independence-is-distance wording supplies no probabilistic factorization. Definitions settle meaning only. Conditional lineage identification, causal subgroup recovery and oracle-free reference remain open. This companion text changes no signed base, algebra, M/3-M/4 or wire." at=witness:obligations046/definitions by=target form=interval measure=count needs=vectors/laws/definitions.native.json|contracts/extension-lineage-participation.json|docs/contracts/extension-lineage-participation.md|proofs/definitions-046/declaration.json|vectors/laws/policy.json|src/laws/laws.bound|vectors/laws/a7-t90.json|vectors/laws/a9-t99.json|samples/laws/definitions/yes/sample.json|samples/laws/definitions/no/sample.json role=demands scope=publication/evidence/definitions value=0..0
+bound-lock/1 about="# Extension, named lineage and effective participation\n\nExtension is the supplied set of coordinate/interval pairs in A5, compared at fixed coordinate interpretation, resolution and context. Equal extensions identify one extensional class under that convention. They do not identify historical actors, establish a shared cause or prove probabilistic independence. A named lineage is a declared model grouping with a supplied generative/ancestry mechanism, membership and weights. Its name is not observational evidence.\n\nJoint independence is factorization of the declared joint probability law for all joint events. A conditional statement names its conditioning variable and requires factorization in every positive-mass stratum. Different names, disjoint extensions and pairwise zero covariance do not suffice. The fair-bit XOR triple has independent pairs and fails joint factorization.\n\nFor finite nonnegative masses with positive total, set w_i=a_i/sum(a) and K_eff=1/sum(w_i^2). It is dimensionless weight participation, between1 and the positive-support size; equal positive weights give that size. It is not a count of causally independent extensions. For a symmetric PSD covariance C with positive trace, normalized nonnegative eigenvalues instead give spectral participation trace(C)^2/tr(C^2). These are different inputs and need a model before they can be equated. Existing participationRatio checks symmetry and nonnegative diagonal but does not certify PSD. A true covariance constructed from the declared error rows supplies PSD; passing arbitrary matrices directly does not. Zero variation is unmeasured. In O4, K_eff=K and identification from population moments apply only in the declared uniform known-p family; nonuniform moment collisions remain.\n\nA7 concerns fixed coordinates, resolution, context and ceilings under added live narrowing constraints. Withdrawal and witnessed local widening may reopen freedom on the same coordinate. A sum of coordinate log-cardinal freedoms is not automatically joint Shannon entropy. T90 equates log-cardinality with entropy for nonempty finite uniformly distributed admissible states at fixed resolution; it does not establish the identity for arbitrary priors or a physical phase interpretation.\n\nA9 is a representation convention, not a convergence theorem. T99 concerns finite records and worlds, an acyclic reachable dependency graph and total supplied lattice operations: evaluation takes finitely many operations. Reachable ancestral cycles reject, while unreachable cycles do not affect a query. An arbitrary monotone iteration still needs its carrier, operator, seed and progress/height hypotheses; a monotone reflection on incomparable singleton intervals has a two-cycle. Different hypotheses and missing proofs are not a fork.\n\nThe historical C1 independence-is-distance wording supplies no probabilistic factorization. Definitions settle meaning only. Conditional lineage identification, causal subgroup recovery and oracle-free reference remain open. This companion text changes no signed base, algebra, M/3-M/4 or wire.\n" at=witness:obligations046/O8 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/extension-lineage-participation shape=docs/contracts/extension-lineage-participation.md value=lock
 bound-lock/1 about="# In phase\n\nA claim carries a size and a direction, how much it narrows and the turn it landed on, and a withdrawal is the same size the other way: two hundred claims in phase make the square of their number and the same two hundred strewn make its order, while a write and its withdrawal at one epoch leave nothing and at different epochs do not cancel.\n\n## Run it\n\n```ts\nimport { coherence, interfere } from '@lapxo/obligations/views/field';\n\nconst span = { lo: 0, hi: 0 };\nlet held = 11;\nconst next = (): number => { held = (held * 1103515245 + 12345) % 2147483648; return held / 2147483648; };\nconst together = Array.from({ length: 32 }, (_, i) => ({ origin: `o${i}`, epoch: 8, span }));\nconst strewn = Array.from({ length: 32 }, (_, i) => ({ origin: `o${i}`, epoch: Math.floor(next() * 8), span }));\n\nconsole.log('in phase  ', interfere(together, 8), 'coherence', coherence(together, 8).toFixed(2));\nconsole.log('strewn    ', interfere(strewn, 8).toFixed(0), 'coherence', coherence(strewn, 8).toFixed(2));\nconsole.log('their number is 32, and its square is', 32 ** 2);\nconsole.log('why       claims that land at one turn of the period add as the square of their number, and the same claims strewn across it add as its order');\n```\n\n```\nin phase   1024 coherence 1.00\nstrewn     50 coherence 0.22\ntheir number is 32, and its square is 1024\nwhy       claims that land at one turn of the period add as the square of their number, and the same claims strewn across it add as its order\n```\n\nIts origins meet.\n\n## What it rests on\n\n```mermaid\nflowchart LR\n  c0[\"coherence\"]\n  c1[\"interfere\"]\n  l0([\"amplitude has sign and phase\"])\n  c0 --> l0\n  c1 --> l0\n  classDef shown fill:#2da44e,color:#ffffff,stroke:#2da44e\n  class l0 shown\n```\n\n## Source\n\n[Its source](../../examples/release/in-phase.ts) is one of the examples of obligations, and it runs as it is written, against the built package, with nothing compiled for it.\n" at=witness:041/retain-declared-documentation by=target form=alphabet measure=text role=writes scope=prose/en/learn-in-phase shape=docs/learn/in-phase.md value=lock
 bound-lock/1 about="# Measures beside the states\n\nThe pure API @lapxo/obligations/measures does not change FREE, REQUIRED, FORBIDDEN or CONFLICT. Observed association never establishes independence.\n\n## Descriptive contract\nerrorMatrix takes explicit binary event/origin/error rows and minCells >= 2. Identical redelivery is idempotent; conflicting observations refuse; incomplete shared events are unmeasured. covariance is population covariance of the handed rows, divided by their event count. participationRatio describes effective rank; zero variation is unmeasured.\n\nspectrum requires absolute, relative and maxRotations. Asymmetric or materially non-PSD matrices refuse. commonMass is the largest observed variance fraction, not a probability of false agreement. loadings require an isolated top eigenvalue; repeated eigenspaces have no unique top loading. commonMassOf requires an explicit cutoff and whole eigenspaces. The unanimity no-sample prints observed commonMass >= 0.5 beside FREE, without claiming strength.\n\ndescentCount counts distinct proper descendants in a declared restsOn graph. Identical edges add nothing. Missing declarations remain unmeasured; duplicate node declarations and cycles refuse. Declared descent is not observed activity or independence.\n\n## Controlled procedures\nunanimityFloor and unanimityThreshold implement the declared T1 special case. With P_k=(1-c)p^k(n-1)^(1-k), F_k=(c+P_k)/(c+P_k+(1-c)(1-p)^k). For nondegenerate parameters, F_(k+1) >= F_k iff p*c >= (1-p-p/(n-1))*P_k. The c=.01,p=.1,n=2 no-sample decreases before k=3; its threshold is 3. dissentExperiment and interestExperiment report conditional counts under explicitly handed generators: xorshift32, nonzero seed and trial count. Their denominators are events and falseEvents, and zero events are unmeasured. Interest is an explicitly handed bias toward one wrong value, not inferred from a missing observation. E3: a school answers truth with probability q, otherwise its own wrong value. These are controlled procedures, never laws or state changes.\n\n## Native publication evidence\nobservations, spectrum, unanimity and descent each have yes/no cases in samples/measures/<group>.json and installed-instrument captures in vectors/measures/<group>.cli.json. M/3 has samples/measures/m3.json and vectors/measures/m3.cli.json. Each vector ran on two independent places, repeated the positive reading byte-for-byte and refused its negative by name. State-preservation tests compare all four actual algebraic states before and after measurements.\n\n## Model boundary\nM/3 below is the only reference model. The older descriptive D/commonMass and independence claims are superseded. modelRequired returns unmeasured for an absent model; no measurement silently supplies a causal model. Factor attribution, dissent and probe results are conditional on M/3's handed parameters, not empirical independence certificates.\n\n# obligations 0.4.0 — model M/3 (authoritative contract)\n\nM/3 is the reference conditional model shipped beside the descriptive measures. Every M/3\nresult carries `model=M/3`, its handed parameters and its conditions. The descriptive\nmeasures are independent of M/3. Nothing changes a state. This document supersedes all\nearlier M/1, M/2 and amendment texts.\n\n## 1. Definition\nWitnesses W (unique identifiers); cells with truth t and integer cardinality n ≥ 2;\nfactors F, each with unique identifier, sharing set a_f ⊆ W, firing probability c_f and a\nunique declared index (total order); private error probability p_w for every witness\ninvolved. Per cell, independently:\n1. each factor fires independently with probability c_f;\n2. a witness is governed by the fired factor containing it with the lowest index, if\n   any; otherwise its private error fires with probability p_w;\n3. labels: each fired governing factor is a factor label; each privately erring witness\n   is a private label (namespaces are distinct: a factor label and a private label can\n   never merge even with identical identifier strings); every label draws one wrong\n   value uniformly from the n−1 wrong values; draws of distinct labels are mutually\n   independent and independent of all firing and private indicators; everyone else says t.\nSingleton factors (|a_f| = 1) are retained in declared order; the generator is never\nnormalized.\n\n## 2. Validation (refuse by name)\nS ⊆ W and S nonempty; every a_f ⊆ W; unique witness and factor identifiers; unique factor\nindices; c_f, p_w ∈ [0,1]; n integer ≥ 2; an explicitly handed p_w for every witness in\nS and in every sharing set touching S; a sharing set with duplicate members is refused.\n\n## 3. Exact evaluator\nEnumerate fired subsets of the factors touching S (2^|touching|) and private patterns of\nungoverned members of S (2^|free|). In each configuration, erring witnesses are grouped by\nlabel; L = number of labels; weights = witnesses per label. Collisions of wrong values\nfollow set partitions π of the labels with\nP(π) = (n−1)^{↓|π|} / (n−1)^L (falling factorial), and P(π) = 0 when |π| > n−1.\nEach partition yields block totals; unanimity ⇔ no correct witness and one block;\nmajority = strictly more than |S|/2 witnesses on one value; ties and pluralities ≤ half\nare \"no majority\".\nExactness: all c_f, p_w are handed as rationals (or decimal strings converted exactly);\naccumulation is in rational arithmetic; displayed decimals are rounded half-even to a\ndeclared number of digits. Budget: before any work, compute\nwork = Σ_configurations Bell(L) ≤ `evaluator/budget` (declared); if exceeded, return\n`unmeasured` with cause `evaluator/budget` and no partial accumulation.\nOutputs per (S, x): P_true, P_false (false unanimity), P_fired (false unanimity with some\ntouching factor fired), P_dissent = 1 − P_true − P_false (identity, asserted),\nmaj_true∧dissent, maj_false∧dissent, maj_none∧dissent (exclusive, sum = P_dissent).\nClosed form admitted only for P_true = Π_{f touches S}(1−c_f) · Π_{w∈S}(1−p_w).\n\n## 4. Quantities and denominators\n```\nΦ   = P_false / (P_true + P_false)        false-unanimity share\nD   = P_fired / (P_true + P_false)        factor-attribution share\nreliability = 1 − Φ, labelled \"P(correct | unanimous) under M/3 with handed parameters\"\nP(false maj | dissent)            = maj_false∧dissent / P_dissent\nP(false maj | any maj ∧ dissent)  = maj_false∧dissent / (maj_true∧dissent + maj_false∧dissent)\n```\nA ratio with zero denominator is `unmeasured` with cause; a zero numerator over a positive\ndenominator is a measured 0. Φ − D is private coincidence; 1 − D is never reliability.\n\n## 5. Dissent\nTheorem: if a factor covering S fires and no fired factor of lower index touches S\npartially, S is unanimous; disagreement inside S certifies this configuration did not\noccur — nothing more. False majorities under dissent remain possible through partial\nfactors and are reported through the two conditionals above. T1 and T5 stay controlled\nexperiments with declared PRNG, seed, trials and denominators (T5 uses the second\nconditional).\n\n## 6. Probe update\nFor a witness u private-only and independent of every factor touching S (or, with its\ntotal marginal error probability, labelled so):\n```\na = Φ · p_u/(n−1);  b = (1−Φ)·(1−p_u);  Φ′ = a/(a+b);  unmeasured iff a+b = 0\n```\nStrict improvement Φ′ < Φ holds for 0 < Φ < 1 iff p_u < (n−1)/n; boundary cases are\nvalid (Φ=0, p_u=0.2 → 0; Φ=1, p_u=0.2 → 1; p_u=1 → 1).\n\n## 7. Identification and fitting\nLet, for each witness w,\n```\nr_w = (1−p_w) · Π_{singleton f ∋ w} (1−c_f)        unresolved singleton/private survival\ns_w = r_w · Π_{shared f ∋ w} (1−c_f)                total correctness probability\ns_uv = P(e_u = 0 ∧ e_v = 0)\n```\nPopulation identification (declared sharing sets, s_u > 0 for every involved witness):\nlog(s_uv/(s_u·s_v)) = Σ_{shared f ∋ u,v} −log(1−c_f) is linear in −log(1−c_f); if the\npair × shared-factor system has full column rank, every shared c_f is identified, and then\nr_w from s_w; r_w's decomposition into p_w and singleton c_f is unresolved by error data.\nStructure is never discovered by a measure. Finite-data fitting is a separate declared\nprocedure: constrained least squares on the log system, declared budget, residual\ndiagnostics against a declared tolerance, bootstrap uncertainty with declared B/seed/PRNG,\npooling only under declared parameter compatibility; no pseudocounts, no clamping, no\npromotion of fitted structure; zero joint-correct counts or incompatible moments →\n`model/M misfit`, no c_f reported. Φ and D are reported only with handed parameters and\nlabelled `handed`, never `fitted`.\n\n## 8. Time, stake, commonMass\nFreshness and interest enter only as hypothetical factors with declared firing\nprobabilities; otherwise annotations and `unmeasured`. Descriptive commonMass is read as\nexcess over 1/|S| only as deviation from the equal-variance independent reference; it\nnever identifies dependence.\n\n## 9. Captured vectors (exact; rational reference; decimals rounded half-even, 8 digits)\n- two witnesses, covering c=1/20, p=1/5, n=64: P_true 0.608, P_false 0.05060317,\n  P_fired 0.05, P_dissent 0.34139683, Φ 0.07683409, D 0.07591825.\n- impossible conditioning (no factors, p_A=0, p_B=1): P_true = P_false = 0, P_dissent 1,\n  Φ, D unmeasured (cause: no unanimity mass).\n- three witnesses, covering {A,B,C} c=1/5 idx 0, partial {A,B} c=3/10 idx 1, p=0:\n  P_true 0.56, P_false 0.2, P_dissent 0.24, maj_false∧dissent 0.24, Φ = D = 0.26315789,\n  P(false maj | dissent) = 1, P(false maj | any maj ∧ dissent) = 1.\n- earlier singleton {A} c=3/10 idx 0, covering {A,B} c=1/5 idx 1, p=1/5: Φ 0.28387293,\n  D 0.28316249, P_dissent 0.49953016; merged-singleton no-sample Φ 0.35944805.\n- four witnesses, factors {0,1} and {2,3} each c=1/2, p=0: P_dissent 47/63 = 0.74603175,\n  maj_none∧dissent 47/63, P(false maj | dissent) = 0 (measured), P(false maj | any maj ∧\n  dissent) unmeasured (no majority mass), Φ = D = 1/64.\n- probe (Φ 0.07683409, n=64): p_u=0.2 → 0.00033; 0.98 → 0.06080; 0.99 → 0.11566; 1 → 1;\n  Φ=0,p_u=0.2 → 0; Φ=1,p_u=0.2 → 1.\n- identification: c=1/5, p_A=1/2, p_B=3/8 → c recovered exactly 1/5; (c=1/5,p_A=1,\n  p_B=3/8) vs (c=2/5,p_A=1,p_B=1/6) have identical moments → s_A = 0 → unidentified.\n- identity 1 − P_true − P_false = P_dissent holds in every case.\n\n## 10. Open, by name\nPartial value sharing (a factor firing without forcing one value) — a future model;\nprobe usefulness beyond the private-only case; discovery of sharing structure (never by a\nmeasure); adequacy policies (min cells, interval widths, budgets) as declared lines.\n\n## 11. Acceptance\nTypeScript implementation reproduces every captured vector exactly in rational\narithmetic; validation refuses by name; budget is computed before work; every result\ncarries model, handed parameters and conditions; states identical before and after;\nthe descriptive 0.4.0 measures and all algebra hashes unchanged.\n\n## 12. Capacity under a single dominant factor\n\n`capacityBound`, `capacityP0`, `mutualInformation`, and `unanimityNoFactor` use the declared single-dominant-factor model. T is uniform on n >= 2 values. F is independent of T with probability c. On F=1 all witnesses report one W, uniform among values different from T. On F=0 they use independent homogeneous private channels: correct with probability 1-p, otherwise uniform among n-1 wrong values. These hypotheses are handed, never inferred.\n\nFor every positive k, I(T;V) <= log2(n)-c*log2(n-1). The entropy chain rule gives\nH(T|V) = c*log2(n-1) + (1-c)*H(T|V,F=0) + I(T;F|V).\nThe first term is exclusion uncertainty, the second private uncertainty, the third factor ambiguity. A decoder cannot increase information about T.\n\nFor 0<p<1 and p!=(n-1)/n, the bound is attained as k tends to infinity: the empirical private vote distribution distinguishes T, and private unanimity has probability (1-p)^k+p^k/(n-1)^(k-1), tending to zero. For p=1,n>2 the missing value identifies T asymptotically. For p=1,n=2 every vote is the complement of T, giving one bit for every k. At p=0, I=log2(n)-h(c)-c*log2(n-1) for every k. At c=1, I=log2(n/(n-1)) for every k. At c=0 the uninformative private channel p=(n-1)/n gives zero for every k; c=0 does not by itself imply log2(n). At that uninformative p with a factor, the limit is c*log2(n/(n-1)), not the general upper bound.\n\nProbabilities and the conditional-entropy expression are exact rationals. Numerical entropy uses the explicitly handed `binary64-log2` policy, in bits, and is an approximation; it is not an exact rational logarithm. `mutualInformation` declares its joint-cell enumeration budget before work. `unanimityNoFactor` declares a rational-bit upper-bound budget before exponentiation. Budget exhaustion is unmeasured, never zero.\n\nCaptured finite information, n=4,c=1/5,p=3/10: k=1,2,4,7 gives approximately 0.313028978, 0.469712906, 0.914458010, 1.332321771 bits. The bound is approximately 1.683007500 bits. At p=0 the information is approximately 0.961079405 bits for every k. These decimals are illustrative approximations under the named policy.\n\n## 13. Decision results are separate\n\n`decisionInformation` accepts `plurality-uniform-ties@1` or `posterior-map-uniform-ties@1`. The second compares exact declared joint probabilities for finite k; it does not apply an intuition-based unanimity threshold. Ties are uniformly distributed among maximizers. It returns posterior information I(T;V), decision information I(T;answer), and exact rational decision accuracy as distinct quantities. The exact T/answer joint table accompanies them. A randomized answer cannot gain information over V.\n\nUnder p<(n-1)/n, asymptotically plurality emits the forced wrong value on the factor event. Posterior MAP identifies that event and samples uniformly among its n-1 alternatives. For n=4,c=1/5, plurality decision information is approximately 0.961079405 bits; MAP decision information is approximately 1.222162 bits; posterior information is approximately 1.683007500 bits. The two information gains differ. None is a finite-k or model-free guarantee.\n\n## 14. No-truth fitting\n\n`fitUnanimityModel` uses `exact-c-slices-on-declared-p-grid@1`. It takes one named lineage, cardinality, k/count/denominator rows, a declared p grid, exact absolute rate tolerance, and a work budget. For each handed p it intersects the exact inequalities for c, returning the entire compatible c interval and midpoint residual diagnostics. No claim is made about p values between slices or continuous identification. A measured fit means the declared procedure was evaluated; it does not mean parameters or causes were identified.\n\nThe observed rate is compared with c+(1-c)*[(1-p)^k+p^k/(n-1)^(k-1)]. Binary p versus 1-p ambiguity remains visible. Perfect unanimity leaves p=0 and c=1 indistinguishable. Too few informative sizes or no compatible slice are explicitly unmeasured. Mixed populations require a separately declared mixture model and are not pooled here.\n\nOptional bootstrap samples complete paired groups across sizes with a handed xorshift32 seed, B and random-word budget. It retains the full compatible regions in each replicate, not independent uncertainty intervals for each size. Groups are the declared resampling units; the procedure assumes exchangeable independent groups and does not establish that assumption. Counts alone leave uncertainty unmeasured. Replicate regions are empirical bootstrap output, not guaranteed confidence sets. Exhausted random words never produce successful uncertainty.\n\n## 15. False coincidence relative to a declared reference\n\n`coincidenceExcess` takes event/origin/value rows, truth rows (`kind=truth`), an explicit selection S and the `independent-uniform-wrong@1` reference. Order h is |S|; identity and redelivery never add origins or events. Values belong to the declared alphabet. Conflicting values or truth refuse. Incomplete shared events and insufficient declared event counts remain unmeasured. Imperfect probes need a separate contract and are not silently accepted as truth.\n\nThe reference uses handed error marginals, or explicitly estimated marginals stratified by observed truth. For handed homogeneous errors p_i, reference false coincidence is product(p_i)/(n-1)^(h-1). Estimated strata use their event weights, never a pooled error probability that confounds truth populations. Output contains the false-coincidence count, denominator, exact observed and reference rates, signed delta=observed-reference, and ratio=observed/reference. Delta is never floored at zero. At reference zero the ratio is unmeasured, while counts and delta remain available. No sampling design is inferred; uncertainty is separately unmeasured.\n\nA ratio greater than one means more coincidence than this reference, not a discovered common cause. Nonuniform wrong labels can exceed the uniform reference with independent witnesses. Independent errors with one shared wrong label give ratio (n-1)^(h-1): at n=64 this is 63 for pairs and 3969 for triples. The fair-bit XOR vector explicitly assigns one common wrong label: pairs have ratio 63, triples ratio zero and a negative delta. Indicators alone do not define the reported-value vector.\n\nUnder the separately handed dominant-factor model c=1/10,p=1/5,n=64, observed error marginals are 7/25. Relative to those marginals, delta at orders 2 and 3 is approximately 0.099326984 and 0.099996283. Its convergence to c is a conclusion under this model, never model-free identification.\n\n## 16. Research demands and boundaries\n\nThe spectrum summarizes covariance of binary error indicators. It is not a sufficient statistic of reported values, closure events or independence. False-unanimity excess summarizes one event and does not replace the full joint distribution. Higher-order closure statistics need a declared closure rule and the appropriate joint law of reported values given truth; neither is inferred from a form name.\n\nHelly is a property of a declared geometric family, not a probabilistic independence order or a truth guarantee. Geometry, factor precedence, partial label sharing, reproduction, percolation, time-varying fitting, imperfect-probe identification and model-free capacity remain explicitly open until their models, procedures and falsifiers close. Controlled experiments live in a world. No new origin, permission, algebraic amount or state is created by a measure.\n\n## 17. Publication and stability\n\nThe historical nine publication groups are linked to their contracts, yes/no data and declared Bound 0.1.7 captures in two places. The 0.4.2 operations below require new captures under their selected reader; historical implementation-bound receipts do not cover changed bytes. Validation readers are maintained TypeScript worlds with ordinary modular compilation; no .mjs bundle or private executor ships in this library. Their implementation inventory is retained once by digest. The installed archive must expose the same public exports, preserve the four states, match all published bytes and close native receipts without a private store. Declaring these requirements does not pay them.\n\n## 18. Declared failure bounds\n\n`unionBoundConfidence(failures)` requires distinct nonempty IDs, explicit rational probabilities in [0,1], and nonempty justification references. The caller must establish every failure bound in one probability space. References are retained, not verified. The returned lower bound for all events succeeding is max(0,1−Σp_i), with exact rational arithmetic. The empty family gives 1; Σp_i≥1 gives the trivial bound 0. No independence, truth probability, or algebraic state is inferred.\n\n`tolerantCountConfidence(failures,k)` requires a safe integer 0≤k≤m. For k<m it bounds failure by min(1,min_{0≤j≤k}(Σ of the m−j smallest p_i)/(k+1−j)); its exact success lower bound is the complement. For k=m success is certain. For m=3,k=1 and all p_i=1/10 the result is 17/20, not an inferred success rate. The distinct subset-intersection guarantee gives the weaker bound 7/10. Three disjoint paired failures among six events, each pair having probability 1/10, refute the former 4/5 claim: success is 7/10.\n\nThese operations compute conditional probability bounds. They select neither a geometric tolerance nor a consumer policy. Count-tolerant intersection T_k and widened-interval intersection T_eps remain named forms; tolerant-choice remains open.\n\n## 19. Declared covering cause\n\n`commonCauseCapacityBound(n,c,q,{logarithm:'binary64-log2'})` requires integer n≥2 and explicit rational c,q in [0,1]. Truth is uniform; the covering-cause indicator is independent of truth; when active, every report copies one symmetric channel with accuracy q. The inactive private channel is unrestricted. Revealing the indicator gives the upper bound log2(n)−c[h(q)+(1−q)log2(n−1)] in approximate bits. Copy count is no input. This is neither finite-sample mutual information nor an achievability claim.\n\nAt n=4,c=1,q=1/4 the bound is exactly zero; q=0 gives log2(4/3), and q=1 gives two bits. Missing q refuses. The operational declaration or detection of activation remains open in identification.model. Unconditioned coincidence does not identify q.\n\nM/3 and M/4 retain their existing definitions. Partial-factor governance proposals do not supply a conditional joint observation and selection law. The information carried by dissent, including a bottom symbol, is open for those unspecified proposals.\n\n## Obligations 0.4.3 — proposed conditional measures\n\nL7: conditional bound on one declared common probability space: P(N>k)<=min(1,sum over |S|=k+1 of min p_i), with rational declared marginal failure upper bounds and 0<=k<=m. Trivial iff computed upper bound is one. Counterexamples refute the former top-k+1 success guarantee. Joint-independent Bernoulli convolution is a separate declared hypothesis; rho=0 and pairwise independence do not supply it. Existing stronger 0.4.2 count bound is unchanged and needs no joint independence.\n\nL8: law by enumeration only for 3<=n<=64, positive integer divisors p|n and integer 0<=s<p. D=log2(n/p)-h(s/p), explicit binary64-log2 approximation. Odd-period minimum uses h(floor(p/2)/p), even-period minimum uses one. Complete maximum at zero; nonzero domain has endpoints 1,p-1, empty when p=1. No information or worst-case interpretation follows from nonnegativity. T87 retains its separate wrapped-phase amplitude identity.\n\nL9: law by counterexample of existence of noninjective weighted mix, and measure with a declared prior on a finite explicitly supplied set of named-factor configurations. Equal-weight ab and ba give the same bottom tie and different named forks. Loss is H(configuration | mix)=H(configuration)-H(mix); a uniform prior must be explicitly selected, absent prior is unmeasured. The four-state uniform example has mean loss 0.5 bits and one bit conditioned on tie; the injective named fork has zero loss. Defines no new algebraic act, governance selection, M/3 or M/4 law, or destroyed field.\n\n## Lineage and delivery: distinct scopes\n\nFor n>=2, uniform truth X, the declared n-ary symmetric channel X->Z with crossover probability c in [0,1], and X->Z->reports->aggregate A,\n\n```text\nH(X|Z) = h2(c) + c*log2(n-1) >= h2(c)\nH(X|A) >= H(X|Z)\nI(X;A) <= log2(n) - h2(c) - c*log2(n-1)\n```\n\nHere h2 is binary entropy, with 0*log2(0)=0. The uncertainty floor and information ceiling follow from this symmetric-channel equality and the declared Markov bottleneck. The reports and aggregation have no additional access to truth or a revealed error/cause indicator. This reuses capacityP0; it neither replaces capacityBound nor changes M/3 or M/4. An error rate alone, an asymmetric channel or the existing private-error model does not establish this ceiling. The distinguishing counterexamples and relation to F1 are in [the conditional lineage contract](../proofs/lineage-ceiling.json).\n\nThe parameter c denotes the mixture activation or channel crossover specified by the selected model. It is not identified from unanimity without that model, and no equality with the genetic inbreeding coefficient F is asserted. No genetic law follows here.\n\nCell vacuity is a property of a region under the algebra. Delivery asks whether the bytes named by a digest are available and match it. A vacuous cell neither certifies delivery nor proves that a delivered package is admissible. The relation between these predicates remains the named vacuity-versus-delivery tension.\n" at=witness:044/text-scope-corrections by=target form=alphabet measure=text role=writes scope=prose/en/measures shape=docs/measures.md value=lock
 bound-lock/1 about="# Price\n\n<p align=\"center\"><img src=\"../img/price.svg\" alt=\"Two origins on one scale: seller claims 2 to 9 and buyer claims 5 to 12; what they hold together runs from a floor of 5 to a ceiling of 9.\" width=\"640\"></p>\n\nA claim from one origin is potential; a cell is information only where two independent origins touch it and their intervals meet.\n\n## Run it\n\n```ts\nimport { chain, disagree, freedom, meetAt, origins, point, unit } from '@lapxo/obligations';\n\nconst said = (cell: Parameters<typeof meetAt>[0]): string =>\n  (origins(cell) < 2 ? 'grey' : disagree(cell) ? 'split' : 'agreed');\n\nconst price = point('price', 0, [\n  { origin: 'seller', span: { lo: 2, hi: 9 } },\n  { origin: 'buyer', span: { lo: 5, hi: 12 } },\n]);\nconst scale = chain(Array.from({ length: 16 }, (_, i) => `l${i}`));\n\nconsole.log('verdict   ', said(price));\nconsole.log('they hold ', JSON.stringify(meetAt(price)));\nconsole.log('still free', freedom(scale, unit('price', { floor: 'l5', ceiling: 'l9' })).toFixed(2), 'bits');\nconsole.log('why       a seller and a buyer are two origins; where their marks meet is a price, and what is left between the marks is what nobody has decided yet');\n```\n\n```\nverdict    agreed\nthey hold  {\"lo\":5,\"hi\":9}\nstill free 2.32 bits\nwhy       a seller and a buyer are two origins; where their marks meet is a price, and what is left between the marks is what nobody has decided yet\n```\n\nIts origins meet.\n\n## What it rests on\n\n```mermaid\nflowchart LR\n  c0[\"point\"]\n  c1[\"unit\"]\n  l0([\"encounter\"])\n  l1([\"debit in bits\"])\n  c0 --> l0\n  c1 --> l1\n  classDef shown fill:#2da44e,color:#ffffff,stroke:#2da44e\n  class l0 shown\n```\n\n## Source\n\n[Its source](../../examples/release/price.ts) is one of the examples of obligations, and it runs as it is written, against the built package, with nothing compiled for it.\n" at=witness:041/retain-declared-documentation by=target form=alphabet measure=text role=writes scope=prose/en/learn-price shape=docs/learn/price.md value=lock
@@ -12,7 +15,7 @@ bound-lock/1 about="**{name}** — {answer}." at=witness:the-root-spoke-for-the-
 bound-lock/1 about="**{name}**, a form of {args}" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reference/form value=lock
 bound-lock/1 about="**{title}** — {brief}. *Breaks if {breaks}.*" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/open/conjecture value=lock
 bound-lock/1 about=", & " at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/cite/and value=lock
-bound-lock/1 about="<p><img src=\"docs/img/logo.svg\" alt=\"\"></p>\n\n# @lapxo/obligations\n\n![version 0.4.2](https://img.shields.io/badge/version-0.4.2-) ![license MIT](https://img.shields.io/badge/license-MIT-) ![node >=22.12](https://img.shields.io/badge/node-%3E%3D22.12-) [![DOI 10.5281/zenodo.21858428](https://img.shields.io/badge/DOI-10.5281%2Fzenodo.21858428-)](https://doi.org/10.5281/zenodo.21858428)\n\nThe algebra of a cell: two poles, origins with phase, eight acts.\n\n## The idea\n\nEvery quantity a system answers for has two marks on one scale. The floor is what must hold, the ceiling is what may hold, and the pair is a cell. Two origins that touch one cell and whose marks meet make information; two whose marks do not meet make a fork that no average can close.\n\nFour words carry the whole library. A floor, a ceiling, an origin and an epoch. A price is the distance between the marks, a state is where they stand, a verdict is what an origin found, a horizon is what no origin has reached, and none of them is a new idea: each is read off those four.\n\nThe pure API `@lapxo/obligations/measures` describes error histories of origins: covariance, spectrum, effective rank and common variance. It ships M/3 as the reference conditional model with an exact rational evaluator. No measure changes a state; observed association never establishes independence. [Measures](docs/measures.md).\n\n## The object\n\n```text\nc = ⟨⊥, ⊤, O, ⊑⟩        over L at r\n⊥(c)                   = ⋁ required ∨ ⋁_{o∈O} lo_o\n⊤(c)                   = ⋀ signed ∧ ⋀_{o∈O} hi_o\ninfo(c)                ⟺ |ext(O)| ≥ 2 ∧ meet(c) ≠ ∅\nF(C)                   = Σ_{c∈C} F(c),   F(a(c)) ≤ F(c) for every act a that narrows\nA(c)                   = |Σ_{o∈O} s_o w_o e^{iφ_o}|²\n⊤(c)                   = ⋀_{b ⊑ c} signed(b) ∧ ⋀_{o∈O} hi_o,   one line per act\n|e^{ia} + e^{ib}|² < 2 ⟺ acos(cos(a − b)) > π/2\nstate(c)               ∈ {FREE, REQUIRED, FORBIDDEN, CONFLICT}\n```\n\n```text\nbounds cross or claims have an empty meet  CONFLICT \none origin                                 REQUIRED \nclaims meet within bounds                  FREE     \nclaims meet outside bounds                 FORBIDDEN\n```\n\n```bash\nnpm install @lapxo/obligations\n```\n\n\n## A model-bound calculation\n\n```js\nimport { capacityBound } from '@lapxo/obligations/measures';\n\nconst bound = capacityBound(4, '1/5', { logarithm: 'binary64-log2' });\nconsole.log(bound.value.toFixed(6), bound.unit);\n// 1.683007 bits\n```\n\nThis is an information upper bound under the declared single-dominant-factor model,\nnot a measurement of truth or proof of independent origins. The four states are unchanged.\n\nFor the separate, declared n-ary symmetric lineage channel with uniform truth and no extra truth access, h2(c) is a lower bound on residual truth uncertainty, not a ceiling on information. The full residual is h2(c) + c*log2(n-1); the corresponding information ceiling needs that symmetric channel and the report-only Markov bottleneck. This is the capacityP0 case, not a replacement for the capacityBound calculation above.\n\nThe parameter c has the meaning given by its selected mixture or channel model; it is not the genetic inbreeding coefficient F. Cell vacuity and missing delivered bytes are separate questions: a statement about a cell does not verify that an archive or provider exists and matches its digest. Their relationship remains a named tension.\n\n\n## The paper\n\nThe theory here is not an application of an algebra to a problem. It is one algebra, of a cell with two marks, and three theories that turn out to be that algebra seen from different sides: constraints with a price, states on a scale, and points with an epoch and an origin.\n\nWhat it proves is that the price of a fold, the freedom of a system in bits, the four states a verdict can hold, the spectrum a domain admits, the metric that shared observation induces and the phase an epoch carries are all consequences of the same lines. Each law names the view that implements it, and each view is a folder of the source: what is proved in the field view runs in the field view, and a law no operation reaches is a law this package refuses to claim.\n\nOchoa, N. (2026). Two-Sided Constraints on a Valued Lattice (Version 1.0.0). Zenodo. https://doi.org/10.5281/zenodo.21858428\n\n## Pointers\n\n- [In phase](docs/learn/in-phase.md)\n- [Measures](docs/measures.md)\n- [Paper](docs/paper.md)\n- [Price](docs/learn/price.md)\n- [Reference](docs/reference.md)\n- [Signature](docs/learn/signature.md)\n- [Thermometer](docs/learn/thermometer.md)\n- [Withdrawal](docs/learn/withdrawal.md)\n" at=witness:044/text-scope-corrections by=target form=alphabet measure=text role=writes scope=prose/en/readme shape=README.md value=lock
+bound-lock/1 about="<p><img src=\"docs/img/logo.svg\" alt=\"\"></p>\n\n# @lapxo/obligations\n\n![version 0.4.6](https://img.shields.io/badge/version-0.4.6-) ![license MIT](https://img.shields.io/badge/license-MIT-) ![node >=22.12](https://img.shields.io/badge/node-%3E%3D22.12-) [![DOI 10.5281/zenodo.21858428](https://img.shields.io/badge/DOI-10.5281%2Fzenodo.21858428-)](https://doi.org/10.5281/zenodo.21858428)\n\nThe algebra of a cell: two poles, origins with phase, eight acts.\n\n## The idea\n\nEvery quantity a system answers for has two marks on one scale. The floor is what must hold, the ceiling is what may hold, and the pair is a cell. Two origins that touch one cell and whose marks meet make information; two whose marks do not meet make a fork that no average can close.\n\nFour words carry the whole library. A floor, a ceiling, an origin and an epoch. A price is the distance between the marks, a state is where they stand, a verdict is what an origin found, a horizon is what no origin has reached, and none of them is a new idea: each is read off those four.\n\nThe pure API `@lapxo/obligations/measures` describes error histories of origins: covariance, spectrum, effective rank and common variance. It ships M/3 as the reference conditional model with an exact rational evaluator. No measure changes a state; observed association never establishes independence. [Measures](docs/measures.md).\n\n## The object\n\n```text\nc = ⟨⊥, ⊤, O, ⊑⟩        over L at r\n⊥(c)                   = ⋁ required ∨ ⋁_{o∈O} lo_o\n⊤(c)                   = ⋀ signed ∧ ⋀_{o∈O} hi_o\ninfo(c)                ⟺ |ext(O)| ≥ 2 ∧ meet(c) ≠ ∅\nF(C)                   = Σ_{c∈C} F(c),   F(a(c)) ≤ F(c) for every act a that narrows\nA(c)                   = |Σ_{o∈O} s_o w_o e^{iφ_o}|²\n⊤(c)                   = ⋀_{b ⊑ c} signed(b) ∧ ⋀_{o∈O} hi_o,   one line per act\n|e^{ia} + e^{ib}|² < 2 ⟺ acos(cos(a − b)) > π/2\nstate(c)               ∈ {FREE, REQUIRED, FORBIDDEN, CONFLICT}\n```\n\n```text\nbounds cross or claims have an empty meet  CONFLICT \none origin                                 REQUIRED \nclaims meet within bounds                  FREE     \nclaims meet outside bounds                 FORBIDDEN\n```\n\n```bash\nnpm install @lapxo/obligations\n```\n\n\n## Use the pure API\n\nThe package is ESM and requires Node.js 22.12 or later. It provides the algebra; it does not fetch evidence, choose trusted origins or sign declarations. Bound consumes this algebra to admit and resolve places.\n\n```js\nimport { intervals } from '@lapxo/obligations';\n\nconst scale = intervals(0, 10);\nconsole.log(scale.show(scale.meet({ lo: 2, hi: 8 }, { lo: 5, hi: 9 })));\n// 5..8\n```\n\nPublic entry points include:\n\n| Entry point | Purpose |\n| --- | --- |\n| `@lapxo/obligations` | Cell algebra, declarations, forms and region operations |\n| `/measures` | Model-bound information, confidence and error-history calculations |\n| `/field`, `/encounter`, `/present` | Regions, observations, epochs and encounters |\n| `/lattice`, `/forms` | Orders, intervals and alphabets |\n| `/debit`, `/packed`, `/price` | Constraint operations, packed states and their price |\n| `/signatures`, `/replay` | Projection of signed declarations and replay |\n| `/shuffle`, `/views/field`, `/views/product` | Permutations and declared views |\n\n### A model-bound calculation\n\n```js\nimport { capacityBound } from '@lapxo/obligations/measures';\n\nconst bound = capacityBound(4, '1/5', { logarithm: 'binary64-log2' });\nconsole.log(bound.value.toFixed(6), bound.unit);\n// 1.683007 bits\n```\n\nThis is an information upper bound under the declared single-dominant-factor model,\nnot a measurement of truth or proof of independent origins. The four states are unchanged.\n\nFor the separate, declared n-ary symmetric lineage channel with uniform truth and no extra truth access, h2(c) is a lower bound on residual truth uncertainty, not a ceiling on information. The full residual is h2(c) + c*log2(n-1); the corresponding information ceiling needs that symmetric channel and the report-only Markov bottleneck. This is the capacityP0 case, not a replacement for the capacityBound calculation above.\n\nThe parameter c has the meaning given by its selected mixture or channel model; it is not the genetic inbreeding coefficient F. Cell vacuity and missing delivered bytes are separate questions: a statement about a cell does not verify that an archive or provider exists and matches its digest. Their relationship remains a named tension.\n\n\n## Theory and evidence in 0.4.6\n\nThe compiled API and algebra are unchanged from 0.4.5. This release adds contracts, proof sources, samples and executable vectors; these are not new runtime exports.\n\n- **Conditional lineage models:** the finite M0 binomial bridge, diagonal prerequisites, population-moment identification and finite uncertainty retain their declared hypotheses. Identification requires known p and uniform lineage shares; arbitrary weights retain exact counterexamples.\n- **M1 models:** the ancestor-first fixed-quota generator, off-diagonal limit and specified diagonal regions have Lean-checked results within their stated domains.\n- **Projection chains:** deterministic X → Y → Z uses one common prior. The entropy identity has bounded executable evidence; it is not presented as a universal Lean proof.\n- **Origins and participation:** named lineage, shared provenance and participation do not establish joint independence. Independence is a model hypothesis wherever consumed.\n\nRead the [identification contract](docs/contracts/m0-moment-identification.md), [finite-uncertainty contract](docs/contracts/m0-keff-interval.md), [M1 regions](docs/contracts/m1-diagonal-regions.md), [projection-chain contract](docs/contracts/projection-chain.md) and [extension/lineage definitions](docs/contracts/extension-lineage-participation.md) for exact conditions and boundaries. Bound records admitted declarations and their evidence in `TARGET.bound` and `receipts.bound`.\n\n### Open questions\n\nGeneral heterogeneous M0 and M1 diagonal central limit theorems, causal subgroup recovery, oracle-free reference, actual calibration, fixed-source quota uncertainty and a public K_eff interval API remain open. Conditional results do not close those demands. [Experiment 1a](docs/contracts/model-collapse-1a.md) supplies a protocol only: its empirical status is `unmeasured`, with no selected dataset or claimed experimental result.\n\n## The paper\n\nThe theory here is not an application of an algebra to a problem. It is one algebra, of a cell with two marks, and three theories that turn out to be that algebra seen from different sides: constraints with a price, states on a scale, and points with an epoch and an origin.\n\nWhat it proves is that the price of a fold, the freedom of a system in bits, the four states a verdict can hold, the spectrum a domain admits, the metric that shared observation induces and the phase an epoch carries are all consequences of the same lines. Runtime operations, mathematical statements and executable evidence have separate scopes. Their contracts name the assumptions and the evidence that support each claim; proof sources do not imply an exported implementation.\n\nOchoa, N. (2026). Two-Sided Constraints on a Valued Lattice (Version 1.0.0). Zenodo. https://doi.org/10.5281/zenodo.21858428\n\n## Pointers\n\n- [In phase](docs/learn/in-phase.md)\n- [Measures](docs/measures.md)\n- [Paper](docs/paper.md)\n- [Price](docs/learn/price.md)\n- [Reference](docs/reference.md)\n- [Signature](docs/learn/signature.md)\n- [Thermometer](docs/learn/thermometer.md)\n- [Withdrawal](docs/learn/withdrawal.md)\n" at=witness:public-documentation by=target form=alphabet measure=text role=writes scope=prose/en/readme shape=README.md value=lock
 bound-lock/1 about="<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 64 64\" width=\"64\" height=\"64\" role=\"img\" aria-labelledby=\"title\">\n<title id=\"title\">2 origins and the bond where they touch</title>\n<path d=\"M32 17.58 A17 17 0 0 1 32 46.42 A17 17 0 0 1 32 17.58 Z\" fill=\"#2da44e\"/>\n<path d=\"M32 17.58 A17 17 0 1 0 32 46.42\" fill=\"none\" stroke=\"#8c959f\" stroke-width=\"4\" stroke-linecap=\"round\"/>\n<path d=\"M32 17.58 A17 17 0 1 1 32 46.42\" fill=\"none\" stroke=\"#8c959f\" stroke-width=\"4\" stroke-linecap=\"round\"/>\n</svg>\n" at=witness:041/retain-declared-mark by=target form=alphabet measure=text role=writes scope=prose/en/logo shape=docs/img/logo.svg value=lock
 bound-lock/1 about="<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 64 64\" width=\"64\" height=\"64\" role=\"img\" aria-labelledby=\"title\">\n<title id=\"title\">2 origins and the bond where they touch</title>\n<path d=\"M32 17.58 A17 17 0 0 1 32 46.42 A17 17 0 0 1 32 17.58 Z\" fill=\"#cf222e\"/>\n<path d=\"M32 17.58 A17 17 0 1 0 32 46.42\" fill=\"none\" stroke=\"#8c959f\" stroke-width=\"4\" stroke-linecap=\"round\"/>\n<path d=\"M32 17.58 A17 17 0 1 1 32 46.42\" fill=\"none\" stroke=\"#8c959f\" stroke-width=\"4\" stroke-linecap=\"round\"/>\n</svg>\n" at=witness:041/retain-declared-documentation by=target form=alphabet measure=text role=writes scope=prose/en/logo-fork shape=docs/img/logo-fork.svg value=lock
 bound-lock/1 about="<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 640 178\" width=\"640\" height=\"178\" role=\"img\" aria-labelledby=\"title desc\">\n<title id=\"title\">A cell</title>\n<desc id=\"desc\">Two origins on one scale: a claims 2 to 9 and b claims 5 to 12; what they hold together runs from a floor of 5 to a ceiling of 9.</desc>\n<style>\ntext{font:14px ui-sans-serif,-apple-system,\"Segoe UI\",Helvetica,Arial,sans-serif;fill:#59636e}\n.claim{fill:#8c959f}.held{fill:#2da44e}.pole{fill:#2da44e;font-weight:600}.axis,.tick{stroke:#8c959f;stroke-width:1}.touch{stroke:#2da44e;stroke-width:1;stroke-dasharray:3 3}\n@media (prefers-color-scheme:dark){text{fill:#9198a1}}\n</style>\n<line class=\"touch\" x1=\"269.3\" y1=\"12\" x2=\"269.3\" y2=\"126\"/>\n<line class=\"touch\" x1=\"442.7\" y1=\"12\" x2=\"442.7\" y2=\"126\"/>\n<text x=\"82\" y=\"32\" text-anchor=\"end\">a</text>\n<rect class=\"claim\" x=\"139.3\" y=\"18\" width=\"303.4\" height=\"18\" rx=\"4\"/>\n<text x=\"82\" y=\"66\" text-anchor=\"end\">b</text>\n<rect class=\"claim\" x=\"269.3\" y=\"52\" width=\"303.4\" height=\"18\" rx=\"4\"/>\n<text x=\"82\" y=\"100\" text-anchor=\"end\">held</text>\n<rect class=\"held\" x=\"269.3\" y=\"86\" width=\"173.4\" height=\"18\" rx=\"4\"/>\n<line class=\"axis\" x1=\"96\" y1=\"126\" x2=\"616\" y2=\"126\"/>\n<line class=\"tick\" x1=\"139.3\" y1=\"126\" x2=\"139.3\" y2=\"131\"/>\n<text x=\"139.3\" y=\"148\" text-anchor=\"middle\">2</text>\n<line class=\"tick\" x1=\"269.3\" y1=\"126\" x2=\"269.3\" y2=\"131\"/>\n<text x=\"269.3\" y=\"148\" text-anchor=\"middle\">5</text>\n<line class=\"tick\" x1=\"442.7\" y1=\"126\" x2=\"442.7\" y2=\"131\"/>\n<text x=\"442.7\" y=\"148\" text-anchor=\"middle\">9</text>\n<line class=\"tick\" x1=\"572.7\" y1=\"126\" x2=\"572.7\" y2=\"131\"/>\n<text x=\"572.7\" y=\"148\" text-anchor=\"middle\">12</text>\n<text class=\"pole\" x=\"269.3\" y=\"168\" text-anchor=\"middle\">floor</text>\n<text class=\"pole\" x=\"442.7\" y=\"168\" text-anchor=\"middle\">ceiling</text>\n</svg>\n" at=witness:041/retain-declared-documentation by=target form=alphabet measure=text role=writes scope=prose/en/figure shape=docs/img/cell.svg value=lock
@@ -22,6 +25,8 @@ bound-lock/1 about="<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 640
 bound-lock/1 about="A cell is drawn as bars on one scale: a grey bar is what one origin claims, potential until another meets it, and a green bar is where two claims meet, its ends the floor and the ceiling. A state carries its render in a figure, a badge and a graph alike: FREE green, REQUIRED grey, FORBIDDEN red, CONFLICT fork." at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/marks value=lock
 bound-lock/1 about="A cell" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/cell/title value=lock
 bound-lock/1 about="A new tree ratio requires its own handed leaf and region population with a digest and native capture. The old population does not constrain a new place. Empty regions falsify the universal inequality." at=witness:descriptive-measures-beside-states by=target form=interval measure=count needs=observation/T58/handed-population role=demands scope=observation/T58/cardinality value=0..0
+bound-lock/1 about="Binary M0 with jointly independent Bernoulli(p) latent lineages, known p in(0,1), uniform shares1/K with K>=1 and0<c<=1: the exact population pair and fourth agreement moments identify(c,K). A general quartic expectation bridge and strict monotonicity prove this beyond the old finite grid. For arbitrary normalized weights, p declared is insufficient for this moment map: c=7/10,K_eff=147/4 and c=4/5,K_eff=48 have equal R2,R4 at p=3/4. This collision concerns these moments only, not the entire observable law. R3 remains redundant. No sample uncertainty, causal recovery or contextual activity identification is claimed." at=witness:obligations046/m0-identification by=target form=interval measure=count needs=proofs/m0-046-identification/M0Identification046.lean|proofs/m0-046-identification/Obligations045/M0Coincidence.lean|proofs/m0-046-identification/lake-manifest.json|proofs/m0-046-identification/lakefile.toml|proofs/m0-046-identification/lean-toolchain|vectors/laws/m0-identification.lean.json|contracts/m0-moment-identification.json|samples/laws/m0-moment-identification/yes/sample.json|samples/laws/m0-moment-identification/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-identification value=0..0
+bound-lock/1 about="Binary M0 with jointly independent Bernoulli(p) latent lineages, known p in(0,1), uniform shares1/K with K>=1 and0<c<=1: the exact population pair and fourth agreement moments identify(c,K). A general quartic expectation bridge and strict monotonicity prove this beyond the old finite grid. For arbitrary normalized weights, p declared is insufficient for this moment map: c=7/10,K_eff=147/4 and c=4/5,K_eff=48 have equal R2,R4 at p=3/4. This collision concerns these moments only, not the entire observable law. R3 remains redundant. No sample uncertainty, causal recovery or contextual activity identification is claimed.\n" at=witness:obligations046/O4 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-moment-identification shape=docs/contracts/m0-moment-identification.md value=lock
 bound-lock/1 about="Bounded diagnostic contract: on a finite acyclic rest graph with its exact reverse-edge index, bites traverses travelling non-widening ceiling marks and stops below an envelope a when meet(a,new)=a. Descendant travelling envelopes contain that ancestor meet and are also absorbed. Its cells and visits describe this diagnostic traversal. With no local widening, local-only ceiling constraints or claim spans masking these envelopes, the fixture matches changed ceilings. It proves neither actual propagation cost nor a general region-summary interval. Historical alias: a-signature-stops-where-the-meet-is-identity." at=policy:law/T94 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T94-a-signature-stops-where-the-meet-is-identity.json|samples/no/T94-a-signature-stops-where-the-meet-is-identity.json|src/field/sign.ts|src/lattice/obligatory.ts restsOn=law/A2-meet role=demands scope=law/T94-a-signature-stops-where-the-meet-is-identity value=present
 bound-lock/1 about="Bounded enumeration contract: for a finite cell history and fixed finite acyclic world with total lattice operations, fragility enumerates subsets of distinct live origin names in increasing size. For each subset it removes all history records by those names and compares both poles. It returns the smallest size changing a pole, or sentinel0 if no tested subset does. This is history-record deletion, not automatic phased cancellation; cross-origin takes can expose old records. Simultaneous-support intuition additionally assumes no cross-origin withdrawal dependencies and no masking marks. Historical alias: fragility-is-the-fewest-withdrawals." at=policy:law/T101 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T101-fragility-is-the-fewest-withdrawals.json|samples/no/T101-fragility-is-the-fewest-withdrawals.json|src/field/fragility.ts|src/lattice/obligatory.ts restsOn=law/A2-meet role=demands scope=law/T101-fragility-is-the-fewest-withdrawals value=present
 bound-lock/1 about="Bounded interval-budget contract: in a finite acyclic world with inhabited poles, finite ceiling/floor endpoints and no local widening, pay explicitly appends a travelling ceiling mark at hi-1. It refuses if hi-1<floor.lo; otherwise looksLeft decreases by one with the rest of the snapshot unchanged. The caller must explicitly charge a look; sign, observe and refine are not thereby charged automatically. Region membership is computed by the existing region predicate. No universal physical price, policy optimality or third-object claim follows. Historical alias: every-act-is-paid-by-its-origin." at=policy:law/T93 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T93-every-act-is-paid-by-its-origin.json|samples/no/T93-every-act-is-paid-by-its-origin.json|src/debit/observer.ts|src/field/sign.ts|src/lattice/obligatory.ts restsOn=law/A2-meet role=demands scope=law/T93-every-act-is-paid-by-its-origin value=present
@@ -58,17 +63,24 @@ bound-lock/1 about="Every capacity limit states its hypotheses; finite informati
 bound-lock/1 about="Every conjecture in full" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/open/full value=lock
 bound-lock/1 about="Every operation this package offers, every law it states and every form it declares: {operations} operations, {laws} laws, {forms} forms." at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reference/lead value=lock
 bound-lock/1 about="Every quantity a system answers for has two marks on one scale. The floor is what must hold, the ceiling is what may hold, and the pair is a cell. Two origins that touch one cell and whose marks meet make information; two whose marks do not meet make a fork that no average can close.\n\nFour words carry the whole library. A floor, a ceiling, an origin and an epoch. A price is the distance between the marks, a state is where they stand, a verdict is what an origin found, a horizon is what no origin has reached, and none of them is a new idea: each is read off those four.\n\nThe pure API `@lapxo/obligations/measures` describes error histories of origins: covariance, spectrum, effective rank and common variance. It ships M/3 as the reference conditional model with an exact rational evaluator. No measure changes a state; observed association never establishes independence. [Measures](docs/measures.md)." at=witness:040/presentation-two-pages by=target form=alphabet measure=text role=writes scope=prose/en/idea value=present
+bound-lock/1 about="Exact M0 independent-Bernoulli expectation gives R2=p^2+(1-p)^2+2c^2 p(1-p) sum w^2 for normalized declared shares; this identity is checked generally in Lean by expect_quadratic and pair_coincidence. Triple agreement satisfies R3=(3R2-1)/2 and adds no independent equation. Population agreement is not majority error or causal identification. Finite distinct-member sampling needs gamma_N, and observed data still need calibration, justified reference and uncertainty.\n" at=witness:obligations045 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-pair-coincidence shape=docs/contracts/m0-pair-coincidence.md value=lock
 bound-lock/1 about="Exact conditional procedure and state-preservation quartet; native two-place fixture captures exist. Root selected-context publication and release admission remain required." at=witness:042/native-quartet-closeout by=target form=interval measure=count needs=docs/measures.md|samples/measures/common-cause-capacity.json|vectors/measures/common-cause-capacity.cli.json role=demands scope=publication/measures/common-cause-capacity value=0..0
 bound-lock/1 about="Exact conditional procedure and state-preservation quartet; native two-place fixture captures exist. Root selected-context publication and release admission remain required." at=witness:042/native-quartet-closeout by=target form=interval measure=count needs=docs/measures.md|samples/measures/confidence.json|vectors/measures/confidence.cli.json role=demands scope=publication/measures/confidence value=0..0
 bound-lock/1 about="Exact conditional procedure and state-preservation quartet; native two-place fixture captures exist. Root selected-context publication and release admission remain required." at=witness:042/native-quartet-closeout by=target form=interval measure=count needs=docs/measures.md|samples/measures/tolerant-count.json|vectors/measures/tolerant-count.cli.json role=demands scope=publication/measures/tolerant-count value=0..0
 bound-lock/1 about="Exact rational probabilities accompany approximate binary64 logarithms under the named policy." at=witness:041/cleanup-models-and-contracts by=target form=alphabet measure=text role=writes scope=rationale/041/exact-not-log value=lock
+bound-lock/1 about="Execute the exact conditional M0 model-to-implementation proof, 22 theorem axiom audits and three named compiler negatives. Joint member product law required; no general diagonal, c=1, identification, root receipt, public delivery or release readiness is certified." at=witness:obligations046/m0-binomial-bridge by=target form=interval measure=count needs=proofs/m0-046/BridgeNegatives.lean|proofs/m0-046/M0Bridge.lean|proofs/m0-046/Obligations045.lean|proofs/m0-046/Obligations045/ConsensusGrid.lean|proofs/m0-046/Obligations045/M0Coincidence.lean|proofs/m0-046/Obligations045/M0Diagonal.lean|proofs/m0-046/Obligations045/M0Limit.lean|proofs/m0-046/Obligations045/M0Offdiag.lean|proofs/m0-046/lake-manifest.json|proofs/m0-046/lakefile.toml|proofs/m0-046/lean-toolchain|vectors/laws/m0-binomial-bridge.lean.json|contracts/m0-binomial-bridge.json|docs/contracts/m0-binomial-bridge.md|samples/laws/m0-binomial-bridge/yes/sample.json|samples/laws/m0-binomial-bridge/no/sample.json|samples/laws/m0-binomial-bridge/yes/small-binomial-table.json|samples/laws/m0-binomial-bridge/no/pairwise-is-not-joint.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-binomial-bridge value=0..0
 bound-lock/1 about="Existing static SVG illustration as declared text data; no cell computation is claimed." at=witness:041/retain-declared-documentation by=target form=alphabet measure=id needs=docs/img/cell.svg role=demands scope=view/figure shape=docs/img/cell.svg value=text
 bound-lock/1 about="Existing static SVG illustration as declared text data; no cell computation is claimed." at=witness:041/retain-declared-documentation by=target form=alphabet measure=id needs=docs/img/logo-fork.svg role=demands scope=view/logo-fork shape=docs/img/logo-fork.svg value=text
 bound-lock/1 about="Existing static SVG illustration as declared text data; no cell computation is claimed." at=witness:041/retain-declared-documentation by=target form=alphabet measure=id needs=docs/img/price.svg role=demands scope=view/ranges-price shape=docs/img/price.svg value=text
 bound-lock/1 about="Existing static SVG illustration as declared text data; no cell computation is claimed." at=witness:041/retain-declared-documentation by=target form=alphabet measure=id needs=docs/img/thermometer.svg role=demands scope=view/ranges-thermometer shape=docs/img/thermometer.svg value=text
 bound-lock/1 about="Existing static SVG illustration as declared text data; no cell computation is claimed." at=witness:041/retain-declared-documentation by=target form=alphabet measure=id needs=docs/img/withdrawal.svg role=demands scope=view/ranges-withdrawal shape=docs/img/withdrawal.svg value=text
 bound-lock/1 about="F1 bounds RI_H=I(U;V|G) for partitions on a finite uniform N-atom universe; the conditional lineage ceiling bounds I(X;aggregate) for a designated truth and declared channel. Their units are bits but their objects and cardinalities differ. Neither expression is a substitute for the other. Existing F1 path evidence is reused." at=policy:law/lineage-F1-boundary by=target form=alphabet kind=definition measure=status needs=proofs/lineage-ceiling.json|vectors/laws/lineage-ceiling.json|vectors/laws/f1/path-witness.json restsOn=law/thm-extremal|law/lineage-symmetric-markov-ceiling role=demands scope=law/lineage-F1-object-boundary value=present
+bound-lock/1 about="Finite law by enumeration: K=1..4, p=11/20..19/20, c=1/20..20/20, uniform shares. All 720 closed scores equal exact binary-configuration enumeration and lie in [0,1]. This is a static score formula, not a proof of the N-limit. The false WF expected-floor monotonicity is rejected by a normalized 21-state counterexample at N=5,p=3/4,c=9/10,w=(3,1,1)/5.\n" at=witness:obligations045 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-finite-grid shape=docs/contracts/m0-finite-grid.md value=lock
+bound-lock/1 about="Finite named X, exact rational mu_X>=0 summing to1; total deterministic maps Y=f(X), Z=g(Y); mu_Y=f_*mu_X and mu_Z=g_*mu_Y, never separately chosen priors. Zero-mass fibers contribute0. Units bits. H_mu(X|Z)=H_mu(X|Y)+H_mu(Y|Z). Loss vanishes exactly when the respective projection is injective on positive support. No independence assumption. All partitions of four named atoms, every nested coarsening, all nonnegative integer masses summing4 divided4. Binary64 log2 tolerance1e-12. This is bounded enumeration, not a universal kernel proof. General Lean proof and native admission remain pending." at=witness:obligations046/projection-chain by=target form=interval measure=count needs=vectors/laws/projection-chain.native.json|contracts/projection-chain.json|proofs/projection-chain.md|vectors/laws/policy.json|vectors/laws/projection-chain.json|samples/laws/projection-chain/yes/sample.json|samples/laws/projection-chain/no/sample.json role=demands scope=publication/evidence/projection-chain value=0..0
+bound-lock/1 about="Finite named X, exact rational mu_X>=0 summing to1; total deterministic maps Y=f(X), Z=g(Y); mu_Y=f_*mu_X and mu_Z=g_*mu_Y, never separately chosen priors. Zero-mass fibers contribute0. Units bits. H_mu(X|Z)=H_mu(X|Y)+H_mu(Y|Z). Loss vanishes exactly when the respective projection is injective on positive support. No independence assumption. All partitions of four named atoms, every nested coarsening, all nonnegative integer masses summing4 divided4. Binary64 log2 tolerance1e-12. This is bounded enumeration, not a universal kernel proof. General Lean proof and native admission remain pending.\n" at=witness:obligations046/O7 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/projection-chain shape=docs/contracts/projection-chain.md value=lock
 bound-lock/1 about="Finite nonconvex Helly counterexample, kernel checked in Lean: subsets {0,1}, {1,2}, {0,2} meet pairwise with witnesses 1,0,2 while their triple meet is empty. This does not alter the interval-only T38 or claim failure for convex intervals." at=policy:law/helly-comb by=target form=alphabet kind=theorem measure=status needs=proofs/helly-comb.json|proofs/lean/Obligations/HellyComb.lean|vectors/laws/helly-comb.lean.json|vectors/laws/helly-comb.json role=demands scope=law/helly-comb value=present
+bound-lock/1 about="Finite refutation under the published binary M0 static floor functional: p=3/4,c=9/10,neutral Wright-Fisher N=5,initial named counts(3,1,1). All21 multinomial descendant count states,including zero shares,have total probability1. The initial floor32/128=1/4 exceeds E[next floor]=92440/(128*3125)=2311/10000 by189/10000. Reuses the unchanged published Obligations045.wf_transition_normalized and wf_floor_decreases_in_expectation certificates. This refutes universal expected-floor nondecrease; it does not assert universal decrease or a new probability-limit theorem. The floor-monotone-in-t claim is refuted and its closed-lineage-law roadmap alias remains withdrawn; conditional lineage capacity is unaffected.\n" at=witness:obligations046/O3 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-wf-floor-refutation shape=docs/contracts/m0-wf-floor-refutation.md value=lock
+bound-lock/1 about="Finite refutation under the same declared M0 p=3/4,c=9/10: named weights(1,4,4)/9 and(2,2,5)/9 both have sum(w_l^2)=11/27 and K_eff=27/11,while their static floors are5/32 and1/4. Reuses the unchanged published Obligations045.same_effective_participation_different_floor certificate. Therefore K_eff alone does not determine this floor even with p,c fixed. This does not refute the distinct pair-coincidence identity and supplies no identification or uncertainty guarantee.\n" at=witness:obligations046/O3 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-keff-floor-refutation shape=docs/contracts/m0-keff-floor-refutation.md value=lock
 bound-lock/1 about="For a finite nonempty family of nonempty closed real intervals, pairwise nonempty intersection implies a nonempty total intersection. The lattice interval form supplies this finite Helly-2 case; no polygon/consensus claim for arbitrary forms. Convex families in R^d require Helly hypotheses and d+1 witnesses; discrete circle and halfplane fixtures distinguish pairs from triples. Historical alias: origins-are-a-polygon." at=policy:law/T38 by=target form=alphabet kind=theorem measure=status needs=samples/laws/t38/intervals.json|vectors/laws/t38/circle12.json|vectors/laws/t38/halfplanes.json|test/t38-forms.test.ts restsOn=law/A2-meet role=demands scope=law/T38-origins-are-a-polygon value=present
 bound-lock/1 about="For a finite nonempty set of uniformly weighted admissible states at a fixed resolution, freedom is log2 of its cardinality, equal to its Shannon entropy. A narrowing act cannot increase this quantity. Withdrawal and witnessed local join can increase it on an existing object; phase and vacuity experiments do not establish that these are the only possible changes. Historical alias: freedom-is-entropy." at=policy:law/T90 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T90-freedom-is-entropy.json|samples/no/T90-freedom-is-entropy.json|test/laws-boundaries-042.test.ts|vectors/laws/a7-t90.json restsOn=law/D4-debit-in-bits|law/A7-freedom-conserved role=demands scope=law/T90-freedom-is-entropy value=present
 bound-lock/1 about="For a finite nonempty set of uniformly weighted admissible states at fixed resolution, debit is log2 of its cardinality. A singleton has zero debit. An empty set has no uniform distribution; any zero-debit convention for empty/vacuous regions is separate from this Shannon statement." at=policy:law/D4 by=target form=alphabet kind=definition measure=status needs=samples/yes/D4-debit-in-bits.json|vectors/freedom.json|vectors/debits.json|test/laws-boundaries-042.test.ts|vectors/laws/a7-t90.json restsOn=law/A0-carrier|law/A3-resolution role=demands scope=law/D4-debit-in-bits value=present
@@ -79,6 +91,14 @@ bound-lock/1 about="For a fixed supplied collection of signed bounds with declar
 bound-lock/1 about="For finite distinct real walls and finite distinct sites strictly inside their bounding consecutive-wall intervals, grow assigns each site the interval between its wall or nearest-site midpoints. Adding another distinct interior site while retaining the walls cannot increase an existing site width: its left endpoint can only increase and its right endpoint can only decrease. No encounter, sufficient-resolution or general-form growth law follows; wall-coincident, duplicate, nonfinite and out-of-domain sites are outside this claim." at=policy:law/T39 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T39-cells-grow-until-stopped.json|src/views/product/reach.ts|test/wave.test.ts restsOn=law/A0-carrier role=demands scope=law/T39-cells-grow-until-stopped value=present
 bound-lock/1 about="For finite held real intervals and lock intervals with strictly positive finite width, stretching about each fixed midpoint eventually contains every bounded nonempty held interval; an empty held interval is never accepted by red. pour counts reached named lock places. tense interpolates touched inhabited endpoints toward their held endpoints at a handed rate in [0,1]; touching narrows width only when the held interval is no wider, and may widen it otherwise. Missing or empty observations use the specified widening rule. The historical seeded deformation counts are experiments, not a physical adaptation law." at=policy:law/T37 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T37-a-lock-is-a-mould.json|src/views/product/mould.ts|test/loom.test.ts restsOn=law/A0-carrier|law/A2-meet role=demands scope=law/T37-a-lock-is-a-mould value=present
 bound-lock/1 about="For fixed coordinates, resolution, context and signed ceilings, adding live narrowing claims cannot increase the sum of log-cardinalities of finite admissible states. Exact withdrawal and witnessed local widening may reopen freedom at the same coordinate. The blanket exclusivity claim that only a new coordinate raises freedom is not valid. Historical alias: freedom-conserved." at=policy:law/A7 by=target form=alphabet kind=axiom measure=status needs=samples/yes/A7-freedom-conserved.json|samples/no/A7-freedom-conserved.json|test/laws-boundaries-042.test.ts|vectors/laws/a7-t90.json role=demands scope=law/A7-freedom-conserved value=present
+bound-lock/1 about="For the actual M0 product law, moving-threshold majority and fair-tie transfer are conditional on standardized fixed-cut CDF convergence to F, continuous at zero. The tie atom then vanishes; conditionalError tends to F(0), hence to one half only when F(0)=1/2 is declared. The actual M0 CLT remains unpaid and open. A scalar LGN limit alone does not give half error." at=witness:obligations046/m0-diagonal-threshold by=target form=interval measure=count needs=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-threshold.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-diagonal-conditional/threshold value=0..0
+bound-lock/1 about="For the actual M0 product law, moving-threshold majority and fair-tie transfer are conditional on standardized fixed-cut CDF convergence to F, continuous at zero. The tie atom then vanishes; conditionalError tends to F(0), hence to one half only when F(0)=1/2 is declared. The actual M0 CLT remains unpaid and open. A scalar LGN limit alone does not give half error.\n" at=witness:obligations046/m0-diagonal-threshold by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-diagonal-threshold shape=docs/contracts/m0-diagonal-threshold.md value=lock
+bound-lock/1 about="For the declared binary M1 ancestor-first fixed-quota model, the complete finite generative PMF contains jointly independent named ancestor and leaf correctness bits and three independent primitive bits per member: ancestor selector, conditional leaf selector, and fresh vote. Summing unused primitive draws gives exclusive masses c1, (1-c1)c2, (1-c1)(1-c2)p and (1-c1)(1-c2)(1-p). Pushing this law to named lineage counts yields the product binomial law with q_l=c1 A_parent(l)+(1-c1)c2 B_l+(1-c1)(1-c2)p. For every finite N its fair-majority error is exactly the finite latent mixture of binomial errors. This identity is compiled in Lean without assuming a count law or convergence theorem. It does not prove an asymptotic floor, a CLT, a calibrated public API or causal identification." at=witness:obligations046/m1-generator-binomial by=target form=interval measure=count needs=proofs/m1-046-bridge/M0Bridge.lean|proofs/m1-046-bridge/M1Bridge046.lean|proofs/m1-046-bridge/Obligations045/M0Limit.lean|proofs/m1-046-bridge/Obligations045/M0Offdiag.lean|proofs/m1-046-bridge/lake-manifest.json|proofs/m1-046-bridge/lakefile.toml|proofs/m1-046-bridge/lean-toolchain|vectors/laws/m1-generator-binomial.lean.json|contracts/m1-subcauses.json|contracts/m1-generator-binomial.json|samples/laws/m1-generator-binomial/yes/sample.json|samples/laws/m1-generator-binomial/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m1-generator-binomial value=0..0
+bound-lock/1 about="For the declared binary M1 ancestor-first fixed-quota model, the complete finite generative PMF contains jointly independent named ancestor and leaf correctness bits and three independent primitive bits per member: ancestor selector, conditional leaf selector, and fresh vote. Summing unused primitive draws gives exclusive masses c1, (1-c1)c2, (1-c1)(1-c2)p and (1-c1)(1-c2)(1-p). Pushing this law to named lineage counts yields the product binomial law with q_l=c1 A_parent(l)+(1-c1)c2 B_l+(1-c1)(1-c2)p. For every finite N its fair-majority error is exactly the finite latent mixture of binomial errors. This identity is compiled in Lean without assuming a count law or convergence theorem. It does not prove an asymptotic floor, a CLT, a calibrated public API or causal identification.\n" at=witness:obligations046/O6-bridge by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m1-generator-binomial shape=docs/contracts/m1-generator-binomial.md value=lock
+bound-lock/1 about="For the declared finite binary M1 ancestor-first fixed-quota model, if every named ancestor/leaf latent configuration has score S different from1/2, the actual full-generator fair-majority error tends to the exact latent threshold functional sum_z mass(z)1{S(z)<1/2}. The proof uses the admitted finite primitive-generator/binomial bridge, prefix-quota convergence, the exact finite conditional second moment and variance at mostN/4. For any fixed epsilon>0, once the finite conditional mean divided byN lies on the correct side with margin epsilon, its error gap is at most1/(4N epsilon^2). This yields the off-diagonal limit without an assumed probability limit, ambient process oracle or CLT. A concrete shared-parent two-leaf example withp=2/3,c1=c2=1/2 meets the off-diagonal condition. Configurations onS=1/2, causal identification and calibration are outside this theorem; the three original research cards remain open." at=witness:obligations046/m1-offdiag-limit by=target form=interval measure=count needs=proofs/m1-046-offdiag/M0Bridge.lean|proofs/m1-046-offdiag/M0Diagonal046.lean|proofs/m1-046-offdiag/M0Moments046.lean|proofs/m1-046-offdiag/M1Bridge046.lean|proofs/m1-046-offdiag/M1Offdiag046.lean|proofs/m1-046-offdiag/Obligations045/M0Limit.lean|proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean|proofs/m1-046-offdiag/lake-manifest.json|proofs/m1-046-offdiag/lakefile.toml|proofs/m1-046-offdiag/lean-toolchain|vectors/laws/m1-offdiag-limit.lean.json|contracts/m1-subcauses.json|contracts/m1-offdiag-limit.json|samples/laws/m1-offdiag-limit/yes/sample.json|samples/laws/m1-offdiag-limit/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m1-offdiag-limit value=0..0
+bound-lock/1 about="For the declared finite binary M1 ancestor-first fixed-quota model, if every named ancestor/leaf latent configuration has score S different from1/2, the actual full-generator fair-majority error tends to the exact latent threshold functional sum_z mass(z)1{S(z)<1/2}. The proof uses the admitted finite primitive-generator/binomial bridge, prefix-quota convergence, the exact finite conditional second moment and variance at mostN/4. For any fixed epsilon>0, once the finite conditional mean divided byN lies on the correct side with margin epsilon, its error gap is at most1/(4N epsilon^2). This yields the off-diagonal limit without an assumed probability limit, ambient process oracle or CLT. A concrete shared-parent two-leaf example withp=2/3,c1=c2=1/2 meets the off-diagonal condition. Configurations onS=1/2, causal identification and calibration are outside this theorem; the three original research cards remain open.\n" at=witness:obligations046/O6-offdiag by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m1-offdiag-limit shape=docs/contracts/m1-offdiag-limit.md value=lock
+bound-lock/1 about="For the declared member product, c<1 and the published quota rule imply positive growing actual variance. For each epsilon>0 the member-level Lindeberg truncated-second-moment ratio is eventually exactly zero. At epsilon=0 it equals one for N>0. This is a checked CLT hypothesis, not a CLT theorem." at=witness:obligations046/m0-diagonal-lindeberg by=target form=interval measure=count needs=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-lindeberg.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-diagonal-conditional/lindeberg value=0..0
+bound-lock/1 about="For the declared member product, c<1 and the published quota rule imply positive growing actual variance. For each epsilon>0 the member-level Lindeberg truncated-second-moment ratio is eventually exactly zero. At epsilon=0 it equals one for N>0. This is a checked CLT hypothesis, not a CLT theorem.\n" at=witness:obligations046/m0-diagonal-lindeberg by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-diagonal-lindeberg shape=docs/contracts/m0-diagonal-lindeberg.md value=lock
 bound-lock/1 about="For the existing object state reading with fewer than two distinct live origin names, the cell cannot be FREE: incompatible required/signed constraints give CONFLICT first, otherwise the origin-count branch gives REQUIRED. Further claims of the same origin do not increase that distinct-name count. The seeded twenty-cell play results are experiments; player permissions, identity authenticity, independence, asymmetric economic value and an unsuspendable referee are not consequences of this state rule and remain open." at=policy:law/T57 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T57-a-refereed-game-governs-itself.json|src/lattice/obligatory.ts|src/field/encounter.ts|src/views/field/policy.ts|test/obligatory.test.ts restsOn=law/A8-four-states|law/D11-the-obligatory role=demands scope=law/T57-a-refereed-game-governs-itself value=present
 bound-lock/1 about="For two unit complex amplitudes with real phases, let delta=acos(cos(a-b)) in [0,pi]. Then |exp(ia)+exp(ib)|^2=2+2*cos(delta), and it is below 2 iff delta>pi/2. Raw absolute phase difference is not invariant under full turns. Laminarity, fork/close ratios and the F4 worst-case objective are not conclusions of this identity. Historical alias: the-quarter-turn." at=policy:law/T87 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T87-the-quarter-turn.json|samples/no/T87-the-quarter-turn.json|test/measures/t87-phase.test.ts|src/views/field/wave.ts|src/field/encounter.ts role=demands scope=law/T87-the-quarter-turn value=present
 bound-lock/1 about="Formal Lean witness for the existing A2 interval instance under LinearOrder: endpoint meet is associative, commutative and idempotent, and narrows in the published API preorder. Raw empty pairs remain distinct; observable interval meanings form a meet semilattice. Replay consequences concern fixed accumulated restrictions only, not withdrawal, widening, epochs, provenance erasure or authority. Lean compilation and finite published-JavaScript correspondence are captured; Bound admission remains open." at=policy:law/A2-interval-lean by=target form=alphabet kind=theorem measure=status needs=proofs/lean/Obligations/Cell.lean|proofs/lean/Obligations/Bridge.lean|proofs/lean/lean-toolchain|proofs/lean/lakefile.toml|proofs/lean/lake-manifest.json|vectors/laws/meet-semilattice.json|samples/laws/semilattice/yes.json|samples/laws/semilattice/no.json|src/lattice/forms.ts restsOn=law/A2-meet role=demands scope=law/A2-interval-semilattice-lean value=present
@@ -86,14 +106,20 @@ bound-lock/1 about="H1 remains open: the published resolution and encounters sam
 bound-lock/1 about="How to read it" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reading/heading value=lock
 bound-lock/1 about="In a common probability space with justified declared failure upper bounds p_i, the probability of all declared events succeeding is at least max(0,1-sum(p_i)); sum(p_i)>=1 is trivial. Agreement and copy counts do not estimate probabilities. Historical alias: freedom-is-a-currency; no transferability or unforgeability claim." at=policy:law/T18 by=target form=alphabet kind=theorem measure=status needs=samples/measures/confidence/union-bound.json|vectors/measures/confidence/expected.json role=demands scope=law/T18-freedom-is-a-currency value=present
 bound-lock/1 about="In a finite undirected graph with distinct named vertices, positive component sizes and unrestricted unit-cost fresh bridges that join only their two chosen components, a nonnegative integer budget b minimises unreachable unordered pairs by connecting the min(b+1,k) largest of k components into one. The objective is (N^2-sum(componentSize^2))/2; arbitrary site restrictions, nonuniform costs and origin-name collisions are outside this theorem. design returns a star on representatives of those components. Historical comparisons against particular blind seeds remain experiments, not universal superiority over every competing draw." at=policy:law/T51 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T51-the-shape-of-knowing-can-be-designed.json|src/views/product/design.ts|src/views/product/reach.ts|test/obligatory.test.ts restsOn=law/A0-carrier|law/A5-origin-is-extension role=demands scope=law/T51-the-shape-of-knowing-can-be-designed value=present
+bound-lock/1 about="In the declared binary M1 ancestor-first fixed-quota model, a latent configuration with every q_i=1/2 has fair-majority error exactly1/2 at every finiteN. Thus the complete implementation and primitive-generator mixture converge to the latent threshold functional whenever every latent configuration is either off diagonal or entirely unbiased. A two-level example p=3/4,c1=1/5,c2=1/6,one ancestor and one leaf has a positive-mass unbiased diagonal state and a Lean-proved full-generator error limit1/32. For heterogeneous diagonal configurations, positive fresh massd=(1-c1)(1-c2) gives variance>=N*d^2*p*(1-p), bounded quota drift, vanishing standardized threshold and the checked bounded-array Lindeberg condition for epsilon>0. These are prerequisites, not a proved general CLT. Transfer from actual primitive fixed-cut CDF limits to the moving majority cut is proved only with that distributional convergence supplied explicitly. The general heterogeneous-diagonal probability limit remains open, as do the three original research cards." at=witness:obligations046/m1-diagonal-partial by=target form=interval measure=count needs=proofs/m1-046-diagonal/M0Bridge.lean|proofs/m1-046-diagonal/M0Diagonal046.lean|proofs/m1-046-diagonal/M0Lindeberg046.lean|proofs/m1-046-diagonal/M0Moments046.lean|proofs/m1-046-diagonal/M0Threshold046.lean|proofs/m1-046-diagonal/M1Bridge046.lean|proofs/m1-046-diagonal/M1Diagonal046.lean|proofs/m1-046-diagonal/M1Offdiag046.lean|proofs/m1-046-diagonal/Obligations045/M0Limit.lean|proofs/m1-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m1-046-diagonal/lake-manifest.json|proofs/m1-046-diagonal/lakefile.toml|proofs/m1-046-diagonal/lean-toolchain|vectors/laws/m1-diagonal-partial.lean.json|contracts/m1-subcauses.json|contracts/m1-diagonal-regions.json|samples/laws/m1-diagonal-regions/yes/sample.json|samples/laws/m1-diagonal-regions/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m1-diagonal-partial value=0..0
+bound-lock/1 about="In the declared binary M1 ancestor-first fixed-quota model, a latent configuration with every q_i=1/2 has fair-majority error exactly1/2 at every finiteN. Thus the complete implementation and primitive-generator mixture converge to the latent threshold functional whenever every latent configuration is either off diagonal or entirely unbiased. A two-level example p=3/4,c1=1/5,c2=1/6,one ancestor and one leaf has a positive-mass unbiased diagonal state and a Lean-proved full-generator error limit1/32. For heterogeneous diagonal configurations, positive fresh massd=(1-c1)(1-c2) gives variance>=N*d^2*p*(1-p), bounded quota drift, vanishing standardized threshold and the checked bounded-array Lindeberg condition for epsilon>0. These are prerequisites, not a proved general CLT. Transfer from actual primitive fixed-cut CDF limits to the moving majority cut is proved only with that distributional convergence supplied explicitly. The general heterogeneous-diagonal probability limit remains open, as do the three original research cards.\n" at=witness:obligations046/O6-diagonal by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m1-diagonal-regions shape=docs/contracts/m1-diagonal-regions.md value=lock
 bound-lock/1 about="L7: conditional bound on one declared common probability space: P(N>k)<=min(1,sum over |S|=k+1 of min p_i), with rational declared marginal failure upper bounds and 0<=k<=m. Trivial iff computed upper bound is one. Counterexamples refute the former top-k+1 success guarantee. Joint-independent Bernoulli convolution is a separate declared hypothesis; rho=0 and pairwise independence do not supply it. Existing stronger 0.4.2 count bound is unchanged and needs no joint independence." at=policy:law/L7 by=target form=alphabet kind=definition measure=status needs=samples/measures/l7-tolerant-k.json|vectors/laws/l7-tolerant-k.json|vectors/laws/policy.json restsOn=law/T18-freedom-is-a-currency role=demands scope=law/L7-tolerant-k value=present view=valuation
 bound-lock/1 about="L8: law by enumeration only for 3<=n<=64, positive integer divisors p|n and integer 0<=s<p. D=log2(n/p)-h(s/p), explicit binary64-log2 approximation. Odd-period minimum uses h(floor(p/2)/p), even-period minimum uses one. Complete maximum at zero; nonzero domain has endpoints 1,p-1, empty when p=1. No information or worst-case interpretation follows from nonnegativity. T87 retains its separate wrapped-phase amplitude identity." at=policy:law/L8 by=target form=alphabet kind=definition measure=status needs=samples/measures/l8-phase-defect.json|vectors/laws/l8-phase-defect.json|vectors/laws/policy.json role=demands scope=law/L8-F4-integer-phase-defect value=present view=valuation
 bound-lock/1 about="L9: law by counterexample of existence of noninjective weighted mix, and measure with a declared prior on a finite explicitly supplied set of named-factor configurations. Equal-weight ab and ba give the same bottom tie and different named forks. Loss is H(configuration | mix)=H(configuration)-H(mix); a uniform prior must be explicitly selected, absent prior is unmeasured. The four-state uniform example has mean loss 0.5 bits and one bit conditioned on tie; the injective named fork has zero loss. Defines no new algebraic act, governance selection, M/3 or M/4 law, or destroyed field." at=policy:law/L9 by=target form=alphabet kind=definition measure=status needs=samples/measures/l9-mix-loss.json|vectors/laws/l9-mix-loss.json|vectors/laws/policy.json role=demands scope=law/L9-mix-projection-loss value=present view=valuation
 bound-lock/1 about="Learn from an example: {pages}" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/pointers/learn value=lock
 bound-lock/1 about="M/3 is the only admitted conditional model. Superseded descriptive D/commonMass claims are retired; observed commonMass remains descriptive, never strength or independence." at=witness:descriptive-measures-beside-states by=target form=alphabet measure=text role=writes scope=rationale/040/model-text value=lock
+bound-lock/1 about="M0 conditional law: normalized joint product probabilities of named individual Bernoulli outcomes push forward to the exact product-binomial count law. conditional_error_representation and model_mixture_error_representation identify that finite PMF fair-majority expectation and its normalized latent mixture with the existing conditionalError and error for every N. ambient_conditional_error_representation transfers from measurable raw-bit snapshots with that declared joint product law; no binomial count law, expected-error equality or convergence is assumed. fair_loss_average_bridge requires N>0; conditional_error_zero and zero_average_counterexample distinguish N=0. computational_offdiag_limit composes the exact representation with the existing floor_limit_offdiag_mixture theorem under its stated integrability, independence, identical-distribution, mean and measurability assumptions, plus every latent score unequal to 1/2. Domain: finite fixed K, normalized nonnegative fixed weights, p in (1/2,1), c in [0,1), published cumulative-floor allocation and fair ties. Pairwise independence alone is insufficient, certified by pairwise_not_joint. General diagonal, c=1, moment identification, root admission and release readiness are not claimed.\n" at=witness:obligations046/m0-binomial-bridge by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-binomial-bridge shape=docs/contracts/m0-binomial-bridge.md value=lock
+bound-lock/1 about="M0 with the published c<1 domain and cumulative-floor quotas. Every conditional q_i=1/2 implies exact conditionalError=1/2 for every N, including zero. A diagonal score alone does not imply every q_i=1/2. General heterogeneous diagonal remains open; c=1 is excluded and parity distinguishes its failure." at=witness:obligations046/m0-diagonal-symmetric by=target form=interval measure=count needs=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-symmetric.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-diagonal-conditional/symmetric value=0..0
+bound-lock/1 about="M0 with the published c<1 domain and cumulative-floor quotas. Every conditional q_i=1/2 implies exact conditionalError=1/2 for every N, including zero. A diagonal score alone does not imply every q_i=1/2. General heterogeneous diagonal remains open; c=1 is excluded and parity distinguishes its failure.\n" at=witness:obligations046/m0-diagonal-symmetric by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-diagonal-symmetric shape=docs/contracts/m0-diagonal-symmetric.md value=lock
 bound-lock/1 about="MIT License\n\nCopyright (c) 2026 Lapxo\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE." at=policy:license by=target form=alphabet measure=id role=demands scope=license value=MIT
 bound-lock/1 about="Named experiment: object.test.ts simulates300 independent finite interval cells,20 explicit looks per epoch,64 states per initial cell, expiry after10 epochs and200 epochs. A running signed price ledger telescopes so freedom left plus the ledger equals its initial value; the captured fixture reports steady1200 under this scheduler. That bookkeeping identity is not Shannon entropy conservation, and the finite fixture does not prove general convergence, physical attention cost or an entropy-flow claim. Historical alias: an-act-is-paid-with-attention." at=policy:law/T100 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/T100-an-act-is-paid-with-attention.json|samples/no/T100-an-act-is-paid-with-attention.json|src/debit/observer.ts|test/object.test.ts role=demands scope=law/T100-an-act-is-paid-with-attention value=present
 bound-lock/1 about="Named phase-assignment experiment: the existing fixture chooses the withdrawal epoch equal to the observation epoch when rests=false, and uses the declared withdrawal epoch when rests=true. That chosen convention yields its measured phasors, but neither-rests-on-the-other does not itself prove phase equality. A dependent withdrawal one full period later also cancels; unrelated claims assigned different phases need not. Any general concurrency-if-and-only-if-cancellation theorem requires a declared cross-clock phase-comparison rule and remains open. Historical alias: concurrent-withdrawal-cancels." at=policy:law/T104 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/T104-concurrent-withdrawal-cancels.json|samples/no/T104-concurrent-withdrawal-cancels.json|test/object.test.ts|src/views/field/wave.ts role=demands scope=law/T104-concurrent-withdrawal-cancels value=present
+bound-lock/1 about="Native installation closure update only: replace vectors/measures/installed-artifact.cli.json exactly sha256:e13401af6214851b3152214c507cc57788b68cd99b83ad02ffe56684e25bed68 -> sha256:5638dd11e9ac8a3624034048a8fe0fe20ec9e0204d7989d23e0838196643efb8 (2756 bytes). Real Node22/24 clean-consumer probes of admitted-metadata review archive sha256:55963df64637803a4373993bbeb38bd0434237acd74d87a04c4cf2f521329c68 returned PASS closed without ledger/private CAS. Actual test/export/check outputs are retained; the unchanged installed-acceptance/1 reader now returns0..0 in both places and rejects the implementation-negative by name. This does not approve or sign that tarball.1a stays unmeasured and the three research cards stay open.\n" at=witness:046/installation-native-closure by=target form=alphabet measure=text role=writes scope=prose/en/contracts/installation-046-inputs shape=docs/contracts/installation-046-inputs.md value=lock
 bound-lock/1 about="Negative excess is evidence of a deficit and is retained; no zero flooring." at=witness:041/cleanup-models-and-contracts by=target form=alphabet measure=text role=writes scope=rationale/041/signed-excess value=lock
 bound-lock/1 about="One lattice is read through several views, and each answers one question." at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reading/lead value=lock
 bound-lock/1 about="One theorem shows the theory meeting its own measurement. {sentence} {measured}" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/what-holds/measured value=lock
@@ -105,7 +131,8 @@ bound-lock/1 about="Open research demand: A separately declared reported-value m
 bound-lock/1 about="Open research demand: An explicit observation channel and identification conditions before a probe can stand for truth." at=witness:041/cleanup-models-and-contracts by=target form=interval measure=count needs=publication/models/imperfect-probes role=demands scope=model/0.4.1/imperfect-probes value=0..0
 bound-lock/1 about="Open research hypothesis; the unit-amplitude identity in T87 proves no policy advantage. Comparing disagreement-weighted and blind policies requires a declared objective, population and sampling model. Historical alias: disagreement-is-where-to-look." at=policy:law/T89 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/T89-disagreement-is-where-to-look.json|samples/no/T89-disagreement-is-where-to-look.json restsOn=law/T87-the-quarter-turn role=demands scope=law/T89-disagreement-is-where-to-look value=present
 bound-lock/1 about="Open research interpretation; not a consequence of T87. Evenly spaced phases do not always give a forks/closes ratio of one: phases 0, 2pi/3, 4pi/3 give three cancelling pairs and zero closing pairs. General faction interpretation remains open. Historical alias: turbulence-is-factions." at=policy:law/T88 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/T88-turbulence-is-factions.json|samples/no/T88-turbulence-is-factions.json restsOn=law/T87-the-quarter-turn role=demands scope=law/T88-turbulence-is-factions value=present
-bound-lock/1 about="Public API, rendered contracts, compact data and native captures, including the existing files the README links. Validation worlds and their modular dependencies are separate digest-addressed assets; no private executor is shipped in the library." at=witness:044/public-case-layout by=target form=alphabet measure=id role=reads scope=audit/wire/ships value=dist|README.md|LICENSE|TARGET.bound|receipts.bound|docs/measures.md|samples/measures|vectors/measures|samples/yes/algebra-is-closed.json|samples/yes/field-uses-price-and-debit.json|samples/yes/three-theories-one-algebra.json|src/lattice/index.ts|src/field/motion.ts|samples/yes/installed-artifact.json|samples/no/installed-artifact.json|vectors/measures/installed-artifact.cli.json|docs/img|docs/paper.md|docs/reference.md|docs/learn/in-phase.md|docs/learn/price.md|docs/learn/signature.md|docs/learn/thermometer.md|docs/learn/withdrawal.md|vectors/laws/policy.json|vectors/laws/l7-tolerant-k.json|vectors/laws/l8-phase-defect.json|vectors/laws/l9-mix-loss.json|vectors/laws/implementation-043.json|samples/laws/cofailure-pairs/no/sample.json|samples/laws/cofailure-pairs/yes/sample.json|samples/laws/linage-rest/no/sample.json|samples/laws/linage-rest/yes/sample.json|samples/laws/lineage-ceiling/no/sample.json|samples/laws/lineage-ceiling/yes/sample.json|samples/laws/marginal-information/no/sample.json|samples/laws/marginal-information/yes/sample.json|samples/laws/semilattice/no/sample.json|samples/laws/semilattice/yes/sample.json|vectors/laws/cofailure-pairs.json|vectors/laws/cofailure-pairs.native.json|vectors/laws/coordination.json|vectors/laws/f1/finite-arithmetic.json|vectors/laws/f1/path-witness.json|vectors/laws/helly-comb.json|vectors/laws/helly-comb.lean.json|vectors/laws/linage-rest.native.json|vectors/laws/lineage-ceiling.json|vectors/laws/lineage-ceiling.native.json|vectors/laws/marginal-information.json|vectors/laws/marginal-information.native.json|vectors/laws/meet-semilattice.json|vectors/laws/meet-semilattice.native.json|vectors/laws/resolution-encounters.json|proofs/lineage-ceiling.json|proofs/cofailure-pairs.json|proofs/marginal-information.json|proofs/helly-comb.json|proofs/resolution-encounters.json|proofs/coordination.json|proofs/lean/Obligations/Cell.lean|proofs/lean/Obligations/HellyComb.lean|samples/yes/H1-uncertainty.json|samples/no/H1-uncertainty.json|vectors/laws/f1/path-witness.json|vectors/laws/f1/finite-arithmetic.json
+bound-lock/1 about="Publication-attribution correction only. Preserve historical signed sources and receipts. For each path, replace exactly the old bytes by the proposed new bytes: protocols/model-collapse-1a.json sha256:a0fdca5bd239e97258aa5ba9eab3d37afc46d8a1fece767e6c35df0adf7a8ec3 -> sha256:7b8e16cbc8dff5d1654b8bb3710dd619810dde74ad8bb3a70b92dec377af736f; vectors/laws/model-collapse-1a.json sha256:a0778ca34a47aa92fd8c71fa7ca27381cdcfce825988349838dec528563fdca0 -> sha256:dda54cc8ae7d204251fd343f572093434aaee02fd272d5f4f65b5a1ff95e2d50; vectors/laws/experiment1a-protocol.native.json sha256:386ec41df834431492c6e43e644cd9a91a284b967e0bcaf16389ca3cd0709aa8 -> sha256:2b3ddb9e9d08d97d6a33c6726dc8efb298236bb9fd6a0077d0bfdaeda1c16f7b. The1a protocol stays version1 and unmeasured; no dataset retrieved, experimental execution, new model or causal claim. Existing reader/provider/runtime bytes are reused; changed input identity requires a fresh native root reading after authorized admission.\n" at=witness:046/package-candidate by=target form=alphabet measure=text role=writes scope=prose/en/contracts/experiment1a-public-attribution shape=docs/contracts/experiment1a-public-attribution.md value=lock
+bound-lock/1 about="Published member selection without a separate changelog; admitted history remains in the place." at=witness:public-documentation by=target form=alphabet measure=id role=reads scope=audit/wire/ships value=dist|README.md|LICENSE|TARGET.bound|receipts.bound|docs/measures.md|samples/measures|vectors/measures|samples/yes/algebra-is-closed.json|samples/yes/field-uses-price-and-debit.json|samples/yes/three-theories-one-algebra.json|src/lattice/index.ts|src/field/motion.ts|samples/yes/installed-artifact.json|samples/no/installed-artifact.json|vectors/measures/installed-artifact.cli.json|docs/img|docs/paper.md|docs/reference.md|docs/learn/in-phase.md|docs/learn/price.md|docs/learn/signature.md|docs/learn/thermometer.md|docs/learn/withdrawal.md|vectors/laws/policy.json|vectors/laws/l7-tolerant-k.json|vectors/laws/l8-phase-defect.json|vectors/laws/l9-mix-loss.json|vectors/laws/implementation-043.json|samples/laws/cofailure-pairs/no/sample.json|samples/laws/cofailure-pairs/yes/sample.json|samples/laws/linage-rest/no/sample.json|samples/laws/linage-rest/yes/sample.json|samples/laws/lineage-ceiling/no/sample.json|samples/laws/lineage-ceiling/yes/sample.json|samples/laws/marginal-information/no/sample.json|samples/laws/marginal-information/yes/sample.json|samples/laws/semilattice/no/sample.json|samples/laws/semilattice/yes/sample.json|vectors/laws/cofailure-pairs.json|vectors/laws/cofailure-pairs.native.json|vectors/laws/coordination.json|vectors/laws/f1/finite-arithmetic.json|vectors/laws/f1/path-witness.json|vectors/laws/helly-comb.json|vectors/laws/helly-comb.lean.json|vectors/laws/linage-rest.native.json|vectors/laws/lineage-ceiling.json|vectors/laws/lineage-ceiling.native.json|vectors/laws/marginal-information.json|vectors/laws/marginal-information.native.json|vectors/laws/meet-semilattice.json|vectors/laws/meet-semilattice.native.json|vectors/laws/resolution-encounters.json|proofs/lineage-ceiling.json|proofs/cofailure-pairs.json|proofs/marginal-information.json|proofs/helly-comb.json|proofs/resolution-encounters.json|proofs/coordination.json|proofs/lean/Obligations/Cell.lean|proofs/lean/Obligations/HellyComb.lean|samples/yes/H1-uncertainty.json|samples/no/H1-uncertainty.json|proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-allocation.lean.json|contracts/m0-allocation.json|samples/laws/m0-allocation/yes/sample.json|samples/laws/m0-allocation/no/sample.json|vectors/laws/m0-allocation.native.json|docs/contracts/m0-allocation.md|vectors/laws/m0-finite-grid.lean.json|contracts/m0-finite-grid.json|samples/laws/m0-finite-grid/yes/sample.json|samples/laws/m0-finite-grid/no/sample.json|vectors/laws/m0-finite-grid.native.json|docs/contracts/m0-finite-grid.md|vectors/laws/m0-limit-offdiag.lean.json|contracts/m0-limit-offdiag.json|samples/laws/m0-limit-offdiag/yes/sample.json|samples/laws/m0-limit-offdiag/no/sample.json|vectors/laws/m0-limit-offdiag.native.json|docs/contracts/m0-limit-offdiag.md|vectors/laws/m0-limit-diag.lean.json|contracts/m0-limit-diag.json|samples/laws/m0-limit-diag/yes/sample.json|samples/laws/m0-limit-diag/no/sample.json|docs/proofs/floor-limit-diag.proof.json|vectors/laws/m0-limit-diag.native.json|docs/contracts/m0-limit-diag.md|vectors/laws/m0-pair-coincidence.lean.json|contracts/m0-pair-coincidence.json|samples/laws/m0-pair-coincidence/yes/sample.json|samples/laws/m0-pair-coincidence/no/sample.json|vectors/laws/m0-pair-coincidence.native.json|docs/contracts/m0-pair-coincidence.md|vectors/laws/definitions.native.json|contracts/extension-lineage-participation.json|docs/contracts/extension-lineage-participation.md|proofs/definitions-046/declaration.json|src/laws/laws.bound|vectors/laws/a7-t90.json|vectors/laws/a9-t99.json|samples/laws/definitions/yes/sample.json|samples/laws/definitions/no/sample.json|vectors/laws/experiment1a-protocol.native.json|contracts/model-collapse-1a.json|protocols/model-collapse-1a.json|docs/contracts/model-collapse-1a.md|proofs/experiment1a-046/declaration.json|vectors/laws/model-collapse-1a.json|samples/laws/experiment1a/yes/sample.json|samples/laws/experiment1a/no/sample.json|proofs/m0-046/BridgeNegatives.lean|proofs/m0-046/M0Bridge.lean|proofs/m0-046/Obligations045.lean|proofs/m0-046/Obligations045/ConsensusGrid.lean|proofs/m0-046/Obligations045/M0Coincidence.lean|proofs/m0-046/Obligations045/M0Diagonal.lean|proofs/m0-046/Obligations045/M0Limit.lean|proofs/m0-046/Obligations045/M0Offdiag.lean|proofs/m0-046/lake-manifest.json|proofs/m0-046/lakefile.toml|proofs/m0-046/lean-toolchain|vectors/laws/m0-binomial-bridge.lean.json|contracts/m0-binomial-bridge.json|docs/contracts/m0-binomial-bridge.md|samples/laws/m0-binomial-bridge/yes/sample.json|samples/laws/m0-binomial-bridge/no/sample.json|samples/laws/m0-binomial-bridge/yes/small-binomial-table.json|samples/laws/m0-binomial-bridge/no/pairwise-is-not-joint.json|contracts/m0-diagonal-conditional.json|proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|samples/laws/m0-diagonal-conditional/no/sample.json|samples/laws/m0-diagonal-conditional/yes/sample.json|vectors/laws/m0-diagonal-lindeberg.lean.json|vectors/laws/m0-diagonal-moments.lean.json|vectors/laws/m0-diagonal-symmetric.lean.json|vectors/laws/m0-diagonal-threshold.lean.json|proofs/m0-046-identification/M0Identification046.lean|proofs/m0-046-identification/Obligations045/M0Coincidence.lean|proofs/m0-046-identification/lake-manifest.json|proofs/m0-046-identification/lakefile.toml|proofs/m0-046-identification/lean-toolchain|vectors/laws/m0-identification.lean.json|contracts/m0-moment-identification.json|samples/laws/m0-moment-identification/yes/sample.json|samples/laws/m0-moment-identification/no/sample.json|proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/m0-keff-interval.json|vectors/laws/m0-uncertainty-blocks.lean.json|vectors/laws/m0-uncertainty-interval.lean.json|vectors/laws/m0-uncertainty-finite-discord.lean.json|proofs/m1-046-diagonal/M0Bridge.lean|proofs/m1-046-diagonal/M0Diagonal046.lean|proofs/m1-046-diagonal/M0Lindeberg046.lean|proofs/m1-046-diagonal/M0Moments046.lean|proofs/m1-046-diagonal/M0Threshold046.lean|proofs/m1-046-diagonal/M1Bridge046.lean|proofs/m1-046-diagonal/M1Diagonal046.lean|proofs/m1-046-diagonal/M1Offdiag046.lean|proofs/m1-046-diagonal/Obligations045/M0Limit.lean|proofs/m1-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m1-046-diagonal/lake-manifest.json|proofs/m1-046-diagonal/lakefile.toml|proofs/m1-046-diagonal/lean-toolchain|vectors/laws/m1-diagonal-partial.lean.json|contracts/m1-subcauses.json|contracts/m1-diagonal-regions.json|samples/laws/m1-diagonal-regions/yes/sample.json|samples/laws/m1-diagonal-regions/no/sample.json|proofs/m1-046-bridge/M0Bridge.lean|proofs/m1-046-bridge/M1Bridge046.lean|proofs/m1-046-bridge/Obligations045/M0Limit.lean|proofs/m1-046-bridge/Obligations045/M0Offdiag.lean|proofs/m1-046-bridge/lake-manifest.json|proofs/m1-046-bridge/lakefile.toml|proofs/m1-046-bridge/lean-toolchain|vectors/laws/m1-generator-binomial.lean.json|contracts/m1-generator-binomial.json|samples/laws/m1-generator-binomial/yes/sample.json|samples/laws/m1-generator-binomial/no/sample.json|proofs/m1-046-offdiag/M0Bridge.lean|proofs/m1-046-offdiag/M0Diagonal046.lean|proofs/m1-046-offdiag/M0Moments046.lean|proofs/m1-046-offdiag/M1Bridge046.lean|proofs/m1-046-offdiag/M1Offdiag046.lean|proofs/m1-046-offdiag/Obligations045/M0Limit.lean|proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean|proofs/m1-046-offdiag/lake-manifest.json|proofs/m1-046-offdiag/lakefile.toml|proofs/m1-046-offdiag/lean-toolchain|vectors/laws/m1-offdiag-limit.lean.json|contracts/m1-offdiag-limit.json|samples/laws/m1-offdiag-limit/yes/sample.json|samples/laws/m1-offdiag-limit/no/sample.json|vectors/laws/projection-chain.native.json|contracts/projection-chain.json|proofs/projection-chain.md|vectors/laws/projection-chain.json|samples/laws/projection-chain/yes/sample.json|samples/laws/projection-chain/no/sample.json|vectors/laws/definitions.native-capture.json|vectors/laws/experiment1a-protocol.native-capture.json|vectors/laws/m0-identification.native-capture.json|vectors/laws/m0-uncertainty.native-capture.json|vectors/laws/m1-diagonal-partial.native-capture.json|vectors/laws/m1-generator-binomial.native-capture.json|vectors/laws/m1-offdiag-limit.native-capture.json|vectors/laws/projection-chain.native-capture.json|vectors/laws/experiment1a-public-input.native-capture.json|docs/img/logo.svg|docs/img/logo-fork.svg|docs/img/cell.svg|docs/img/withdrawal.svg|docs/img/price.svg|docs/img/thermometer.svg|docs/contracts/m0-moment-identification.md|docs/contracts/projection-chain.md|docs/contracts/m0-wf-floor-refutation.md|docs/contracts/m0-keff-floor-refutation.md|docs/contracts/m0-diagonal-threshold.md|docs/contracts/m1-generator-binomial.md|docs/contracts/m1-offdiag-limit.md|docs/contracts/m0-diagonal-lindeberg.md|docs/contracts/m1-diagonal-regions.md|docs/contracts/m0-diagonal-symmetric.md|docs/contracts/m0-keff-interval.md|docs/contracts/m0-diagonal-moments.md|docs/contracts/m0-refuted-inverses.md|docs/contracts/experiment1a-public-attribution.md|docs/contracts/installation-046-inputs.md
 bound-lock/1 about="Read admitted obligations and their native evidence; unit-test success alone cannot make a release ready." at=witness:descriptive-measures-beside-states by=target form=alphabet measure=id role=writes scope=release/blocks value=algebra|contracts|artifact
 bound-lock/1 about="Read the existing instrument programs region and its real release-policy verdict; this declares no new operation or library export." at=policy:041/release-verdict-visible by=target form=alphabet measure=id role=demands scope=view/programs value=programs
 bound-lock/1 about="Reduction to a discrete join — Every pair with trivial meet can be transformed, without decreasing $\\RI_H$ and in finitely many steps, into a pair on the same $n$ states with trivial meet and discrete join." at=policy:law/lem-join by=target form=alphabet kind=corollary measure=status needs=samples/yes/lem-join.json|test/f1-boundary-042.test.ts|vectors/laws/f1/path-witness.json restsOn=law/lem-identity role=demands scope=law/lem-join value=present
@@ -138,7 +165,11 @@ bound-lock/1 about="Research status: experiment, one-origin structural interpret
 bound-lock/1 about="Research status: experiment, one-origin structural interpretation; general/physical-law reading open. stated as a hint and never as a claim about the world: if what is is a field of floors and ceilings, a distant signature changes a cell whose own record never moved, and in two hundred trials of one cell holding one value the verdict came out both ways, so nothing stored at the cell explains the difference and what explains it is the bound the cell rests on; the resemblance is structural and never arithmetic, with no continuous amplitudes and no inequality violated by number; structural resemblance, one origin, not a claim about the world" at=policy:law/H3 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/H3-a-distant-signature-moves-a-cell-that-did-not-move.json|samples/no/H3-a-distant-signature-moves-a-cell-that-did-not-move.json restsOn=law/T46-a-bound-moves-cells-no-walk-reaches|law/T47-a-two-pole-object role=demands scope=law/H3-a-distant-signature-moves-a-cell-that-did-not-move value=present
 bound-lock/1 about="Research status: open beyond the supplied sufficient-resolution fixtures. In a finite declared chain of resolutions, a coarsest resolution preserving the finest verdict exists because the finest itself qualifies; it need not be strictly coarser than the finest. The historical unconditional strict-coarsening claim is not a theorem." at=policy:law/T7 by=target form=alphabet kind=conjecture measure=status needs=samples/yes/T7-sufficient-resolution.json|samples/no/A3-resolution.json|vectors/info/sufficient-resolution.json restsOn=law/A3-resolution role=demands scope=law/T7-sufficient-resolution value=present
 bound-lock/1 about="Run it" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/learn/run value=lock
-bound-lock/1 about="Scoped conditional measures and law boundaries beside the unchanged algebra." at=witness:044/prepared-release-metadata by=target form=alphabet measure=id role=writes scope=version shape=package.json value=0.4.4
+bound-lock/1 about="Scoped M0 candidate reading: execute declared Lean inputs, declared theorem audit and named negative under the unchanged 25-second global reader ceiling. Does not certify a general diagonal limit, causal identification, public delivery or release readiness." at=witness:obligations045/m0-allocation by=target form=interval measure=count needs=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-allocation.lean.json|contracts/m0-allocation.json|samples/laws/m0-allocation/yes/sample.json|samples/laws/m0-allocation/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-allocation value=0..0
+bound-lock/1 about="Scoped M0 candidate reading: execute declared Lean inputs, declared theorem audit and named negative under the unchanged 25-second global reader ceiling. Does not certify a general diagonal limit, causal identification, public delivery or release readiness." at=witness:obligations045/m0-finite-grid by=target form=interval measure=count needs=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-finite-grid.lean.json|contracts/m0-finite-grid.json|samples/laws/m0-finite-grid/yes/sample.json|samples/laws/m0-finite-grid/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-finite-grid value=0..0
+bound-lock/1 about="Scoped M0 candidate reading: execute declared Lean inputs, declared theorem audit and named negative under the unchanged 25-second global reader ceiling. Does not certify a general diagonal limit, causal identification, public delivery or release readiness." at=witness:obligations045/m0-limit-diag by=target form=interval measure=count needs=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-limit-diag.lean.json|contracts/m0-limit-diag.json|samples/laws/m0-limit-diag/yes/sample.json|samples/laws/m0-limit-diag/no/sample.json|vectors/laws/policy.json|docs/proofs/floor-limit-diag.proof.json role=demands scope=publication/evidence/m0-limit-diag value=0..0
+bound-lock/1 about="Scoped M0 candidate reading: execute declared Lean inputs, declared theorem audit and named negative under the unchanged 25-second global reader ceiling. Does not certify a general diagonal limit, causal identification, public delivery or release readiness." at=witness:obligations045/m0-limit-offdiag by=target form=interval measure=count needs=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-limit-offdiag.lean.json|contracts/m0-limit-offdiag.json|samples/laws/m0-limit-offdiag/yes/sample.json|samples/laws/m0-limit-offdiag/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-limit-offdiag value=0..0
+bound-lock/1 about="Scoped M0 candidate reading: execute declared Lean inputs, declared theorem audit and named negative under the unchanged 25-second global reader ceiling. Does not certify a general diagonal limit, causal identification, public delivery or release readiness." at=witness:obligations045/m0-pair-coincidence by=target form=interval measure=count needs=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-pair-coincidence.lean.json|contracts/m0-pair-coincidence.json|samples/laws/m0-pair-coincidence/yes/sample.json|samples/laws/m0-pair-coincidence/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-pair-coincidence value=0..0
 bound-lock/1 about="T58 counted one historical tree. Retire the universal leaves>regions assertion; preserve the historical observation and the expected-refusal counterexample with a legal empty region." at=witness:descriptive-measures-beside-states by=target form=alphabet measure=text role=writes scope=rationale/040/T58 value=lock
 bound-lock/1 about="The 43 expected-refusal failures came from a borrowed adapter that ignored expected.ok=false; restore the original Obligations comparison. The field case loop now checks its returned boolean. No algebra or expected vector answer changes." at=witness:descriptive-measures-beside-states by=target form=alphabet measure=text role=writes scope=rationale/040/test-adapter value=lock
 bound-lock/1 about="The complete descriptive and M/3 contract, controlled procedures and captured vectors, rendered from own prose." at=witness:040/presentation-two-pages by=target form=alphabet measure=id role=demands scope=view/measures shape=docs/measures.md value=text
@@ -162,15 +193,24 @@ bound-lock/1 about="The {count} views and the question each answers" at=witness:
 bound-lock/1 about="Try it" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/first-use/heading value=lock
 bound-lock/1 about="Two readings with identical complete live claims, values, form, resolution, epoch/effective ordering and required world/mark context return the same deterministic meet and verdict. For the published point fixture, identical full seen records give identical potential/disagreement verdicts. Equal origin names alone do not ensure equal readings; claims and context may differ. The seeded observer counts are finite experiments; no universal horizon-only explanation of disagreement is asserted." at=policy:law/T42 by=target form=alphabet kind=theorem measure=status needs=samples/yes/T42-no-privileged-observer.json|src/field/encounter.ts|src/field/meet.ts|src/lattice/obligatory.ts|test/wave.test.ts restsOn=law/A0-carrier|law/A2-meet|law/A4-epoch role=demands scope=law/T42-no-privileged-observer value=present
 bound-lock/1 about="Two-Sided Constraints on a Valued Lattice" at=witness:a-paper-cited-by-its-slug by=target form=alphabet measure=doi role=writes scope=cites/two-sided-constraints value=10.5281/zenodo.21858428
+bound-lock/1 about="Under the declared binary M0 conditional-population-iid member design, finite-cell pair discord has the published population disagreement mean. ForT jointly independent complete cells, the all-pairs average is a bounded whole-cell statistic: its tail is at most min(1,1/(4T epsilon^2)), not a bound withT multiplied by the number of pairs. External coverage-calibrated p,c boxes and their union error budgets propagate through the positive M0 denominator to a conditional outer K_eff enclosure. A denominator that may approach zero has no certified finite upper bound unless a valid external cap is declared. Missing calibration is unmeasured; an incompatible confidence box is not an unconditional rejection of the model. No finite interval establishes causal independence." at=witness:obligations046/m0-uncertainty-blocks by=target form=interval measure=count needs=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-blocks.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json role=demands scope=publication/evidence/m0-uncertainty/blocks value=0..0
+bound-lock/1 about="Under the declared binary M0 conditional-population-iid member design, finite-cell pair discord has the published population disagreement mean. ForT jointly independent complete cells, the all-pairs average is a bounded whole-cell statistic: its tail is at most min(1,1/(4T epsilon^2)), not a bound withT multiplied by the number of pairs. External coverage-calibrated p,c boxes and their union error budgets propagate through the positive M0 denominator to a conditional outer K_eff enclosure. A denominator that may approach zero has no certified finite upper bound unless a valid external cap is declared. Missing calibration is unmeasured; an incompatible confidence box is not an unconditional rejection of the model. No finite interval establishes causal independence." at=witness:obligations046/m0-uncertainty-finite-discord by=target form=interval measure=count needs=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-finite-discord.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json role=demands scope=publication/evidence/m0-uncertainty/finite-discord value=0..0
+bound-lock/1 about="Under the declared binary M0 conditional-population-iid member design, finite-cell pair discord has the published population disagreement mean. ForT jointly independent complete cells, the all-pairs average is a bounded whole-cell statistic: its tail is at most min(1,1/(4T epsilon^2)), not a bound withT multiplied by the number of pairs. External coverage-calibrated p,c boxes and their union error budgets propagate through the positive M0 denominator to a conditional outer K_eff enclosure. A denominator that may approach zero has no certified finite upper bound unless a valid external cap is declared. Missing calibration is unmeasured; an incompatible confidence box is not an unconditional rejection of the model. No finite interval establishes causal independence." at=witness:obligations046/m0-uncertainty-interval by=target form=interval measure=count needs=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-interval.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json role=demands scope=publication/evidence/m0-uncertainty/interval value=0..0
+bound-lock/1 about="Under the declared binary M0 conditional-population-iid member design, finite-cell pair discord has the published population disagreement mean. ForT jointly independent complete cells, the all-pairs average is a bounded whole-cell statistic: its tail is at most min(1,1/(4T epsilon^2)), not a bound withT multiplied by the number of pairs. External coverage-calibrated p,c boxes and their union error budgets propagate through the positive M0 denominator to a conditional outer K_eff enclosure. A denominator that may approach zero has no certified finite upper bound unless a valid external cap is declared. Missing calibration is unmeasured; an incompatible confidence box is not an unconditional rejection of the model. No finite interval establishes causal independence.\n" at=witness:obligations046/O5 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-keff-interval shape=docs/contracts/m0-keff-interval.md value=lock
+bound-lock/1 about="Under the declared joint independent Bernoulli member product, the existing sum n_i*q_i and sum n_i*q_i*(1-q_i) equal the actual mean and variance. These identities hold for every finite N. Marginals alone do not justify the variance sum, as the correlated-pair negative demonstrates." at=witness:obligations046/m0-diagonal-moments by=target form=interval measure=count needs=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-moments.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json role=demands scope=publication/evidence/m0-diagonal-conditional/moments value=0..0
+bound-lock/1 about="Under the declared joint independent Bernoulli member product, the existing sum n_i*q_i and sum n_i*q_i*(1-q_i) equal the actual mean and variance. These identities hold for every finite N. Marginals alone do not justify the variance sum, as the correlated-pair negative demonstrates.\n" at=witness:obligations046/m0-diagonal-moments by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-diagonal-moments shape=docs/contracts/m0-diagonal-moments.md value=lock
 bound-lock/1 about="Under uniform truth and an independent covering-cause indicator of mass c, active observations copy one n-ary symmetric channel of accuracy q; I(truth;observations) <= log2(n)-c*(h(q)+(1-q)*log2(n-1)); copies add no information. Historical alias: reliability-is-encounter-rate. No achievability or partial governance claim." at=policy:law/T12 by=target form=alphabet kind=theorem measure=status needs=samples/measures/t12/common-cause.json|vectors/measures/t12/expected.json role=demands scope=law/T12-reliability-is-encounter-rate value=present
 bound-lock/1 about="Unpaid: a separately declared generative model, parameters, identifiability conditions, captured procedure and falsifier are required. M/3 does not infer these from absence." at=witness:descriptive-measures-beside-states by=target form=interval measure=count needs=publication/models/cross-cell-dependence role=demands scope=model/0.5/cross-cell-dependence value=0..0
 bound-lock/1 about="Unpaid: a separately declared generative model, parameters, identifiability conditions, captured procedure and falsifier are required. M/3 does not infer these from absence." at=witness:descriptive-measures-beside-states by=target form=interval measure=count needs=publication/models/interest-identification role=demands scope=model/0.5/interest-identification value=0..0
 bound-lock/1 about="Unpaid: a separately declared generative model, parameters, identifiability conditions, captured procedure and falsifier are required. M/3 does not infer these from absence." at=witness:descriptive-measures-beside-states by=target form=interval measure=count needs=publication/models/time-model role=demands scope=model/0.5/time-model value=0..0
+bound-lock/1 about="Unsigned candidate release metadata; owner admission pending." at=witness:046/package-candidate by=target form=alphabet measure=id role=writes scope=version shape=package.json value=0.4.6
+bound-lock/1 about="Validate exact versioned1a protocol and retain empirical status unmeasured; count0 denotes no protocol-validation defects, not an empirical measurement or closed causal demand." at=witness:obligations046/experiment1a-protocol by=target form=interval measure=count needs=vectors/laws/experiment1a-protocol.native.json|contracts/model-collapse-1a.json|protocols/model-collapse-1a.json|docs/contracts/model-collapse-1a.md|proofs/experiment1a-046/declaration.json|vectors/laws/policy.json|vectors/laws/model-collapse-1a.json|samples/laws/experiment1a/yes/sample.json|samples/laws/experiment1a/no/sample.json role=demands scope=publication/evidence/experiment1a-protocol value=0..0
 bound-lock/1 about="Validation runs through declared modular worlds. Their executors do not ship in the pure library." at=witness:041/cleanup-models-and-contracts by=target form=alphabet measure=text role=writes scope=rationale/041/readers-not-library value=lock
 bound-lock/1 about="What holds" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/what-holds/heading value=lock
 bound-lock/1 about="What is open" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/open/heading value=lock
 bound-lock/1 about="What it rests on" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/learn/rests value=lock
 bound-lock/1 about="What the object rests on" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reference/rests value=lock
+bound-lock/1 about="Withdrawals preserve history. dark-K-from-error remains withdrawn as a generally single-valued inverse: at p=3/4,c=1/2,uniform K=3 andK=5 have the same static floor1/64,certified by the unchanged published Obligations045.inverse_alias theorem. closed-lineage-law denotes the roadmap WF expected-floor nondecrease proposal and remains withdrawn with the21-state WF witness; it does not denote the valid separately conditioned capacityP0/data-processing statement. No statement here closes conditional-lineage-identification,causal-subgroup-recovery,oracle-free-reference or the actual heterogeneous M0 CLT.\n" at=witness:obligations046/O3 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-refuted-inverses shape=docs/contracts/m0-refuted-inverses.md value=lock
 bound-lock/1 about="[Its source]({at}) is one of the examples of {place}, and it runs as it is written, against the built package, with nothing compiled for it." at=witness:a-state-said-as-two-booleans by=target form=alphabet measure=text role=writes scope=prose/en/learn/source value=lock
 bound-lock/1 about="a claim from one origin is potential; a cell is information only where two independent origins touch it and their intervals meet" at=policy:law/A1 by=target form=alphabet kind=axiom measure=status needs=samples/yes/A1-encounter.json|samples/no/A1-encounter.json|vectors/encounter.json role=demands scope=law/A1-encounter value=present
 bound-lock/1 about="a constant whose name is a card rather than a value: a screaming name bound to one string names a place, and a place belongs in the lock" at=policy:no-hazards by=target form=interval measure=count role=reads scope=hazard/marker-const/src/** value=0..0
@@ -214,6 +254,9 @@ bound-lock/1 about="every observation has a scale; hierarchy is resolution; a co
 bound-lock/1 about="every operation offered, with how many vectors reached it" at=policy:region/offers by=target form=alphabet measure=text role=writes scope=region/offers value=readings
 bound-lock/1 about="every operation with its signature, its derived refusals, what it reaches and the laws it rests on; every law with its kind, view, premises, sentence and whether it reproduces; every form" at=witness:no-page-a-reader-looks-things-up-in by=target form=alphabet measure=text role=writes scope=region/reference value=lock
 bound-lock/1 about="every quantity has two poles, a floor that is required and a ceiling that is permitted, and a cell is the pair" at=policy:law/A0 by=target form=alphabet kind=axiom measure=status needs=samples/yes/A0-carrier.json|samples/no/A0-carrier.json|vectors/closure.json role=demands scope=law/A0-carrier value=present
+bound-lock/1 about="floor_limit_diag: vector plus written proof, NOT a general Lean theorem. For 0<=c<1, p in (1/2,1), cumulative-floor quotas and S(A)=1/2, variance is order N and quota mean shift is O(1); the standard independent-array normal approximation yields error tending to 1/2. Finite vector: K=1,p=3/4,c=1/3,w=[1], N=1..12; A=0 has q=1/2, A=1 has q=5/6, target floor=1/8. The finite unbiased diagonal identity is kernel-checked; it does not establish a general limit. theta=0 belongs to this diagonal and retains mass (1-p)^K/2. c=1 is excluded: its zero conditional variance needs a separate tie-preserving allocation contract.\n" at=witness:obligations045 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-limit-diag shape=docs/contracts/m0-limit-diag.md value=lock
+bound-lock/1 about="floor_limit_offdiag_M0 and floor_limit_offdiag_mixture: conditional on each fixed latent A, actual jointly independent Bernoulli lineage draws with mean q_l=(1-c)p+c A_l satisfy lineage_lgn. The proved cumulative-floor allocation gives member_average_lgn. If S(A)=sum w_l q_l differs from 1/2, the fair-majority loss tends almost surely to 1{S<1/2}; dominated convergence gives its probability limit. The mixture theorem requires no S(A)=1/2 for every latent state. Technical hypotheses: integrability, identical distribution, independence and measurability are explicit in the formal statement. No ConditionalTailLimits or CLT is assumed by the off-diagonal theorem. The Lean probability formulation uses actual lineage arrays and integrals; equivalence to the separate computational binomial-sum definition is not kernel-proved here.\n" at=witness:obligations045 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-limit-offdiag shape=docs/contracts/m0-limit-offdiag.md value=lock
+bound-lock/1 about="floor_quota_bounds: K>=1, named nonnegative weights summing to one, p in (1/2,1), c in [0,1). Set W_i=sum_{j<i}w_j, n_i(N)=floor(N W_{i+1})-floor(N W_i). Lean proves sum n_i=N, -1<n_i-Nw_i<1, n_i/N tends to w_i, positive-share counts tend to infinity and zero-share counts vanish. Transport counts, membership and weights under permutation.\n" at=witness:obligations045 by=target form=alphabet measure=text role=writes scope=prose/en/contracts/m0-allocation shape=docs/contracts/m0-allocation.md value=lock
 bound-lock/1 about="four real calls and what each of them answers" at=policy:region/thirty-seconds by=target form=alphabet measure=text role=writes scope=region/thirty-seconds value=prose
 bound-lock/1 about="how a reader installs the package: this verb, then the name its manifest carries" at=witness:a-door-that-never-said-how-to-install-it by=target form=alphabet measure=id needs=package.json role=writes scope=install value="npm install"
 bound-lock/1 about="how many epochs a region spans, from its first line to its last" at=policy:region/width by=target form=alphabet measure=text role=writes scope=region/width value=lock-and-readings
@@ -236,7 +279,7 @@ bound-lock/1 about="lane D's window widened to 380 for the base: receipts at a r
 bound-lock/1 about="lines that stand on one origin and are therefore not yet information" at=policy:region/grey by=target form=alphabet measure=text role=writes scope=region/grey value=lock
 bound-lock/1 about="name: release\non:\n  workflow_run:\n    workflows: [tag]\n    types: [completed]\n  workflow_dispatch:\njobs:\n  stage:\n    if: github.event_name == 'workflow_dispatch' || (github.event.workflow_run.conclusion == 'success' && github.event.workflow_run.head_branch == 'main')\n    concurrency: release-delivery\n    environment: release\n    runs-on: ubuntu-latest\n    permissions:\n      contents: write\n      id-token: write\n    steps:\n      - uses: actions/checkout@v4\n        with:\n          ref: ${{ github.event.workflow_run.head_sha || github.sha }}\n      - uses: actions/setup-node@v4\n        with:\n          node-version: 24\n      - run: npm install --prefix .instrument --no-save --ignore-scripts @lapxo/bound@0.2.1\n      - run: npm install --global npm@'12.1.0' --ignore-scripts\n      - name: Prepare release\n        env:\n          GH_TOKEN: ${{ github.token }}\n        run: |\n          set -euo pipefail\n          TAG=\"v$(node -p \"require('./package.json').version\")\"\n          printf 'TAG=%s\\n' \"$TAG\" >> \"$GITHUB_ENV\"\n          git fetch origin \"refs/tags/$TAG:refs/tags/$TAG\"\n          gh api --paginate \"repos/$GITHUB_REPOSITORY/releases\" --jq '.[].tag_name' > \"$RUNNER_TEMP/release-tags\"\n          if grep -Fxq \"$TAG\" \"$RUNNER_TEMP/release-tags\"; then\n            printf 'RELEASE %s · exists\\n' \"$TAG\"\n          else\n            gh release create \"$TAG\" --verify-tag --draft --title \"$TAG\" --generate-notes\n            printf 'RELEASE %s · draft created · awaiting signed assets\\n' \"$TAG\"\n          fi\n      - name: Read owner approval\n        env:\n          GH_TOKEN: ${{ github.token }}\n        run: |\n          set -euo pipefail\n          mkdir .release\n          gh release download \"$TAG\" --pattern approval-signed --dir .release\n          node .instrument/node_modules/@lapxo/bound/dist/cli/verb.js fold --as release .release/approval-signed > .release/verdict\n          cat .release/verdict\n      - name: Stage the approved release archive\n        env:\n          GH_TOKEN: ${{ github.token }}\n        run: |\n          set -euo pipefail\n          read -r status digest archive source extra < .release/verdict\n          test \"$status\" = READY\n          test -z \"$extra\"\n          gh release download \"$TAG\" --pattern \"$archive\" --dir .release\n          printf '%s  %s\\n' \"${digest#sha256:}\" \".release/$archive\" | sha256sum -c -\n          expected=\"$(node -p \"require('./package.json').name+'@'+require('./package.json').version\")\"\n          actual=\"$(tar -xOf \".release/$archive\" package/package.json | node -p \"const p=JSON.parse(require('fs').readFileSync(0,'utf8'));p.name+'@'+p.version\")\"\n          test \"$actual\" = \"$expected\"\n          printf 'SOURCE release/%s/%s · %s · declared %s\\n' \"$TAG\" \"$archive\" \"$digest\" \"$source\"\n          gh release edit \"$TAG\" --draft=false\n          printf 'RELEASE %s · published · %s\\n' \"$TAG\" \"$digest\"\n          npm stage publish \".release/$archive\" --access public --ignore-scripts\n          printf 'STAGED %s · %s · owner approval pending\\n' \"$actual\" \"$digest\"\n" at=witness:043/native-closure by=target form=alphabet measure=text role=writes scope=prose/en/pipeline/approved-delivery shape=.github/workflows/release.yml value=lock
 bound-lock/1 about="name: tag\non:\n  workflow_run:\n    workflows: [test]\n    types: [completed]\njobs:\n  tag:\n    if: github.event.workflow_run.conclusion == 'success' && github.event.workflow_run.event == 'push' && github.event.workflow_run.head_branch == 'main'\n    runs-on: ubuntu-latest\n    permissions:\n      contents: write\n    steps:\n      - uses: actions/checkout@v4\n        with:\n          ref: ${{ github.event.workflow_run.head_sha }}\n          fetch-depth: 0\n      - run: |\n          version=\"v$(node -p \"require('./package.json').version\")\"\n          git tag --list \"$version\" | grep -q . && exit 0\n          git tag \"$version\" && git push origin \"$version\"\n" at=witness:043/native-closure by=target form=alphabet measure=text role=writes scope=prose/en/pipeline/checked-tag shape=.github/workflows/tag.yml value=lock
-bound-lock/1 about="name: test\njobs:\n  test:\n    strategy:\n      matrix:\n        node:\n        - 22\n        - 24\n    runs-on: ubuntu-latest\n    permissions:\n      contents: write\n    steps:\n    - uses: actions/checkout@v4\n    - uses: actions/setup-node@v4\n      with:\n        node-version: ${{ matrix.node }}\n    - run: npm ci\n    - run: npm run build\n    - run: npm test\n    - name: Lay the declared historical proof reader\n      env:\n        GH_TOKEN: ${{ github.token }}\n      run: |\n        set -euo pipefail\n        mkdir -p .bound/cas/blobs\n        gh release download \"v$(node -p \"require('./package.json').version\")\" --pattern 5399fdc87cb104b5030e092e213ad6584004c6d4de49e716838081ae1f2e4182 --pattern 8655c52a0a4f6e19c883f2fe50b8f34eaa2cee7b21ac14b635a1a70130ab45fd --dir .bound/cas/blobs\n    - run: npm exec --yes --package=@lapxo/bound@0.2.1 --package=@lapxo/topos@0.2.0 -- bound fold --check\n  lean:\n    runs-on: ubuntu-24.04\n    permissions:\n      contents: write\n    defaults:\n      run:\n        shell: bash\n        working-directory: proofs/lean\n    steps:\n    - uses: actions/checkout@v4\n    - name: Install pinned Elan\n      shell: bash\n      run: |\n        set -euo pipefail\n        curl --fail --location --proto '=https' --proto-redir '=https' https://github.com/leanprover/elan/releases/download/v4.2.4/elan-x86_64-unknown-linux-gnu.tar.gz --output \"$RUNNER_TEMP/elan.tar.gz\"\n        printf '%s  %s\\n' 42b94d4244e8353142c456ec0e4ca6528fd898a6c604d4059f494e706e431f63 \"$RUNNER_TEMP/elan.tar.gz\" | sha256sum --check\n        mkdir \"$RUNNER_TEMP/elan-installer\"\n        tar -xzf \"$RUNNER_TEMP/elan.tar.gz\" -C \"$RUNNER_TEMP/elan-installer\"\n        \"$RUNNER_TEMP/elan-installer/elan-init\" -y --default-toolchain none\n        printf '%s\\n' \"$HOME/.elan/bin\" >> \"$GITHUB_PATH\"\n    - uses: actions/cache@v4\n      with:\n        path: |-\n          ~/.elan/toolchains\n          proofs/lean/.lake\n        key: lean-${{ runner.os }}-${{ runner.arch }}-${{ hashFiles('proofs/lean/lean-toolchain', 'proofs/lean/lakefile.toml', 'proofs/lean/lake-manifest.json') }}-${{\n          hashFiles('proofs/lean/**/*.lean') }}\n        restore-keys: lean-${{ runner.os }}-${{ runner.arch }}-${{ hashFiles('proofs/lean/lean-toolchain', 'proofs/lean/lakefile.toml', 'proofs/lean/lake-manifest.json')\n          }}-\n    - uses: actions/setup-node@v4\n      with:\n        node-version: 24\n    - name: Prepare locked compiler image\n      run: |\n        set -euo pipefail\n        elan toolchain install \"$(cat lean-toolchain)\"\n        lean --version\n        lake exe cache get Mathlib.Order.Interval.Set.Basic\n    - name: Install the published instrument\n      working-directory: .\n      run: npm install --prefix \"$RUNNER_TEMP/lean-instrument\" --no-save --ignore-scripts @lapxo/bound@0.2.1 @lapxo/topos@0.2.0\n    - name: Lay the declared proof reader\n      working-directory: .\n      env:\n        GH_TOKEN: ${{ github.token }}\n      run: |\n        set -euo pipefail\n        mkdir -p \"$RUNNER_TEMP/lean-place/.bound/cas/blobs\"\n        git archive HEAD proofs/lean vectors/laws/meet-semilattice.json vectors/laws/helly-comb.lean.json | tar -x -C \"$RUNNER_TEMP/lean-place\"\n        cp proofs/lean/verification.bound \"$RUNNER_TEMP/lean-place/TARGET.bound\"\n        mkdir -p \"$RUNNER_TEMP/lean-place/proofs/lean/.lake\"\n        ln -s \"$GITHUB_WORKSPACE/proofs/lean/.lake/packages\" \"$RUNNER_TEMP/lean-place/proofs/lean/.lake/packages\"\n        gh release download \"v$(node -p \"require('./package.json').version\")\" --pattern 1b71c00ce6134659534532519d7139cc5576283b4a5bf1dc83327a3511e555e1 --pattern 0b40747e9fa2ac40c706220732c45870321230f3c5164153b428d7fa0273dd43 --dir \"$RUNNER_TEMP/lean-place/.bound/cas/blobs\"\n    - name: Fold proof inputs and check receipt reuse\n      working-directory: .\n      run: |\n        set -euo pipefail\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" land \"$RUNNER_TEMP/lean-place\"\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" fold \"$RUNNER_TEMP/lean-place\"\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" fold \"$RUNNER_TEMP/lean-place\" --check\n'on':\n  push:\n    branches:\n    - main\n  pull_request: null\n" at=witness:044/ci-signed-proof-replay by=target form=alphabet measure=text role=writes scope=prose/en/pipeline/proof-checks shape=.github/workflows/test.yml value=lock
+bound-lock/1 about="name: test\njobs:\n  test:\n    strategy:\n      matrix:\n        node:\n        - 22\n        - 24\n    runs-on: ubuntu-latest\n    permissions:\n      contents: write\n    steps:\n    - uses: actions/checkout@v4\n    - uses: actions/setup-node@v4\n      with:\n        node-version: ${{ matrix.node }}\n    - run: npm ci\n    - run: npm run build\n    - run: npm test\n    - name: Lay the declared historical proof reader\n      env:\n        GH_TOKEN: ${{ github.token }}\n      run: |\n        set -euo pipefail\n        mkdir -p .bound/cas/blobs\n        gh release download \"v0.4.4\" --pattern 5399fdc87cb104b5030e092e213ad6584004c6d4de49e716838081ae1f2e4182 --pattern 8655c52a0a4f6e19c883f2fe50b8f34eaa2cee7b21ac14b635a1a70130ab45fd --dir .bound/cas/blobs\n    - run: npm exec --yes --package=@lapxo/bound@0.2.1 --package=@lapxo/topos@0.2.0 -- bound fold --check\n  lean:\n    runs-on: ubuntu-24.04\n    permissions:\n      contents: write\n    defaults:\n      run:\n        shell: bash\n        working-directory: proofs/lean\n    steps:\n    - uses: actions/checkout@v4\n    - name: Install pinned Elan\n      shell: bash\n      run: |\n        set -euo pipefail\n        curl --fail --location --proto '=https' --proto-redir '=https' https://github.com/leanprover/elan/releases/download/v4.2.4/elan-x86_64-unknown-linux-gnu.tar.gz --output \"$RUNNER_TEMP/elan.tar.gz\"\n        printf '%s  %s\\n' 42b94d4244e8353142c456ec0e4ca6528fd898a6c604d4059f494e706e431f63 \"$RUNNER_TEMP/elan.tar.gz\" | sha256sum --check\n        mkdir \"$RUNNER_TEMP/elan-installer\"\n        tar -xzf \"$RUNNER_TEMP/elan.tar.gz\" -C \"$RUNNER_TEMP/elan-installer\"\n        \"$RUNNER_TEMP/elan-installer/elan-init\" -y --default-toolchain none\n        printf '%s\\n' \"$HOME/.elan/bin\" >> \"$GITHUB_PATH\"\n    - uses: actions/cache@v4\n      with:\n        path: |-\n          ~/.elan/toolchains\n          proofs/lean/.lake\n        key: lean-${{ runner.os }}-${{ runner.arch }}-${{ hashFiles('proofs/lean/lean-toolchain', 'proofs/lean/lakefile.toml', 'proofs/lean/lake-manifest.json') }}-${{\n          hashFiles('proofs/lean/**/*.lean') }}\n        restore-keys: lean-${{ runner.os }}-${{ runner.arch }}-${{ hashFiles('proofs/lean/lean-toolchain', 'proofs/lean/lakefile.toml', 'proofs/lean/lake-manifest.json')\n          }}-\n    - uses: actions/setup-node@v4\n      with:\n        node-version: 24\n    - name: Prepare locked compiler image\n      run: |\n        set -euo pipefail\n        elan toolchain install \"$(cat lean-toolchain)\"\n        lean --version\n        lake exe cache get Mathlib.Order.Interval.Set.Basic\n    - name: Install the published instrument\n      working-directory: .\n      run: npm install --prefix \"$RUNNER_TEMP/lean-instrument\" --no-save --ignore-scripts @lapxo/bound@0.2.1 @lapxo/topos@0.2.0\n    - name: Lay the declared proof reader\n      working-directory: .\n      env:\n        GH_TOKEN: ${{ github.token }}\n      run: |\n        set -euo pipefail\n        mkdir -p \"$RUNNER_TEMP/lean-place/.bound/cas/blobs\"\n        git archive HEAD proofs/lean vectors/laws/meet-semilattice.json vectors/laws/helly-comb.lean.json | tar -x -C \"$RUNNER_TEMP/lean-place\"\n        cp proofs/lean/verification.bound \"$RUNNER_TEMP/lean-place/TARGET.bound\"\n        mkdir -p \"$RUNNER_TEMP/lean-place/proofs/lean/.lake\"\n        ln -s \"$GITHUB_WORKSPACE/proofs/lean/.lake/packages\" \"$RUNNER_TEMP/lean-place/proofs/lean/.lake/packages\"\n        gh release download \"v0.4.4\" --pattern 1b71c00ce6134659534532519d7139cc5576283b4a5bf1dc83327a3511e555e1 --pattern 0b40747e9fa2ac40c706220732c45870321230f3c5164153b428d7fa0273dd43 --dir \"$RUNNER_TEMP/lean-place/.bound/cas/blobs\"\n    - name: Fold proof inputs and check receipt reuse\n      working-directory: .\n      run: |\n        set -euo pipefail\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" land \"$RUNNER_TEMP/lean-place\"\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" fold \"$RUNNER_TEMP/lean-place\"\n        node \"$RUNNER_TEMP/lean-instrument/node_modules/@lapxo/bound/dist/cli/verb.js\" fold \"$RUNNER_TEMP/lean-place\" --check\n'on':\n  push:\n    branches:\n    - main\n  pull_request: null\n" at=witness:045/historical-proof-download by=target form=alphabet measure=text role=writes scope=prose/en/pipeline/proof-checks shape=.github/workflows/test.yml value=lock
 bound-lock/1 about="no law" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reference/unrested value=lock
 bound-lock/1 about="not a derivation" at=witness:the-root-spoke-for-the-place by=target form=alphabet measure=text role=writes scope=prose/en/reference/underived value=lock
 bound-lock/1 about="obligations knows no instrument: its name, @lapxo/bound and bound/, never the noun a bound, which is the theory-s" at=witness:the-noun-bound-in-an-axiom by=target form=alphabet measure=id role=reads scope=literal/src/** value=not:fs|path|process|Date|fetch|card|package|placement|judge|receipt|topos|@lapxo/bound|bound/|render|npm|github|symbol|generation|Infinity|parseFloat|toFixed|grey|agreed|split|free|required|forbidden|conflict
@@ -718,6 +761,106 @@ bound-lock/1 at=witness:lane-keys-made-by-the-owner by=target form=interval meas
 bound-lock/1 at=witness:lane-keys-made-by-the-owner by=target form=interval measure=resolution role=reads scope=keys/lane-C value=1..16
 bound-lock/1 at=witness:laws-as-a-directory-of-scripts by=target form=alphabet measure=status needs=TARGET.bound|src/replay.ts|samples/yes/|samples/no/ role=demands scope=audit/laws-are-the-lock shape=decision value=present
 bound-lock/1 at=witness:leaf-was-the-old-word by=target form=alphabet measure=coverage role=reads scope=keys/lane-A value=topos/**|topos-frame/**|topos-doc/**|topos-laws/**|topos-notation/**|topos-node/**|topos-github/**|topos-json/**|topos-bound/**|topos-typescript-tree/**|region/topos/**|region/topos-frame/**|region/topos-doc/**|region/topos-laws/**|region/topos-notation/**|region/topos-node/**|region/topos-github/**|region/topos-json/**|region/topos-bound/**|region/topos-typescript-tree/**
+bound-lock/1 at=witness:obligations045/m0-allocation by=target form=alphabet measure=coordinates role=writes scope=region/m0-allocation value=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-allocation.lean.json|contracts/m0-allocation.json|samples/laws/m0-allocation/yes/sample.json|samples/laws/m0-allocation/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations045/m0-allocation by=target form=alphabet measure=digest role=writes scope=uses/m0-allocation value=sha256:9644a7d1fce1221b35d6ddcebca75712cb9dbe66984c6a000c82ef08348fe652
+bound-lock/1 at=witness:obligations045/m0-allocation by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-allocation shape=test/support/semilattice-reader.js value=sha256:e2a3952ac170e01e8f2499089f5b529c6fe577f593b09d163652347b89714ba9
+bound-lock/1 at=witness:obligations045/m0-allocation by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-allocation/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations045/m0-allocation by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-allocation/timeout value=0..25000
+bound-lock/1 at=witness:obligations045/m0-finite-grid by=target form=alphabet measure=coordinates role=writes scope=region/m0-finite-grid value=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-finite-grid.lean.json|contracts/m0-finite-grid.json|samples/laws/m0-finite-grid/yes/sample.json|samples/laws/m0-finite-grid/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations045/m0-finite-grid by=target form=alphabet measure=digest role=writes scope=uses/m0-finite-grid value=sha256:7afa8ca5256368d78bf6b384300e17f719ba9de91688cd692e3429a8566ea107
+bound-lock/1 at=witness:obligations045/m0-finite-grid by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-finite-grid shape=test/support/semilattice-reader.js value=sha256:2430efed4552906400a9a99f3284f704869cda384728af9e1926bec7819cdf79
+bound-lock/1 at=witness:obligations045/m0-finite-grid by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-finite-grid/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations045/m0-finite-grid by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-finite-grid/timeout value=0..25000
+bound-lock/1 at=witness:obligations045/m0-limit-diag by=target form=alphabet measure=coordinates role=writes scope=region/m0-limit-diag value=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-limit-diag.lean.json|contracts/m0-limit-diag.json|samples/laws/m0-limit-diag/yes/sample.json|samples/laws/m0-limit-diag/no/sample.json|vectors/laws/policy.json|docs/proofs/floor-limit-diag.proof.json
+bound-lock/1 at=witness:obligations045/m0-limit-diag by=target form=alphabet measure=digest role=writes scope=uses/m0-limit-diag value=sha256:e684226fb3f037024b07622f5baa3ffa7121617f2b708bd1e55ad8e513df5a78
+bound-lock/1 at=witness:obligations045/m0-limit-diag by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-limit-diag shape=test/support/semilattice-reader.js value=sha256:2ea5e9a6cf81c9e3be96271f462923dad0ee4ab6c82314eed57eb142752b677f
+bound-lock/1 at=witness:obligations045/m0-limit-diag by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-limit-diag/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations045/m0-limit-diag by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-limit-diag/timeout value=0..25000
+bound-lock/1 at=witness:obligations045/m0-limit-offdiag by=target form=alphabet measure=coordinates role=writes scope=region/m0-limit-offdiag value=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-limit-offdiag.lean.json|contracts/m0-limit-offdiag.json|samples/laws/m0-limit-offdiag/yes/sample.json|samples/laws/m0-limit-offdiag/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations045/m0-limit-offdiag by=target form=alphabet measure=digest role=writes scope=uses/m0-limit-offdiag value=sha256:c67457ac771c4ff7349bafed0d1fec88bc32f57b3fac5d70b1a163fee9d525f3
+bound-lock/1 at=witness:obligations045/m0-limit-offdiag by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-limit-offdiag shape=test/support/semilattice-reader.js value=sha256:20f51c4335013fa98fafc3ff5aa757318ce04ef6e09e10b93f765a35f18f0e66
+bound-lock/1 at=witness:obligations045/m0-limit-offdiag by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-limit-offdiag/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations045/m0-limit-offdiag by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-limit-offdiag/timeout value=0..25000
+bound-lock/1 at=witness:obligations045/m0-pair-coincidence by=target form=alphabet measure=coordinates role=writes scope=region/m0-pair-coincidence value=proofs/m0-045/Obligations045/ConsensusGrid.lean|proofs/m0-045/Obligations045/M0Coincidence.lean|proofs/m0-045/Obligations045/M0Diagonal.lean|proofs/m0-045/Obligations045/M0Limit.lean|proofs/m0-045/Obligations045/M0Offdiag.lean|proofs/m0-045/Obligations045.lean|proofs/m0-045/lake-manifest.json|proofs/m0-045/lakefile.toml|proofs/m0-045/lean-toolchain|vectors/laws/m0-pair-coincidence.lean.json|contracts/m0-pair-coincidence.json|samples/laws/m0-pair-coincidence/yes/sample.json|samples/laws/m0-pair-coincidence/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations045/m0-pair-coincidence by=target form=alphabet measure=digest role=writes scope=uses/m0-pair-coincidence value=sha256:0464f133ac5e155f83203da942c945172237e912f229fa671fdb76360df2d900
+bound-lock/1 at=witness:obligations045/m0-pair-coincidence by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-pair-coincidence shape=test/support/semilattice-reader.js value=sha256:36ec222b235f2f88728a36153b5f7f803968713bc7987a93f9349a06d5504658
+bound-lock/1 at=witness:obligations045/m0-pair-coincidence by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-pair-coincidence/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations045/m0-pair-coincidence by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-pair-coincidence/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/definitions by=target form=alphabet measure=coordinates role=writes scope=region/definitions value=vectors/laws/definitions.native.json|contracts/extension-lineage-participation.json|docs/contracts/extension-lineage-participation.md|proofs/definitions-046/declaration.json|vectors/laws/policy.json|src/laws/laws.bound|vectors/laws/a7-t90.json|vectors/laws/a9-t99.json|samples/laws/definitions/yes/sample.json|samples/laws/definitions/no/sample.json
+bound-lock/1 at=witness:obligations046/definitions by=target form=alphabet measure=digest role=writes scope=uses/definitions value=sha256:ebb645d899c863c4a343f01b59be33ce2404456a4b463f4be83c5689ea6c2714
+bound-lock/1 at=witness:obligations046/definitions by=target form=alphabet measure=id role=writes scope=dep/runtime-definitions shape=test/support/semilattice-reader.js value=sha256:714d07023dcf3dd76cf5e0e3126823add25f49d2e5e9053de5594f5aeb5fc4bd
+bound-lock/1 at=witness:obligations046/definitions by=target form=interval measure=bytes role=writes scope=reader/capsule/definitions/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/definitions by=target form=interval measure=milliseconds role=writes scope=reader/capsule/definitions/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/experiment1a-protocol by=target form=alphabet measure=coordinates role=writes scope=region/experiment1a-protocol value=vectors/laws/experiment1a-protocol.native.json|contracts/model-collapse-1a.json|protocols/model-collapse-1a.json|docs/contracts/model-collapse-1a.md|proofs/experiment1a-046/declaration.json|vectors/laws/policy.json|vectors/laws/model-collapse-1a.json|samples/laws/experiment1a/yes/sample.json|samples/laws/experiment1a/no/sample.json
+bound-lock/1 at=witness:obligations046/experiment1a-protocol by=target form=alphabet measure=digest role=writes scope=uses/experiment1a-protocol value=sha256:8f69e797df5007f84ae10c282147eae867e167a9ad535c34c4fe58a911909d3c
+bound-lock/1 at=witness:obligations046/experiment1a-protocol by=target form=alphabet measure=id role=writes scope=dep/runtime-experiment1a-protocol shape=test/support/semilattice-reader.js value=sha256:e9dbb4cc260e03b127f3e45f17b34de0197e2edded8387e37dde37cebbe78508
+bound-lock/1 at=witness:obligations046/experiment1a-protocol by=target form=interval measure=bytes role=writes scope=reader/capsule/experiment1a-protocol/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/experiment1a-protocol by=target form=interval measure=milliseconds role=writes scope=reader/capsule/experiment1a-protocol/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-binomial-bridge by=target form=alphabet measure=coordinates role=writes scope=region/m0-binomial-bridge value=proofs/m0-046/BridgeNegatives.lean|proofs/m0-046/M0Bridge.lean|proofs/m0-046/Obligations045.lean|proofs/m0-046/Obligations045/ConsensusGrid.lean|proofs/m0-046/Obligations045/M0Coincidence.lean|proofs/m0-046/Obligations045/M0Diagonal.lean|proofs/m0-046/Obligations045/M0Limit.lean|proofs/m0-046/Obligations045/M0Offdiag.lean|proofs/m0-046/lake-manifest.json|proofs/m0-046/lakefile.toml|proofs/m0-046/lean-toolchain|vectors/laws/m0-binomial-bridge.lean.json|contracts/m0-binomial-bridge.json|docs/contracts/m0-binomial-bridge.md|samples/laws/m0-binomial-bridge/yes/sample.json|samples/laws/m0-binomial-bridge/no/sample.json|samples/laws/m0-binomial-bridge/yes/small-binomial-table.json|samples/laws/m0-binomial-bridge/no/pairwise-is-not-joint.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-binomial-bridge by=target form=alphabet measure=digest role=writes scope=uses/m0-binomial-bridge value=sha256:8400c28615b6dfaf5acd0d63ceedeb52d6b4d20be0a579f3b49cc710edfbf959
+bound-lock/1 at=witness:obligations046/m0-binomial-bridge by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-binomial-bridge shape=test/support/semilattice-reader.js value=sha256:278148cf313dc1248db7c19574dbc6e57657dd582f508163a5c3f1c5ec57d9d3
+bound-lock/1 at=witness:obligations046/m0-binomial-bridge by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-binomial-bridge/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-binomial-bridge by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-binomial-bridge/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-diagonal-lindeberg by=target form=alphabet measure=coordinates role=writes scope=region/m0-diagonal-lindeberg value=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-lindeberg.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-diagonal-lindeberg by=target form=alphabet measure=digest role=writes scope=uses/m0-diagonal-lindeberg value=sha256:5880375027adb15d791ec5416e1f9a6b9d250491a9a51d5fd7c21b54fd00d772
+bound-lock/1 at=witness:obligations046/m0-diagonal-lindeberg by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-diagonal-lindeberg shape=test/support/semilattice-reader.js value=sha256:18688d8cd81457a1c32f97ae125afdfefb2115ad529765a925989e138ea8e84b
+bound-lock/1 at=witness:obligations046/m0-diagonal-lindeberg by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-diagonal-lindeberg/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-diagonal-lindeberg by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-diagonal-lindeberg/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-diagonal-moments by=target form=alphabet measure=coordinates role=writes scope=region/m0-diagonal-moments value=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-moments.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-diagonal-moments by=target form=alphabet measure=digest role=writes scope=uses/m0-diagonal-moments value=sha256:1bdc68f4d65a241155bff3a7f780539614d70cfcd5b6e067bea4f80c39ae63b2
+bound-lock/1 at=witness:obligations046/m0-diagonal-moments by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-diagonal-moments shape=test/support/semilattice-reader.js value=sha256:230d2c967c95ff5521c5a322b67acaa2bbbd504343aed31f96ea99e4207faa3a
+bound-lock/1 at=witness:obligations046/m0-diagonal-moments by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-diagonal-moments/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-diagonal-moments by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-diagonal-moments/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-diagonal-symmetric by=target form=alphabet measure=coordinates role=writes scope=region/m0-diagonal-symmetric value=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-symmetric.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-diagonal-symmetric by=target form=alphabet measure=digest role=writes scope=uses/m0-diagonal-symmetric value=sha256:f8fd5fe6bb034faa662eeb3047c7fda8e5ec17d5e8012fd913ef54a068b58ff0
+bound-lock/1 at=witness:obligations046/m0-diagonal-symmetric by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-diagonal-symmetric shape=test/support/semilattice-reader.js value=sha256:813424fe24059f37114dfbf6170eafbaddcbc9e458e6b5f65e39cc6670bf4b87
+bound-lock/1 at=witness:obligations046/m0-diagonal-symmetric by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-diagonal-symmetric/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-diagonal-symmetric by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-diagonal-symmetric/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-diagonal-threshold by=target form=alphabet measure=coordinates role=writes scope=region/m0-diagonal-threshold value=proofs/m0-046-diagonal/BridgeNegatives.lean|proofs/m0-046-diagonal/M0Bridge.lean|proofs/m0-046-diagonal/M0Diagonal046.lean|proofs/m0-046-diagonal/M0Lindeberg046.lean|proofs/m0-046-diagonal/M0Moments046.lean|proofs/m0-046-diagonal/M0Threshold046.lean|proofs/m0-046-diagonal/Obligations045.lean|proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean|proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean|proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean|proofs/m0-046-diagonal/Obligations045/M0Limit.lean|proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m0-046-diagonal/lake-manifest.json|proofs/m0-046-diagonal/lakefile.toml|proofs/m0-046-diagonal/lean-toolchain|vectors/laws/m0-diagonal-threshold.lean.json|contracts/m0-diagonal-conditional.json|samples/laws/m0-diagonal-conditional/yes/sample.json|samples/laws/m0-diagonal-conditional/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-diagonal-threshold by=target form=alphabet measure=digest role=writes scope=uses/m0-diagonal-threshold value=sha256:b69ee4637e500c952013cdd50008fc74a299351de402dc7abec08b02bb878e3c
+bound-lock/1 at=witness:obligations046/m0-diagonal-threshold by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-diagonal-threshold shape=test/support/semilattice-reader.js value=sha256:8ec7c17c8c532fcd52c78c4ae58588600c240b5848705f4aba7688cf9116be77
+bound-lock/1 at=witness:obligations046/m0-diagonal-threshold by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-diagonal-threshold/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-diagonal-threshold by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-diagonal-threshold/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-identification by=target form=alphabet measure=coordinates role=writes scope=region/m0-identification value=proofs/m0-046-identification/M0Identification046.lean|proofs/m0-046-identification/Obligations045/M0Coincidence.lean|proofs/m0-046-identification/lake-manifest.json|proofs/m0-046-identification/lakefile.toml|proofs/m0-046-identification/lean-toolchain|vectors/laws/m0-identification.lean.json|contracts/m0-moment-identification.json|samples/laws/m0-moment-identification/yes/sample.json|samples/laws/m0-moment-identification/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m0-identification by=target form=alphabet measure=digest role=writes scope=uses/m0-identification value=sha256:0aec2fd5bdb81bcdf9e51d5d9d2cb2e64a132c80ece30ac6921cc9cb27022653
+bound-lock/1 at=witness:obligations046/m0-identification by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-identification shape=test/support/semilattice-reader.js value=sha256:8f1f051ac7d0f9acf34a6714aa3f6280e644aeb12e28e5d60e35b6698ba2eb21
+bound-lock/1 at=witness:obligations046/m0-identification by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-identification/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-identification by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-identification/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-uncertainty-blocks by=target form=alphabet measure=coordinates role=writes scope=region/m0-uncertainty-blocks value=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-blocks.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json
+bound-lock/1 at=witness:obligations046/m0-uncertainty-blocks by=target form=alphabet measure=digest role=writes scope=uses/m0-uncertainty-blocks value=sha256:e480d927ac8edfdd9bc275be81347223e83d20c520f5b3926f8079d46444d16e
+bound-lock/1 at=witness:obligations046/m0-uncertainty-blocks by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-uncertainty-blocks shape=test/support/semilattice-reader.js value=sha256:3a228527f0ea66825365dbe169af6bd8b77383cd436ad3754cb1a396c5e66347
+bound-lock/1 at=witness:obligations046/m0-uncertainty-blocks by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-uncertainty-blocks/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-uncertainty-blocks by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-uncertainty-blocks/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-uncertainty-finite-discord by=target form=alphabet measure=coordinates role=writes scope=region/m0-uncertainty-finite-discord value=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-finite-discord.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json
+bound-lock/1 at=witness:obligations046/m0-uncertainty-finite-discord by=target form=alphabet measure=digest role=writes scope=uses/m0-uncertainty-finite-discord value=sha256:addae02aab8ab613cdd417069b8a5048755255f1fa4b728602b84f8215977ac5
+bound-lock/1 at=witness:obligations046/m0-uncertainty-finite-discord by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-uncertainty-finite-discord shape=test/support/semilattice-reader.js value=sha256:99dd29f5ceafe2d17c681047599d079a3e7748d5171e73ce8fb2f7e2420d91f1
+bound-lock/1 at=witness:obligations046/m0-uncertainty-finite-discord by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-uncertainty-finite-discord/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-uncertainty-finite-discord by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-uncertainty-finite-discord/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m0-uncertainty-interval by=target form=alphabet measure=coordinates role=writes scope=region/m0-uncertainty-interval value=proofs/m0-046-uncertainty/BridgeNegatives.lean|proofs/m0-046-uncertainty/M0BlockCoverage046.lean|proofs/m0-046-uncertainty/M0Bridge.lean|proofs/m0-046-uncertainty/M0Diagonal046.lean|proofs/m0-046-uncertainty/M0FiniteDiscord046.lean|proofs/m0-046-uncertainty/M0Interval046.lean|proofs/m0-046-uncertainty/M0Lindeberg046.lean|proofs/m0-046-uncertainty/M0Moments046.lean|proofs/m0-046-uncertainty/M0Threshold046.lean|proofs/m0-046-uncertainty/Obligations045/ConsensusGrid.lean|proofs/m0-046-uncertainty/Obligations045/M0Coincidence.lean|proofs/m0-046-uncertainty/Obligations045/M0Diagonal.lean|proofs/m0-046-uncertainty/Obligations045/M0Limit.lean|proofs/m0-046-uncertainty/Obligations045/M0Offdiag.lean|proofs/m0-046-uncertainty/Obligations045.lean|proofs/m0-046-uncertainty/lake-manifest.json|proofs/m0-046-uncertainty/lakefile.toml|proofs/m0-046-uncertainty/lean-toolchain|vectors/laws/m0-uncertainty-interval.lean.json|contracts/m0-keff-interval.json|samples/laws/m0-keff-interval/yes/sample.json|samples/laws/m0-keff-interval/yes/api-rows.json|samples/laws/m0-keff-interval/no/sample.json|vectors/laws/policy.json|vectors/laws/m0-keff-interval.json
+bound-lock/1 at=witness:obligations046/m0-uncertainty-interval by=target form=alphabet measure=digest role=writes scope=uses/m0-uncertainty-interval value=sha256:645941d9b44794ba1967f8dafc4231c919e90d6c614a38e1d547fd4e78c7f909
+bound-lock/1 at=witness:obligations046/m0-uncertainty-interval by=target form=alphabet measure=id role=writes scope=dep/runtime-m0-uncertainty-interval shape=test/support/semilattice-reader.js value=sha256:6ae8b3f3a062367a719546c34f04f779d1076e57ad68e6f40d33e78fc68398c9
+bound-lock/1 at=witness:obligations046/m0-uncertainty-interval by=target form=interval measure=bytes role=writes scope=reader/capsule/m0-uncertainty-interval/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m0-uncertainty-interval by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m0-uncertainty-interval/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m1-diagonal-partial by=target form=alphabet measure=coordinates role=writes scope=region/m1-diagonal-partial value=proofs/m1-046-diagonal/M0Bridge.lean|proofs/m1-046-diagonal/M0Diagonal046.lean|proofs/m1-046-diagonal/M0Lindeberg046.lean|proofs/m1-046-diagonal/M0Moments046.lean|proofs/m1-046-diagonal/M0Threshold046.lean|proofs/m1-046-diagonal/M1Bridge046.lean|proofs/m1-046-diagonal/M1Diagonal046.lean|proofs/m1-046-diagonal/M1Offdiag046.lean|proofs/m1-046-diagonal/Obligations045/M0Limit.lean|proofs/m1-046-diagonal/Obligations045/M0Offdiag.lean|proofs/m1-046-diagonal/lake-manifest.json|proofs/m1-046-diagonal/lakefile.toml|proofs/m1-046-diagonal/lean-toolchain|vectors/laws/m1-diagonal-partial.lean.json|contracts/m1-subcauses.json|contracts/m1-diagonal-regions.json|samples/laws/m1-diagonal-regions/yes/sample.json|samples/laws/m1-diagonal-regions/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m1-diagonal-partial by=target form=alphabet measure=digest role=writes scope=uses/m1-diagonal-partial value=sha256:a3bb35e69157da377e98351aea20523d946b6293de0fa6d38bb0c3ad39ec0490
+bound-lock/1 at=witness:obligations046/m1-diagonal-partial by=target form=alphabet measure=id role=writes scope=dep/runtime-m1-diagonal-partial shape=test/support/semilattice-reader.js value=sha256:fab819257e2fdd8db64b74981e36b7c385e7d4bf826fdb7f334a6a4b22be4a42
+bound-lock/1 at=witness:obligations046/m1-diagonal-partial by=target form=interval measure=bytes role=writes scope=reader/capsule/m1-diagonal-partial/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m1-diagonal-partial by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m1-diagonal-partial/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m1-generator-binomial by=target form=alphabet measure=coordinates role=writes scope=region/m1-generator-binomial value=proofs/m1-046-bridge/M0Bridge.lean|proofs/m1-046-bridge/M1Bridge046.lean|proofs/m1-046-bridge/Obligations045/M0Limit.lean|proofs/m1-046-bridge/Obligations045/M0Offdiag.lean|proofs/m1-046-bridge/lake-manifest.json|proofs/m1-046-bridge/lakefile.toml|proofs/m1-046-bridge/lean-toolchain|vectors/laws/m1-generator-binomial.lean.json|contracts/m1-subcauses.json|contracts/m1-generator-binomial.json|samples/laws/m1-generator-binomial/yes/sample.json|samples/laws/m1-generator-binomial/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m1-generator-binomial by=target form=alphabet measure=digest role=writes scope=uses/m1-generator-binomial value=sha256:93b0b9d0241aecb6acfa1ebc90b4bb7a62d3452a028b0c8bec2085112d61e559
+bound-lock/1 at=witness:obligations046/m1-generator-binomial by=target form=alphabet measure=id role=writes scope=dep/runtime-m1-generator-binomial shape=test/support/semilattice-reader.js value=sha256:b91151445a36d63e6cc15dd43851c9ace3db4612eaf8e625d1bbbae67d15065d
+bound-lock/1 at=witness:obligations046/m1-generator-binomial by=target form=interval measure=bytes role=writes scope=reader/capsule/m1-generator-binomial/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m1-generator-binomial by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m1-generator-binomial/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/m1-offdiag-limit by=target form=alphabet measure=coordinates role=writes scope=region/m1-offdiag-limit value=proofs/m1-046-offdiag/M0Bridge.lean|proofs/m1-046-offdiag/M0Diagonal046.lean|proofs/m1-046-offdiag/M0Moments046.lean|proofs/m1-046-offdiag/M1Bridge046.lean|proofs/m1-046-offdiag/M1Offdiag046.lean|proofs/m1-046-offdiag/Obligations045/M0Limit.lean|proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean|proofs/m1-046-offdiag/lake-manifest.json|proofs/m1-046-offdiag/lakefile.toml|proofs/m1-046-offdiag/lean-toolchain|vectors/laws/m1-offdiag-limit.lean.json|contracts/m1-subcauses.json|contracts/m1-offdiag-limit.json|samples/laws/m1-offdiag-limit/yes/sample.json|samples/laws/m1-offdiag-limit/no/sample.json|vectors/laws/policy.json
+bound-lock/1 at=witness:obligations046/m1-offdiag-limit by=target form=alphabet measure=digest role=writes scope=uses/m1-offdiag-limit value=sha256:b74cf4ef0507d8c1b8151042de4119bac4491154e0c04ed7dad4f4ecaccb7e0a
+bound-lock/1 at=witness:obligations046/m1-offdiag-limit by=target form=alphabet measure=id role=writes scope=dep/runtime-m1-offdiag-limit shape=test/support/semilattice-reader.js value=sha256:653f4a10ee677f667c5b4e70e77edaac918e1466f71f45566140b3706de1ff97
+bound-lock/1 at=witness:obligations046/m1-offdiag-limit by=target form=interval measure=bytes role=writes scope=reader/capsule/m1-offdiag-limit/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/m1-offdiag-limit by=target form=interval measure=milliseconds role=writes scope=reader/capsule/m1-offdiag-limit/timeout value=0..25000
+bound-lock/1 at=witness:obligations046/projection-chain by=target form=alphabet measure=coordinates role=writes scope=region/projection-chain value=vectors/laws/projection-chain.native.json|contracts/projection-chain.json|proofs/projection-chain.md|vectors/laws/policy.json|vectors/laws/projection-chain.json|samples/laws/projection-chain/yes/sample.json|samples/laws/projection-chain/no/sample.json
+bound-lock/1 at=witness:obligations046/projection-chain by=target form=alphabet measure=digest role=writes scope=uses/projection-chain value=sha256:9c6025ae4eb7d247a6d6df1ba2545c7bdaa7ec1a3dd57bc4d3144fb1f0923631
+bound-lock/1 at=witness:obligations046/projection-chain by=target form=alphabet measure=id role=writes scope=dep/runtime-projection-chain shape=test/support/semilattice-reader.js value=sha256:2050c3087bb50f4a5cbdd6d84c969b2d93a34b246af43acd9728a41d507b3dd4
+bound-lock/1 at=witness:obligations046/projection-chain by=target form=interval measure=bytes role=writes scope=reader/capsule/projection-chain/response-bytes value=0..65536
+bound-lock/1 at=witness:obligations046/projection-chain by=target form=interval measure=milliseconds role=writes scope=reader/capsule/projection-chain/timeout value=0..25000
 bound-lock/1 at=witness:orders-to-a-model-inside-code by=target form=alphabet measure=id role=reads scope=literal/**/src/** value="not:isolate|NEVER|ALWAYS|MUST|do not"
 bound-lock/1 at=witness:placement-and-card-pack-live-in-obligations by=target form=alphabet measure=id role=reads scope=literal/vectors/** value=not:card|symbol|package|placement|judge|generation|receipt|topos
 bound-lock/1 at=witness:refactor-validated-by-opinion by=target form=alphabet measure=status needs=src/replay.ts|vectors/fold.json|samples/yes/ role=demands scope=audit/replay-is-the-proof shape=vector value=present