Mir is a distributed ledger for decentralized applications. It uses cryptographic proofs to verify transactions, improving security and scalability. Byzantine fault tolerant (BFT) consensus algorithms allow blockchains to confirm transactions much more quickly than longest-chain systems like Bitcoin. We present a new partially synchronous BFT algorithm which achieves lower latency than existing solutions. Our algorithm takes fewer communication steps to terminate in certain cases, and under normal conditions, it transitions from one step to another based on observed messages rather than waiting for timeouts. In simulations, our algorithm was approximately 14% faster than the other ones we tested when configured with optimal timeout parameters. This gap widened when larger timeout parameters were used, since our algorithm rarely makes state transitions based on timeouts.