Showing 43351–43380 of 77205 skills
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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.
odinfree/storm-ecdsa-harness
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).
odinfree/storm-ecdsa-harness
Compliance jurídico-regulatório (LGPD, ANPD, CDC, Marco Civil) para qualquer app ou sistema construído para brasileiros. Ative SEMPRE que o projeto coletar qualquer dado pessoal (nome, e-mail, telefone, CPF, geolocalização, dado do dispositivo, cookie de tracking, foto, áudio, log que identifique pessoa), OU quando o pedido envolver "LGPD", "política de privacidade", "termos de uso", "compliance", "DPO", "encarregado", "ROPA", "consentimento de cookies", "banner de cookies", "vazamento de dados", "incidente de segurança", "direito do titular", "exportar dados do usuário", "excluir conta". Esta skill AUDITA o projeto, classifica os tratamentos, e GERA os artefatos: política de privacidade, política de cookies, banner de consentimento, ROPA preenchido, RIPD quando exigível, runbook de incidente, endpoints de exercício de direitos do titular, schema de consent_log, termos de uso e portal de transparência.
ThomasMoreAI/legal-skills-open
Reference: shared framework for managing internal investigations from intake through final memo — privileged investigation log, document processing with needle-finding, source coverage tracking, Q&A against the log, memo drafting, and audience summaries. Loaded by /investigation-open, /investigation-add, /investigation-query, /investigation-memo, and /investigation-summary; not invoked directly.
ThomasMoreAI/legal-skills-open
独立上下文的怀疑式审核,两种模式,串行调用(不要并行起两个 Agent,会撞速率限制): · mode=judgment-stress(命题定稿后、写正文前)——起一个全新上下文的 agent, 对刚定稿的判断做压力对抗:逻辑链有没有断裂、有没有明显反例、是不是只停在表面没挖到机制/人性层、 是不是新瓶装旧酒。测的是论证站不站得住,不是立场讨不讨喜——反共识判断不因为"反共识"被扣分。 · mode=post-draft-audit(终稿、quality-gate 通过后)——独立上下文核验终稿有没有真的把判断往深处 逼了还是只是包装了已有想法(内容层面的谄媚检测),并核对 judgment-stress 阶段提出的质疑有没有 被真正解决,同时可选做结构查重(比对你自己的历史稿件记录)。 两种模式默认姿态:先假定平庸,除非稿子自己证明不是。禁止清单打勾式审查——每次质疑必须从这条内容本身 现场生成,不能套固定题库。 触发:/adversarial-gate、「压力对抗这个判断」「这条是不是谄媚我」「独立审核一下」、 写稿流程里命题定稿后/终稿质检后自动调用
MarchTalk/ai-content-skills
商业心理与购买阻力底层能力(合并自两个原本总是配对使用的判断层:经济理性层锁定阻力分类,心理感受层翻译成内心独白)。先用六类阻力锁定用户卡在哪(钱/风险/时间/信任/面子/决策成本),再翻译成用户不会说出口的心理独白和内容锚点。处理产品价值、价格、信任、成交、风险、成本、用户为什么不买;区分伪需求和真实付费需求、流量内容和成交内容;落点必须是钱、风险、时间、信任、结果、代价,以及具体的一句话/一个场景/一个动作。
MarchTalk/ai-content-skills
概念核验。两种深度:A 贴身词语核验(写文案时一个词该不该留,三问自检 + 行业黑话豁免);B 深度概念拆解(把一个模糊概念拆到说不清就是没想清——对齐是否各说各话、往回倒查原意、假设检查戳穿伪概念、检验是描述行动还是替代了行动、去词测试、判断是信息缺口还是执行缺口)。别只停在"是不是 AI 空词"就收工,那只是 A 模式;用户要"深度拆解"必须走完 B 模式。
MarchTalk/ai-content-skills