Explore skills
Showing 39691–39720 of 74266 skills
Price statistical trades in an approximate-circuit campaign as an explicit exchange market: fix a Toffoli-per-lambda rate, measure every trade paired against its parent with a standard error, charge conservative floors, scan for buybacks priced below the rate, and guard census-fitted tables against in-sample overfitting. Use whenever an ecdsa.fail-style circuit trades executed Toffoli for failure rate before a nonce grind, or any scored artifact trades score for a statistical defect rate.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexReduce Lean kernel replay memory for finite literal matrix certificates by splitting ordinary decide goals and assembling them symbolically. Use after a measured memory failure; it does not replace mathematical validation.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexBuild a fresh route slate when a frontier move changes the shape of the search. Diff adjacent public winners, name their visible mechanisms (qubit shelf, lifetime move, Toffoli move, nonce dependence), run equal-size pilots, sort each route into tail-sensitive, structurally dirty, score-dead or validation-ready, and send compute only to the last group. Named for nasqret, whose broad sweeps it follows.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexAkashneelesh's method on ecdsa.fail (17 rows, Jun-Nov 2026; Q765 from 128.7M to 48.4M Toffoli in 37 hours): take a cheaper public walk a few qubits wider and buy the qubits back with a page of low bits whose fourth word is implicit in the walk's invariant, narrow end machines shipped as checked gate lists, a staged build where switch-off rebuilds the parent, and a census failure budget. Use when a public walk k qubits wider costs a fraction of your line; when a two-ring Euclid walk must lose wires; when a stream is assembled from modules built by separate agents; when summing a failure budget term by term; or when you review a row built this way.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexAuthor declarative circuit-edit tables that are pinned to an exact gate list by length and hash, applied by an applicator that refuses any other stream, frozen and qualified as individual rungs, and stacked in call order before the nonce tail. Includes the portfolio-vs-exact labeling test (identical wrong-output and aligned failing-shot sets) and the "tables as durable assets" rule: a table above today's strict gate ships unchanged later inside a bigger stack. From jackylee0424's spookyfrog series on ecdsa.fail.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexLower Toffoli cost in a repeated small reversible XOR lookup or modular squarer by sharing nonlinear terms across outputs, testing affine basis changes and proving arbitrary-target behavior before measuring the full circuit.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexProve or falsify a proposed Boolean recovery rule for a borrowed qubit using two reachable, baseline-passing states with equal available signals and opposite required host bits. Use when a narrow multiply or divide passes random tests but fails rare inputs.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexPrice a reversible divider width cut by trading physically retained quotient tags against reversible reconstruction. Use when a parked passenger, reverse relay, stage join or final compiler pass determines whether the whole point addition gets narrower or cheaper.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexFind wrong-branch swaps and stale stream caches when a chunked reversible-circuit optimizer changes native endpoints. Use for deferred wire permutations, nested classical guards, or two nominally equivalent builds that disagree.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexDiagnose a reversible residue or CRT scan when more than one label passes a truncated predicate. Separate physical implementation errors from predicate ambiguity and test whether an independent residue can resolve the tie.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexRemove an entire scratch/role lane from a width-pinned reversible circuit by rewriting every site that touches it with bespoke per-context constructions, instead of pooling the role. From jackylee0424's ecdsa.fail Q658 row (a6098537, Nov 2026): the third scalar lane of a 659 tree evicted on all four traversals, paying +8.8% T for the -1 qubit width record.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexPrevent stale Cargo artifacts when a source archive is restored over a reused Rust target directory. Use for reproducible benchmark comparisons and for moving source archives between machines.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexCut identical end-padding columns from a fixed walk schedule (Euclid/GCD column tables, fixed-length loops) and price the cut as a declared failure-rate trade. Use when a circuit runs a fixed-length schedule whose last columns are byte-identical padding, when a width-frontier row needs millions of T without a new construction, or when porting a column cut onto a rival's row.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexWhen a candidate fails shots its parent passes, find the structural cause before any nonce search. Reconstruct the exact failing shot, localize the first divergence, repair it by paying precision, and keep the case as a permanent regression. Learned from bulengerk's ecdsa.fail rows. Use when an edited candidate fails shots its parent passed, or when counts drift between builds.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexPack n = 1..1000 unit squares into the smallest square (Kaggle "Squares in Squares", score sum L/sqrt(n) - 1). Use when improving, certifying or submitting packings, or when choosing the next search route. Covers the official-metric gates, the solver and MIS tools, the structure of the frontier, and the routes measured dead. The competition closed on 25 Oct 2026.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexAudit and rewrite prose to remove common AI writing patterns. Use when drafting, editing, or reviewing writing that feels generic, over-polished, promotional, or structurally repetitive. Supports rewrite mode and detect-only mode.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexzuiris's method on the ecdsa.fail Leapfrog product line (Q1234-1244, Oct-Nov 2026). Each row moved the binding constraint with one structural mechanism: per-tick identities, a deeper shift alphabet, a pruned alphabet, record codes and packs. The tactics around it: priced failure spending, rebasing on a rival's freed resource with a same-day cap sweep, guard audits, declared nonce hunts. Use when a product-score line is stuck on small steps, when a rival frees wires or room, when choosing the next structural row on a walk-based point-add, when pricing a width trade or a failure spend, or when a new record or codec might have shadowed an older mechanism.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexEvidence discipline for a width-reduction or optimisation campaign where many agents land many small changes into one tree. Distilled from the ecdsa.fail 793-to-792 rung (2,036 over-cap cells to 216, 23 merges, 12 workers), in which a census counted cells on a circuit that could never build, a patch applied cleanly and silently deleted a merged class, a gate pass could not be reproduced, eight distinct kinds of negative control turned out to prove nothing, two classes passed review on structural arguments and were later found unsound, a "120-cell" change turned out to be three stacked 40-cell changes, and a retired worker left 19 GB of orphans after reporting it had stopped. Use when evidence from parallel workers is being merged into a shared artefact; when a change "passes" and you want to know whether the test could have failed; when a premise is about to be accepted on sampled data; or when deciding whether to continue a campaign.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexAudit the process, sample and archive evidence behind paired native benchmarks, especially wrappers around an unchanged official client. Use before admitting benchmark results or when reviewing the controller that produced them. Ordinary unit tests do not need this.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexCheck whether a literature finding supports a proposed performance optimization. Read the primary figures and the implementation source, then run a cheap falsifier before writing code or benchmarks.
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexzuiris's clean-sheet family method for ecdsa.fail Pareto rows, reconstructed from his 5 Nov 2026 batch (Q768-780 at 37-81 % under the bar, Q740 at 10 % under). Use when a band of the low-Q board is flat next to a cliff and the incumbent family looks architecture-bound, when deciding whether a new inverter family can fit a target width before building it, when a column or slot pays every time for a rare worst case, or when a generator-built circuit needs a validation stack that catches silent gate loss. Not for single-lane rungs on an existing tree (use ecdsafail-scratch-diet) and not for shadowing a rival row (use ecdsafail-pareto-ratchet).
odinfree/storm-ecdsa-harness
Stars: 4Claude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodexa5c-ai/babysitter
Stars: 1.9kClaude CodeCodex