dalek-ed25519-verified/TRUSTED-BASE.md

# Trusted base

What you must believe for the theorems in this repository to transfer to the
running Rust code. Everything else is machine-checked.

1. **Lean 4 kernel** (v4.30.0-rc2) and its three foundational axioms
   `[propext, Classical.choice, Quot.sound]`. Every arithmetic and scalar
   certificate is `#print axioms`-audited against exactly this list; the four
   apex-tier certificates are audited against this list plus their documented
   boundary axioms (the signature-apex item below), both enforced exactly —
   nothing more, nothing less — by the button.
2. **mathlib** (prebuilt oleans fetched by `lake exe cache get`).
3. **Charon + Aeneas** (pinned `9dd7f23c` / `bf13c42e`): the translation
   from Rust MIR to the Lean model is assumed faithful. The generated
   `gen/` files are never edited (comments only); proofs are stated ABOUT them.
4. **External-function models** (`gen/*/FunsExternal.lean`): Rust items that
   Aeneas cannot translate (constant-time `subtle` primitives, iterator
   plumbing, formatting) are axiomatized as opaque symbols. The axiom audit
   proves none of these axioms enters the dependency cone of any certificate,
   except where a model is explicitly listed below.
5. **The signature-apex boundary (signature layer only)**: FOUR apex-tier
   certificates — `CurveFieldProofs.verify_accepts_iff` (byte apex:
   accepted iff compress([s]·B − [k]·A) = R byte-for-byte),
   `verify_accepts_iff_point` (half-lift: R is the canonical encoding of
   the recomputed point), `verify_accepts_iff_point_eq` (point equation:
   canonically-encoded Q accepted iff Q equals the recomputed point), and
   `verify_accepts_iff_decompress` (full lift: R decompresses to a valid
   on-curve point that equals the recomputed point) — are each
   `#print axioms`-audited by check.sh Phase 3b against EXACTLY the
   standard three plus this documented set, and the build fails on any
   deviation:
   `ed25519.Signature` (wire-format type), the three SHA-512 wrapper
   oracles `verifying.sha512_new/update/finalize_bytes` (+ the opaque
   `sha2.Sha512` state type), `ed25519.Signature.to_bytes`, and
   `signature.error.Error`/`Error.new` (opaque error type). The hash is an
   oracle with no algebraic properties assumed — the theorems hold for
   whatever bytes it produces; the SHA-512 implementation itself is NOT
   verified. Zero curve, scalar, or backend axioms are in any of the four
   cones. The constructive decompress theorem underneath the full lift
   (`decompress_of_canonical`) carries the standard three axioms ONLY.
   That two-tier separation is enforced, not merely observed. Phase 3
   requires every arithmetic certificate's cone to be exactly the three
   kernel axioms, and every apex cone to equal the documented set above
   exactly. `selftest-tiers.sh` attacks it from both sides: it injects one
   of the axioms above into an arithmetic certificate's *proof*, leaving the
   statement untouched so that only the cone moves, and it shifts the
   documented apex boundary by one name in each direction. All three must be
   rejected, and are. Before those cases existed nothing in the harness
   distinguished "this tier needs no hash oracle" from "this tier happens
   not to use one today".
   **What answers each external, and whether it is a proof or an assumption.**
   Aeneas emits a `*_Template.lean` naming everything the extracted code needs
   from outside itself — the extraction's own statement of its boundary. Phase
   0d requires every one of those names to be answered either by the
   hand-written model beside it (an assumption, then governed by the axiom gate
   and the cones) or by a real definition already in the extracted corpus, and
   requires the classification to equal the committed
   `MODEL-CORRESPONDENCE.txt` exactly. That second class is the tier-A/B claim
   this document makes above — the curve calls and curve types resolving to
   proven definitions rather than to axioms — and until 2026-07-31 it was prose
   that nothing checked. `selftest-correspondence.sh` attacks it, including the
   case that matters most: a PROVEN external answered by an axiom instead,
   which changes no name anywhere, leaves every byte pin matching, and compiles
   cleanly because the signature is unchanged.
6. **Compilation of Rust to machine code** (rustc backend) is out of scope,
   as is side-channel behaviour (timing, speculation). The proofs are about
   functional correctness at the MIR/LLBC level.
