Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
The diff you're trying to view is too large. We only load the first 3000 changed files.
2 changes: 1 addition & 1 deletion .devcontainer/Dockerfile
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ RUN curl -sSfL https://github.com/leanprover/elan/releases/download/v4.2.3/elan-
&& tar -xzf /tmp/elan.tar.gz -C /tmp/elan-bin \
&& /tmp/elan-bin/elan-init -y --no-modify-path --default-toolchain none \
&& rm -rf /tmp/elan.tar.gz /tmp/elan-bin \
&& elan toolchain install leanprover/lean4:v4.32.1 \
&& elan toolchain install leanprover/lean4:v4.32.2 \
&& ln -s /usr/local/elan /root/.elan

RUN curl -sSfL https://github.com/casey/just/releases/download/1.57.0/just-1.57.0-x86_64-unknown-linux-musl.tar.gz -o /tmp/just.tar.gz \
Expand Down
2 changes: 1 addition & 1 deletion AGENTS.md
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ Expanded, in the order they are most often broken:

4. **A claim about a dependency belongs to that dependency.** Lean's
guarantees are authority rows in `model/authorities.toml`, not LexLean
claims. Citing Lean 4.32.1 is not proving it; `leanchecker` is a
claims. Citing Lean 4.32.2 is not proving it; `leanchecker` is a
same-kernel replay, never described as an independent checker (§22.4).

## Adding a capability
Expand Down
15 changes: 15 additions & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,21 @@ workspace carried at those versions without a tag.

## Unreleased

