You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
[v0.4] Text and coverage left from the v0.4 train's member reviews (follow-up to #167) #182
Follow-up to #167. These items were raised on the member PRs and are not on f1e1157. None changes compiler records.
SPEC §17.17, certificate B: "2.4 KB of each certificate B" (SPEC.md:5003), program and crate terms "noncomputable" (:5024; they are not compiled), the B checking times measured on text certificates, and the two reasons given for the missing module header.
COSTS_B: record how it was derived (SPEC.md:4923 says half of the greatest; the review found the text-era costs divided by four). State in SP-02 that a mixed shape fitting at full scale 256 gets no edge check (cases/preservation.rs:425).
dyadicRoundShift (examples/models/src/Recognizer.lex.tex:356) ignores the done flag of iterate_until and returns a wrong value when exponent plus shift exceeds 512. Return Option, or delete it with the unused dyadicMul.
decodeBinary64's unsigned branch is untested.
CHANGELOG says "43 theorems (39 + 4)"; there are 47.
The skewed-oracle plant's output is "..." in VERIFICATION.md.
Capacity: CHANGELOG says that, with certificate A as data, a pair of match arms costs about 5.7 times its text cost (1018 against 180 sixteenths), so the widest match that fits the default max_file_bytes falls from about 420 to 240 constructors (SP-02, SPEC §17.17), and that a project with a wider match raises max_file_bytes.
Activity
humuhumu33 commentedon Oct 18, 2026
Superseded by #187, which combines #178, #180 and #182 into one v0.4 issue that one PR closes.
Generated by Claude Code