Whytegod Protocol

Protocol Architecture

The Whytegod Protocol is a minimal, deterministic system designed to prove the existence of data at a specific time. It is intentionally simple to maximize trust, auditability, and long-term survivability.

Core Principles

• Immutability over convenience
• Verification over trust
• Minimalism over complexity
• Public proof over private storage

Protocol Layers

1. Hashing Layer — converts data into a fixed-length hash
2. Submission Layer — accepts hashes for anchoring
3. Anchoring Layer — orders hashes in time
4. Verification Layer — allows public proof

Hashing Layer

Users generate hashes locally using SHA-256. The protocol never receives raw content.

• Any file type supported
• Any size supported
• Same input always produces same hash

Submission Layer

Hashes are submitted to the protocol for anchoring. Submission may require a small WGD fee to prevent spam.

• No identity required
• No approval process
• No content inspection

Anchoring Layer

Anchoring commits hashes into a public, time-ordered structure. Once anchored, a record becomes permanent.

• Anchors are append-only
• Anchors cannot be rewritten
• Anchors define finality

Verification Layer

Verification is permissionless and free. Anyone can independently confirm a record.

1. Re-hash the original data
2. Locate the anchored hash
3. Confirm timestamp and order

Determinism

The protocol produces the same result for the same input regardless of who verifies it or when verification occurs.

There is no randomness, discretion, or interpretation.

Failure Resistance

• No single point of trust
• No dependency on private servers
• Records remain verifiable even if interfaces disappear

What the Protocol Does Not Do

• Does not store files
• Does not enforce contracts
• Does not judge truth or intent
• Does not resolve disputes