- Breaking security update: replace the single Lean 4.32.1 pin with
`leanprover/lean4:v4.32.2`, source commit
`f3b06c705e6c85f5314019d5d3baab0fec5b580c` (SPEC.md §8.2). The
[upstream point release](https://lean-lang.org/doc/reference/latest/releases/v4.32.2/)
fixes the nested-inductive kernel soundness issue
[leanprover/lean4#14576](https://github.com/leanprover/lean4/issues/14576).
All three compiler-semantics identities change; projects and generated
evidence must be regenerated under the new pin. The older toolchain is
refused. Historical evidence and frozen language-1.0/1.1 runtime text
retain their original bytes. This is a patch migration, not the separate
Lean 4.33.1 feature upgrade. The differential oracle's pinned commit names
4.32.1 and upstream has none naming 4.32.2, so its pin gains the optional
`source_lean_toolchain` (an exactly named earlier patch release, built with
the pinned Lean; SPEC.md §17.19).

- Intel macOS runs on the line, not on every pull request (SPEC.md §8.3,
§9.4). The repository has about one hosted Intel runner and the host's
workload takes about three hours of it, so pull requests queued six hours
Expand Down
26 changes: 13 additions & 13 deletions CONFORMANCE.md
Original file line number Diff line number Diff line change
Expand Up @@ -150,7 +150,7 @@ the error registry does not sanction (R5, `ERRORS.md`).
| `CF-11` | `build` | Check, build, format, and verify resolve only locked locally available dependencies. |
| `CF-12` | `build` | Network package acquisition occurs only through lock --allow-network and only for an exact configured commit. |
| `CF-13` | `build` | The Lake workspace contains exactly one supported Lake configuration and the recorded workspace files match. |
| `CF-14` | `build` | Language 1.0 accepts only leanprover/lean4:v4.32.1 for verification. |
| `CF-14` | `build` | Language 1.0 accepts only leanprover/lean4:v4.32.2 for verification. |
| `CF-15` | `build` | Duplicate logical modules and case-folded path or module collisions are rejected. |
| `CF-16` | `build` | Language 1.1 has a parallel exact builtin closure and rejects a language-1.0 lock or package without altering language-1.0 identities. |
| `CF-17` | `build` | Language 1.2 declaration support accepts language 1.2 and rejects unsupported or malformed language versions. |
Expand Down Expand Up @@ -600,7 +600,7 @@ the error registry does not sanction (R5, `ERRORS.md`).
| `SM-16` | `build` | The language-1.1 semantic snapshot contains every closed declaration, term, recursion, match, instance, proof variant, and exact theorem axiom policy without paths or backend text. |
| `SM-17` | `build` | Language 1.1 has distinct mathematical Int, fixed-width signed and unsigned integer, UTF-8 string, byte-sequence, Option, and Result semantic types with canonical literals. |
| `SM-18` | `build` | Portable arithmetic, conversion, bitwise, bounded-shift, collection, UTF-8, byte-order, split/join, and decimal operations form one closed typed primitive vocabulary. |
| `SM-19` | `build` | Portable semantic operations generate deterministic Lean 4.32.1 definitions that elaborate and replay with exact declared computational axiom policies. |
| `SM-19` | `build` | Portable semantic operations generate deterministic Lean 4.32.2 definitions that elaborate and replay with exact declared computational axiom policies. |
| `SM-20` | `build` | Noncanonical, out-of-range, invalid-byte, ill-typed, and unbounded fixed-width values fail before either backend runs. |
| `SM-21` | `build` | Structural recursion admits byte/list values and closed Option and Result inductives while preserving termination and exhaustiveness checks. |
| `SM-22` | `build` | The public owned snapshot DTO and schemas cover every portable type, literal, primitive, and explicit definition axiom policy without backend text. |
Expand All @@ -618,7 +618,7 @@ the error registry does not sanction (R5, `ERRORS.md`).
| `SM-34` | `build` | A version 2 core-module row may be derived, stating its name, kind, and extension state, and for a sparse casesOn its recipe, and no universe parameters, type, or value: the decoder makes the constant with the pinned Lean's own construction at the row's place in the order, and refuses the module when the name is not one the pinned Lean reserves and the row states no sparse casesOn recipe, when the construction does not make the name, or when the constant it makes is not a theorem, definition, or abbreviation as the row says; the notation writes a derived row without a type, the schema and the linker refuse a derived row that states what the construction decides, a stored row is still checked against the construction, the decoder checks that the constructors a recipe names are constructors of the type and are named once, that the module states every sparse casesOn its construction makes, and that every derived sparse casesOn is referred to by the type or value of a row, and the content of a derived row is checked by its uses alone, so that a recipe naming other valid constructors of the type is not distinguished where the use accepts it; and the shipped preservation library states every row that carries a sparse casesOn record or is named like an equation, an unfolding equation, a splitter, or an else equation as a derived row. |
| `SM-35` | `build` | A language-1.2 theorem may be proved by `term_cases`, a split on the value of a document term: the proof names a term and a nonempty, strictly sorted, duplicate-free list of prior document definitions, the term's type is an inductive type of the document, and the backend lowers the proof to a split of the goal on every constructor of that type with the hypothesis that equates the term to the constructor, then `simp only` over the named definitions, that hypothesis, and the reduction of a conditional on a decided condition, with closed propositions decided, which uses exactly the axioms the theorem's policy states; the schema, the linker, the notation, the Lean backend, the canonical LaTeX, and the formatter accept it, and a use in language 1.1, a term whose type is not an inductive type of the document, an empty list, an unsorted or repeated name, a name that is not a prior definition, and a theorem parameter that takes the hypothesis's name are each refused. |
| `SM-36` | `build` | A language-1.2 `cases` proof may split a local of type `Bool` into its two constructors: the proof names the local and gives a branch for `false` and one for `true`, each with no binders, the backend lowers it to `cases` on the local with those two alternatives, the theorem verifies with exactly the axioms its policy states, and the schema, the linker, the notation, the formatter, and the canonical LaTeX accept it; a use in language 1.1, a missing branch, a repeated branch, a branch with a binder, and an `induction` on a Boolean are each refused. |
| `SM-37` | `build` | A language-1.2 theorem may be proved by `nested_induction`, an induction over a nested inductive type of the document, one that holds a member of itself under `List`, `Option`, `Result`, or a product and is in no mutual group: the proof names a parameter of the theorem, states one proposition for each auxiliary member of the type's recursive family in the order the pinned Lean's recursor takes them, and gives a branch for every constructor of the type and of each auxiliary member, each binding the constructor's fields followed by one hypothesis for each field that is a member of the family, in field order; the backend lowers it to `induction` over the recursor the pinned Lean generates for the type, with the propositions as its auxiliary motives and the goals taken in the order of its minor premises, so that a theorem over every value of a type with a constructor that holds a `List` of the type verifies under the pinned Lean 4.32.1 with exactly the axioms `propext` and `Quot.sound`, the set its build observes; the schema, the linker, the notation, the formatter, and the canonical LaTeX accept it, and a use in language 1.1, a local whose type is not a nested inductive of the document or lies in a mutual group, an auxiliary member that is missing, repeated, or out of order, a missing or repeated branch, a branch with the wrong number of binders, a proposition that is not well typed, and an `induction` proof on a nested type are each refused as LLT4001. |
| `SM-37` | `build` | A language-1.2 theorem may be proved by `nested_induction`, an induction over a nested inductive type of the document, one that holds a member of itself under `List`, `Option`, `Result`, or a product and is in no mutual group: the proof names a parameter of the theorem, states one proposition for each auxiliary member of the type's recursive family in the order the pinned Lean's recursor takes them, and gives a branch for every constructor of the type and of each auxiliary member, each binding the constructor's fields followed by one hypothesis for each field that is a member of the family, in field order; the backend lowers it to `induction` over the recursor the pinned Lean generates for the type, with the propositions as its auxiliary motives and the goals taken in the order of its minor premises, so that a theorem over every value of a type with a constructor that holds a `List` of the type verifies under the pinned Lean 4.32.2 with exactly the axioms `propext` and `Quot.sound`, the set its build observes; the schema, the linker, the notation, the formatter, and the canonical LaTeX accept it, and a use in language 1.1, a local whose type is not a nested inductive of the document or lies in a mutual group, an auxiliary member that is missing, repeated, or out of order, a missing or repeated branch, a branch with the wrong number of binders, a proposition that is not well typed, and an `induction` proof on a nested type are each refused as LLT4001. |
| `SM-38` | `build` | A language-1.2 build publishes, for every semantic module, a declaration ID for each declaration and a statement ID for each theorem: the declaration ID is a framed SHA-256 of the declaration's canonical JSON and of the declaration IDs of the project declarations it references, with declarations that reference one another hashed as one group, and the statement ID omits the theorem's proof; changing one literal of one definition changes the declaration IDs of exactly that definition and of the declarations that reach it by reference, changing a theorem's proof alone leaves its statement ID unchanged, adding or reordering independent declarations changes no ID, the IDs equal their recomputation from the specified framed inputs, the file validates against `api/schemas/declarations.schema.json`, and a language-1.0 or 1.1 build publishes none. |

## stdlib
Expand Down Expand Up @@ -686,22 +686,22 @@ Never re-derived, vendored, or gated on.

| Authority | Citation | Evidence here |
| --- | --- | --- |
| `LEAN-REL-4-32-1` | https://github.com/leanprover/lean4/releases/tag/v4.32.1 | `CF-14`, `VR-02`, `VR-05` |
| `LAKE-4-32-1` | https://github.com/leanprover/lean4/tree/v4.32.1/src/lake | `VR-03`, `VR-17` |
| `LEANCHECKER-4-32-1` | https://github.com/leanprover/lean4/tree/v4.32.1 | `VR-08` |
| `PRINT-AXIOMS-4-32-1` | https://github.com/leanprover/lean4/tree/v4.32.1 (the #print axioms command); observed output fixtures under tests/golden/axiom-parser/ | `VR-09`, `VR-10` |
| `LEAN-LCNF-4-32-1` | https://github.com/leanprover/lean4/tree/f054605aea4b840552cca2e725580bffd1e1b704/src/Lean/Compiler/LCNF | `NE-01`, `NE-02`, `NE-04` |
| `LEAN-REL-4-32-2` | https://github.com/leanprover/lean4/releases/tag/v4.32.2 | `CF-14`, `VR-02`, `VR-05` |
| `LAKE-4-32-2` | https://github.com/leanprover/lean4/tree/v4.32.2/src/lake | `VR-03`, `VR-17` |
| `LEANCHECKER-4-32-2` | https://github.com/leanprover/lean4/tree/v4.32.2 | `VR-08` |
| `PRINT-AXIOMS-4-32-2` | https://github.com/leanprover/lean4/tree/v4.32.2 (the #print axioms command); observed output fixtures under tests/golden/axiom-parser/ | `VR-09`, `VR-10` |
| `LEAN-LCNF-4-32-2` | https://github.com/leanprover/lean4/tree/f3b06c705e6c85f5314019d5d3baab0fec5b580c/src/Lean/Compiler/LCNF | `NE-01`, `NE-02`, `NE-04` |
| `UOR-GNAF-1-DRAFT-2` | https://github.com/afflom/wasm-gemm-gnaf/blob/917306fd2b5a397ab02c5d38918fb8620fcc5ae0/authority/UOR-GNAF-v1-draft.2.md; the issuer publishes no upstream copy, so the citation is the downstream repository that vendors the draft and pins its SHA-256 in its authority manifest | `GN-02`, `GN-03`, `GN-04`, `GN-05`, `GN-06`, `GN-07`, `GN-08` |
| `RUSTC-1-97-1` | https://github.com/rust-lang/rust/releases/tag/1.97.1 | `TC-07` |

## Claims that are not conformance IDs

| ID | Level | Claim |
| --- | --- | --- |
| `AUTH-LEAN-REL-4-32-1` | `some-true` | Lean 4.32.1 is the release tagged leanprover/lean4:v4.32.1, built from source commit f054605aea4b840552cca2e725580bffd1e1b704. |
| `AUTH-LAKE-4-32-1` | `some-true` | Lake as distributed with Lean 4.32.1 resolves a pinned workspace environment through lake env without network access when every locked dependency is locally available. |
| `AUTH-LEANCHECKER-4-32-1` | `some-true` | The leanchecker executable distributed with Lean 4.32.1 replays a compiled module's environment through the Lean kernel in a separate process and is not an independent proof checker. |
| `AUTH-LEAN-LCNF-4-32-1` | `some-true` | Lean 4.32.1 translates a code-generating definition to base-phase LCNF with Lean.Compiler.LCNF.toDecl, the compiler's own input to its later passes, so every constant the compiled definition can depend on at run time is named by that translation or by a definition it names. |
| `AUTH-LEAN-REL-4-32-2` | `some-true` | Lean 4.32.2 is the release tagged leanprover/lean4:v4.32.2, built from source commit f3b06c705e6c85f5314019d5d3baab0fec5b580c. |
| `AUTH-LAKE-4-32-2` | `some-true` | Lake as distributed with Lean 4.32.2 resolves a pinned workspace environment through lake env without network access when every locked dependency is locally available. |
| `AUTH-LEANCHECKER-4-32-2` | `some-true` | The leanchecker executable distributed with Lean 4.32.2 replays a compiled module's environment through the Lean kernel in a separate process and is not an independent proof checker. |
| `AUTH-LEAN-LCNF-4-32-2` | `some-true` | Lean 4.32.2 translates a code-generating definition to base-phase LCNF with Lean.Compiler.LCNF.toDecl, the compiler's own input to its later passes, so every constant the compiled definition can depend on at run time is named by that translation or by a definition it names. |
| `AUTH-RUSTC-1-97-1` | `some-true` | rustc 1.97.1 compiles a safe Rust 2021 crate with the semantics The Rust Reference states for that release: the checked integer methods return None exactly on overflow, the wrapping shifts mask their amount, integer division truncates toward zero, and a #![no_std] crate that declares no extern crate links neither alloc nor std. |
| `AUTH-PRINT-AXIOMS-4-32-1` | `some-true` | Lean 4.32.1 reports the transitive axiom dependencies of a declaration through #print axioms in exactly the output forms recorded by the committed axiom-parser fixtures. |
| `AUTH-PRINT-AXIOMS-4-32-2` | `some-true` | Lean 4.32.2 reports the transitive axiom dependencies of a declaration through #print axioms in exactly the output forms recorded by the committed axiom-parser fixtures. |
| `AUTH-UOR-GNAF-1-DRAFT-2` | `some-true` | UOR-GNAF normative draft uor-gnaf/1-draft.2 requires an optimality claim's machine contract, accounting model, complete-system universe and its optimizer-independent completeness evidence, objective order, and claim class to be fixed before optimization, and treats UOR-NAF as informative only. |
2 changes: 1 addition & 1 deletion Dockerfile
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
#
# The image carries the compiler *and* the exact toolchain its `verify`
# command requires. LexLean's central claim is that a document was checked by
# Lean 4.32.1 and replayed by that toolchain's `leanchecker` (§22, R9); an
# Lean 4.32.2 and replayed by that toolchain's `leanchecker` (§22, R9); an
# image with the binary alone could `check` and `build` but never `verify`,
# which is the part worth distributing. Both versions are read from the files
# that pin them --- `rust-toolchain.toml` and `lean-toolchain` --- so the image
Expand Down
Loading