7. **What the axiom gate binds, and what it does not.** `check.sh` Phase 2b
   reads every compiled `Proofs/*.olean` and fails the build if any
   declaration there is an axiom. It asks the kernel rather than parsing
   source text, because the source-text check in Phase 1 is evadable four
   ways — an indented `axiom`, `@[simp] axiom`, `unsafe axiom`, and `axiom`
   with the name on the following line all compile and all miss its pattern.
   Membership self-derives from the filesystem, so `Scalar*` and `AxiomCheck`
   are covered as well, and the count of compiled modules must equal the
   count of shipped sources, so a deleted `.olean` cannot make the scan pass
   vacuously. `selftest-axgate.sh` attacks the shipping gate rather than a
   copy of it, and was itself negative-tested by removing the gate's error.
   `selftest-shapes.sh` asks the companion question about Phase 2c: can a
   declaration HIDE from the walker? It adds four shapes to an audited module
   — `@[simp]`, `private`, an `instance`, and a nested namespace reusing an
   audited basename — and requires the walker to report every one of them by
   name, not merely to fail. Those four shapes are the ones that defeated a
   source-regex enumerator in ltl-accumulator-verified and caused Phase 2c to
   be written against the Lean environment instead; until 2026-07-31 the fix
   was ported here but never re-attacked. It too was negative-tested, by
   removing the injection and confirming the run then reports the walker blind.
   **The residue you must still supply yourself:** this binds *declarations*,
   not *statements*. Nothing in the button establishes that a certificate's
   theorem says what its name — or this document — suggests it says. A
   theorem gutted to a tautology with the same axiom cone would pass every
   phase. Reading the statements remains a human act.
8. **What the statement binding covers.** `check.sh` Phase 3c compiles
   `Proofs/Audit.lean`, which emits a canonical block containing the policy
   constants, every certificate's fully-elaborated statement (`pp.all`, so
   implicit arguments, instances and universe levels are all visible), and the
   fully-elaborated body of every specification constant transitively
   reachable from those statements. The SHA-256 of that block is pinned in
   `check.sh` and the block itself is committed as `AUDIT-MANIFEST.txt`, so a
   mismatch is diffed rather than merely reported. This is what makes a
   certificate gutted to a tautology of the same axiom cone fail, and what
   makes a reference definition redefined to BE the extracted code fail — two
   attacks that move no cone at all. Phase 0b separately pins the bytes of
   every extracted-model file under `gen/`, with membership derived from the
   filesystem so a new model file fails closed.

   **The residue you must still supply yourself.** Three things, stated
   plainly because a reader would otherwise assume them:

   · *A digest binds identity, not meaning.* The audit proves the statements
     are the ones that were reviewed. Whether those statements say something
     worth believing about ed25519 is a question only a human reading them
     answers. `AUDIT-MANIFEST.txt` is committed precisely so that reading is
     possible without re-running anything.

   · *An author can rotate the pins.* Editing a statement and refreshing the
     digest in the same commit passes every phase. The defence is that both
     changes are visible in the diff, reviewed at the pinned commit — not that
     the script prevents it. No harness audits its own author.

   · *Phase 0b pins the model; it does not verify the translation.* That the
     bytes under `gen/` are the reviewed bytes says nothing about whether
     Charon and Aeneas translated the Rust faithfully. That assumption is
     item 3 above and is unchanged.

9. **The harness is pinned, and what that is worth.** `check.sh` Phase 0c
   requires every executable file under `verification/` — plus the audit
   driver, the committed manifests and the policy tables, which are not
   executable and are therefore listed explicitly in the script — to match
   `HARNESS.sha256`. Membership is derived from the executable bit, so a new
   script fails the build until someone pins it deliberately, and the required
   set is computed from the filesystem rather than read out of the pin file,
   so deleting an entry is a failure rather than a silent un-pinning.
   `lean-guard` is inside that set: stubbing the memory-capped compiler
   wrapper is the cheapest known route to a false green, demonstrated
   elsewhere in this estate as ALL GREEN in 3.6 seconds over deliberately
   destroyed proofs. `selftest-harness.sh` replays that attack and four
   others.

   **What it does NOT buy, stated plainly.** Pinning a harness from inside
   that harness is circular, and no amount of engineering removes the
   circularity. An author who edits `check.sh` — or `lean-guard`, or the
   audit driver — and refreshes its pin in the SAME commit passes every
   phase. What the pin changes is that the edit can no longer be silent: it
   must appear in the diff, at the commit you are reviewing. That is why the
   consumer's protection is, and has always been, *review at the pinned
   commit* rather than the button's own verdict. A green button says "this is
   the apparatus that was reviewed", never "this apparatus is trustworthy".

