Search…
⌃K

PoT Workflow

Under “soft voting,” a time elector collates the submitted event data, verifies the signature, and hashes it. It then performs a VDF computation, attaches the VDF proof to the hashed transaction, and broadcasts the result to the rest of the time nodes.
Under a “hard voting” process, the network generates a randomized consensus committee of 1,000 time nodes to confirm the submitted hash. The selected time nodes within the consensus committee then verifies the signature of the time elector, submitted hash, and VDF proof.
The VDF proof confirms that the transaction submitted by the time elector occurred after the current block height on the Timechain. A time node can either accept or reject the submitted transaction and publish its confirmation, which votes for the PoT consensus algorithm. If more than two-thirds of time nodes vote to accept the proposed block, the block gets appended to the Timechain.
Tesseract nodes can also fetch event data from external chains and submit it to the network. If this occurs, the network forms a randomized committee of 1,000 time nodes where each node can vote to accept or reject the fetched event data. If more than two-thirds of the time nodes vote to accept the fetched event data, the data gets appended to the Timechain for external subscribers to consume.
High level overview of the PoT process