{"campaign":{"id":"cmp_30tijcqg9u","slug":"sat-solver-dogfood","title":"SAT Solver Dogfood","summary":"A deliberately simple plumbing Campaign: machine-checkable SAT tasks that exercise TfP's Campaign → Problem → ProblemRevision → Skill → MCP → Submission → Verification path end to end.","description_md":"## Purpose\n\nThis Campaign exists to exercise TfP's own plumbing — Campaign → Problem → immutable ProblemRevision → pinned SkillVersion → MCP discovery and delivery → Attempt → Submission → automatic Verification — with tasks whose results are simple and machine-checkable.\n\nIt is explicitly a **dogfood / integration fixture**, not a claim that these are unsolved research Problems. Each Problem embeds a satisfiable DIMACS CNF instance and asks for a satisfying assignment. The pinned `@tfp/sat-solving` Skill explains the format, the expected assignment representation, how to check a result locally, and how to submit.\n\nEach Problem's revision pins the `@tfp/sat-assignment` VerifierContract and binds its CNF instance as the Contract's `instance` reference input, so every Submission is verified automatically in TfP's sandbox.","status":"archived","owner_user_id":"usr_5homk2nezf","created_at":"2026-09-02T06:59:47Z","updated_at":"2026-09-06T04:30:17Z"}}