DPoH Consensus
The industry's first cryptographically verifiable decentralized clock.
The Problem of Time
In traditional decentralized systems like Bitcoin or Ethereum, nodes do not share a common clock. They must rely on timestamps in blocks, which are easily manipulated or delayed by network latency.
The Trilemma Bottleneck
Without a synchronized source of time, validators must wait for block propagation before they can decide on the next leading node. This communication overhead is the primary reason legacy chains struggle with throughput.
DPoH Architecture
The Validator Clock
Every Kortana validator runs a recursive SHA-256 loop that produces a sequence of hashes representing the passage of time.
Data Anchoring
Transactions are 'woven' into this sequence. This proves that a transaction occurred at a specific point in time relative to others.
Protocol Sequence Loop
Verifiable Delay Functions
Kortana's DPoH uses a specific type of VDF. While the hash sequence must be produced **sequentially**, it can be **verified in parallel**.
fn verify_sequence(start: Hash, count: u64, end: Hash) -> bool {
let mut current = start;
for _ in 0..count {
current = sha256(current);
}
current == end
}Byzantine Finality
Combined with DPoH, Kortana uses a Tower BFT implementation. This provides **Optimistic Confirmation** in 400ms and **Deterministic Finality** in 1.8 seconds.