Intellectual Property

Summary

This summary was written with the assistance of AI and is based on the patent award, above. Please drop any questions or comments in our official Telegram group.

Geeq’s Patent and Protocol: What’s Protected, and What It Makes Possible

Section 1: What the Patent Protects
(Directly supported by patent claims and specification)

• Covers a complete, data-agnostic blockchain architecture built on deterministic transaction logic.
• Each transaction type has its own validation schema (coins, fungible tokens, NFTs, contracts, stackables), defined by protocol.
• All transactions are processed in the order received, validated before any block is written, and independently checked by every node.
• Invalid transactions are cryptographically blocked—validation is enforced, not assumed.
• Transactions are crowd-sourced: each node broadcasts candidate transactions and signs its own block view.
• No block leader, proposer, or sequencer—every node acts independently.
• Active node signatures enable transparency. Conflicts and equivocations are provable from the chain itself.
• Audits are triggered automatically in the next block when dishonest behavior is detected.
• Dishonest nodes are excluded based on observed protocol violations—not slashing or stake.
• Supports provable finality and Merkle proofs (~1 KB) for light clients and mobile verification.
• Transaction logic and signature blocks are separated.
• This allows selective upgrades (e.g., quantum resistance) without disrupting validation.
• Chains running the same protocol scale horizontally, maintaining lightweight, full ledgers. 
• Storage- and format-agnostic design makes the architecture adaptable across use cases.

Section 2: What the Protocol Enables
(Implications derived from the patented architecture)

• Decentralized correctness at the edge replaces global consensus. Every node applies validation rules without coordination, voting, or governance.
• The system operates securely even under extreme adversarial conditions—dishonesty is identifiable and punishable.
• No privileged roles. No special trust.
• Honest behavior is rational, not hopeful—protocol rewards and validation rules incentivize audits.
• Only one honest node is needed to verify integrity across the system.
• Users can independently confirm the validity and finality of transactions.
• With original data and Merkle roots, users don’t need active chain contact to verify inclusion.
• Chains can operate in parallel, scale without conflict, and define assets in consistent schemas.
• Business and app logic is layered outside the protocol, preserving minimalism and auditability.
• Built for real-world verification needs—including humans, agents, and devices—without trusting the network.

Geeq replaces trust with verifiable proof. It is a new category of infrastructure—secure, auditable, and ready for adversarial realities.

Section 3: Why It Solves a Blocker Identified 40 Years Ago

• The CAP Theorem shows it is impossible to simultaneously guarantee consistency, availability, and partition tolerance. Systems can only offer best-effort tradeoffs.
• Most blockchain protocols attempt global consensus, increasing their vulnerability to latency, network partition, and escalating costs.
• Geeq avoids consensus entirely. It defines correctness at the edge:
  • Each node validates every transaction before it commits a block.
  • Nodes process in receipt order (first-in, first-out) and independently update the ledger.
  • Validity is determined cryptographically—not by agreement.
• As a result:
  • A user can know whether a transaction is valid.
  • A user can know whether the ledger is final.
  • A user does not need to rely on a network majority.

For more information, see Section 2 of the Yellow Paper.