Results for “invariants”

Produce the architecture: a lean spine of invariants that keeps everything built from it consistent, projected into whatever format the work needs. Use when the user says "create the architecture", "create technical architecture", "architecture spine", or "create a solution design".

Type design analysis — encapsulation, invariant expression, usefulness, and enforcement.

Refactors Swift code toward declarative functional programming with immutability, value types, pure functions, transformations, and closure-based APIs.

Debugging constant Markov regime features in RL observations - when HMM probabilities show uniform values instead of dynamic regime estimates

Identify, collect, and analyze ransomware attack artifacts to determine the variant, initial access vector, encryption scope, and recovery options.

Ingests case studies, past proposals, and boilerplate from library/inbox into structured indexes. Use when the user requests to 'index proposal library', 're-index case studies', 'ingest inbox docs', or 'validate library'.

VALIS registration for CODEX: rigid + non-rigid with tuned smoothing. Earlier 'rigid-only' conclusion was caused by a parameter passing bug — all non-rigid tests ran with unsmoothed OpticalFlowWarper.

Deliberative consultation with Codex CLI. Ask, evaluate, critique, iterate until workable agreement.

Inverse ETF Proxy for Crypto Shorts

BISON v2.0 — Conviction Holder (Hardened). Top 10 assets by volume. All signals are score contributors — no hard gates. Scanner enters via create_position internally (Wolverine pattern). RatchetStop exits. Thesis exit REMOVED. v2.0: every hard gate converted to score contributor, ensureExecutionAsTaker=false, conviction-scaled margin 25-37%.

Design a theming architecture that supports brand variants, dark mode, and high-contrast modes with token mapping.

Converting repository changes into detailed learning documents. Use when turning diffs into teaching materials, recording design decisions, or creating onboarding materials for new members.

Application architecture patterns and code organization — clean architecture, hexagonal architecture, feature-based structure, dependency inversion, module boundaries, SOLID principles at module scale. Activate on "clean architecture", "hexagonal architecture", "feature-based structure", "dependency inversion", "module boundaries", "architecture pattern", "folder structure", "fat controller", "circular dependency", "IoC container". NOT for microservice decomposition (use microservices-patterns) or database schema design (use database-design-patterns).

Flip a problem, goal, or decision 180 degrees to find what forward thinking misses. Asks what would guarantee failure, then works backward to what must be avoided or changed. Load when the user says "invert this", "flip this problem", "what would guarantee failure", "think backward", "reverse engineer the goal", "think about it backwards", or when deep-thinking diagnoses an inversion frame. Also triggers on "what's the opposite of success here", "how would we sabotage this". Two methods: Failure Inversion and Opposite Goal. Max 2 clarifying questions before inverting. Always returns forward actions. For broader analysis, deep-thinking calls this.

Analyzes code to separate essential complexity from incidental noise, then produces a ranked refactoring plan with a structural sketch and TRACE assessment, without making edits.

Use when simulating stochastic folding kinetics of single-stranded nucleic acids, computing first passage times between structures, or analyzing RNA/DNA folding trajectories.

Optimizes hot-path scalar loops in .NET 8+ with cross-platform Vector128/Vector256/Vector512 SIMD intrinsics, or replaces manual math loops with single TensorPrimitives API calls.

Progressively refines context retrieval in multi-agent workflows to solve the subagent context problem.

Use when inferring maximum-likelihood phylogenetic trees, selecting substitution models, running bootstrap support analyses, or performing partitioned phylogenetic analyses on sequence alignments.

Holarchic reasoning framework implementing λ-calculus over simplicial complexes. Entities (ο) transform through operations (λ) toward terminals (τ) via the universal form λο.τ. Persistent homology captures multi-scale structure; sheaf theory ensures local-to-global consistency. Use when knowledge requires: (1) homoiconic self-reference where structure mirrors content, (2) scale-invariant holonic decomposition, (3) topological invariants preserved across transformations, or (4) formal Lex-style axiom systems over property graphs.

Formally verify programs by writing Lean 4 proofs. Trigger this skill whenever the user wants to formally verify code, generate Lean 4 proofs, prove properties about algorithms or smart contracts, verify invariants, convert program logic into formal specifications, or anything involving Lean 4 and formal verification. Also trigger when the user mentions "qedgen", "lean proof", "formal proof", "verify my code", "prove correctness", "formal verification", or wants mathematical guarantees about their implementation.