Fast CPU Points Generation Library

No algorithm gives O(1) lookup for non-linear keys. A B-Tree can help speed things up, but you’ll still have log(n) performance.

Let’s say I have 60GB RAM and computed 2^30 points will lookups be O(1)? I have an algorithm that solves some puzzles faster, but I need instant lookups.

Nope, it won't be instant. You need a dictionary structure for lookups. With 2^30 keys, direct O(1) access needs way more space than you have.