Explore skills
Search every indexed skill by name, description, repository or instructions, then narrow the results.
Showing 38791–38820 of 45926 skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| logging-log-aggregationchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| network-policies-securitychimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| observability-stackchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| post-mortemchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| security-compliance-automationchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| service-meshchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| slo-sli-slachimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| versioning-managementchimeranext/flutter-boilerplate-monorepo-template | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| accepted-proof-exact-retuneodinfree/storm-ecdsa-harnessExtract 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. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| arxiv-portable-researchodinfree/storm-ecdsa-harnessMine arXiv papers, original LaTeX and citation trails for mechanisms that can transfer into a real implementation; maintain topic watches and source-bound experiment proposals. Use for arXiv research, paper monitoring or portable research gains. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| auto-autoresearch-pipelineodinfree/storm-ecdsa-harnessRun a long autonomous optimization campaign on a scored artifact (circuit, proof, packing) as a role-separated pipeline: one director, parallel area-owning workers, an independent paired verifier, a fail-closed integrator, and a compiled-screen grinder. Use when many small candidate edits compete for a leaderboard score and no single worker can be trusted to measure its own work. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| beachhead-ratchetodinfree/storm-ecdsa-harnessTake a left Pareto move even when it raises Toffoli, under a T budget written down first, then win the cost back on your own tree, attributing every lever to the component the width cut made dearer. Learned from bulengerk's ecdsa.fail record (9 left moves, 61 down rows). Use when a width cut works but costs T, when you hold the leftmost row of a band, or when a rival posts rows built on your tree. | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| bounded-commuting-foldodinfree/storm-ecdsa-harnessExact commuting-pair cancellation for very large reversible/quantum op streams: per-wire last-read/last-write dependency stamps, canonical-gate matching with classical conditions retained, stable-condition-block pair cancellation, in-place billion-op memory discipline, and the holds-then-fold rerun (slack fold again after the hold table: at most two rounds, stop early on a zero round). Distilled from nasqret's public ecdsa.fail notes and source (Q660 15df559e, 389f99c3, Nov 2026). | Stars: 4 | Updated | Claude CodeCodex | Unverified | Install |
| burn-the-house-downodinfree/storm-ecdsa-harnessEscape a local optimum in a long-horizon optimization campaign by running a structurally free descent beside the protected incumbent. Use when improvements shrink while machinery grows, candidates are rejected by incumbent-fitted gates, the same wall recurs, work has collapsed into knob-fencing, or the user says "local optimum", "stuck polishing", "optimization plateau", or "burn the house down". | Stars: 4 | Updated | Claude CodeCodex | Unverified | 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 |