in-house-pass.md: adv-accept-3's and adv-mixer-3's own 00:00 readings
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
This commit is contained in:
parent
2e7fb4bf91
commit
877cf4694e
1 changed files with 2 additions and 0 deletions
|
|
@ -198,3 +198,5 @@ Spend: box-hours by lane as each report states (about 0.6, 0.31, pending, 0.55,
|
|||
| adv-accept-3 (read from the report at 0c150e3c by the coordinator at 01:03 BST; the lane's own line owed) | Every sweep ended 23:05 BST; about 3.3 box-hours, 0 pod-hours. Q1 exhaustion BOUND (accept 0.323 and reject 0.677 per attempt, geometric histogram, P(exhaust) 4.6e-44, 0 of 16,337 seeds at the cap). Q1b FINDING, correctness: the real rule rejects 271 of 3,000 last-resort programs (9.0 percent) yet they are handed out unchecked; unreachable. Q2 steering BOUND (45 of 48 plants fired; the real rule rejects every effective plant by (a'); 975 seeds at the first part, partial of 10^5); Q2b the best seed property at 1 in 10^6 tries is a shadow block of 38 multiplies, about 2 to 3 percent of the f = 1 chip's energy per hash (approximate); Q2c the 256-unit ratio is noise as a selector. Q3 FINDING, documentation: the program-id derivation text omits the "sub/" suffix (30956569d8f3d8d7 against fce15bf61030be57 for Devnet 3); 0 collisions over 10^7. Q4 DONE: the (c'') f64 compare never flips a verdict; a second interpretation agrees on 5,748 of 5,748. Q5 BOUND: 400 eras move the address map, not the program |
|
||||
| adv-cache-2 (read at 9384ee09 by the coordinator at 01:03 BST; the lane's own line owed) | About 2.2 box-hours (wall times threads over 96, the boxes at load 400 to 600 for two hours), 0 pod-hours; two shards still queued at 00:00 (partial, named). Q1 PASS (the 2^35 + 3 x 2^33 line census); Q2a PASS with the Devnet 3 site-0 FINDING; Q2b all 64 programs done, every one clear on the hot-set test, the site class at 13 of 27 drawn-era programs over 1.04x (8 over 1.2x, worst 1.7451x), 0 of 61 refused by the v5 floor (AP-F8-6); Q3(1) PASS; Q3(2) the 16,384-day weak-day scan PASS; Q3(3) the window layer exact to four digits, FINDING against the chip model's partial-store rows (up to 1.8x overstated at f = 0.5, the verdict unchanged); Q4 the prices |
|
||||
| adv-mixer-3 (read at 4ebe2455 by the coordinator at 01:03 BST; RUNNING: Q3 and Q4 at k = 8 on day 20729, queue 07 the other seven days; the lane's own line and finish time owed) | Q1 the exhaustive round-0 line-index census over all 2^32 t PASS to k = 8 on both days (and 20730 at k = 2, 3, 4, 8); Q2 and Q2b avalanche FINDING at k = 1 (the known single-application diffusion), PASS from k = 2 at 2^24 and 2^28; Q3 differential multiplicity FINDING at k = 1 (695 and 537 deterministic bits), PASS k = 2 to 7, k = 8 running; Q4 and Q4b linear PASS from k = 1; Q5 rotational-XOR PASS from k = 1; Q6 SAT k = 1 SATISFIABLE in 137 s (the model verified through the real code), k = 2 and 3 TIMEOUT at one hour. The round margin: no statistic survives 2 of the 8 applications between reads |
|
||||
| adv-accept-3, the lane's own line (01:0x BST; tip 0c150e3c, nothing unpushed) | Box-hours 3.3, pod-hours 0. Q1 exhaustion BOUND: P(exhaust 256) = 1.0e-43 per epoch seed from 62,240 candidates of 19,975 full-rule seeds plus 3.0e6 static candidates of 1e6 seeds, 0 at the cap. Q1b FINDING (correctness, unreachable): 271 of 3,000 last-resort programs fail the real rule yet try_generate_class hands them to the chain unchecked; the fix named in the report. Q2 steering BOUND over 19,975 full-rule and 1e6 static seeds: no property buys over about 1.03x at 1 in 1e6 tries; the worst live hot set of eight measured 1.0008x; the stand-in ratio's 256-unit floor is noise. Q3 the program id: 0 collisions in 1e7 pairs (BOUND); FINDING (interoperability): the derivation text omits the generator-4 "sub/" || 3_le16 suffix. Q4 determinism BOUND on the rule (5,748 of 5,748 verdicts agree; the control fired; the f64 compare 0 flips over 2^20 values, latent only at a floor of 0.975) and FINDING (documentary): an implementation written from the spec text differs on 264 of 400 epoch programs. Q5 era steering BOUND (400 eras move the address map, not the program). Partial, named: the floor-0.97 known-failed variant did not fire (the (c'') ratios are bimodal, accepted 0.989 to 0.999, rejected 0.814 to 0.966) and was replaced by the single-pass (a) variant, which fired; 25 seeds of the kill window uncovered in the steer sweep. Running: nothing. Longer pass: the steering sweep to 1e5 seeds with a live census as the true selector, the ratios sweep to 3,000 seeds, a chosen-id preimage attempt through the murmur finaliser |
|
||||
| adv-mixer-3, the lane's own line (01:05 BST; tip 4ebe2455, later 6288a154; 163 log copies) | Box-hours about 3.0 wall-hours of sweep on the two boxes (build-1 1.9, build-2 1.1, both at load 100 to 600 throughout) plus 4 single-core CaDiCaL hours; pod-hours 0; GPU BLOCKED. Q1 BOUND (uniform k = 1 to 8, both days, 2^32 t exhaustive). Q2 and Q2b avalanche FINDING at k = 1, BOUND from k = 2 (0 cells beyond 6 sigma through k = 8; 2^28 at k = 2 to 4). Q3 differential FINDING at k = 1 (35 to 40 output bits fixed per single-bit difference), BOUND from k = 2 to 7; no full output difference ever repeated at any k. Q4 linear BOUND from k = 1. Q5 rotational-XOR BOUND from k = 1. Q6 SAT BOUND: k = 1 solved in 137 s, five orders slower than the honest 2^10 trials; k = 2, 3, 4 TIMEOUT at one hour. The round margin: no statistic survives 2 of the 8 keyed applications between dependent reads; 6 of 8 are margin on every measured statistic, 70 of 72 per item; the k = 1 effects are one mechanism (the lowest-set-bit trail through one application, dead once both addends carry a difference); nothing saves one application against 9,360 ops per item. Partial, named: Q3 k = 8 not run; Q2 2^27 rows at k = 2, 3 and Q2b day 20733 2^28 rows running (finish about 03:00 BST at 4 cores); Q6 day 20733 k = 2 to 4 running (about 03:45 BST, timeouts expected); Q7 random days only 20730 so far; multi-bit linear masks and a MILP trail bound not attempted. Longer pass: multi-bit masks, a MILP differential bound through 2 applications, the SAT model with a cache-line XOR between applications, 2^30 states at k = 2 |
|
||||
|
|
|
|||
Loading…
Reference in a new issue