andrew efd1b323e7 Prove minimality is unique and add it to the headlines
- Define `ConflictRange.toSet`, the set of keys lying in a range
- Add the headline `MinimalUnique`: any two minimal sound ranges for the
  same read and result denote the same set of keys
- Transport `FormalConflictRange.Minimal.toSet_eq` across the bridge; the
  statement is unconditional, since `Minimal` already carries soundness
- State `Statement.minimalUnique` in the challenge and add it to the
  comparator's `theorem_names`

`lake build` is warning-free and `lake comparator` accepts both headlines.
2026-11-17 11:39:52 -05:00
2026-11-17 10:04:35 -05:00
S
Description
A closed-form algorithm that computes the minimal conflict range for an observed range read and result.
Apache-2.0
1.1 MiB
2 Watchers 0 Forks
Languages
Lean 97.5%
C++ 2.3%
Shell 0.1%