10. **The whole declaration surface is pinned, not just the certificates.**
   `check.sh` Phase 2c reads the compiled environment and records, for EVERY
   constant originating in an audited module — roughly three thousand of them,
   compiler-generated auxiliaries included — its originating module, fully
   qualified name, declaration kind and complete axiom cone. The observed set
   must equal `inventory-allowlist.txt` exactly, in BOTH directions: a
   declaration present but not allowlisted (`UNCLASSIFIED`) and an allowlist
   entry with no declaration (`STALE`) are both build failures, and a count
   trailer disagreeing with the lines received is a third.

   The gap this closes: Phase 2b asks the kernel only whether an AXIOM is
   declared, and Phase 3 pins the cones of the named certificates. Between
   them sat every helper lemma in the corpus. One of those quietly acquiring
   a hash oracle in its cone moved nothing either phase looked at.

   **Two limits, stated because a reader would otherwise assume neither.**

   · *No independent cone walker here.* The companion accumulator runs a
     hand-written closure walker alongside the kernel's `collectAxioms` and
     requires the two to agree on every constant, so each checks the other.
     Ported to this corpus on 2026-07-29 that walker was wrong in BOTH
     directions on mathlib's inductive shapes — it reported no axioms for
     `CurveFieldProofs.EdPoint` where the kernel reported three, and after
     being extended it reported three for `CurveFieldProofs.ProjPoint` where
     the kernel reported none. Two implementations disagreeing both ways are
     not a cross-check; they are a second wrong answer. The cone figures here
     therefore rest on `collectAxioms` alone. The accumulator keeps its
     cross-check, its corpus being mathlib-free.

   · *The scalar layer is outside this phase.* Thirteen `Proofs/Scalar*`
     modules belong to `check-scalar.sh` and sit outside `check.sh`'s
     Phase 2c specifically — they are inventoried by `check-scalar.sh`'s own
     Phase 2c against `inventory-allowlist-scalar.txt`, both directions. The
     two-button seam itself closed 2026-07-30 (see the two-button item below). Phase 2c prints every uncovered
     module by name on every run, so the omission is visible rather than
     inferred.

11. **Both buttons, and the seam between them.** This repository is checked by
   two scripts: `check.sh` covers the field, curve and signature layers,
   `check-scalar.sh` the scalar layer. Until 2026-07-30 neither asserted
   anything about the other's scope and the main one simply SKIPPED anything
   named `Scalar*`, so a new `Proofs/ScalarX.lean` was gated by nothing at all
   — absent from one manifest by exemption, from the other by omission,
   compiled by neither, inventoried by neither. Each button now reads the
   other's manifest and requires every shipped proof source to belong to
   EXACTLY ONE of them, both directions: neither orphaned nor double-claimed.

   The scalar button was also brought to the main one's standard, having been
   left behind by every hardening round: it now checks source integrity,
   verifies the harness pins (so running it alone is protected too), asks the
   KERNEL about axiom declarations instead of grepping source text, inventories
   its ~1,880 declarations against its own allowlist, and asserts each of its
   13 certificates by name rather than counting how many lines of output
   matched. A count cannot say WHICH certificate is clean, and passes just as
   happily if one cone is reported twice.

   **What this cost, recorded because the lesson generalises.** Three separate
   gates in this work reasoned about how a thing is SPELLED rather than what it
   BELONGS TO, and the corpus punished each one: `Proofs/ScalarPackSpec.lean`
   is named like the scalar layer and owned by the main button. A dead-file
   gate globbing `Scalar*` demanded it be scalar-owned; an axiom gate scanning
   `Scalar*.olean` swept in an artifact this button does not compile, which on
   a fresh tree is absent and would have failed the run for a false reason; and
   the inventory driver discovery globbing `Inventory*.lean` claimed the other
   button's driver. All three now test membership in a manifest. This is the
   same family as the source-text axiom grep that began this campaign:
   reasoning about names instead of about the thing itself.

