BEAR: Budgeted Evidence Allocation for Multi-Document Reasoning — HN submission

Wed, 08 Apr 2026 13:05:23 GMT

Show HN: OpenFable – Open-source RAG engine using tree-structured indexes

Hi HN, I built OpenFable, an open-source retrieval engine that implements the FABLE algorithm (https://arxiv.org/abs/2601.18116) for RAG pipelines. I'm using it in another project and thought that others might benefit. Most RAG systems chunk documents into flat segments and retrieve by vector similarity. This works for simple lookups but breaks when answers span multiple sections, when relevant content is buried in a subsection, or when you need to control how many tokens you're sending to an LLM. OpenFable takes a different approach: when you ingest a document, it uses an LLM to identify…

5 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

BEAR: Budgeted Evidence Allocation for Multi-Document Reasoning · HackerPapers discussions

BEAR: Budgeted Evidence Allocation for Multi-Document Reasoning — HN submission