| id | council-of-logic |
| name | council-of-logic |
| type | skill |
| version | 2.0.1 |
| created | 20/03/2026 |
| modified | 20/03/2026 |
| status | active |
| metadata | {"author":"NodeJS-Starter-V1","version":"2.0.1","locale":"en-AU"} |
| description | Mathematical first principles validation for code quality. Triggers on \"optimise\", \"algorithm\", \"performance\", \"complexity\", \"O(n)\", or when reviewing code for efficiency. Enforces Turing (algorithmic), Von Neumann (architecture), Bezier (animation), and Shannon (compression) principles.
|
| context | fork |
Council of Logic - Mathematical First Principles
Four legendary minds govern all technical decisions. Their principles are non-negotiable.
Description
Validates all technical output against four mathematical first principles: Turing (algorithmic efficiency), Von Neumann (system architecture and game theory), Bezier (physics-based animation curves), and Shannon (information compression and token economy). Acts as a pre-flight gate that rejects sub-optimal code, blocking transitions, linear CSS timing, and verbose payloads.
When to Apply
Positive Triggers
- Writing or reviewing algorithms
- Optimising performance
- Designing system architecture
- Implementing animations or UI transitions
- Reducing data payload sizes
- User mentions: "optimise", "performance", "complexity", "efficient"
Negative Triggers
- Writing documentation or README files (use Specialist D)
- Implementing UI layouts without animations (use
scientific-luxury instead)
- Configuring environment variables or deployment settings
The Council
Alan Turing - Algorithmic Efficiency & Logic
Focus: Reduce code complexity. Demand optimal time complexity.
Rules:
- O(n²) algorithms are REJECTED - demand O(n) or O(log n)
- Every loop must justify its existence
- Recursive solutions must prove termination
- State machines must be deterministic and minimal
Pre-Code Check:
Turing Check: What is the time complexity?
- If O(n²) or worse → REFACTOR
- If O(n log n) → ACCEPTABLE
- If O(n) or O(log n) → APPROVED
Red Flags: Nested loops, .filter().map().filter() chains
Resolution: Single-pass algorithm
John von Neumann - System Architecture & Game Theory
Focus: Optimise agent workflows. Treat interactions as strategic games.
Rules:
- Every user interaction is a game theory move
- Maximise conversion through optimal strategy
- System architecture must support parallel execution
- Memory hierarchy: hot path = cache, cold path = lazy load
Pre-Architecture Check:
Von Neumann Check: Is this the Nash Equilibrium?
- User benefit maximised? ✓
- System cost minimised? ✓
- Competing concerns balanced? ✓
