Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
24 commits
Select commit Hold shift + click to select a range
2c49d32
Prepare SM-39 decimal formatting policy regression (#434)
Nov 3, 2026
3fd8732
Prepare native SM39 policy regression on landed v0.5 source
Nov 4, 2026
77f6dd2
Isolate native decimal formatting from parse evidence [skip ci]
Nov 4, 2026
a6b4036
Merge release/v0.5 (6c36829120) into maintainer/381-format-isolation
claude Nov 14, 2026
dae43b5
Merge #441 (217cc36602) into maintainer/381-format-isolation
claude Nov 14, 2026
adee2a9
Relock under the moved language-1.2 compiler-semantics ID
claude Nov 14, 2026
598c7e2
Merge #441 (5262319) into maintainer/381-format-isolation
claude Nov 14, 2026
b209368
Write the formatting graphs in canonical notation
claude Nov 14, 2026
163715d
Relock under the moved language-1.2 compiler-semantics ID
github-actions[bot] Nov 14, 2026
04f94cd
Merge #441's regenerated head (e415e4a9b8) into maintainer/381-format…
github-actions[bot] Nov 15, 2026
5f8ce1f
State the axioms Coverage.Prims.formats now uses: [propext]
github-actions[bot] Nov 15, 2026
52f28e7
Relock reasoning-conclude-bypass-invariant under the language-1.2 ID
github-actions[bot] Nov 15, 2026
cdd6e45
Merge #441 (a929968c13) into maintainer/381-format-isolation
github-actions[bot] Nov 15, 2026
fe53de1
Regenerate the written outputs of cdd6e45ef0
github-actions[bot] Nov 15, 2026
1ecb40a
Separate the SM-43 row with a blank line (canonical IdsSM)
github-actions[bot] Nov 15, 2026
c6b9c7d
Merge #441 (5026efb921) into maintainer/381-format-isolation
github-actions[bot] Nov 15, 2026
a90584c
Relock under this branch's language-1.2 ID after merging #441
github-actions[bot] Nov 15, 2026
986e3b3
Regenerate the written outputs of a90584ca42
github-actions[bot] Nov 15, 2026
5a1f3ae
Point listIndex's eqn_info at its renumbered nodes (GC-09)
github-actions[bot] Nov 15, 2026
2ee7fdc
Restate Factor's formatDecimal equations with ToString (GC-09)
github-actions[bot] Nov 15, 2026
624220f
Relock under this branch's language-1.2 ID (a691c55e)
github-actions[bot] Nov 15, 2026
0a59099
Format signed fixed widths without propext (SM-43)
github-actions[bot] Nov 16, 2026
db46237
Merge release/v0.5 (361dc351: #553, #539) into maintainer/381-format-…
github-actions[bot] Nov 16, 2026
bf13f10
Spell nonnegative intDecimal with Nat.toDigits for extraction
github-actions[bot] Nov 16, 2026
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
  •  
  •  
  •  
7 changes: 7 additions & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,13 @@ and Unreleased holds what has landed since.

## Unreleased

- Decimal formatting at a fixed width uses no axiom (`SM-43`, SPEC.md §17.12). In the pinned
Lean, `ToString` at `Int8`..`Int64` goes through `Int.repr`, whose `"-" ++` depends on
`propext`. `LexLeanRuntime.formatDecimal` now takes the runtime class `DecimalFormat`: at
`Int` and the unsigned widths its instance is `ToString`, and at the signed widths it is
`intDecimal` of the value's `Int`, which writes the `-` with `String.ofList`. Each output
is the same bytes. Parsing keeps its `Decimal` evidence. The language-1.2 compiler-semantics
ID changes.
- `just relock-identity` writes what a moved compiler-semantics ID moves: it writes the Rust
backend records of `language/semantics-1.2.toml` (`cargo xtask semantics-records --write`,
new), builds the compiler, keeps each relocked `lexlean.lock` whose only change is its `compiler_semantics`
Expand Down
1 change: 1 addition & 0 deletions CONFORMANCE.md
Original file line number Diff line number Diff line change
Expand Up @@ -658,6 +658,7 @@ the error registry does not sanction (R5, `ERRORS.md`).
| `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-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. |
| `SM-42` | `build` | A language-1.2 definition may apply bit_and, bit_or and bit_xor to two Nat operands and shift_left and shift_right to a Nat operand and a Nat amount, each with result Nat and no Option, and the backend lowers them to Nat.land, Nat.lor, Nat.xor, Nat.shiftLeft and Nat.shiftRight, so that reflexivity evaluates them inside a verified module; the registered laws nat_bit_and, nat_bit_or, nat_bit_xor, nat_bit_shift_left, nat_bit_shift_right, nat_or_xor_and, nat_witt_step and nat_bit_ext state the bit read of each under an exact axiom policy, and a theorem that applies one verifies while a false bit equation is rejected; a use in language 1.1, bit_not of a Nat, a Nat operand mixed with an integer of another type, and a production root over a Nat form are each refused. |
| `SM-43` | `build` | Language-1.2 decimal formatting verifies with no axioms at fixed widths and exactly propext at Int, while decimal parsing preserves canonical spelling and range refusals. |
| `SM-44` | `build` | A language-1.2 theorem may be proved by `evaluation`, an equality checked by the kernel alone: the proof carries no argument, the backend lowers it to `MVarId.refl` with `check := false` run as a finishing tactic, so the elaborator's unifier never compares the two sides, and the module imports as `meta` exactly the two Lean modules that tactic needs; a true equation verifies with exactly the axioms its policy states, a false one and a policy that states more axioms are refused at verification by the pinned Lean, the schema, the linker, the notation, the Lean backend, and the formatter accept it, and a use in language 1.1 is refused. |

## stdlib
Expand Down
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -147,7 +147,7 @@ just vv
just release
```

All 524 registered conformance IDs are implemented. `just vv` runs the complete normative acceptance gate (SPEC.md §9.2). `just release` runs `vv` and the §30 criterion; it is refused until 1.0.0.
All 525 registered conformance IDs are implemented. `just vv` runs the complete normative acceptance gate (SPEC.md §9.2). `just release` runs `vv` and the §30 criterion; it is refused until 1.0.0.

The [`lean4-prod`](https://github.com/UOR-Foundation/lean4-prod) differential is validation evidence only. A missing oracle fails on Linux x86 64 and prints `NOT VALIDATED` elsewhere. Releases live on `release/vX.Y`, and a tag before 1.0.0 does not claim the §30 criterion.

Expand Down
5 changes: 3 additions & 2 deletions SPEC.md
Original file line number Diff line number Diff line change
Expand Up @@ -2675,7 +2675,7 @@ uses that type's fixed decidable equality without coercion; mathematical
the explicit `UInt32` maximum number of fields. Join is its deterministic
delimiter intercalation. Decimal parsing accepts a value exactly when parsing,
range checking, and formatting reproduce the input byte-for-byte; formatting
is canonical base ten. No operation wraps, saturates, defaults a numeric type,
is canonical base ten. In language 1.2, `format_decimal` at every fixed-width integer type verifies with no axioms, and at `Int` with exactly `propext`; formatting does not inherit the axioms of decimal parsing (`SM-43`). No operation wraps, saturates, defaults a numeric type,
uses a host exception, or delegates its meaning to a backend-specific payload.

Members are qualified logical
Expand Down Expand Up @@ -12128,6 +12128,7 @@ Every row below is normative, has honesty level `build`, and is projected byte-f
| `SM-37` | `semantic-ir` | 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. | §16.9, §17.10, §17.12 |
| `SM-38` | `semantic-ir` | 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. | §21.9 |
| `SM-42` | `semantic-ir` | A language-1.2 definition may apply bit_and, bit_or and bit_xor to two Nat operands and shift_left and shift_right to a Nat operand and a Nat amount, each with result Nat and no Option, and the backend lowers them to Nat.land, Nat.lor, Nat.xor, Nat.shiftLeft and Nat.shiftRight, so that reflexivity evaluates them inside a verified module; the registered laws nat_bit_and, nat_bit_or, nat_bit_xor, nat_bit_shift_left, nat_bit_shift_right, nat_or_xor_and, nat_witt_step and nat_bit_ext state the bit read of each under an exact axiom policy, and a theorem that applies one verifies while a false bit equation is rejected; a use in language 1.1, bit_not of a Nat, a Nat operand mixed with an integer of another type, and a production root over a Nat form are each refused. | §17.11, §17.12 |
| `SM-43` | `semantic-ir` | Language-1.2 decimal formatting verifies with no axioms at fixed widths and exactly propext at Int, while decimal parsing preserves canonical spelling and range refusals. | §17.12 |
| `SM-44` | `semantic-ir` | A language-1.2 theorem may be proved by `evaluation`, an equality checked by the kernel alone: the proof carries no argument, the backend lowers it to `MVarId.refl` with `check := false` run as a finishing tactic, so the elaborator's unifier never compares the two sides, and the module imports as `meta` exactly the two Lean modules that tactic needs; a true equation verifies with exactly the axioms its policy states, a false one and a policy that states more axioms are refused at verification by the pinned Lean, the schema, the linker, the notation, the Lean backend, and the formatter accept it, and a use in language 1.1 is refused. | §17.10 |
| `DF-01` | `declarations` | A valid type-definition sentence emits one nonrecursive sort-valued Lean def linked to its document entry. | §15.7, §18.6 |
| `DF-02` | `declarations` | A valid term-definition sentence emits one nonrecursive explicitly typed Lean def. | §15.7, §18.6 |
Expand Down Expand Up @@ -12529,7 +12530,7 @@ Every row below is normative, has honesty level `build`, and is projected byte-f
| `NS-06` | `normative-source` | The hand-edited normative inputs of the repository are the `.lex.tex` modules of the specification project: `model/` holds only the projected files and the copies an authority row vendors, every Markdown file at the root is a projection or is on the closed list of hand-written documents, the projections carry the notice that names their source, and no hand-written document restates a registered statement, a plant of each being refused naming R1. | §27.2, §27.5, §27.10 |
| `NS-07` | `normative-source` | `cargo xtask spec` changes the chapter modules of the specification project by item: it replaces a block, inserts one after a block, and ports the hunks of a merged SPEC.md that lie outside derived regions, each through the authoring SDK, and it writes nothing unless the regenerated SPEC.md equals the intended text outside derived regions, refusing a first line that matches no block or two and a hunk that spans two blocks. | §24.8, §27.5 |

**Total required capability IDs:** 524.
**Total required capability IDs:** 525.

No row may be downgraded to `some-true` or `open`. Upstream Lean facts are ledger/authority rows, not substitutions for these build behaviors.

Expand Down
Loading
Loading