# Join the Halloween Monster Hunt

Pick one trail from the [hunt map](data/hunt-map.json), preferably a P0 or P1 item with available inputs. Before starting, read its controlling evidence in the canonical [Admissibility Frontier corpus](https://github.com/aaron-alderman/spin23-relational-geometry).

## What counts

- a proof that closes a stated implication or no-go;
- a reproducible calculation with convergence and residual checks;
- a hardware or experimental design with calibration and nuisance budgets;
- an independent reproduction of an existing result;
- a negative control that explains an apparent signal;
- a clean failure that preserves assumptions and identifies a reopening condition;
- an improvement to the map, packet format or contributor experience.

Numerical coincidences, visual resemblance and outputs programmed to contain the desired structure do not count as physical evidence.

## Return format

Create `packets/<topic-id>-<short-name>/README.md` and include:

1. object;
2. input authority and pinned revisions;
3. prerequisites;
4. exact claim;
5. certificate;
6. convergence axes;
7. negative controls;
8. kill test;
9. claim boundary;
10. next interface.

Include executable verification wherever possible. Finish with one disposition: `closed-positive`, `closed-negative`, `advanced`, `split`, `unchanged` or `blocked`.

## Seasonal rule

The Halloween presentation runs through 2 November 2026. The research map remains as a durable archive afterward. Fun is encouraged; weakened epistemic standards are not.