Catalogue
The primitives coding agents keep getting subtly wrong.
Every card is a reusable implementation pattern with provenance, review status and usage — not anonymous generated boilerplate. Preview the metadata for free; retrieve the verified bytes by MCP or from the console.
Catalogue is warming up.
The live catalogue could not be reached right now. It refreshes automatically. In the meantime you can open the console to search and retrieve directly.
Open the consoleSearch before generating
Start with the behavior, language and constraints your agent needs. A strong match should reduce implementation and review work; a weak match should be rejected rather than forced into the codebase.
Inspect the proof
Check provenance, license, scan date, examples, tests and revocation status before retrieval. The catalogue exposes those signals so reusable code remains attributable and auditable.
Adapt and verify
Retrieval is the starting point, not the release gate. Adapt the primitive to local interfaces, run its proof pack and preserve the receipt so the next agent can understand what was reused, why it matched and which assumptions still belong to the surrounding repository.
What a verified primitive is — and is not
A primitive is deliberately smaller than a product feature. It solves a narrow recurring problem — validating an input, protecting a fetch, handling a retry, or recording a proof — while leaving the surrounding application in control. That narrow scope makes the artifact easier to inspect, test and adapt than a large block of generated code with unclear assumptions.
Verification does not mean that a snippet can be copied blindly. It means the repository can see where the pattern came from, what license and scan date apply, which examples or tests support it, and whether the artifact has been revoked. The consuming agent still has to compare interfaces, runtime versions, threat models and failure behavior with the codebase it is changing.
A useful retrieval therefore begins with constraints rather than a familiar function name. Search for the behavior you need, reject near matches when they miss an important constraint, then run the local proof pack after adaptation. This keeps reuse honest: it saves repeated reasoning without turning an old implementation into an authority it has not earned.