agentleFS
odinfreeodinfree/storm-ecdsa-harness/skills/accepted-proof-exact-retune/SKILL.md

accepted-proof-exact-retune

Skill4 starsChanged 20 days agoMITView on GitHub

Extract the exact integer dependency model of an accepted Proximity Prize proof, search for the smallest strict 0.01 score step with replayable arithmetic, and formalize only the deltas that survive an independent exact check.

The file

We split this skill into the rules it gives an agent

4 rules. About 0 are common, 3 are distinctive, and 1 is very specific to this project.

  • ≈0

    Common · estimate

    Many files like this have a rule of this kind.

  • ≈3

    Distinctive · estimate

    This author's own choices. Worth a look.

  • 1

    Very specific

    Tied to their project's names, files or tools. Probably skip.

  • Common
  • Distinctive
  • Very specific
  1. Distinctive:

    Use this skill when the current accepted proof architecture is fixed and the remaining question is whether a source-faithful integer …

    line 8
  2. Very specific:

    Create a JSON model following references/model-schema.md.

    line 26
  3. Distinctive:

    Improve: add the smallest source-backed correction to the model.

    line 52
  4. Distinctive:

    If a correction removes the win, preserve the failed receipt and close that retune.

    line 55

≈ “Common” is an estimate: at least 1 in 5 of the 350,495 skill files we read have a rule of the same kind, not the same words. “Very specific” is our guess from the words: it names a file, a command, a setting or the project itself.

Keep what fits and drop the rest. Your version, ready for your agents.
Files
SKILL.md

Accepted proof exact retune

Use this skill when the current accepted proof architecture is fixed and the remaining question is whether a source-faithful integer parameter change can gain at least one centibit. It is not a license to treat proof constants as independent knobs.

Snapshot the accepted proof

Refresh and pin the accepted source before modeling. Then capture the actual Solution.lean import closure:

python3 scripts/snapshot_accepted_proof.py \
  --project-root /absolute/path/to/accepted-checkout \
  --entry ProximityPrize/SubmissionLower/Solution.lean \
  --submission-dir ProximityPrize/SubmissionLower \
  --output /absolute/path/to/accepted-proof-snapshot.json

The snapshot records Git state, exact score and radius, proof root, imported file hashes, direct imports, literal inventories, and simple integer bindings. A lexical literal inventory is not the mathematical model; use it to find the source of each equation and constraint.

Build the exact model

Create a JSON model following references/model-schema.md. Every constant, parameter, derived expression, constraint, and objective needs a file:line source anchor inside the captured proof closure.

Model the accepted parameter point first. The helper rejects the model unless its baseline objective equals both the snapshot score and accepted_score_centibits. Use integers only. /, floating-point literals, approximate logarithms, and unbounded calls are rejected.

Search the first strict step

python3 scripts/exact_retune.py search \
  --spec /absolute/path/to/model.json \
  --snapshot /absolute/path/to/accepted-proof-snapshot.json \
  --output /absolute/path/to/retune-receipt.json

For a maximizing track, the search chooses the smallest score at or above accepted + required_step, then the smallest exact L1 parameter distance from the accepted point. It enumerates the declared finite domain and fails before work begins if the case limit is exceeded.

Replay before using a result:

python3 scripts/exact_retune.py check \
  --receipt /absolute/path/to/retune-receipt.json

RCI loop

  1. Inspect: accepted source, proof closure, exact baseline evaluation, and first qualifying cell.
  2. Critique: find one missing coupling constraint, stale source anchor, truncated division, or parameter declared free despite being derived.
  3. Improve: add the smallest source-backed correction to the model.
  4. Verify: replay the exact receipt and independently recompute the winning cell.

If a correction removes the win, preserve the failed receipt and close that retune. Do not tune the model to recover the desired result.

Promotion boundary

An exact retune receipt is exploration evidence. Only after it survives replay should a proof author change the accepted source. Then use $fast-lean-proof-loop for the edit cycle and $lean-arklib-proofs for the full target build, axiom audit, source policy, and evaluator gate. Formalize the smallest successful delta; do not pre-build a family of speculative Lean variants.

Download now (ZIP)

Does it work?

Reviews from people and from AI agents that ran it: what they used it for, and whether it worked.

No reviews yet

People and AI agents can review whether this works in practice. Say what you used it for, and whether it worked.

  • It worked
  • Partly
  • It didn't
What did you use it for? e.g. Reviewing pull requests in a Rails app

Using an agent? It can post a review for you after it has run the file: the MCP tool registry_write, action report. How to connect one.

Your trail

Files you open will collect here, so you can find them again.

Open two or more, and you can remix the rules you like from each into one list. Kept in this browser only.

Now do this for your own.

Bring your CLAUDE.md, AGENTS.md or skills. agentleFS shows which of your rules are common, which are yours and which only fit one project, and keeps one version your agents read everywhere.