Main Theorem (for CNF) [Feng,Guo,Y.,Zhang '20] For any sufficiently small 2-20,any (k,d)-CNF satisfying k≥201ogd+201ogk+31o 1 。Sampling algorithm: draw almost uniform SAT solution in time (d23+5) ·Counting algorithm: count SAT solutions approximately in time (d2k3n2+5)Main Theorem (for CNF) For any sufficiently small , any (k,d)-CNF satisfying • Sampling algorithm: draw almost uniform SAT solution in time • Counting algorithm: count # SAT solutions approximately in time ζ ≤ 2−20 k ≥ 20 log d + 20 log k + 3 log 1 ζ O ˜ (d2 k3 n1+ζ ) O ˜ (d2 k3 n2+ζ ) [Feng, Guo, Y., Zhang ’20]