Documentation

A quick-reference guide to essential Geeq terminology and concepts.

Blockchain Fundamentals

Consensus Mechanism

A method by which network participants agree on the state of the blockchain. Geeq uses Proof of Honesty (PoH), which relies on binary validation criteria rather than computational work or stake-weighted voting.

Ledger

A distributed database that records all transactions across a network by consensus approval. Geeq requires each validator to build and maintain its own independently verifiable copy.

Smart Contract

Self-executing code stored on a blockchain. Geeq does not require smart contracts for most use cases — applications interact directly with the protocol layer for simpler, more secure integrations.

Hash Function

A cryptographic function that converts input data into a fixed-size output (hash). Used extensively in Geeq for transaction verification, block linking, and proof generation. Verification consists of hashing only — easy enough to run on a phone.

Geeq-Specific Terms

Proof of Honesty (PoH)

At Geeq, it appears there is consensus when multiple validators follow protocol correctly. Validation criteria are binary, providing efficient verification rather than energy-intensive mining or capital-intensive staking.

Layer 0

The foundational protocol layer that enables multiple independent blockchains to share ledgers of portable, per-transaction proofs.

Application Chain

A dedicated blockchain for a specific application or suite of applications, running the same protocol with customizable parameters, e.g. restrictions on metadata or a different block interval.

Good Behavior Bond (GBB)

A stake deposited by validators that is forfeited if dishonest behavior is detected. Creates accountability through automatic enforcement rather than trust.

Catastrophic Dissent Mechanism (CDM)

The protocol's enforcement mechanism — when dishonesty is cryptographically proven, the validator's bond is automatically forfeited.

Catastrophic Recovery Protocol (CRP)

A safety mechanism that enables the network to roll back to the last provably honest state if validation fails catastrophically.

Core Concepts Quick Links

Security Model

• Byzantine Fault Tolerance: Tolerates fully adversarial conditions; automatic fallback if complete network takeover.
• Finality: Transactions receive portable proofs after two blocks (validation and audit).
• Cryptographic Proof: Per-transaction, per-block, per-validator verification via hashing on a phone.

Performance Characteristics

• Block Time: Customizable per-chain, to support suites of similar applications.
• Throughput: 1,500+ TPS per chain with horizontal scaling across multiple chains.
• Energy Efficiency: Minimal computational requirements — no mining hardware needed.

Economic Model

• Staking Requirements: Audits triggered by protocol, stake confiscated if validators fail.
• Transaction Fees: Fixed, predictable per-transaction fees — no gas auctions.
• Validator Economics: Validators earn fees for honest service; dishonesty results in bond forfeiture.

Next Steps

• Proof of Honesty — Deep dive into the consensus mechanism
• Security Model — Threat analysis and defenses
• Validator Guide — How to participate as a validator

2 min read

Updated 2 months ago