Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of hypergraph burning that uses an alternative propagation rule for how the fire spreads - if some fixed proportion of vertices are on fire in a hyperedge, then in the next round the entire hyperedge catches fire. This new variant has more potential for applications than the original model, and it is similarly viable for obtaining deep theoretical results. We obtain bounds which apply to general hypergraphs, and introduce the concept of the burning distribution, which describes how the model changes as the proportion ranges over (0,1). We also obtain computational results which suggest there is a strong correlation between the automorphism group order and the lazy burning number of a balanced incomplete block design.