A Scalable Approximate Model Counter — mentioned by zero_k

Tue, 18 Feb 2025 19:26:16 GMT

But you forgot! It's also a 3-wise independent linear hashing function! Which means it can be used for probabilistically approximately uniform sampling and counting of solutions to boolean functions. This is super-duper useful. We use it to build counters that give probabilistic, but proven, counts. I explained the idea here in more understandable terms [1]. Basically, it halves the solution space approximately correctly each time. So you keep on adding them, until you have say, 10 solutions. Then you multiply the 10 with 2^k, where k is the number of XORs you added. That's it! So cool, no?…

Paper and discussion history. A mention is not an endorsement.

A Scalable Approximate Model Counter · HackerPapers discussions

A Scalable Approximate Model Counter — mentioned by zero_k