Consensus protocols in distributed ledger and blockchain technology form the foundation for validating transactions and upholding network integrity and security. While diverse, these protocols share common traits such as decentralization, security measures against fraud, and scalability considerations, albeit to varying degrees. Nonetheless, they also harbor limitations, presenting trade-offs between efficiency, security, decentralization, and environmental impact. Addressing this challenge, we introduce a novel consensus protocol, Proof-of-Randomness (PoR), leveraging information-theoretic secure multiparty computation in this short research paper. The proposed PoR seeks to cultivate a more inclusive consensus by securing the random assignment of the leader role, consequently lessening the need for specialized hardware or the need for peer-specific characteristics, enabling decentralized, easily verifiable block endorsement. A preliminary proof-of-concept implementation underscores the feasibility and efficiency of our proposed protocol.