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§
- Api
- Entry
- Each Entry contains three pieces of data. The
num_hashes
field is the number of hashes performed since the previous entry. Thehash
field is the result of hashinghash
from the previous entrynum_hashes
times. Thetransactions
field points to Transactions that took place shortly beforehash
was generated. - Entry
SigVerification State - Entry
Summary - Entry
Verification State - GpuSig
Verification Data - GpuVerification
Data - Verify
Recyclers
Enums§
- Device
SigVerification Data - Device
Verification Data - Entry
Type - Typed entry to distinguish between transaction and tick entries
- Entry
Verification Status
Traits§
Functions§
- api
- create_
random_ ticks - create_
ticks - hash_
transactions - init_
poh - next_
entry - Creates the next Tick or Transaction Entry
num_hashes
afterstart_hash
. - next_
entry_ mut - next_
hash - Creates the hash
num_hashes
afterstart_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. - next_
versioned_ entry - Creates the next Tick or Transaction Entry
num_hashes
afterstart_hash
. - start_
verify_ transactions - thread_
pool_ for_ tests - verify_
transactions