Expand description
The entry module is a fundamental building block of Proof of History. It contains a
unique ID that is the hash of the Entry before it, plus the hash of the
transactions within it. Entries cannot be reordered, and its field num_hashes
represents an approximate amount of time since the last Entry was created.
Structs§
- Each Entry contains three pieces of data. Thenum_hashesfield is the number of hashes performed since the previous entry. Thehashfield is the result of hashinghashfrom the previous entrynum_hashestimes. Thetransactionsfield points to Transactions that took place shortly beforehashwas generated.
Enums§
- Typed entry to distinguish between transaction and tick entries
Traits§
Functions§
- Creates the next Tick or Transaction Entrynum_hashesafterstart_hash.
- Creates the hashnum_hashesafterstart_hash. If the transaction contains a signature, the final hash will be a hash of both the previous ID and the signature. If num_hashes is zero and there’s no transaction data, start_hash is returned.
- Creates the next Tick or Transaction Entrynum_hashesafterstart_hash.