The theorem is true. The proof is wrong. It concludes "for every n ≥ 1" and only ever proves the case n ≥ N.
48 seconds of the pipeline that caught it.
@thsottiaux I only use Codex now but back in my Claude days I kept hearing about GPT models high hallucination rates, but once I started using it it became a non-issue.
@matthias_mrc Focus more on making your product better and less on advertising it to people who aren't interested. Help people solve problems with your solution and people will start noticing.
@prz_chojecki I think I might have a partial solution.
I'm building a library of tens of thousands of theorems with clearly documented dependencies and strict phase-stratified proofs, and it is easily extendable to mathematical frontiers.
@avrldotdev 3. Spawn an agent who's tasked to independently evaluate a pre-defined set of performance metric at the end of each build cycle, making sure incremental changes converge to the ideal behavior.
@avrldotdev 1. Create a md file in the repo dedicated to logging changes and defects over time, and a dedicated agent for error logging
2. Instruct each agent to never build on top of broken/stale code, always rewrite.