Changes touching this path
- a timing without a control stops compiling: timed_min takes its controls as a const-sized array and a const assert refuses an empty one, every prove_ returns a Proven token whose constructor is private so the argument cannot be forged, and snapshot_delta - the one timing the gate judges and the only one of the thirteen that called no control at all - gets a first control, proved non-vacuous by breaking tree_edited to return the tree unedited and watching it go red rather than produce a happy number; the clock is handed to the body rather than wrapping the repetition because locally_missing and closure_complete re-open their store outside the timed region while for repo_open and graph_load that same call is the measurement, so a combinator that timed the whole repetition would have silently destroyed both shapes, and the holes and complete checks move inside the body so they cover every repetition instead of whichever reading happened to be last; the refusal is post-monomorphization, so cargo check passes on a tree cargo build rejects, which is written into the doc beside a compile_fail pin and its positive arm because a compile_fail example passes on any compile error; and three of this ticket's own citations were wrong and are corrected rather than worked around, since TIMING lives in gate.rs and not in the bin, the prove_ call sites number 24 and not 68, and the five blind instruments in one night that ADR 0072 was said to record are not in it at all - a mis-citation two other places in the tree already make, left to a follow-up rather than widened into this change (#1654)
f03656a4 · dbf3dbe6…
Renames are not followed. loot's tree maps a path to an address, so a rename is a delete and an add. This list is the history of the name, not of the bytes.