Explore skills
Search every indexed skill by name, description, repository or instructions, then narrow the results.
Showing 37861–37890 of 41544 skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| calibrated-static-cost-proxyodinfree/storm-ecdsa-harnessCompute the judged cost inside the artefact generator from structure alone (charged ops weighted by the firing rate of their enclosing conditions), calibrate it against the official judge once per design, and use it for all inner-loop decisions. Use when a judge run costs minutes or more and individual levers are worth less than about 1% each, in any benchmark-optimization campaign where a generator builds the artefact (circuits, prover constraints, gas, proof size). | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| circuit-edit-integration-safetyodinfree/storm-ecdsa-harnessDebug a reversible-circuit primitive that is value-exact in isolation but leaves identical classical, phase and ancilla dirt on every Fiat-Shamir shot once wired into the full circuit. Run a three-step falsifier ladder first: stale stream-specific optimization indexes, free-pool qubit-ID aliasing, then the measurement-vent discharge target. Use before blaming the primitive's math. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| colab-laneodinfree/storm-ecdsa-harnessRun production GPU jobs on Google Colab (G4 = RTX PRO 6000 Blackwell 96 GB by default; H100/A100/L4/T4 also available on a paid plan) from a local machine, with the signed-in `colab` CLI and the `colab-lane` wrapper (tools/wolkeschieber in this repository). Use when a lane needs to run, compile or benchmark something on a cloud GPU (CUDA, torch, nonce/prescreen kernels, Rust builds). Jobs run until done, then results are downloaded and the runtime is stopped. Covers spend, auth, disconnect handling and the exact failure semantics. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| computer-algebra-oraclesodinfree/storm-ecdsa-harnessRoute exact algebra, finite-field, coding-theory, polynomial-system, group-theory and number-theory questions through SageMath, Magma, OSCAR, Singular, GAP/GUAVA, PARI/GP or Hecke, with replayable evidence and an independent check. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| constraint-construction-searchodinfree/storm-ecdsa-harnessEncode and verify finite construction or optimization searches with CryptoMiniSat, Z3, OR-Tools CP-SAT or Gurobi, including witness extraction, model audits, and calibrated UNSAT or optimality claims. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| cross-model-review-gateodinfree/storm-ecdsa-harnessTwo-model review before an irreversible step. A reviewer from a second lab checks the work, and every review is recorded against the exact commit and artifact hash. Learned from gnuchev's Open Research Club (a Claude author, an OpenAI reviewer, about three rounds per artifact). Use before submitting a structural benchmark row, publishing a tool or skill, declaring a route dead, or deploying. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| deepseek-pressure-testodinfree/storm-ecdsa-harnessAdversarial review before you commit. Before a route change, paid CPU or GPU compute, or a worker handoff, an independent worker from another lab tries to kill the route. The output is a falsifiable decision (proceed, measure, park, kill or human review) plus the hidden assumption that could make it wrong. Advisory only. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| ecdsafail-fastevalodinfree/storm-ecdsa-harnessScore an ecdsa.fail ops.bin exactly like the official eval_circuit (same Fiat-Shamir shots, totals, failure counts and score) in minutes, at about 20 bytes per op instead of 56. Uses BitWonka's fasteval. Use when a circuit is too big for eval_circuit on your machine, when you need an official-equivalent score before submitting, or when you need a circuit's failure rate from fresh salted shots. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| ecdsafail-lowq-playbookodinfree/storm-ecdsa-harnessCut qubits off a low-Q ecdsa.fail stream (about 670 to 950 Q) the way BitWonka's 25 low-qubit rows did in October 2026 (940 down to 671 Q). Census the binding instant, pick the cut, refactor equivalence-first, budget lambda against the clean-nonce supply, and gate on the exact replica. Use when a precision or lane cut raises lambda, or when porting a rival's low-Q cut onto your tree. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| ecdsafail-oracle-loopodinfree/storm-ecdsa-harnessIterate on an ecdsa.fail route until a fresh official `ecdsafail run` says it is better, never on a self-reported number, and keep a route journal (tried, killed, next cut) that survives context compaction. Use for "loop this route", "run it to a verified win", "what have I already tried". Adapted from tanweai/pua (discipline only). | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| ecdsafail-pareto-ratchetodinfree/storm-ecdsa-harnessHold rows on the ecdsa.fail Pareto board the way gnuchev did (167 submissions, 152 of them left moves). Shadow a fresh rival row at the same qubit count with exact cuts that work on any tree, turn one structural move into a band of rows with a single width dial, order the band by contention, and never lose a row to the validator. Use when a rival posts a row you can rebuild, or before submitting a billion-op row. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| ecdsafail-scratch-dietodinfree/storm-ecdsa-harnessExact qubit cuts for low-Q ecdsa.fail trees. Run a known-bit census, then replace every clean-scratch use at the binding instant with a borrowed lane, a literal or a re-encoding, or move a register into another register's provable gap. Built from gnuchev's October cuts and our own public 793-to-791 and 815-to-811 rows. Use when the next qubit must come off, or when a stage panics with 'scratch pool exhausted'. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| elicit-researchodinfree/storm-ecdsa-harnessSearch academic literature through the Elicit API: papers, clinical trials, reports, systematic reviews and Research Agent sessions. Use when a question needs published evidence or an outside, literature-backed view. Needs your own Elicit API key. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| evaluator-scoring-surface-auditodinfree/storm-ecdsa-harnessRead a benchmark's evaluator, verifier and scoring source line by line for gaps between what is counted, what is checked and what is only assumed, then turn each gap into a priced lever, a tool, or a report to the organisers. Use when joining a benchmark, after any evaluator change, or when the leaderboard moves in a way your cost model does not explain. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| exact-evaluator-replicaodinfree/storm-ecdsa-harnessBuild and validate a fast, exact local copy of a benchmark's official evaluator: same inputs, same counts, same score, proven by a differential fuzz test and a reproduced graded log. Use when the official judge is too slow, too memory-hungry or too opaque to sit inside the edit loop of an optimization campaign (circuits, provers, gas, proof size), when many candidates must be scored per day, or when a failure-rate estimate needs fresh samples the judge cannot give. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| exact-hold-passodinfree/storm-ecdsa-harnessExact final-pass Toffoli reduction for reversible/quantum op streams: replace repeated unconditional Toffolis with a CX copy from a held wire (product holds), and clear-then-rebuild idle live wires whose value another live wire duplicates (dup loans, Clifford-only). Uses affine symbolic value tracking with a random 128-bit hash, a provable width cap, and fail-closed relocation. Use when a stream recomputes products or carries duplicated live values over idle intervals. | Stars: 4 | Updated | Claude CodeCodex | Unverified | 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 |