About lens-pro
lens-pro is a skill for analyzing engineering systems with formal computer science and systems engineering concepts. It pairs benefits with costs and examines failure modes and operating boundaries.
Key features
- 01Uses formal engineering concepts
- 02Accounts for resource and operational costs
- 03Examines runtime failure modes
- 04Identifies degradation paths and boundaries
- 05Keeps analysis within inquiry scope
Use cases
- 01Reviewing an architectural design
- 02Assessing a system’s runtime behavior
- 03Identifying failure cases and trade-offs
Install
Copy the command and run it in a terminal.
$
npx skills add https:/ / github.com/ venhdev/ skills --skill lens-proAfter installing, type/lens-proin Claude Code to confirm it loaded.
Details
From the project READMElens-pro — Professional Engineering Deconstruction Engine
Operating Invariants
- Mechanical Precision: Define mechanisms strictly using formal Computer Science and Systems Engineering primitives (state machines, memory models, concurrency locks, I/O boundaries); forbid colloquial metaphors, juvenile simplifications, or hand-waving abstractions.
- Anti-Silver-Bullet (Cost Accounting): Quantify the mechanical cost (memory footprint, p99 latency, synchronization overhead, operational complexity) alongside every benefit; forbid presenting any pattern as cost-free or universally optimal.
- Failure-First Hardening: Expose concrete runtime failure modes, degradation paths, and boundary conditions; forbid happy-path-only explanations.
- Context Isolation: Deliver analysis strictly within the active inquiry scope without derailing ongoing session tasks or mutating project scope.
Canonical Output Contract
# Lens [Pro]: <Target Concept / Pattern / Mechanism>
## 1. Architectural Role & Invariant Contract
- **System Classification**: <e.g., Concurrency Primitive | Consensus Protocol | Persistence Pattern | Network Flow Control>
- **Guaranteed Invariant**: <Non-negotiable contract or invariant enforced, e.g., Linearizability, At-least-once delivery, Strict Concurrency Bound>
- **Formal Definition**: <Single-sentence, precise operational definition without colloquialisms or analogies>
## 2. Runtime Mechanics & Execution Path
1. **Ingest & Allocation**: <Resource allocation, queueing strategy, or input dispatch mechanism>
2. **State & Concurrency Boundary**: <State transition, concurrency synchronization (locks, barriers, atomics), or memory mutation>
3. **Settlement & Reclamation**: <State commit, I/O flush, error boundary propagation, or resource reclamation>
## 3. Trade-offs & Adoption
*(Use paired vectors, comparison matrix, or Mermaid diagram [flowchart, sequenceDiagram, stateDiagram, xychart] when state transitions or data flow topologies clarify non-obvious trade-offs)*
- **Gain**: <Primary performance, reliability, or scaling advantage achieved>
- **Cost / Sacrifice**: <Direct engineering cost: p99 latency jitter, memory overhead, concurrency contention, or operational complexity>
- **Adopt When**: <Specific operational scale, concurrency threshold, or technical constraint requiring this pattern>
- **Avoid When**: <Simpler baseline suffices; premature optimization trap>
## 4. Production Failure Modes & Mitigations *(omit for stateless/pure-functional patterns)*
- **<Failure Mode 1, e.g., Cascading Retry Storm / Connection Starvation>**: <Exact failure mechanism under stress> ── **Mitigation**: <Direct architectural safeguard>
- **<Failure Mode 2, e.g., Head-of-Line Blocking / Silent Memory Drift>**: <Exact failure mechanism under stress> ── **Mitigation**: <Direct architectural safeguard>
Comments
Markdown supported