Manuscript Oai283-A@1 · Oai283-A.tex · section · 6fb75895
Hypothesis ledger
Acceptance ledger and conditional assembly › Hypothesis ledger · lines 1651–1696
| Item | Acceptance condition | Disposition |
|---|---|---|
| Item | Acceptance condition | Disposition |
| A1 | An actual finite circuit skeleton, and an actual generator if uniformity is claimed. | Defined per instance. The phase family has a printed uniform construction. The universal 283-01 generator is not verified. |
| A2 | A named supplied Boolean table and coherent query access. | Explicit resource. Table construction, storage, physical lookup, and coherent correctness are separately charged. |
| A3 | An independent logical approximation certificate with one norm convention. | Exact for the pilot; otherwise a clean-isometry, semidefinite, or finite-confidence certificate is required. Full means half . |
| A4 | Complete implementations, memory/reset assumptions, and resource ledgers. | Proved accounting rules; the particular physical allowances must be supplied. Returned workspace needs its own certificate. |
| A5 | An admissible timed transport realization on the same or an explicitly revised carrier. | A finite path construction is supplied under its library. Finite-future, locality, and arrival obligations are not erased. |
| A6 | Separation from arbitrary precision, Lorentz extraction, dynamics, and emergence. | Obstructions and non-transfer statements are proved. No cone-selection or dynamical premise is supplied by the synthesis certificate. |