Skill Claude CodeCodex
Strategy: Role-play attacks from hostile personas — competing lab researcher, hostile reviewer, funding skeptic, domain outsider — each with distinct attack motivations and blind spots.
Skill Claude CodeCodex
Strategy: Role-play attacks from hostile personas — competing lab researcher, hostile reviewer, funding skeptic, domain outsider — each with distinct attack motivations and blind spots.
Skill Claude CodeCodex
Tactic: Construct detailed hostile persona, attack artifact from that persona's perspective, record successful attack paths for aggregation.
Skill Claude CodeCodex
Campaign: Logical extreme and boundary testing via reductio ad absurdum and edge-case analysis. Core question: Does this artifact collapse under logical limits and boundary conditions? Methods: Lakatos 1976, Dutilh Novaes 2016, BVA, Flyvbjerg Critical Case, Popper.
Skill Claude CodeCodex
Strategy: What-If Analysis, Alternative Futures, and Four Ways of Seeing — generate competing explanations and scenarios to challenge the dominant narrative.
Skill Claude CodeCodex
Generate 2-4 divergent scenarios from the same evidence base, each representing a plausible alternative to the artifact's conclusions.
Skill Claude CodeCodex
Build assumption dependency graphs and trace cascade failures when root assumptions are invalidated.
Skill Claude CodeCodex
Tactic: Surface assumptions, sort by dependency, attack root assumptions first, then trace cascade failures through the dependency graph.
Skill Claude CodeCodex
Classic reductio ad absurdum: negate the core claim, derive logical consequences, seek contradiction or absurdity.
Skill Claude CodeCodex
Compute overall resilience score (0.0-1.0) based on attack results, coverage, and vulnerability severity distribution.
Skill Claude CodeCodex
Generate specific attack strategies for a given threat surface, producing concrete probes that can be executed.
Skill Claude CodeCodex
Systematic Boundary Value Analysis: identify parameter boundaries, test at and beyond limits, detect breakpoints.
Skill Claude CodeCodex
Map parameter space, generate extreme values, test at boundaries, detect breakpoints, synthesize validity envelope.
Skill Claude CodeCodex
Test a claim at extreme parameter values and detect the precise point where it breaks down.
Skill Claude CodeCodex
Extract all causal claims (X causes Y, X leads to Y, X enables Y) from an artifact, producing a structured list of cause-effect pairs.
Skill Claude CodeCodex
Tactic: Extract causal claims, evaluate probability of necessity (PN) and sufficiency (PS) for each, classify into necessity-sufficiency quadrants.
Skill Claude CodeCodex
Strategy: Run BEFORE building any validator (sandbox/simulation/benchmark). Builds a non-circularity matrix of theory-claim × validator-assumption to detect when a validator would 'confirm' a theory only because it was built on the theory's own premises. A circular validator's PASS carries zero evidential weight.…
Skill Claude CodeCodex
Formally negate the core claim, producing the logical complement for reductio testing.
Skill Claude CodeCodex
Propose a refined claim that survives counterexamples while preserving maximum explanatory power (Lakatos lemma-incorporation).
Skill Claude CodeCodex
Strategy: Lewis Possible Worlds — find the minimal change to reality that would flip the conclusion, measuring how close the nearest world where the conclusion fails.
Skill Claude CodeCodex
Calibrates confidence scores based on debate progression. Determines whether to escalate, continue, or terminate based on cumulative evidence.
Skill Claude CodeCodex
Negate a claim, derive logical consequences step by step, detect whether a genuine contradiction or absurdity emerges.
Skill Claude CodeCodex
Evaluate whether a derivation chain has reached a genuine contradiction, absurdity, or inconclusive state.
Skill Claude CodeCodex
Systematically generate counterexamples (monsters) to a given claim using diverse heuristic strategies.
Skill Claude CodeCodex
Generate counterexamples (monsters), attempt monster-barring, incorporate surviving counterexamples as lemma refinements (Lakatos method).