@lapxo/obligations 0.4.3 → 0.4.5

package/CHANGELOG.md

@@ -0,0 +1,10 @@
+# 0.4.5 — linaje
+
+Conditional M0 evidence beside the unchanged algebra and wire format.
+
+- Cumulative-floor quotas and the off-diagonal probability limit are checked in Lean under the declared binary-lineage sampling model.
+- The 720-case finite grid, the Wright–Fisher counterexample and pair-coincidence identities retain their exact domains. Triple agreement adds no independent equation.
+- The diagonal is a bounded N=1..12 kernel vector plus a cited proof in text, not a general Lean limit theorem. The computational binomial/integral bridge remains unclaimed.
+- Named open demands: conditional-lineage-identification, causal-subgroup-recovery and oracle-free-reference.
+
+All existing exports, compiled implementations and M/3–M/4 are retained from published 0.4.4.

package/README.md

@@ -53,6 +53,10 @@ console.log(bound.value.toFixed(6), bound.unit);
 This is an information upper bound under the declared single-dominant-factor model,
 not a measurement of truth or proof of independent origins. The four states are unchanged.
 
+For 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.
+
+The 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.
+
 
 ## The paper