The paper presents the first chain-based BFT SMR protocols with a delay of δ between consecutive honest leader proposals and commit latencies of δ in the partially synchronous network model. The authors introduce three protocols, two of which implement pipelining, to achieve these goals under different notions of optimistic responsiveness. The protocols are designed to be reorg resilient and have short view lengths, properties lacking in many existing chain-based BFT SMR protocols. Evaluations show significant improvements in throughput and latency compared to the state-of-the-art Jolteon protocol in a wide-area network. The paper also demonstrates that techniques like vote-pipelining and designated vote-aggregators, commonly used to reduce communication complexity, can actually degrade performance in practical settings.The paper presents the first chain-based BFT SMR protocols with a delay of δ between consecutive honest leader proposals and commit latencies of δ in the partially synchronous network model. The authors introduce three protocols, two of which implement pipelining, to achieve these goals under different notions of optimistic responsiveness. The protocols are designed to be reorg resilient and have short view lengths, properties lacking in many existing chain-based BFT SMR protocols. Evaluations show significant improvements in throughput and latency compared to the state-of-the-art Jolteon protocol in a wide-area network. The paper also demonstrates that techniques like vote-pipelining and designated vote-aggregators, commonly used to reduce communication complexity, can actually degrade performance in practical settings.