12. **`--audit-only`, and why a green transcript from it is not evidence.**
   `check.sh --audit-only` runs every gate but skips recompilation, against the
   `.olean` files a previous full run left behind: about 60 seconds against
   about 1280. It exists because gate work dominates this estate's wall-clock,
   and it is safe only because it refuses.

   It refuses unless every shipped `.lean` is BYTE-IDENTICAL to a basis
   recorded by a previous full run — not mtimes, which `touch` defeats, and a
   stale-artifact check that fails open would be worse than no shortcut at all:
   a green button would then describe a corpus that is no longer on disk. The
   basis is gitignored build state, so a fresh clone cannot inherit permission
   to skip compiling, and the closing banner says in words that the run is not
   evidence.

   **The kernel re-elaborates nothing in such a run.** What it establishes is
   that the gates accept artifacts produced earlier — useful while developing a
   gate, worthless as a record. an operator-internal recording gate (in the private infrastructure repo)
   enforces that: it refuses to archive any transcript bearing the audit-only
   markers, and also any transcript without a terminal success banner, any
   containing `error:`, and any repository whose tree is dirty at record time.
   A banner is a request; that tool is the gate.

   Also worth knowing when reading a red run: `lean-guard` clamps Lean's memory
   budget to what the machine can spare, and under load that clamp can be too
   small to elaborate a large module. It surfaces as `FAIL: Proofs/<module>`,
   which reads exactly like a broken proof and is not one — it is a resource
   condition, and the cap is what protects this machine from the global OOM
   that killed a session on 2026-07-02. Check the transcript for a `clamping`
   line before concluding anything about the mathematics.

13. **The verdict depends on committed bytes, not on build state — and what
   proving that revealed.** `check.sh` Phase 0a purges every `.olean` under
   `verification/` before compiling, forbids stray Lean files at the
   verification root (they join the build through `LEAN_PATH`, which contains
   `$PWD`), and requires `gen/` to be exactly the model manifest plus its
   pinned Aeneas templates. The templates are KEPT here, unlike the companion
   SLH-DSA repository which deletes them: `extract.sh` directs the operator to
   diff the hand-written external models against them, so they are the
   reference for that comparison. The purge does not run under `--audit-only`,
   which exists to audit the artifacts a previous full run produced; that is a
   further reason an audit-only transcript is not evidence.

   **What the purge exposed, on 2026-07-30.** This button had never in its life
   compiled the corpus from nothing. The signature apex rests on scalar
   arithmetic — `PointLiftSpec` → `ScalarPackSpec` → `ScalarFromBytesSpec`, and
   `SigApexSpec` → `ScalarDenote` — and TWELVE of the scalar layer's thirteen
   modules are transitive prerequisites of this manifest. They were never
   compiled here. The button worked because `check-scalar.sh` had run at some
   earlier point and left its `.olean` files behind, and `.olean` is gitignored,
   so no `git status` could ever have shown a reader that the verdict rested on
   untracked artifacts produced by a different script. Nothing about the proofs
   was wrong; the *evidence* was resting on something invisible.

   Those twelve are now compiled here as `PREREQ` — **borrowed, not owned**.
   `check-scalar.sh` still audits them: their cones, their declaration
   inventory, their axiom gate. Phase 1b asserts that every borrowed name
   belongs to the other manifest and to neither twice, so the list cannot
   quietly become a second claim of ownership.

   The general lesson, which is why the purge is worth its minutes: a
   verification that never cleans up cannot distinguish "these proofs check"
   from "these proofs check given whatever happens to be lying around".

14. **The signing side of this library — not covered, by anything, at all.**
    Every certificate in this repository is about the VERIFICATION path: the
    apex is `verify_accepts_iff`, an acceptance decision over a message,
    public key and candidate signature. Producing a signature is different
    code — nonce derivation from the hashed secret key, the scalar
    multiplication by the secret, the assembly of `s = r + H(R,A,M)·a mod ℓ` —
    and none of it was extracted, none of it is modeled, and no theorem here
    mentions it. Key generation likewise. This was always true; until
    2026-08-06 no document in this repository said it, which round-7 external
    review (GPT-5.6) correctly flagged as a missing required exclusion.

    Concretely, so the consequence is not left to the reader: a defective
    signer — say one that reuses or biases its nonce, the classic key-leaking
    failure — would emit signatures this repository's proven verifier happily
    accepts, because they are valid signatures. Every certificate would hold.
    The green button says nothing about whether the private key survived the
    signing operation.

    This is not hypothetical for THIS fork. The pacta transparency log signs
    its published tree heads with this library's signing path, and records
    `signing_backend: verified-dalek-serial` in every head. The word
    "verified" in that name refers to the verification certificates in this
    repository — the attested artifact was used, rather than an unattested
    third implementation — and must NOT be read as a claim that the signing
    operation which produced the signature is itself proven. It is not.

    The silence of this document on that point had a measured cost: the
    estate's own author, in 2026-08-06 session notes, twice mangled which half
    of which library the proofs cover. A trust document that states only what
    IS covered invites every reader to over-read it; this item is the
    counterweight.