Patent Explainer: Signed Semantic Triples (F-008)

What F-008 Does

F-008 describes a universal signed semantic relationship layer for digital infrastructure. The fundamental unit is a signed semantic triple: a subject (identified by content hash), a predicate (a human-readable relationship type like authored, replied-to, derived-from, depicts, or endorses), and an object (another content hash or literal value), all cryptographically signed by an asserter whose identity is bound to a $401 on-chain identity chain. Each triple is inscribed as a UTXO on a Bitcoin-protocol blockchain, making it persistent, immutable, and independently verifiable.

The invention addresses the absence of a machine-queryable layer of meaning in digital infrastructure. Today, the relationships between things — who authored a document, which files are versions of the same work, what a photograph depicts, whether a review is genuine — are trapped in private application databases. If the application ceases to operate, the content may survive but the meaning (who created it, what it relates to, how it was modified) does not.

F-008 solves this by making relationships first-class, signed, blockchain-persistent data. Critically, it introduces personal trust-weighted query resolution: when two users query "Who authored Document X?", they may receive different answers based on their own trust configurations. This is not a deficiency — it is the correct architecture for a world where people genuinely disagree about whose assertions are reliable.

The Problem It Solves

1. Meaning is trapped in application silos. The relationship between a document and its author is not expressed anywhere that a machine can independently find and verify. If you create a document in one application, annotate it in another, and share it via a third, you have created semantic relationships in three separate databases with no shared representation. If any of those applications shuts down, the relationships are lost.

2. No universal relationship primitive. Digital infrastructure provides primitives for storing data (files), transmitting data (network protocols), and identifying locations (URLs). It provides no primitive for expressing relationships between data. The statement "Document A was authored by Person B" has no standard representation that is simultaneously machine-readable, cryptographically signed, verifiable without contacting a server, queryable by any application, and persistent independent of any platform.

3. The Semantic Web failed for structural reasons. The W3C Semantic Web initiative (RDF, OWL, SPARQL) correctly identified that relationships should be first-class data expressed as triples. But it was built on URLs that rot (when the server goes offline, the identifier ceases to resolve), required centralised ontology agreement (which proved intractable in practice), and had no trust model (anyone could assert any triple with equal standing). The core insight was correct; the foundation was not.

4. Relationships cannot be verified. When a platform asserts that a user authored a piece of content, the assertion is backed only by the platform's authority. There is no cryptographic proof. The platform could fabricate, alter, or delete the assertion at any time.

5. No personal view of meaning. When relationships exist in platforms, they are presented through a single, platform-determined lens. Users cannot apply their own trust judgements to filter, weight, or evaluate relationships. The meaning layer is controlled by the platform, not the person.

How It Works

The Signed Triple

Each triple comprises a subject (a content-addressed identifier — typically a SHA-256 hash of the content), a predicate (a human-readable string from an open vocabulary), an object (another content-addressed identifier or a literal value), and an authorship block containing the asserter's public key (linked to a $401 identity chain), a cryptographic signature over the triple, and a timestamp. The triple is inscribed as a 1-satoshi UTXO on a Bitcoin-protocol blockchain.

Content-addressed identifiers for subjects and objects eliminate URL rot. A triple expressing "Document [hash-A] was authored by Identity [pubkey-B]" remains valid and resolvable regardless of whether any particular server is operational. The identifiers are mathematical facts, not location promises.

Open Predicate Vocabulary

Predicates are human-readable strings (authored, replied-to, derived-from, depicts, translates, endorses, version-of, member-of) drawn from an open vocabulary. No centralised authority controls the vocabulary. Any party may introduce new predicates. Interoperability emerges from convergence on common predicates through use, not from top-down standardisation.

The system includes a predicate aliasing mechanism whereby commonly used predicates can be registered on-chain with aliases, enabling different communities to map their preferred terminology to shared semantics without requiring agreement on a single canonical vocabulary.

Identity-Bound Authorship

Every triple is signed by its asserter using a private key linked to a $401 on-chain identity chain. This means: the asserter is identified (not anonymous), the assertion is cryptographically bound to a specific identity, the assertion cannot be forged (only the holder of the private key can produce a valid signature), and the assertion can be independently verified by anyone with access to the blockchain. Device-level key revocation (provided by the $401 protocol) enables revoking a compromised device's keys without invalidating the identity itself or the triples signed by non-compromised keys.

Personal Trust-Weighted Query Resolution

When a user or application queries the Semantic Layer (e.g., "Who authored Document X?" or "What documents does Person Y endorse?"), the query is resolved against the user's personal trust configuration. The trust configuration specifies:

• Which identities the user trusts
• About which predicates (trust can be scoped per-predicate)
• To what degree (a continuous value, not binary)
• With what decay over time (older assertions may carry less weight)
• Informed by transitive trust (trusting the trust judgements of trusted parties)

Different users querying the same triples may receive different results, because the query resolver weights and filters triples according to the querying user's trust configuration. Two people asking "Who authored this document?" may see different answers — reflecting their different assessments of which asserters are credible.

UTXO Inscription for Persistence and Spam Resistance

Each triple is inscribed as a 1-satoshi UTXO on the blockchain. This provides: persistence (the triple exists as long as the blockchain exists, independent of any server), immutability (once inscribed, the triple cannot be silently modified or deleted), economic spam resistance (inscribing a triple has a non-zero cost, preventing unlimited spam without requiring a centralised gatekeeper), and Merkle-provable existence (each triple has a Merkle proof linking it to a block header, enabling compact proof that the triple was inscribed at a specific time).

Live Implementation

The Signed Semantic Triples layer integrates with the existing $401 identity protocol and $402 commerce protocol, providing the meaning infrastructure that connects identity, content, and commerce.

• $401 Identity Protocol (authorship binding): path401.com
• $402 Commerce Protocol (content addressing): path402.com

Filed at UKIPO by The Bitcoin Corporation Ltd. Patent pending. Application reference F-008.