computationally tag stable releases — the gate-pass criterion, 4-key sealed, fail-closed
Theorem.computationally tag stable releases — the gate-pass criterion, 4-key sealed, fail-closed.
Proof.a release is tagged STABLE by a COMPUTED criterion, not a manual decision (user, 2026-07-25: "computationally tag stable releases"). A release is the src merkle at a commit, so the same src yields the same release address and a stable tag is reproducible. A release is tagged STABLE iff ALL gates pass — the enforcement trinity with zero findings, every facet computing, the merkle seal clean — so the tag is computed; the stable tag is a 4-key-sealed content-address (referrer⊕id⊕prev⊕next) so a changed src yields a different tag, and a release with ANY failing gate is NOT tagged (fail-closed, allow never the default). SCOPE: "stable" = the computed gate-pass criterion (all green), content-addressed and reproducible — NOT a subjective quality judgment or a guarantee of bug-freedom; the tag is the enforcement RESULT, not a promise. HARMONY ≠ TRUTH.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/water/stack/index.ts#computationallyTagStableReleases
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"computationally tag stable releases — the gate-pass criterion, 4-key sealed, fail-closed" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation computationallyTagStableReleases.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (computationallyTagStableReleases @ src/water/stack) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes computationallyTagStableReleases (src/water/stack/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.