independent sets in hypergraphs can be encoded as 0-1 configurations on the set of vertices such that each hyperedge is adjacent to at least one 0. this model has been studied in the cs community for its large gap between efficient mcmc algorithms (previously $d <(k-1)/2$) and the conjectured onset of computational hardness ($d > o(2^{k/2})$ ), where $d$ is the largest degree of vertices and $k$ is the minimum size of hyperedges. in this talk we use a percolation approach to show that the glauber dynamics is rapid mixing for $d < o(2^{k/2}$), closing the gap up to a multiplicative constant.