Design a Byzantine Fault Tolerant (BFT) consensus algorithm tailored for a low-latency, high-frequency trading network involving 100 nodes. Your design must prioritize speed and finality over strict energy efficiency. Explain how you would handle leader election, view changes, and network partitions. Additionally, analyze the trade-offs between safety and liveness in your proposed solution during a partition event, and provide pseudocode for the message-passing structure of a single consensus round.