Skip to content

Explore skills

Search every indexed skill by name, description, repository or instructions, then narrow the results.

Showing 37141–37170 of 39816 skills

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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
quantum-dense-qromodinfree/storm-ecdsa-harnessEvaluate dense Pauli-encoded QROM and packetized lookup as a structural replacement for material coherent table lookup costs.Stars: 4Updated Claude CodeCodexUnverifiedInstall
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: 4Updated Claude CodeCodexUnverifiedInstall
quantum-divstep-reconstructionodinfree/storm-ecdsa-harnessReplace stored reversible branch history with successor-state decision reconstruction or hybrid storage in prime-field arithmetic.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-encoded-arithmeticodinfree/storm-ecdsa-harnessExplore representation-changing arithmetic regions using encoded addition, with explicit modulus, conversion, consumer and full resource compatibility.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-graded-divider-placementodinfree/storm-ecdsa-harnessPrice 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.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-guarded-permutation-auditodinfree/storm-ecdsa-harnessFind 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.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-mbundo-lifetimesodinfree/storm-ecdsa-harnessAssess source-proven ancilla last-use intervals for measurement uncomputation. Distinguish parked stage-level opportunities from unassessed whole-division changes and require correction-inclusive economics.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-record-miningodinfree/storm-ecdsa-harnessMine existing circuit records for overlooked measured gains, process-blocked candidates and mechanisms missing across arithmetic families, before new paper-driven work.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-replay-arithmeticodinfree/storm-ecdsa-harnessCo-design reversible GCD walks, transcript encodings and payload replay for structural point-addition gains; compare full arithmetic families and cleanup.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-residue-scan-ambiguityodinfree/storm-ecdsa-harnessDiagnose 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.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-structural-lanesodinfree/storm-ecdsa-harnessRoute structural quantum-circuit research through record mining, source-to-paper admission, cliff economics and independent promotion gates.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-syndrome-uncomputeodinfree/storm-ecdsa-harnessExplore syndrome-based deterministic or post-selected uncomputation when garbage support has exploitable structure; verify acceptance semantics before board use.Stars: 4Updated Claude CodeCodexUnverifiedInstall
quantum-verified-architecture-searchodinfree/storm-ecdsa-harnessRun evaluator-guided structural circuit search with independent value, phase and scratch checks, architecture diversity and frozen confirmation evidence.Stars: 4Updated Claude CodeCodexUnverifiedInstall
reference-model-as-instrumentodinfree/storm-ecdsa-harnessFor a new algorithmic design, write the exact classical reference model first and make that one model serve as test oracle, parameter-table generator, failure-class predictor, failing-case replayer and seed scanner. Use when starting a new design in a benchmark-optimization campaign (circuit, prover trace, contract, proof term) or when adopting a rival's design you will modify; not for post-passes or retunes of a design whose model already exists.Stars: 4Updated Claude CodeCodexUnverifiedInstall
research-loopodinfree/storm-ecdsa-harnessRun a self-expanding research loop. Each cycle sends parallel researcher agents after open questions, each writes one linked Markdown note, and their follow-up questions refill the queue. Use to start a loop on a seed question, run a cycle, run a tool-assisted monitor cycle, or report loop status. Adapted from BitWonka's loop-engine (MIT).Stars: 4Updated Claude CodeCodexUnverifiedInstall
reversible-circuit-invariantsodinfree/storm-ecdsa-harnessExecutable invariant checkers for space-efficient reversible arithmetic circuits, derived from eprint 2026/2014 (Jo & Lee, exact in-place modular inversion with 3n/2+o(n) qubits). Use before an ecdsa.fail build/eval/submit, when porting a low-qubit layout (four-hole / omitted-rail ports), when deciding whether an in-place erase relation is a legal permutation, when pricing spooky-pebbled uncomputation offline against a lane budget, or when auditing a candidate circuit's peak/Toffoli/clean-ancilla structure from ops.bin. Fires on "rci", "check the layout", "is this erase legal", "price the pebble", "ops.bin census", "omitted rail audit", "exceptional set".Stars: 4Updated Claude CodeCodexUnverifiedInstall