# Proximity Prize Campaign

> Run a Proximity Prize (better.codes) proof lane. Read the live frontier and your campaign ledger, route the math to the exact-algebra, search and Lean skills, check dead routes, and gate every promotion on Lean and ArkLib. Includes digests of BitWonka's 31 public submission notes and of the Discussion #537 thread on the 116.13 upper-track wall.

- Skill: `odinfree/proximity-prize-campaign` (Agent Skill, multi-file: 5 files)
- Install (CLI): `npx get-skill add odinfree/proximity-prize-campaign`
- Raw SKILL.md: https://api.skillmd.com/api/skills/odinfree/proximity-prize-campaign/raw
- Safety review: pending
- Works with: Claude Code, Claude.ai, OpenAI Codex
- Category: Marketing & Growth
- Author: odinfree (https://skillmd.com/u/odinfree)
- Updated: 2026-11-16
- Page: https://skillmd.com/skills/odinfree/proximity-prize-campaign

---


# Nöchberli (proximity-prize-campaign)

Use this thin overlay only for better.codes or Proximity Prize work. Mathematical tooling comes from the reusable exact-algebra, exact-search, constraint-search, and Lean/ArkLib skills.

## Establish live state

1. Locate your campaign repository: one authoritative clone per host.
2. Read its goal, the current work queue or overturn ledger, and the latest ownership or handover record.
3. Check the live benchmark frontier with the documented CLI. Persist benchmark ID, accepted score and source, required strict target, timestamp, and rebase status.
4. Confirm the current lane owner and working tree. Clone presence does not establish ownership.

Read [references/campaign-gates.md](references/campaign-gates.md) before assigning work, promoting a proof, or preparing a submission.

Before attacking a track, read the matching prior art: [references/bitwonka-proximity-digest.md](references/bitwonka-proximity-digest.md)
(BitWonka's 31 notes: lower-track ledger steps 67.67 -> 68.15, binary-upper 114.11 -> 106.25 -> 106.24 via char-2 flats and an
algebraic shared top) and [references/discussion537-upper-116-wall.md](references/discussion537-upper-116-wall.md) (the
nine-author attack on the prime-field upper 116.13 wall: the 2.0035-bit fibre-max gap, every closed family, the three
unchecked pin cells). Since ~19 Oct the board has four tracks: prime-field lower/upper (v20) and binary lower/upper (v3).

## Route work

- Use `$computer-algebra-oracles` to expose or falsify exact algebraic statements.
- Use `$constraint-construction-search` for faithfully finite SAT, SMT, CP-SAT, or MIP constructions.
- Use `$exact-search-engineering` only after the finite search and coverage contract are explicit and profiling identifies the bottleneck.
- Use `$proximity-prize-frontier-archaeology` immediately after an accepted frontier move to compare it only with its direct accepted predecessor and isolate the actual new lever.
- Use `$accepted-proof-exact-retune` when the accepted architecture is fixed and a source-bound integer model can test the smallest strict centibit step before any Lean edit.
- Use `$fast-lean-proof-loop` for dependency-aware incremental builds and Lean-verified symbol lookup during proof iteration.
- Use `$lean-arklib-proofs` for every accepted load-bearing claim.

Read the campaign dead-route and obstruction ledger before proposing a route. If a route requires an overlap to determine the witness, check the recorded Johnson-condition inequality first; below that threshold, reject the route rather than renaming the same obstruction.

## Authority boundary

This skill does not create submission, publication, spend, installation, remote-capacity, or ownership authority. Follow the live campaign instruction and keep a record of every external change. Do not publish private notes unless explicitly authorized.

