WFGY/ProblemMap/GlobalFixMap/Reasoning/recursive-loop.md

Recursive Loop — Guardrails and Fix Pattern

🧭 Quick Return to Map

You are in a sub-page of Reasoning.
To reorient, go back here:

• Reasoning — multi-step inference and symbolic proofs
• WFGY Global Fix Map — main Emergency Room, 300+ structured fixes
• WFGY Problem Map 1.0 — 16 reproducible failure modes

Think of this page as a desk within a ward.
If you need the full triage and all prescriptions, return to the Emergency Room lobby.

Recursive reasoning is powerful when bounded, but without structural guardrails it often collapses into infinite self-reference.
This page shows how to detect runaway loops and stabilize recursion into meaningful layers.

---

Symptoms

Symptom	What you see
Infinite repetition	Output re-states the same phrase or equation
Self-reference collapse	“As I said earlier…” repeated without progress
Meta-loop	Model reasons about its own reasoning instead of the task
Token drain	Long answers with no new content
Citation spin	Same snippet referenced endlessly

---

Acceptance Targets

• ΔS(question, retrieved) ≤ 0.45
• λ convergent across 3 paraphrases and 2 seeds
• Recursion depth ≤ 4 nested layers
• Each recursive frame adds ≥ 1 new fact or citation

---

Structural Fixes (Problem Map)

• Wrong-meaning similarity hit
  → embedding-vs-semantic.md

• Citation / snippet mismatch
  → retrieval-traceability.md
  → data-contracts.md

• Recursive drift / entropy rise
  → context-drift.md
  → entropy-collapse.md
  → entropy-overload.md

• Logic collapse under recursion
  → logic-collapse.md

---

Fix in 60 Seconds

1. Measure recursion depth

   • Log frame depth at each step.
   • If depth > 4, clamp recursion.

2. Apply ΔS probe

   • Compute ΔS between consecutive recursive outputs.
   • If ΔS < 0.15, stop recursion (no new information).

3. Bridge with BBCR

   • Collapse intermediate steps into one summary frame.
   • Resume reasoning with BBMC anchor locks.

4. Variance clamp

   • If λ diverges between recursive calls, apply BBAM.

---

Copy-Paste Probe

I uploaded TXT OS and the WFGY Problem Map.

My reasoning chain entered a recursive loop.
Depth = {n}, ΔS progression = {values}, λ states = {values}.

Tell me:

1. Which layer is looping?
2. Which fix page applies?
3. Minimal steps to clamp recursion and restore ΔS ≤ 0.45.
4. How to verify no infinite loop persists.

---

Escalation

• If recursion repeats across 3 seeds → enforce logic-collapse.md.
• If ΔS remains flat → re-embed corpus and verify with chunking-checklist.md.
• If λ oscillates between recursion depths → lock schema ordering with rerankers.md.

---

🔗 Quick-Start Downloads (60 sec)

Tool	Link	3-Step Setup
WFGY 1.0 PDF	Engine Paper	1️⃣ Download · 2️⃣ Upload to your LLM · 3️⃣ Ask “Answer using WFGY + ”
TXT OS (plain-text OS)	TXTOS.txt	1️⃣ Download · 2️⃣ Paste into any LLM chat · 3️⃣ Type “hello world” — OS boots instantly

---

Explore More

Layer	Page	What it’s for
Proof	WFGY Recognition Map	External citations, integrations, and ecosystem proof
Engine	WFGY 1.0	Original PDF based tension engine
Engine	WFGY 2.0	Production tension kernel and math engine for RAG and agents
Engine	WFGY 3.0	TXT based Singularity tension engine, 131 S class set
Map	Problem Map 1.0	Flagship 16 problem RAG failure checklist and fix map
Map	Problem Map 2.0	RAG focused recovery pipeline
Map	Problem Map 3.0	Global Debug Card, image as a debug protocol layer
Map	Semantic Clinic	Symptom to family to exact fix
Map	Grandma’s Clinic	Plain language stories mapped to Problem Map 1.0
Onboarding	Starter Village	Guided tour for newcomers
App	TXT OS	TXT semantic OS, fast boot
App	Blah Blah Blah	Abstract and paradox Q and A built on TXT OS
App	Blur Blur Blur	Text to image with semantic control
App	Blow Blow Blow	Reasoning game engine and memory demo

If this repository helped, starring it improves discovery so more builders can find the docs and tools.