Consensus/proof_of_elapsed_time library
Proof of Elapsed Time (PoET) - trusted wait simulation
PoET relies on trusted execution to enforce randomized waiting periods. This compact simulation offers a deterministic 'wait lottery' that models selection by elapsed time without dependencies on TEEs. It is useful for protocol-level testing and simulation where a full TEE-backed stack is not available.
Contract:
- Input: node ids and an RNG seed to produce wait times
- Output: the node with the smallest elapsed wait (winner)
- Errors: throws on empty node list