Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> It also means that the "hey Claude vibeslop me a CUDA Anubis solver" route is on its way to being fundamentally dead.

Would there be any risk in making a dynamically built algorithm (i.e. the risk that we don't find N zero prefix bits)? Chain a set of transforms and build a unique WASM binary (including optimizations to deter pattern matching); possibly one a day or hour or something. That way you'd need to have Claude vibeslop the CUDA implementation at that cadence, per website.



This is exactly what I've been working on. For obvious reasons around it not being done yet, I don't have anything else to say.


That's awesome!




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: