Read entire ../couscous_adaptive.py for prepublication audit.

PASS on the mathematical/certificate contract:
- Block division sum increment is r+s: r-1 one exponents followed by s+1.
- Anticipatory cap enlargement includes the exact within-block odd peak and does not reset the current integer or source.
- Exact first descent is preserved because skipped one steps increase; CYCLE is only a boundary-repeat certificate as documented.
- UNKNOWN records a sound prefix and verifies its actual block/current-bit/next-peak budget reason.
- verify checks integer field types, block arithmetic, cap policy, endpoint events, and exact counters.
- direct_audit independently executes3x+1 and divides to odd; it does not merely restate block formulas.

No mathematical error found. This is a useful bounded adaptive toolkit, not a convergence theorem. Internal cap enlargement does not yet supply an API for resuming an externally saved UNKNOWN certificate. If a claim uses 'resume', make that intended meaning explicit.

Optional resource hardening for malicious certificates: bound r<=x.bit_length() before computing2**r; bound s by bit_length(3**r*m-1) before computing2**s. Without these, invalid enormous exponents could cause verifier cost, although no false mathematical certificate is accepted.

No extra experiments were necessary for this audit; parent has its own finite replay suite. Source3 peak fixture from the sibling work remains a useful demonstration of the size-accounting contract.
