Quote from: kTimesG on May 15, 2025, 07:52:24 AM

Quote from: farou9 on May 14, 2025, 09:30:08 PM

"not enough RAM in the Universe" , how much can we store in 8,16,32,64GB RAM ?

2,3 , BOTH needs to process the Db before entering lookup phase, right ?

I gave you all the calculations according to storing / querying 2**30 X coords and their scalars. Simply adjust the calculations if you want more or less points.

IDK what more you're asking for. Depending on how many points you'd like to store and lookup, you pick the right strategy. There is no magic fastest solution. You need to factor for how much you can fit in RAM, how much you read from the disk, and how many operations need to be performed.

For example, if you want to store 1 trillion points, and if you can fit a bloom filter for them in RAM, you'll need 128 GB of RAM and ~ 40 TB disk storage, just to build the lookup table. Then you can brag about having hundreds of zettakeys/second speed for solving Puzzle 80. Not sure you really grasp the physical limitations though...

It seems you think i have the delusion that even a 2*40 Db can solve 135 in reasonable time 😂.

It's just that i have an idea ,it uses db lookup but its not like bsgs it looks random but it's not ,and it works but it's unpredictable.

My main question is what dB is possible for us to make instant lookup!!