23 lines
2.9 KiB
Text
23 lines
2.9 KiB
Text
lease: holding 88 pool cores (8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95, waited 0 s): adv-cache-3 skip-rounds0
|
|
[2026-10-07T19:22:55Z] adv-cache-3 skip (internal adversarial pass, not an independent review)
|
|
[2026-10-07T19:22:55Z] self-test: restated B equals chacha_block on 4,096 inputs; core_inv inverts core at w = 2, 4, 8, 16, 32; the restated chain equals Cache::fill_segment on segments 0, 21859, 65535 of day 20730
|
|
[2026-10-07T19:22:55Z] skip: day 20730 w 32 double rounds 0 lines 64 segments 256 plant none threads 88; rotations [16, 12, 8, 7]
|
|
[2026-10-07T19:22:55Z] templates: 2113280 compares of 512-bit lines, chance matches expected 1.576e-148, 0.0 s
|
|
[2026-10-07T19:22:55Z] template 0 [B(c_j)] at 1 block(s): matches 256 (j0:256)
|
|
[2026-10-07T19:22:55Z] template 1 [B(c_j XOR c_i), i < j] at 1 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] template 2 [B(c_j) XOR B(c_i), i < j] at 2 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] template 3 [B(c_j) XOR c_i, i < j] at 1 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] template 4 [B(B(c_j))] at 2 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] template 5 [B(c_j) + c_i, i < j] at 1 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] template 6 [Cinv(line_j) XOR c_j = line_{j-1} (up the chain)] at 1 block(s): matches 0
|
|
[2026-10-07T19:22:55Z] SKIP RESULT: lines derived under j + 1 blocks by any template: 0 of 16384 (gate 0) PASS
|
|
[2026-10-07T19:22:55Z] rank j=1: samples 4096, columns 1025 (x bits, line bits, 1): rank(x_j, line_j) 17 rank(line_j-1, line_j) 17 DEFICIENT: an affine relation exists
|
|
[2026-10-07T19:22:55Z] rank j=2: samples 4096, columns 1025 (x bits, line bits, 1): rank(x_j, line_j) 17 rank(line_j-1, line_j) 17 DEFICIENT: an affine relation exists
|
|
[2026-10-07T19:22:55Z] rank j=32: samples 4096, columns 1025 (x bits, line bits, 1): rank(x_j, line_j) 17 rank(line_j-1, line_j) 17 DEFICIENT: an affine relation exists
|
|
[2026-10-07T19:22:55Z] rank j=63: samples 4096, columns 1025 (x bits, line bits, 1): rank(x_j, line_j) 17 rank(line_j-1, line_j) 17 DEFICIENT: an affine relation exists
|
|
[2026-10-07T19:22:55Z] rank pooled j>=1: samples 4096, rank(x_j, line_j) 94 of 1025 DEFICIENT
|
|
[2026-10-07T19:22:55Z] dependence: 4096 lines, 512 x 512 flip table: worst cells z +64.00 / -64.00 (gate 6), zero cells 261648 of 262144; word table min 0 of 4096 (every output word changes when any input word changes: NO, a word is computable from fewer than 16 input words); 0.1 s
|
|
[2026-10-07T19:22:55Z] partial knowledge: output words computable from a proper subset of the 16 input words: 16 of 16 (gate 0)
|
|
[2026-10-07T19:22:55Z] inversion: 16128 lines: Cinv(line_j) = x_j directly 0; fixed-point iteration x <- Cinv(y - x) converged 0 (gate 0); 0.0 s
|
|
[2026-10-07T19:22:55Z] skip done in 0.1 s
|
|
lease: released 88 pool cores after 0 s, exit 0
|