Explore skills
Search every indexed skill by name, description, repository or instructions, then narrow the results.
Showing 38821–38850 of 45552 skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| exact-postpass-stackodinfree/storm-ecdsa-harnessPort or stack exact stream-level post-passes on a finished reversible/quantum op stream: NCT pair folds and sandwiches, multi-round folds, symbolic control-product proofs, reverse and slack folds, commuting-pair cancellation. Use when a rival row carries a post-pass chain your tree lacks, when deciding whether a fold family will pay on a stream, or when a stacked pass breaks a table, a nonce tail, memory or the CI time envelope. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| exact-search-engineeringodinfree/storm-ecdsa-harnessBuild and verify performance-critical exact searches in FLINT, Nemo, Julia, C++ or Rust when a general computer algebra system is too slow or exhaustive coverage has to be engineered explicitly. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| fast-lean-proof-loopodinfree/storm-ecdsa-harnessShorten Lean 4 proof iteration with a warm editor session, dependency-aware reverse-import build plans, and lemma lookup that Lean itself confirms, while a separate full build plus axiom audit stays the promotion gate. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| fit-probe-and-spliceodinfree/storm-ecdsa-harnessBefore porting a module from another source tree, measure whether and at what cost it builds under your resource cap (fit probe), then import it verbatim through an adapter that remaps its resources and asserts its contract, instead of rewriting it. Use when a rival's or a library's routine is cheaper than yours, is self-contained, and shares your artefact's op format: a circuit gadget, a prover gadget, a contract library under a size cap. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| gpu-affine-table-synthesisodinfree/storm-ecdsa-harnessUse when an ecdsa.fail or reversible-circuit lane holds meaningful Toffoli share in dirty-table predicates (4/5/6-input truth functions under external controls), when a rival lands an affine/ESOP-class move, or when one hand-optimized table suggests the class pays — covers harvest, GPU/CPU candidate search, per-site winner rule, and exact re-verification. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| greedyfrog-methododinfree/storm-ecdsa-harnessBitWonka's greedyfrog process, reconstructed so we can repeat it. Use when redesigning a reversible traversal or inversion (ecdsa.fail Euclid / GCD walk) so the state carries its own reverse decisions instead of a history stack, when building, porting or moving greedyfrog rows (825 / 815 / 849 trees, cap-dependent family), or when asked how greedyfrog was invented. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| hard-problem-contractodinfree/storm-ecdsa-harnessWrite a contract-style prompt for a hard, precisely decidable problem: an open conjecture, a prove-or-disprove task, or a beat-the-frontier optimization. Use when ordinary prompting returns hedged partial results, special cases, surveys, "this reduces to another open problem", or early give-ups on long autonomous runs. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| hold-demand-ledgerodinfree/storm-ecdsa-harnessMeasure hold/dup-loan demand and supply on an ecdsa.fail-style reversible op stream, and price Q-cut (width) moves correctly against hold capacity. Use when extending or auditing a hold_pass-type final pass, when pricing a qubit cut against the holds it enables or destroys, when a "shortfall histogram" or demand curve looks suspiciously clean, or before trusting internal consistency checks (sym asserts, relocate 0-failures) as evidence of correctness. Contains the four measured traps: tautological shortfall, uniform-shift vs peak-clip model confusion, pre-loan/with-loan numbering drift, and oracle-only rejection. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| hosted-carry-lendingodinfree/storm-ecdsa-harnessLend role wires that are proved clean during a column interval as exact scratch inside a fixed-role walk circuit (boundary-clean words, manufactured zeros, X-basis erasure with a retained mask, cross-traversal carry pairing). Use when a width-starved layout pays for a missing scratch role, when a scratch allocator reports exhaustion while role wires sit idle at column boundaries, or when porting nasqret's 659 lending levers to another width. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| inert-op-screen-to-structural-ruleodinfree/storm-ecdsa-harnessFind charged operations that never act on the verifier's input distribution by bit-sliced screening over many seeds, ship their removal only under a re-verification gate, then replace the index list with a structural skip rule in the generator. Use when a benchmark's judge charges per executed op and verifies on a sample, and the artefact comes from a generator with conservative guards; on benchmarks with exact verification use the screen for discovery only. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| invariant-chartodinfree/storm-ecdsa-harnessStop storing register bits that an algebraic relation already determines, and rebuild them where they are read. Two recipes from bulengerk's ecdsa.fail left moves: residue charts from the extended-Euclid relation (mod 4, mod 8), and a joint code for two size registers with a proven sum range. Use when the next qubit must come off an extended-Euclid or size-register binder. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| jev-second-perspectiveodinfree/storm-ecdsa-harnessUse TypeSafe's Jev as a fast, typed second opinion inside a research or optimization lane. Rank candidate levers by composite score, or check a write-up's claims against a lab log. Pair it with TypeSafe's own typesafe-ai skill, which owns the API and its docs. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| lambda-exchange-deskodinfree/storm-ecdsa-harnessPrice 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| leader-rebase-stackodinfree/storm-ecdsa-harnessMaintain your contributions to a moving-leader leaderboard as an ordered stack of idempotent patches (stack/NN-slug/) that rebase onto whatever submission currently leads, with a background leader watcher, a restack that scores the leader first, and a submission gate tied to the live board (submit only when the stack beats the leader by a written margin at submission time). Use on any benchmark where rivals keep landing rows while you build. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| lean-arklib-proofsodinfree/storm-ecdsa-harnessFormalize and verify mathematical or cryptographic claims in Lean 4 with ArkLib: exact-target builds, axiom audits, dependency checks, and the build evidence an evaluator expects. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| lean-finite-certificate-splittingodinfree/storm-ecdsa-harnessReduce 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| lever-switches-and-break-controlsodinfree/storm-ecdsa-harnessLand each optimization lever behind a default-on constant with an inert development override and a set of numbered deliberate breakages that the test suite must catch, so stacked levers stay separable and every check is shown to have teeth. Use when stacking more than two levers on one generator-built artefact (circuit, prover, contract, proof), when porting a lever from another tree, or when a lever's correctness rests on an invariant and not on an identity. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| mission-commandodinfree/storm-ecdsa-harnessRun a bounded technical mission with commander's intent, exact authority and artifact binding, one accountable owner, freedom of action inside stated limits, and a falsifiable ADMIT, COMPLETE or HARD_NACK closeout. Use when someone asks for mission command, hands over a stalled or complex engineering or research effort, or needs several workers coordinated without duplicate work or new authority. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| nasqret-playbookodinfree/storm-ecdsa-harnessBuild 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| paged-walk-descentodinfree/storm-ecdsa-harnessAkashneelesh'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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| peak-lifetime-ledgerodinfree/storm-ecdsa-harnessUse when mapping ecdsa.fail q1152/lower peak-qubit pressure, especially Trailmix/Ludicrous fold, add, codec, and GCD phases, before editing or scaling compute. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| pinned-table-stackingodinfree/storm-ecdsa-harnessAuthor 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| pip-disciplineodinfree/storm-ecdsa-harnessEvidence-discipline recovery for stalled ecdsa.fail work. Use when the same route, prompt or script has failed twice, an agent keeps tweaking parameters without changing the idea, a failure is blamed on tooling before anyone checked, a completion is claimed without validator output, or a compute request has no owner, validator, kill gate, budget or stop condition. Not for a first pass with a known fix. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| portable-source-assertionsodinfree/storm-ecdsa-harnessFix Python AST source-identity assertions that break across interpreter versions while keeping the exact semantic check. Keeps a source review separate from an actual fixture run. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| proximity-prize-campaignodinfree/storm-ecdsa-harnessRun 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| proximity-prize-frontier-archaeologyodinfree/storm-ecdsa-harnessCompare each newly accepted Proximity Prize proof with its accepted predecessor only. Bind the source and the public note, inspect proof-root and module changes, and isolate the lever that transfers, without contaminating clean-room lanes. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| quantum-affine-lookup-synthesisodinfree/storm-ecdsa-harnessLower 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| quantum-borrowed-wire-counterexampleodinfree/storm-ecdsa-harnessProve 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| quantum-dense-qromodinfree/storm-ecdsa-harnessEvaluate dense Pauli-encoded QROM and packetized lookup as a structural replacement for material coherent table lookup costs. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| quantum-dirty-borrowingodinfree/storm-ecdsa-harnessAssess scheduling of already dirty-safe quantum blocks against actual peak ownership and rewrite economics. Use for source-bound borrowing transfers; Bona does not synthesize clean-to-dirty arithmetic. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |