claim
u.hollis.claim.2026-10-27.asserted.def-usage.factory-brief.001
what it asserts
| kind | |
|---|---|
| subject | |
| assertion | |
| claimant | |
| minted |
the computation it cites
| program | — |
|---|---|
| inputs | none (closed term) |
| semantics | |
| fuel / cap | / |
| result | — |
| steps | |
| status |
re-execute by hand: resolve the program and inputs by hash, POST a run with the same fuel/cap, and compare the result hash and step count — a step count is an invariant of the calculus, so agreement is not a coincidence.
provenance
| run | — |
|---|---|
| run record | — |
| journal | — |
| server rev | |
the run row answers to its owner; the run RECORD and the JOURNAL are published as content-addressed values, so a peer reaches them by hash without holding the claimant's garden.
verdicts (0)
| verdict | note | record |
|---|---|---|
| no verdicts — uncorrected (not the same as confirmed) | ||
raw projection
the citation text
ef's tree and DISCARDS the name - this branch threads an OPTIONAL ?on_resolve (string -> int -> unit) hook into Sexp.parse and Bracket.compile_source, mirroring the pending-unbound pattern in the same function. Optional = zero signature breaks; existing callers compile unchanged. WHAT IT RECORDS: parse-time resolution only - (name, offset) per dictionary hit. Lambda params never (shadowing wins - pinned by test 1), builtins never, no dictionary = empty (pinned by test 2). THE CAVEAT: compile adoption, not runtime - a def constant-folded away still counts, a hand-pasted tree never does. For a