textlog
โ€ฆ
One idea off the top of my head is to just.. keep it "boring" and casual in terms of content. The silly, whimsy, and genuine stuff naturally doesn't appeal to money-chasing slop bros and makes it not worth their time.
OK. I've translated the (correctness) requirements of LeetCode No.22 to Lean, and ask Claude Code to both implement a solution and prove it.
In the first attempt, Opus 4.7 successfully completed it and proved it. However, the solution is to enumerate all possible space and .filter out anything that doesn't qualify my definition, which is obviously not ideal (if cheating is too harsh).
I can't think of a good way to also prevent that kind of solutions and ended up prompting "please don't enumerate and filter". Opus 4.7 then reimplemented and proved the backtracking algorithm.
Inspired by two projects of github:schildep I start to explore what can be expressed in Lean and make coding agents implement and prove the implementation at the same time.
The two projects of github:schildep are "3d mesh intersection" and "multipolygon intersection". I can try "Voronoi diagram generation" as a starter.
join the communityorbrowse more notes