From 6ebd4622e55b06748ac1f7ca5e49bfb731464718 Mon Sep 17 00:00:00 2001 From: Claude Date: Mon, 16 Nov 2026 18:51:34 +0000 Subject: [PATCH] registry: pin Lintel at main d7bdc21 with its receipt; record the refusal MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit ADR 0004: bump a pilot pin as the home repository's changes land. Lintel now has a receipt (metadatastician/lintel#22) and Rocq and Lean legs (#23), so its rows move from a0f2bae, where no receipt existed, to main d7bdc21 with verification/receipts/agda-pwg_praxis.deed and its sha256, and the status document becomes docs/status/PROOF-STATUS.adoc. The derivation does not change: L-1..L-4, L-6 and L-7 stay `ungraded`, now for the true reason. The canon reader refuses the receipt ("unexpected clause (identity)") because it is still the pre-§8.5.1 praxis-deed shape; its self-asserted :pwg "2ii" cannot be derived. The fix belongs at source: a shared §8.5.1 receipt generator in standards (owner ruling 2026-11-16), then a Lintel receipt from it, then a second bump here. Checked: claims-registry build/check (3 pinned sources, 22 claims), bun test tests/registry (26 pass), check-ijson-jcs --enforce. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_017yYi5JxzXZs6nz1ZSForfP --- docs/atlas/claims/claims.jsonl | 16 ++++++++-------- docs/atlas/generated/registry.adoc | 16 ++++++++-------- 2 files changed, 16 insertions(+), 16 deletions(-) diff --git a/docs/atlas/claims/claims.jsonl b/docs/atlas/claims/claims.jsonl index 970156b..47192c1 100644 --- a/docs/atlas/claims/claims.jsonl +++ b/docs/atlas/claims/claims.jsonl @@ -7,14 +7,14 @@ {"agda":{"module":"SecretTypes.Noninterference.Generic","names":["tini"]},"claim":"N-7","id":"hyperpolymath/secret-types#N-7","kind":"theorem","receipt":{"path":"verification/receipts/agda_praxis.deed","sha256":"4ed7e550e399074cc8a93bd190f193a0fea78de97d54e27889263b9d386ce9cc"},"repo":"hyperpolymath/secret-types","source_commit":"4ed067220f1357b37f7d54c5ae0690ff35b292bd","statement":"TINI over the Lattice record: for every variable set with decidable equality, lattice, labelling and down-closed observer, two finishing runs of a well-typed command from stores agreeing on what the observer sees end agreeing on it","status_doc":"PROOF-STATUS.adoc"} {"agda":{"module":"SecretTypes.Countermodels","names":["NoUpper₁.refutes","NoUpper₂.refutes","NoDownClosure.refutes","NoTrans.refutes"]},"claim":"N-8","id":"hyperpolymath/secret-types#N-8","kind":"theorem","receipt":{"path":"verification/receipts/agda_praxis.deed","sha256":"4ed7e550e399074cc8a93bd190f193a0fea78de97d54e27889263b9d386ce9cc"},"repo":"hyperpolymath/secret-types","source_commit":"4ed067220f1357b37f7d54c5ae0690ff35b292bd","statement":"Each census law is necessary: dropping an upper-bound law or observer down-closure admits a well-typed leaking program; transitivity is necessary for principal observers","status_doc":"PROOF-STATUS.adoc"} {"agda":{"module":"SecretTypes.Noninterference.OutcomeVisibility","names":["termination-sensitive-fails"]},"claim":"N-9","id":"hyperpolymath/secret-types#N-9","kind":"theorem","receipt":{"path":"verification/receipts/agda_praxis.deed","sha256":"4ed7e550e399074cc8a93bd190f193a0fea78de97d54e27889263b9d386ce9cc"},"repo":"hyperpolymath/secret-types","source_commit":"4ed067220f1357b37f7d54c5ae0690ff35b292bd","statement":"If an observer sees finishing versus not finishing, termination-sensitive noninterference is false for the current typing rules","status_doc":"PROOF-STATUS.adoc"} -{"agda":{"module":"Lintel.Lattice","names":["⊑-refl","⊑-trans","⊑-antisym","⊔-upper₁","⊔-upper₂","⊔-least","⊓-lower₁","⊓-lower₂","⊓-greatest","anyone-least","no-one-greatest","no-one-⋢-anyone","_⊑?_"]},"claim":"L-1","id":"metadatastician/lintel#L-1","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest","status_doc":"README.adoc"} -{"agda":{"module":"Lintel.Lattice","names":["⊑-readers","readers-⊑","observes-flow","flow-observes"]},"claim":"L-2","id":"metadatastician/lintel#L-2","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level","status_doc":"README.adoc"} -{"agda":{"module":"Lintel.Instance","names":["reader-sets"]},"claim":"L-3","id":"metadatastician/lintel#L-3","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record","status_doc":"README.adoc"} -{"agda":{"module":"Lintel.Lattice","names":["address-to-proxy","qname-to-target","link","link-confined"]},"claim":"L-4","id":"metadatastician/lintel#L-4","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"Address and query name each reach their own role; composed, only the client may observe them","status_doc":"README.adoc"} -{"agda":null,"claim":"L-5","id":"metadatastician/lintel#L-5","kind":"demonstration","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"The typechecker refuses the self-defeating compositions and accepts the client's","status_doc":"README.adoc"} -{"agda":{"module":"Lintel.Instance","names":["tini-per-role","tini-coalition"]},"claim":"L-6","id":"metadatastician/lintel#L-6","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together","status_doc":"README.adoc"} -{"agda":{"module":"Lintel.Composition","names":["writes-flow","link-written-to-client","link-written-to-local","link-writable"]},"claim":"L-7","id":"metadatastician/lintel#L-7","kind":"theorem","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read","status_doc":"README.adoc"} -{"agda":null,"claim":"A-1","id":"metadatastician/lintel#A-1","kind":"assumption","receipt":null,"repo":"metadatastician/lintel","source_commit":"a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1","statement":"Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap)","status_doc":"README.adoc"} +{"agda":{"module":"Lintel.Lattice","names":["⊑-refl","⊑-trans","⊑-antisym","⊔-upper₁","⊔-upper₂","⊔-least","⊓-lower₁","⊓-lower₂","⊓-greatest","anyone-least","no-one-greatest","no-one-⋢-anyone","_⊑?_"]},"claim":"L-1","id":"metadatastician/lintel#L-1","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Lintel.Lattice","names":["⊑-readers","readers-⊑","observes-flow","flow-observes"]},"claim":"L-2","id":"metadatastician/lintel#L-2","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Lintel.Instance","names":["reader-sets"]},"claim":"L-3","id":"metadatastician/lintel#L-3","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Lintel.Lattice","names":["address-to-proxy","qname-to-target","link","link-confined"]},"claim":"L-4","id":"metadatastician/lintel#L-4","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Address and query name each reach their own role; composed, only the client may observe them","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":null,"claim":"L-5","id":"metadatastician/lintel#L-5","kind":"demonstration","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"The typechecker refuses the self-defeating compositions and accepts the client's","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Lintel.Instance","names":["tini-per-role","tini-coalition"]},"claim":"L-6","id":"metadatastician/lintel#L-6","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Lintel.Composition","names":["writes-flow","link-written-to-client","link-written-to-local","link-writable"]},"claim":"L-7","id":"metadatastician/lintel#L-7","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":null,"claim":"A-1","id":"metadatastician/lintel#A-1","kind":"assumption","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap)","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"FeatureReachability","names":["Cargo.absent-under-all-features","Monotone.reach-mono"]},"claim":"THY-1","id":"hyperpolymath/mathesis#THY-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"theory","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone.","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"Applied.Missing","names":["Proofs.closing-needs","Proofs.missing-persists","Proofs.closings-missing","Proofs.verdict-yes","Proofs.breach-decides"]},"claim":"APP-1","id":"hyperpolymath/mathesis#APP-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is \"no\" on a known breach and otherwise missing when any value it depends on is missing; it is never \"yes\" then.","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"Applied.Cash","names":["Proofs.cash-identity"]},"claim":"APP-2","id":"hyperpolymath/mathesis#APP-2","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} diff --git a/docs/atlas/generated/registry.adoc b/docs/atlas/generated/registry.adoc index 421cdfd..b4be590 100644 --- a/docs/atlas/generated/registry.adoc +++ b/docs/atlas/generated/registry.adoc @@ -44,20 +44,20 @@ Census: 11 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 6 `ungraded` |https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-9] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |If an observer sees finishing versus not finishing, termination-sensitive noninterference is false for the current typing rules (`SecretTypes.Noninterference.OutcomeVisibility`: `termination-sensitive-fails`) |— -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#A-1] at `a0f2bae9cac0` |assumption |`ungraded` |Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap) |assumption, not a theorem (§8.1) +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#A-1] at `d7bdc21a1264` |assumption |`ungraded` |Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap) |assumption, not a theorem (§8.1) -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-1] at `a0f2bae9cac0` |theorem |`ungraded` |A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest (`Lintel.Lattice`: `⊑-refl`, `⊑-trans`, `⊑-antisym`, `⊔-upper₁`, `⊔-upper₂`, `⊔-least`, `⊓-lower₁`, `⊓-lower₂`, `⊓-greatest`, `anyone-least`, `no-one-greatest`, `no-one-⋢-anyone`, `_⊑?_`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-1] at `d7bdc21a1264` |theorem |`ungraded` |A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest (`Lintel.Lattice`: `⊑-refl`, `⊑-trans`, `⊑-antisym`, `⊔-upper₁`, `⊔-upper₂`, `⊔-least`, `⊓-lower₁`, `⊓-lower₂`, `⊓-greatest`, `anyone-least`, `no-one-greatest`, `no-one-⋢-anyone`, `_⊑?_`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-2] at `a0f2bae9cac0` |theorem |`ungraded` |⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level (`Lintel.Lattice`: `⊑-readers`, `readers-⊑`, `observes-flow`, `flow-observes`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-2] at `d7bdc21a1264` |theorem |`ungraded` |⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level (`Lintel.Lattice`: `⊑-readers`, `readers-⊑`, `observes-flow`, `flow-observes`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-3] at `a0f2bae9cac0` |theorem |`ungraded` |The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record (`Lintel.Instance`: `reader-sets`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-3] at `d7bdc21a1264` |theorem |`ungraded` |The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record (`Lintel.Instance`: `reader-sets`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-4] at `a0f2bae9cac0` |theorem |`ungraded` |Address and query name each reach their own role; composed, only the client may observe them (`Lintel.Lattice`: `address-to-proxy`, `qname-to-target`, `link`, `link-confined`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-4] at `d7bdc21a1264` |theorem |`ungraded` |Address and query name each reach their own role; composed, only the client may observe them (`Lintel.Lattice`: `address-to-proxy`, `qname-to-target`, `link`, `link-confined`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-5] at `a0f2bae9cac0` |demonstration |`ungraded` |The typechecker refuses the self-defeating compositions and accepts the client's |demonstration, not a theorem (§8.1) +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-5] at `d7bdc21a1264` |demonstration |`ungraded` |The typechecker refuses the self-defeating compositions and accepts the client's |demonstration, not a theorem (§8.1) -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-6] at `a0f2bae9cac0` |theorem |`ungraded` |tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together (`Lintel.Instance`: `tini-per-role`, `tini-coalition`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-6] at `d7bdc21a1264` |theorem |`ungraded` |tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together (`Lintel.Instance`: `tini-per-role`, `tini-coalition`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt -|https://github.com/metadatastician/lintel/blob/a0f2bae9cac07cd97b2395d10d0eb05f8ae1c7d1/README.adoc[metadatastician/lintel#L-7] at `a0f2bae9cac0` |theorem |`ungraded` |Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read (`Lintel.Composition`: `writes-flow`, `link-written-to-client`, `link-written-to-local`, `link-writable`) |no machine receipt in the home repository +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-7] at `d7bdc21a1264` |theorem |`ungraded` |Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read (`Lintel.Composition`: `writes-flow`, `link-written-to-client`, `link-written-to-local`, `link-writable`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt |===