Skip to main content

$t$ Less than $n$ over Three

Definition

This mathematical expression indicates a condition where the number of malicious participants in a system is below a critical one-third threshold. In distributed computing and blockchain systems, this inequality frequently denotes a security requirement for Byzantine Fault Tolerant consensus algorithms. It signifies that if the quantity of dishonest nodes, represented by ‘t’, remains below one-third of the total network participants, ‘n’, the protocol can reliably maintain agreement and prevent system compromise. This condition is crucial for preserving data integrity and operational continuity within decentralized networks.