Expand description
This module provides the data structures and functions for the Proof of History (PoH) algorithm. The PoH algorithm is a cryptographic primitive that allows for the generation of a verifiable and tamper-proof history of events. It is used in various blockchain systems to provide a secure and efficient way to order transactions and events in a distributed network.
Modules§
Structs§
- Appended
Data - Appended Data for the Proof of History (PoH) algorithm. This structure is used to store additional data that is appended to the PoH entries. The appended data can be used to include metadata or other information that is relevant to the PoH process.
- Event
Hash - Initial
Seed - Initial seed for the Proof of History (PoH) algorithm. This seed is used to initialize the PoH process and is typically derived from a known source of entropy, such as the system’s random number generator. The seed is a 64-byte array, which provides sufficient entropy for the PoH algorithm. The seed is used to generate the initial state of the PoH, which is then updated with each tick of the PoH clock. The seed is crucial for ensuring the security and unpredictability of the PoH process. It is important to keep the seed secret and secure, as it directly affects the integrity of the PoH output. The seed should be generated using a cryptographically secure random number generator to ensure that it is unpredictable and resistant to attacks.
- PoHConfig
- PoHEntry
- PoHUsage
- Proof of History (PoH) usage structure. This structure encapsulates the configuration and functionality of the Proof of History (PoH) algorithm. It provides methods for generating and verifying PoH entries, as well as for managing the PoH state.