Then, just like in the standard beam search approach, we prune all explored new hypotheses and continue with the pruned set of B many hypotheses.
for a cipher of length N we only explore N • B • (B LM + B lex ) many hypotheses.