We present EBFT, an egalitarian framework of BFT consensus for permissioned blockchains. The key innovation in EBFT is egalitarian block generation: instead of relying on a fixed leader, nodes randomly and non-interactively propose blocks, which makes the system resilient to attacks targeting the leader. By combining the longest-chain rule from Nakamoto consensus with quorum voting from classical BFT, EBFT achieves deterministic safety with a design as simple as Nakamoto consensus. To demonstrate its practicality, we build three protocols: EBFT-SYN for synchronous networks, EBFTPSYN for partially synchronous networks, and EBFT-TURBO, a variant that incorporates Bitcoin-NG style decoupling to demonstrate the framework's extensibility towards high performance. We implement EBFT atop the Go version of Bitcoin, btcd. We implemented EBFT-SYN, EBFT-PSYN and EBFT-TURBO in about 920 LoCs in total. This indicates that EBFT can be built on top of existing blockchains with relatively little effort. We evaluate these protocols on EC2 instances with up to 256 nodes. Our evaluation shows that EBFT-SYN (resp. EBFT-PSYN) achieves a latency of 6 (resp 1) seconds. EBFT-TURBO can process up to 3.2k transactions per second and has a latency of 8 seconds.