VORTEXRAG is a novel 7-layer Retrieval-Augmented Generation (RAG) framework that simultaneously solves the two fundamental failure modes that have limited RAG systems since their inception: Semantic Drift and Context Window Poisoning. Why existing RAG systems fail Standard RAG systems fail because dense retrieval cannot distinguish between a chunk that caused an event and a chunk that was merely associated with it. Query: "Why did Lehman Brothers collapse? " Standard cosine similarity retrieves Dodd-Frank Act provisions (similarity 0. 87) alongside the actual CDS mispricing mechanism (similarity 0. 91). The LLM sees both and hallucinates a policy-response narrative instead of the causal mechanism. This is Semantic Drift. Even when the correct chunk is retrieved, 7 surrounding irrelevant chunks dilute the LLM's attention window — Context Window Poisoning. The VORTEXRAG 7-Layer Solution TVE — Tri-Vector Encoding: Encodes each text into a 864-dimensional tri-vector combining semantic (768d SBERT all-mpnet-base-v2), syntactic (64d spaCy dependency), and causal (32d PropBank) arms. Score = α·cosₛem + β·cosₛyn + γ·coscau. VRC — Vortex Retrieval Cone: Models retrieval as a spiral probability surface. Spiral rank = TVE · e^ (−λr) · cos (nθ). Chunks causally misaligned by θ > π/4 are geometrically suppressed regardless of semantic similarity. SDC — Semantic Drift Corrector: Computes a causal drift vector D = vcau (q) − vcau (c) and scores SDS = 1 − tanh (‖D‖/τ). Only chunks with SDS ≥ 0. 72 pass. Domain-tuned τ from 0. 30 (medical) to 1. 20 (creative). CPG — Context Poison Guard: Measures the Effective Signal Ratio ESR = Σ SDS·w / (P+ε) of the entire window. Greedy purge removes minimum-SDS chunks until ESR ≥ 3. 5. Theorem 5. 1 proves greedy optimality. RFG — Rank Fusion Gate: Multiplicative Φ-score: Φ = TVE^α × SDS^β × ESRcontrib^γ. Multiplicative fusion enforces a no-weak-link policy — no chunk advances unless strong on all three dimensions. CCB — Causal Context Builder: Constructs a causal dependency graph and assigns slot positions pos = rank (Φ+) × causaldepth. Depth-0 root-cause chunks are placed at position 0 to exploit the empirically established U-shaped LLM recall curve. FV — Faithfulness Verifier: Post-generation gate ΔR = 1 − ROUGE-L × NLI. Accepts if ΔR ≤ 0. 15. Up to 3 retries with reranked context. Uses DeBERTa-v3-small CrossEncoder. Benchmark Results Exact Match (EM): 74. 8 — vs Naive RAG: 61. 2 (+13. 6), CRAG: 66. 9 (+7. 9), Self-RAG: 68. 4 (+6. 4) F1: 82. 6 — highest across all 8 evaluated systems Faithfulness: 0. 94 — +0. 23 over Naive RAG, +0. 13 over Self-RAG Semantic Drift Rate: 14% — reduced 61% from Naive RAG baseline Context Poisoning Rate: 7% — reduced 71% Latency: 185ms — 2. 2× faster than Self-RAG (410ms) Ablation Study (A→H) A (61. 2 EM) → +TVE (65. 3, +4. 1) → +VRC (67. 8, +2. 5) → +SDC (70. 4, +2. 6) → +CPG (72. 1, +1. 7) → +RFG (73. 4, +1. 3) → +CCB (73. 9, +0. 5) → +FV (74. 8, +0. 9) 11 Domain Presets Pre-calibrated parameter vectors (α, β, γ, τ, θCPG, δSDC, δFV) for: scientific (τ=0. 30), medical (τ=0. 35), legal (τ=0. 40), cybersecurity (τ=0. 45), financial (τ=0. 50), code (τ=0. 60), educational (τ=0. 65), general (τ=0. 80), historical (τ=0. 90), customer support (τ=0. 95), creative (τ=1. 20). Human Evaluation Expert human annotators (3 judges: NLP researcher, domain lawyer, biomedical scientist) rated VORTEXRAG 4. 5/5 on Factual Accuracy, 4. 3/5 on Causal Coherence — +0. 9 over Self-RAG on causal coherence, a dimension not captured by automatic metrics. Open Source Complete implementation in Python with 229 passing tests, Gradio interactive demo, HuggingFace Space, benchmark evaluation scripts, and full documentation. MIT licence. All code at: https: //github. com/vignesh2027/VORTEXRAG
Vignesh L (Mon,) studied this question.