sgfreleaseupdate/field-proving-ground — explained in plain English
Analysis updated 2026-05-18
Run a small local model that answers only from a fixed set of documents instead of guessing.
Test whether a small AI model correctly abstains when its documents do not contain an answer.
Study a working example of an abstain-judge pattern for retrieval-augmented generation.
Experiment with phone-class local AI setups using Ollama on your own machine.
| sgfreleaseupdate/field-proving-ground | 0xallam/my-recipe | 0xhassaan/nn-from-scratch | |
|---|---|---|---|
| Stars | 0 | — | 0 |
| Language | Python | Python | Python |
| Last pushed | — | 2022-11-22 | — |
| Maintenance | — | Dormant | — |
| Setup difficulty | moderate | moderate | moderate |
| Complexity | 3/5 | 2/5 | 4/5 |
| Audience | developer | general | developer |
Figures from each repo's GitHub metadata at analysis time.
Requires Ollama running locally with two specific small models pulled first.
Field Proving Ground is a small local system for answering questions using retrieval augmented generation, a technique where a program looks up relevant passages from a fixed set of documents before answering, instead of relying purely on what an AI model already knows. The project's main goal is to make sure the system says it does not know when its source documents do not actually contain an answer, instead of quietly guessing based on the underlying model's own training. It is built to run entirely on modest, phone class hardware. It uses a small AI model called gemma2:2b for generating answers and a separate small model called nomic embed text for finding relevant passages in its document collection, referred to as the cold pack. The author is explicit that this is a genuinely constrained setup, not a larger model artificially limited to look small, and notes that a separate, bigger personal assistant project of theirs is unrelated to this one. The system has three main parts: a server script that only listens on the local machine and makes no outside network calls beyond talking to a locally running tool called Ollama, an evaluation script that runs a set of tests checking whether the system answers correctly or abstains appropriately, and the fixed folder of documents it draws its answers from. Before the model is allowed to answer, a separate check, called an abstain judge, looks at the retrieved passages and decides whether they truly contain the answer. If they do not, the system refuses to answer rather than filling the gap with its own guessed knowledge. The README documents real problems the author ran into while building this: early versions leaked outside knowledge because a simple similarity score let irrelevant passages through, and a single fixed similarity cutoff proved unreliable, which is why the abstain judge replaced it. To run it, you need Ollama installed locally with the two small models downloaded, plus a standard Python 3.9 or newer install with no extra packages required. You start the server with one command and run the test suite with another. The model is not kept loaded in memory between answers, and all traffic stays on your own machine.
A tiny local question-answering tool that only answers from its own documents and plainly refuses when those documents do not contain the answer.
Mainly Python. The stack also includes Python, Ollama, gemma2:2b.
Setup difficulty is rated moderate, with roughly 30min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.