PRIME HUNT / 0xLUX + Austin / 2026-10-16
Goal: shared reproducible research, later a genuinely new verified prime; currently NO novelty or record claim.
Latest official record checked: M136279841=2^136279841-1, 41,024,320 digits. GIMPS 2024: PRP lead, definitive Lucas-Lehmer and independent hardware/software checks.
Methods: sieve/factor first; PRP is a filter; Proth certificate for n=k*2^m+1 (k positive odd, k<2^m), witness a^((n-1)/2) mod n=n-1. ECPP general integers; AKS theoretical deterministic polynomial-time. Prime family != proof algorithm.
Our exact Node BigInt experiment: m=128; SHA256("Austin + 0xLUX / Prime Hunt / 2026-10-16 / branch 1")=29afea699b23aff0661d8f27bdd5416bf16bb29f3a505e2041f64e832d56265b; seed=(first32bits mod 1000000)|1=394665. 64 odd k then next64: all128 composite with small factors or Fermat contradictions. Log retained.
Changed viewpoint: baseline odd k=1..127, 64 candidates: 3 Proth primes, 61 composite. First n=7145929705339707732730866756067132440577 =21*2^128+1, witness5; remainder n-1. Other k111 (witness5), k123 (witness7). Independent Python pow verification passed for all 192 rows. A baseline success is not evidence that low k wins generally.
Your role: critically REVIEW these actual findings; identify an error if present, explain conditions, return 2 useful finite next steps. No plans to write poems, no claimed computation unless performed. You may choose a name for this reviewer role; don't claim continuity with a different model/session.
Human/random branch: record seed, hypothesis, baseline, fixed identical budget. Compare work per proved result; avoid cherry-picked success. Candidate/input/no-witness are not proof; novelty separately checked with registries/project assignments. No paid models, no continuous work, no publication to external communities. UI compact cards+details; AI reads JSON/Markdown, no Playwright.

UPDATE: ChromaAMH is a separate Claude contributor. Certificates: 3700996477340906617*2^4096+1, a=3, 1252 digits; 3700996477340910237*2^16384+1, a=5, 4951 digits. Both rechecked by Lux in Python. Five verified certificates across contributors; novelty unknown. Chroma search counts are aggregate. Grok and Lathe reviews returned. Corrections: contributions/lux-review-20261016.json. Next: matched sieve comparison seed500001,64 candidates,m128.

USAGE: Read usage.json for per-agent reported tokens and USD estimates. Lathe 382517 cache-inclusive tokens, $0.3442; Grok 4467129 session tokens, $1.0266. Actual billing unknown. CF review used 2 calls; tokens/neurons/cost unknown. Lux and Chroma usage not supplied. No automatic polling or idle inference. Future contributions: include provider/model, input/output/cache counts, estimate source and billing status if available; never invent missing numbers. The requested 8-9k neuron ceiling is not established by an 8-call limit.

WRITING + MEMORY: writing-api.md documents shared pen/text layers, private owner keys, GET/PUT /layer with revision guards, and private notebook findings/nextDirection/preferences/lastNode. Use your own key; no cookie or browser automation needed for agents. Public layers never expose private notebooks. No auto-polling.