all publishers

odinfree

@odinfree source repo

81 published skills

  1. ▌
    Lever Switches And Break Controls · odinfree bundle
    Land 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.
    0 installs
  2. ▌
    Quantum Guarded Permutation Audit · odinfree
    Find 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.
    0 installs
  3. ▌
    Verify Paired Native Measurements · odinfree bundle
    Audit 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.
    0 installs
  4. ▌
    Inert Op Screen To Structural Rule · odinfree bundle
    Find 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.
    0 installs
  5. ▌
    Proximity Prize Frontier Archaeology · odinfree bundle
    Compare 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.
    0 installs
  6. ▌
    Quantum Borrowed Wire Counterexample · odinfree bundle
    Prove 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.
    0 installs
  7. ▌
    Quantum Verified Architecture Search · odinfree bundle
    Run evaluator-guided structural circuit search with independent value, phase and scratch checks, architecture diversity and frozen confirmation evidence.
    0 installs
  8. ▌
    Constraint Construction Search · odinfree bundle
    Encode 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.
    0 installs
  9. ▌
    Quantum Divstep Reconstruction · odinfree bundle
    Replace stored reversible branch history with successor-state decision reconstruction or hybrid storage in prime-field arithmetic.
    0 installs
  10. ▌
    Quantum Residue Scan Ambiguity · odinfree
    Diagnose 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.
    0 installs
  11. ▌
    Route Compare Probe Discipline · odinfree
    Compare baseline and candidate on identical input vectors before blaming one call for ecdsa.fail residual or eval dirt. Use when a structural edit changes the op stream, because Fiat-Shamir sampling then tests the two circuits on different shots and can create or hide failures.
    0 installs
  12. ▌
    Circuit Edit Integration Safety · odinfree
    Debug 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.
    0 installs
  13. ▌
    Evaluator Scoring Surface Audit · odinfree bundle
    Read 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.
    0 installs
  14. ▌
    Quantum Affine Lookup Synthesis · odinfree
    Lower 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.
    0 installs
  15. ▌
    Quantum Graded Divider Placement · odinfree
    Price 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.
    0 installs
  16. ▌
    Lean Finite Certificate Splitting · odinfree
    Reduce 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.
    0 installs
  17. ▌
    Portable Source Assertions · odinfree
    Fix 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.
    0 installs
  18. ▌
    Quantum Encoded Arithmetic · odinfree bundle
    Explore representation-changing arithmetic regions using encoded addition, with explicit modulus, conversion, consumer and full resource compatibility.
    0 installs
  19. ▌
    Quantum Syndrome Uncompute · odinfree bundle
    Explore syndrome-based deterministic or post-selected uncomputation when garbage support has exploitable structure; verify acceptance semantics before board use.
    0 installs
  20. ▌
    Rust Archive Build Binding · odinfree bundle
    Prevent 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.
    0 installs
  21. ▌
    Accepted Proof Exact Retune · odinfree bundle
    Extract 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.
    0 installs
  22. ▌
    Squares In Squares Campaign · odinfree
    Pack 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.
    0 installs
  23. ▌
    Calibrated Static Cost Proxy · odinfree bundle
    Compute 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).
    0 installs
  24. ▌
    Reference Model As Instrument · odinfree bundle
    For 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.
    0 installs
  25. ▌
    Reversible Circuit Invariants · odinfree bundle
    Executable 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".
    0 installs
  26. ▌
    Exact Search Engineering · odinfree bundle
    Build 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.
    0 installs
  27. ▌
    Proximity Prize Campaign · odinfree bundle
    Run 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.
    0 installs
  28. ▌
    Quantum Mbundo Lifetimes · odinfree bundle
    Assess source-proven ancilla last-use intervals for measurement uncomputation. Distinguish parked stage-level opportunities from unassessed whole-division changes and require correction-inclusive economics.
    0 installs
  29. ▌
    Quantum Structural Lanes · odinfree bundle
    Route structural quantum-circuit research through record mining, source-to-paper admission, cliff economics and independent promotion gates.
    0 installs
  30. ▌
    Schedule Tail Truncation · odinfree
    Cut 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.
    0 installs
  31. ▌
    Verify Research Transfer · odinfree
    Check 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.
    0 installs
  32. ▌
    Quantum Replay Arithmetic · odinfree bundle
    Co-design reversible GCD walks, transcript encodings and payload replay for structural point-addition gains; compare full arithmetic families and cleanup.
    0 installs
  33. ▌
    Auto Autoresearch Pipeline · odinfree
    Run 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.
    0 installs
  34. ▌
    Gpu Affine Table Synthesis · odinfree
    Use 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.
    0 installs
  35. ▌
    Structural Binder Walk · odinfree bundle
    zuiris'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.
    0 installs
  36. ▌
    Vacuous Evidence Audit · odinfree
    Evidence 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.
    0 installs
  37. ▌
    Cross Model Review Gate · odinfree bundle
    Two-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.
    0 installs
  38. ▌
    Ecdsafail Lowq Playbook · odinfree bundle
    Cut 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.
    0 installs
  39. ▌
    Exact Evaluator Replica · odinfree bundle
    Build 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.
    0 installs
  40. ▌
    Quantum Dirty Borrowing · odinfree bundle
    Assess 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.
    0 installs
  41. ▌
    Computer Algebra Oracles · odinfree bundle
    Route 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.
    0 installs
  42. ▌
    Ecdsafail Pareto Ratchet · odinfree bundle
    Hold 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.
    0 installs
  43. ▌
    Peak Lifetime Ledger · odinfree
    Use when mapping ecdsa.fail q1152/lower peak-qubit pressure, especially Trailmix/Ludicrous fold, add, codec, and GCD phases, before editing or scaling compute.
    0 installs
  44. ▌
    Send To Claude Fable · odinfree bundle
    Send a bounded task or review packet to the local Claude Code CLI on the Fable model and bring back its verdict. Use when you want an independent second opinion from a different model.
    0 installs
  45. ▌
    Ecdsafail Oracle Loop · odinfree
    Iterate 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).
    0 installs
  46. ▌
    Hard Problem Contract · odinfree bundle
    Write 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.
    0 installs
  47. ▌
    Pinned Table Stacking · odinfree
    Author 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.
    0 installs
  48. ▌
    Quantum Record Mining · odinfree bundle
    Mine existing circuit records for overlooked measured gains, process-blocked candidates and mechanisms missing across arithmetic families, before new paper-driven work.
    0 installs
  49. ▌
    Bounded Commuting Fold · odinfree
    Exact 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).
    0 installs
  50. ▌
    Deepseek Pressure Test · odinfree
    Adversarial 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.
    0 installs
  51. ▌
    Ecdsafail Scratch Diet · odinfree bundle
    Exact 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'.
    0 installs
  52. ▌
    Jev Second Perspective · odinfree bundle
    Use 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.
    0 installs
  53. ▌
    Paged Walk Descent · odinfree bundle
    Akashneelesh'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.
    0 installs
  54. ▌
    Quantum Dense Qrom · odinfree bundle
    Evaluate dense Pauli-encoded QROM and packetized lookup as a structural replacement for material coherent table lookup costs.
    0 installs
  55. ▌
    Role Lane Eviction · odinfree
    Remove 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.
    0 installs
  56. ▌
    Burn The House Down · odinfree
    Escape 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".
    0 installs
  57. ▌
    Leader Rebase Stack · odinfree
    Maintain 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.
    0 installs
  58. ▌
    Exact Postpass Stack · odinfree
    Port 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.
    0 installs
  59. ▌
    Fast Lean Proof Loop · odinfree bundle
    Shorten 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.
    0 installs
  60. ▌
    Hosted Carry Lending · odinfree
    Lend 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.
    0 installs
  61. ▌
    Lambda Exchange Desk · odinfree
    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.
    0 installs
  62. ▌
    Elicit Research · odinfree bundle
    Search 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.
    0 installs
  63. ▌
    Exact Hold Pass · odinfree
    Exact 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.
    0 installs
  64. ▌
    Invariant Chart · odinfree bundle
    Stop 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.
    0 installs
  65. ▌
    Mission Command · odinfree bundle
    Run 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.
    0 installs
  66. ▌
    Nasqret Playbook · odinfree
    Build 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.
    0 installs
  67. ▌
    Beachhead Ratchet · odinfree bundle
    Take 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.
    0 installs
  68. ▌
    Greedyfrog Method · odinfree
    BitWonka'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.
    0 installs
  69. ▌
    Ecdsafail Fasteval · odinfree bundle
    Score 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.
    0 installs
  70. ▌
    Hold Demand Ledger · odinfree
    Measure 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.
    0 installs
  71. ▌
    Lean Arklib Proofs · odinfree bundle
    Formalize 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.
    0 installs
  72. ▌
    Stop Slop · odinfree bundle
    Audit 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.
    0 installs
  73. ▌
    Colab Lane · odinfree
    Run 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.
    0 installs
  74. ▌
    Shot Autopsy · odinfree bundle
    When 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.
    0 installs
  75. ▌
    Research Loop · odinfree bundle
    Run 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).
    0 installs
  76. ▌
    Zuiris Method · odinfree
    zuiris'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).
    0 installs
  77. ▌
    Pip Discipline · odinfree
    Evidence-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.
    0 installs
  78. ▌
    Strk20 Privacy · odinfree bundle
    Router and mental model for STRK20, the Starknet privacy pool. Use when choosing an integration route, answering questions about how STRK20 works (notes, nullifiers, viewing keys, channels, actions, proofs, deposit screening), stating what is hidden vs public, handling compliance and auditing questions, or mapping the ecosystem (shadow accounts, formerly private sub-accounts, the EVM Privacy Bridge, starter kit, RFPs, incubator, brand kit). Implementation work fires the sibling skills directly, strk20-wallet-api for private dapps in TS/React, strk20-anonymizer-contracts for Cairo helpers, strk20-privacy-sdk for wallets and key-holding backends.
    4 installs
  79. ▌
    Strk20 Wallet API · odinfree bundle
    Build private dapps on Starknet through the Starknet Wallet API. Covers shield/unshield, private transfers, shielded balances, private DeFi calls, shadow-account actions, and AVNU private swaps from TypeScript or React. Use whenever an app asks the user's privacy-enabled wallet to perform STRK20 actions (starknet.js WalletAccountV6, useStrk20 hooks, strk20InvokeTransaction, STRK20_ACTION, open notes, openNoteIds placeholders). For the Cairo helper side use strk20-anonymizer-contracts, for wallets or backends holding their own keys use strk20-privacy-sdk, for concepts and route choice use strk20-privacy.
    4 installs
  80. ▌
    Strk20 Privacy Sdk · odinfree bundle
    Build privacy wallets and key-holding backends with the Starknet Privacy SDK (@starkware-libs/starknet-privacy-sdk). Covers createPrivateTransfers wiring, register, deposit, transfer, withdraw, multi-op batches, shadow accounts (formerly private sub-accounts), note discovery, setup requirements, and proving configuration. Also use for debugging SDK submissions: provingBlockId, proofFacts, tip 0n, INVALID_NONCE, note maturity, fresh-account sequencing, and AddressMap lookups. If the app talks to the user's wallet instead of holding keys, use strk20-wallet-api. For concepts use strk20-privacy.
    3 installs
  81. ▌
    Strk20 Anonymizer Contracts · odinfree bundle
    Write, review, or audit Cairo anonymizer (helper) contracts for STRK20 private DeFi. Covers the privacy_invoke entry point the pool calls, OpenNoteDeposit returns, the balance-delta idiom, and the swap, Vesu lending, and escrow patterns. Use for the contract side of any STRK20 DeFi integration, or when a privacy_invoke call is being designed or debugged. Pairs with strk20-wallet-api (how a dapp reaches the helper), strk20-privacy (concepts), and cairo-contracts or cairo-security for general Cairo work.
    4 installs