Model counting is a fundamental problem in automated reasoning and theoretical computer science focused on determining the number of satisfying assignments (models) for a given logical formula. This computationally challenging (#P-complete) problem is central to various applications and motivates research into efficient exact and approximate algorithms, including methods offering probabilistic guarantees on the count.