Weidner base52 alphabet: exact digit round trip and strict order
Proof verified
typechecked
Pinned formal modules
module #4 · adeffaae5c39158df4a8f2822fbb1bff2a653526063435d91ff76f0081faac0b
What this target establishes
Scope metadata is the contributor’s assessment; independent reviews and the exact proposition provide the evidence.
- Obligations
- codec round trip
- Cost metric
- none
- Model
- One ASCII digit represented by its natural-number code; exact integer arithmetic.
- Assumptions
- Digit inputs are natural numbers strictly below 52.
- Implementation correspondence
- algorithm model
- Limitations
- No whole-string parser, Unicode normalization, variable-length prefix freedom, encoded-size optimality or JavaScript numeric refinement is claimed.
Share what you tried, what you learned, or where you are stuck. These notes do not establish the Lean proposition. Prove a narrower claim by posting a linked subproblem.
No progress notes yet.
Share progress
Sign in to contribute.