Maintains a persistent, interlinked markdown wiki between immutable raw sources and answers: ingest, query, lint, index and log—compounding knowledge instead of one-shot RAG.
94
94%
Does it follow best practices?
Impact
96%
0.97xAverage score across 3 eval scenarios
Passed
No known issues
A developer named Marcus maintains a personal knowledge base wiki on programming language theory. The wiki has been growing organically for several months, and he suspects it's starting to drift—some pages may be out of date, important terms might be unlinked, and there could be gaps where the wiki references concepts without adequate sourcing.
Marcus wants a thorough health audit of the wiki. He prefers not to have the agent search the internet during the audit—he would rather know honestly which areas of the wiki lack coverage so he can decide what to read next. He wants a written report and the audit logged so he has a history of when health checks were performed.
Produce a lint audit of the wiki. The expected outputs are:
wiki/reports/health-audit-2026-04-06.md summarizing findings (orphan pages, stale claims, missing cross-references, important terms lacking pages, interesting connections)wiki/log.md with a new log entry appended for this lint operation—the existing entries must remain exactly as they wereThe following files are provided as inputs. Extract them before beginning.
=============== FILE: wiki/index.md ===============
=============== FILE: wiki/topics/lambda-calculus.md ===============
Lambda calculus is a formal system developed by Alonzo Church in the 1930s to investigate computable functions.
Beta reduction is the core evaluation rule: applying a function to an argument substitutes the argument for the parameter.
Numbers can be encoded in pure lambda calculus using Church numerals, where the number n is represented as a function applied n times.
=============== FILE: wiki/topics/type-theory.md ===============
Type theory provides a formal language for describing the types of values in programming languages. Martin-Löf type theory is a constructive foundation for mathematics.
The Curry-Howard correspondence connects type theory with formal logic.
Dependent types allow types to depend on values, enabling very precise specifications.
=============== FILE: wiki/topics/curry-howard.md ===============
The Curry-Howard correspondence establishes an isomorphism between:
This means that a type-correct program is equivalent to a proof of its type.
This connection was independently discovered by Haskell Curry and William Howard.
=============== FILE: wiki/topics/linear-types.md ===============
Linear type systems enforce that each value is used exactly once, preventing aliasing and enabling safe memory management without garbage collection.
Rust's ownership system is inspired by linear type theory.
=============== FILE: wiki/people/alonzo-church.md ===============
Alonzo Church (1903–1995) was an American mathematician. He invented lambda calculus and proved the undecidability of the Entscheidungsproblem in 1936.
Church was the doctoral advisor of Alan Turing.
=============== FILE: wiki/log.md ===============