Re: Mark1 - pollard rho implementation (38 minutes for 80 bits solving on CPU)
It ain’t worth makin’, but you could totally build a Memory-Mapped DP Table System that mixes a Bloom filter (in RAM) with a memory-mapped DP table (on disk). Gotta reserve, like, 2-3x the expected DP table size to keep things runnin’ smooth. And for those massive tables over 1TB? Yeah, you’ll need to split ’em across multiple files.Just like I did in my BSGS. But here’s the catch: If someone’s crazy enough to try solvin’ Puzzle 135, they’re gonna need thousands upon thousands of terabytes of storage. 
WTF are you talking about?
DPs do not need instant lookup. That is only needed for when you want to do billions of lookups in a row. I'm sure you must know this, so are you OK? DPs are pretty rare, and more over, their first usage is to always be stored, which automatically involves a lookup itself. Win-win.
Any actual database engine works just fine, and you don't need to bother with splitting files and you definitely don't need any bloom filters. That's why DBMS exist.
Personally I', using SQLite for this, but for consistency there's absolutely nothing wrong with going with a full-blown dedicated database server just for storing DPs, with included backup and redundancy.