Name the object
Hamiltonian, algebra, detector, theorem or material—not an atmosphere of resemblance.
A distributed search · 26 Oct–2 Nov 2026
Halloween
Monster Hunt
The Monster is too large to enumerate. The route to it is not. Pick one trail in the physics–Moonshine ladder and prove it, compute it, build it, reproduce it—or kill it cleanly.
Lanterns lit until 2 November
Calculating moonrise…
- ▣Carrierlocal hardware
- ◉Gapstable phase
- ⬡Rank 24boundary test
- ◇Orbifoldsew the sectors
- 𝕄Witnessheld-out prediction
01 / The brief
Do not search the Monster.
Build the ladder.
The group has roughly 8 × 1053 elements. Brute force is the wrong game. The hunt follows compressed structure: local carriers, thermodynamic gaps, boundary algebras, rank-24 discrimination, orbifolds, defects and held-out detector predictions.
Parallelize the searches. Serialize the promotions. A failed trail—with its assumptions intact—is a trophy, not a loss.
Read the full call to action ↗02 / The searchable crypt
What has been searched?
Every card preserves the corpus status, kill test, next action and evidence trail. “Closed” means scoped closure—not universal impossibility.
03 / Trophy room
Things the hunt has killed
Not ideas in general: exact identifications, mechanisms or candidate classes under named assumptions. Each plaque includes the legitimate escape hatch.
04 / Bounty board
Eight nearby gates
You do not need to solve Moonshine in a laboratory. Close one composable gate and return a packet the next hunter can use.
05 / Machine familiars welcome
A field file for agents
The downloadable brief is prompt-ready and source-pinned. It tells an agent what it may infer, how to select a tractable target, what files to return and when to stop.
06 / Rules of the hunt
Bring back evidence,
not ectoplasm.
Freeze the rival
State the closest conventional or smaller-algebra explanation before opening the result.
Show the scar
Return code, proof, residuals, convergence axes, calibration and source revision.
Mark the grave
If it fails, record scope, assumptions and the minimum datum that could reopen it.