boundary-bbcr-fallback
Execute automatic BBCR (Collapse-Rebirth Correction) when knowledge boundaries are exceeded or reasoning fails.
Calculate the semantic tension (ΔS) between concepts to measure conceptual distance and reasoning jumps.
$ npx -y skills add qdhenry/Claude-Command-Suite --agent claude-codeHow it fires
How this command gets triggered: by you, by Claude, or both.
/reasoning-tension-calcContext preview
What this command does when you run it.
Calculate the semantic tension (ΔS) between concepts to measure conceptual distance and reasoning jumps.
tools: - read - write - grep arguments: $CONCEPT1 $CONCEPT2
Calculate the semantic tension (ΔS) between concepts to measure conceptual distance and reasoning jumps.
Based on the WFGY project: https://github.com/onestardao/WFGY
1. **Parse Input Concepts**
2. **Generate Semantic Embeddings**
3. **Calculate Semantic Tension**
ΔS = 1 - cos(θ) Where: cos(θ) = (V1 · V2) / (||V1|| * ||V2||) ΔS ranges: 0.0 = Identical concepts 0.5 = Moderately related 1.0 = Orthogonal/unrelated 2.0 = Opposite concepts
4. **Analyze Tension Components**
5. **Interpret Results**
6. **Generate Relationship Analysis**
SEMANTIC TENSION ANALYSIS
═══════════════════════════════════════
Concept 1: "$CONCEPT1"
Concept 2: "$CONCEPT2"
Semantic Tension (ΔS): [value]
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Identical Related Unrelated
0.0 0.5 1.0
[═════════════════▼═══════════════]
[value]
Interpretation: [Nearly identical/Closely related/Moderately related/Weakly related/Unrelated]
Zone Classification:
[Safe Zone ✓] [Transitional ⚠️] [Risk Zone ⚠️] [Danger Zone ⚠️]
Component Analysis:
┌─────────────────────────────────────┐
│ Component │ Distance │ Weight │
├─────────────────────────────────────┤
│ Lexical │ [value] │ 25% │
│ Contextual │ [value] │ 35% │
│ Logical │ [value] │ 25% │
│ Categorical │ [value] │ 15% │
└─────────────────────────────────────┘
Relationship Type: [Direct/Indirect/Analogical/Oppositional/None]
Connection Analysis:
• Shared attributes: [list]
• Common context: [description]
• Logical link: [if exists]
Bridging Concepts (if ΔS > 0.6):
1. [Bridge concept] - ΔS from C1: [val], from C2: [val]
2. [Bridge concept] - ΔS from C1: [val], from C2: [val]
3. [Bridge concept] - ΔS from C1: [val], from C2: [val]
Reasoning Path Difficulty:
[Easy ████░░░░░░] [Medium ████████░░] [Hard ██████████]
Navigation Strategy:
[Direct connection possible]
OR
[Bridging required through: concept]
OR
[Multiple bridges needed: path]
Historical Patterns:
• Previous transitions with similar ΔS: [count]
• Success rate at this tension: [percentage]%
• Average bridges required: [number]
Recommendations:
• Safe to proceed: [Yes/No]
• Suggested approach: [Direct/Bridge/Multi-hop]
• Risk level: [Low/Medium/High]
• BBCR readiness: [Not needed/Standby/Armed]Concept A (0.6) → Concept B (0.4) → Concept C (0.2)
Concept A (0.2) → Concept B (0.5) → Concept C (0.8)
Concept A (0.3) → B (0.7) → C (0.4) → D (0.8)
Concept A (0.4) → B (0.4) → C (0.4) → D (0.4)
# Compare multiple concepts /reasoning:tension-calc "A" "B; C; D" # Compare with context /reasoning:tension-calc "concept" # Detailed component breakdown /reasoning:tension-calc "A" "B" --detailed # Find optimal path /reasoning:tension-calc "start" "end" --pathfind
Tension calculation feeds into:
A comprehensive development toolkit designed following Anthropic's Claude Code Best Practices for AI-assisted software development.
Repo: qdhenry/Claude-Command-Suite
Execute automatic BBCR (Collapse-Rebirth Correction) when knowledge boundaries are exceeded or reasoning fails.
Analyze semantic position relative to knowledge boundaries to prevent hallucination and identify uncertainty zones.
Generate a visual heatmap of knowledge boundaries showing safe zones, risk areas, and semantic coverage.
Evaluate the current risk level and provide detailed analysis of potential hallucination or reasoning failure.
Find and construct semantic bridges to safely navigate from current position to target concept without crossing dangerous boundaries.
Takes an input prompt and returns ONLY a token-optimized version that preserves meaning while minimizing token count. Based on LLM tokenization principles:…