Skip to main content
council-of-logic 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.
Ir a la instalación Skills Marketplace Descubre y explora habilidades de IA creadas por la comunidad.
Instalar con Codex o Claude Copia este prompt, pégalo en Codex, Claude u otro asistente, y deja que revise la página de la skill y la instale por ti.
Mostrar detalles del prompt Un comando directo omite el prompt de revisión. Revisa el origen antes de ejecutarlo.
npx skills add https://github.com/CleanExpo/skills-library --skill council-of-logicEl comando permanece en una sola línea. Desplázate horizontalmente para revisarlo antes de copiarlo.
¿Prefieres una copia local? Descarga los archivos que SkillsMP tiene disponibles ahora.
Descargar Zip Descargando... Más de este repositorio Dispatch the eight operational roles against a task, each grounded in the vault before it reads any code, with a live view of what is running. Use for work that wants several independent lenses at once — map, plan, build, verify, review, security, CI, release — rather than one agent doing everything.
Thin wrapper around the Pi-CEO Hour-1 provisioner. Given a client slug + email, invokes `swarm/inbox/provisioner.py` to spin up the full Linear project + Supabase portal_content + ContextBot Telegram intake bot + welcome email + Phill ping. Use when the user says "onboard {client}", "spin up portal for", "new client setup", or right after `stripe-milestone-invoice` confirms a deposit cleared.
PM-Core — the first autonomous execution agent. Claims the highest-priority agent-ready ticket from the Unite-Group Linear board, clones the repo, implements the fix on a feature branch, runs CI, and opens a PR. Model: claude-sonnet-5 (senior agent tier). Trigger: /pm-core [ticket-id] or autonomous via Hermes cron.
name council-of-logic 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. license MIT metadata {"author":"NodeJS-Starter-V1","version":"2.0.1","locale":"en-AU"}
Council of Logic - Mathematical First Principles
Four legendary minds govern all technical decisions. Their principles are non-negotiable.
When to Apply
Activate this skill when:
Writing or reviewing algorithms
Optimising performance
Designing system architecture
Implementing animations or UI transitions
Reducing data payload sizes
User mentions: "optimise", "performance", "complexity", "efficient"
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.
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
Von Neumann Check: Is this the Nash Equilibrium?
- User benefit maximised? ✓
- System cost minimised? ✓
- Competing concerns balanced? ✓
Red Flags : Blocking operations, race conditions
Resolution : Async/parallel design
Pierre Bezier - Frontend Physics & Animation Focus : Interpolation curves for luxury UI. No linear transitions.
BANNED : transition: all 0.3s linearREQUIRED : Physics-based springs, cubic-bezier curvesEvery animation must feel "weighted" and "intentional"
Micro-interactions on every state change
--ease-spring : cubic-bezier (0.68 , -0.55 , 0.265 , 1.55 );
--ease-smooth : cubic-bezier (0.4 , 0 , 0.2 , 1 );
--ease-bounce : cubic-bezier (0.34 , 1.56 , 0.64 , 1 );
--ease-out-expo : cubic-bezier (0.19 , 1 , 0.22 , 1 );
Bezier Check: Does this feel "expensive"?
- Linear timing? → REJECT
- Abrupt start/stop? → REJECT
- Physics-based curve? → APPROVED
Red Flags : Linear timing, jarring transitions
Resolution : Spring/bezier curves
Claude Shannon - Information Theory (Token Economy) Focus : Maximum signal, minimum noise. Compress everything.
Every prompt must be entropy-optimised
Data structures compressed to essential bits
Redundant information is wasted tokens
API responses: return exactly what's needed, nothing more
Shannon Check: What is the signal-to-noise ratio?
- Redundant words? → COMPRESS
- Unnecessary fields? → REMOVE
- Implicit > Explicit when context allows
Red Flags : Verbose prompts, bloated payloads
Resolution : Compress, dedupe, minimise
Workflow Protocol
STEP 1: THE PROOF Before writing ANY code, state the mathematical/logical model:
## Mathematical Model
**Problem** : [State the problem in formal terms]
**Turing** : Time complexity target = O(?)
**Von Neumann** : Architecture pattern = [pattern]
**Bezier** : Animation curve = [easing function]
**Shannon** : Data compression = [strategy]
STEP 2: THE SOLVE Execute with council approval:
## Implementation
**Turing Approval** : [complexity analysis]
**Von Neumann Approval** : [architecture justification]
**Bezier Approval** : [animation specification]
**Shannon Approval** : [compression verification]
STEP 3: THE VERIFY Post-implementation council review:
## Council Review
- [ ] Turing: No O(n²) or worse
- [ ] Von Neumann: Nash equilibrium achieved
- [ ] Bezier: All transitions physics-based
- [ ] Shannon: Maximum compression applied
Quick Reference: Council Objections Council Member Red Flag Resolution Turing Nested loops, .filter().map().filter() Single-pass algorithm Von Neumann Blocking operations, race conditions Async/parallel design Bezier Linear timing, jarring transitions Spring/bezier curves Shannon Verbose prompts, bloated payloads Compress, dedupe, minimise
Code Examples
Turing Violation (BAD)
const result = items.filter ((item ) => otherItems.some ((other ) => other.id === item.id ));
Turing Approved (GOOD)
const otherSet = new Set (otherItems.map ((o ) => o.id ));
const result = items.filter ((item ) => otherSet.has (item.id ));
Bezier Violation (BAD)
transition : all 0.3s linear;
Bezier Approved (GOOD)
transition : transform 0.5s cubic-bezier (0.19 , 1 , 0.22 , 1 );
Remember : These are not guidelines. They are mathematical laws .
