Skip to content
OpenAgentSkill
Browsing is open · Catalog captured 2026-11-21 · Automatic updates and account services are paused.
Other skills

acceptance-gate

The standard a computed result must meet before it may be called done. Use whenever an agent claims an integral is solved, a fit has closed, a formula is identified, or any quantitative answer is ready — the claim is not done until it passes this gate.

BootLoops-ai · Static checks on file

Installation

Read the source and dependencies before running a command. Copying does not install or execute anything.

npx skills add BootLoops-ai/skills --skill acceptance-gate

About this skill


name: acceptance-gate description: The standard a computed result must meet before it may be called done. Use whenever an agent claims an integral is solved, a fit has closed, a formula is identified, or any quantitative answer is ready — the claim is not done until it passes this gate.

acceptance-gate — what "done" means

A result is done when it has survived a check that could have failed, run by a route that could not have known the answer. It is never done merely because the computation that produced it finished.

Why the gate exists: computation produces confident wrong answers at every stage, and none of them announce themselves. A fit converges to the wrong basin and reports small residuals. An integer-relation search "recognizes" numerical noise as a famous constant, because search enough constants and something always matches a short prefix. Two evaluators built on the same series expansion agree to great depth on the same wrong value. The agent that produced the answer — human or model — is the least qualified judge of it, because everything that produced the answer also produces reasons to believe it. So "done" is defined externally: agreement with an independent route, at points that entered no fit, to more digits than the fit could enforce, deepening when precision is raised, measured by machinery that has demonstrably failed on a wrong answer. Each clause of that sentence is there because its absence has, at some point, let a wrong result through.

The bar used for the BootLoops loop-integral results (bootloops.ai): at least thirty genuine held-back digits, two-precision stable, against an oracle that never fed the fit. Adopt a bar of that order for anything new. Scale the digit count to the problem; never scale away the structure.

The procedure

Run the steps in order. The order is itself part of the discipline: the check is designed before the answer exists, because a check designed after the answer exists is chosen — consciously or not — to pass.

0. Declare the gate before fitting. Before any fit, search, or model choice, write down: which evaluation points are reserved, what the independent route will be, what digit count will count as passing, and what the controls are. A gate written after the candidate exists inherits the candidate's blind spots.

1. Reserve never-fit points. Choose evaluation points, record them, and exclude them from every fit, every tuning decision, and every basis selection — not only the final fit but every exploratory run that shaped the method. Agreement at fitted points measures interpolation: a fit with enough parameters reproduces its own inputs exactly, and agreement there means nothing.

2. Audit the independent route. The check values must come from a route that shares no code, no series representation, and no fitted input with the derivation. Numerically integrating the original definition, when the candidate came from a fitted ansatz, is independent; a second wrapper around the same expansion is not. An oracle whose values entered the fit — even once, even only to pick a tolerance — is disqualified from certifying (see independence-bookkeeping). Where full disjointness is impossible, record exactly what is shared and treat the check as weakened by that much.

3. Count digits; do not describe them. Evaluate both sides at the reserved points and count the digits that genuinely agree. The count must exceed, by a wide margin, anything the fit's free parameters could have absorbed. The unit of evidence is a number — "34 digits at each of three reserved points" — never "excellent agreement".

4. Rerun at raised precision. Double the working precision and repeat. A true identity deepens: the count of agreeing digits grows with the precision. Agreement pinned at the same depth regardless of working precision is a truncated intermediate shared by both sides, a coincidence at the resolution of the search, or a bug. It is never a confirmation.

5. Run the controls, positive and negative. Positive: run the identical gate on a case where the answer is independently known, and confirm it passes. Negative: perturb the candidate — flip the sign of one term, alter the last fitted coefficient in its final digit — and confirm the gate fails, loudly, at the digit where it should. A gate that has never failed anything certifies nothing: every clause of it might be broken and you would see only passes.

6. Leave-one-out, where a fit determined the answer. For each anchor point that entered the fit: refit without it, evaluate the refit at the excluded point, and demand agreement at full depth. An identity survives every exclusion; an interpolation collapses at exactly the excluded point. This is the cheapest way to distinguish "found the formula" from "drew a curve through the data".

7. Package a standalone evaluator. The claim ships with a script that rebuilds the result from the exact data included with it and re-measures this gate at arbitrary requested precision — no hidden grids, no finite-precision constants baked in, no state that lived only in the session that produced the claim. If a stranger cannot rerun the gate, the gate ran once and its evidence is already decaying.

8. Report the true verdict. CLOSED means every part above passed and the counts are written down. Anything less is OPEN, reported with what was established and what remains. An honest OPEN is a result; a false CLOSED is damage, because later work builds on it and the cost of the unwinding grows with every week it stands.

Failure modes the gate exists to catch

Each of these is a class observed repeatedly in practice, from agents and from people. The vignette states the mechanism; learn the shape, not the example.

  • Satisficing. The first plausible answer is declared final: a handful of digits of numerical noise matches a known constant at the resolution of the search, and the search stops. The match was guaranteed
Read the complete source ↗