Patent Claim Extractor Irreducible Triangle Method

Reduce each system to three primitives + one governing interaction. The interaction is the invention. Everything else is dependent claims.

Families

Primitives

250

Math Signatures

Shared Prims

Kronos Pillars

New Filings

§1 The Method

Irreducible Triangle — Claim Architecture

Every foundational computing patent reduces to 3–4 primitives whose interaction rule defines the technology. The primitives themselves are often known — the novelty is the relationship between them.

Primitive A ←→ Primitive B        PageRank:  nodes + links + ranking
     \          /                 RSA:       message + encryption + decryption
      Primitive C                 TCP/IP:    packet + routing + acknowledgement
           ↓                      Blockchain: tx + block + consensus
    f(A, B, C) → outcome          Sov:       identity + coherence + governance

The independent claim protects f(A, B, C) → outcome. Dependent claims add variations, then implementation details. Three primitives give you: representation, transformation, outcome.

Extracted Triangles

Shared Primitives

Kronos Full Tree

SAGE Full Tree

DNA / N-Helix Tree

Logos Full Tree

Coverage Map

Math Signatures

PE — Exports

§2 Extracted Irreducible Triangles

Each patent family reduced to its core trinity. The governing interaction (italic) is the independent claim.

All 18 patent families as irreducible triangles — hover for details. Shared primitives shown as connecting lines.

Filed

Logos

Narrative-Anchor Identity Authentication

P1 Identity vector — narrative embedding of user
P2 Coherence function — cosine similarity to stored identity
P3 Authorization state — approve / deny / escalate / delay

f: Coherence score between live input and stored identity vector determines authorization state transition.

7 Pillars

Kronos

Governance-Native Temporal Encoding

P1 Temporal vector — 8D Fourier encoding of time
P2 Decay function — exponential half-life trust erosion
P3 Governance gate — threshold-based state transition

f: Decay function modulates temporal vector's authority weight; governance gate triggers state change when decayed trust crosses threshold.

Filed

SAGE / Semantic Firewall

Dual-Anchor Semantic Authorization

P1 Semantic anchor pair — source + anti reference embeddings
P2 Distance metric — L2 (relevance) + cosine delta (alignment)
P3 Hysteresis gate — Schmitt trigger with 4 auth states

f: Dual-distance evaluation against anchor pair drives Schmitt trigger state machine; delta < 0 triggers instant kill.

In Code

DNA / N-Helix

Content-to-Geometry Encoding

P1 Content encoding — V1 cylindrical helix (lossless)
P2 Shape tensor — 12D geometric fingerprint
P3 Motif classifier — nearest-neighbor in shape space

f: Content becomes geometry through helical encoding; geometry enables classification through 12D tensor comparison in motif space.

Filed

Wisp

Multi-Modal Identity Primitive

P1 Modal vectors — narrative, physical, temporal, role, location
P2 Fusion function — multi-modal vector composition
P3 Governed memory graph — storage with trust metadata

f: Modal vectors fuse into composite identity object; object persists in governed memory with decay and access control.

Filed

Guardian Stones

Integrated Semantic Security Layer

P1 Semantic signal — real-time multi-modal data stream
P2 Drift detection — deviation from identity baseline
P3 Governance action — firewall / escalate / deny / audit

f: Signal deviation from baseline triggers proportional governance response through layered stone architecture.

Filed

Rita

Role Inference & Ontological Positioning

P1 Verified identity vector — from Logos authentication
P2 Ontology map — semantic role definitions and permissions
P3 Role assignment — dynamic permission grant

f: Identity vector is matched against ontology map via semantic similarity; closest role is assigned with context-weighted permissions.

Filed

Mirror

Semantic Memory Capture

P1 Multi-modal input — local device capture
P2 Semantic transformation — input to memory vector
P3 Identity alignment — system adapts to user

f: Multi-modal capture transforms to semantic memory; memory aligns system behavior to the user's persistent identity.

Filed

Hermes

Semantic Intent Orchestration

P1 Parsed intent — semantic representation of user request
P2 Action ontology — available operations and their constraints
P3 Governed routing — constitutional constraint enforcement

f: Intent is matched against action ontology; routing to execution is gated by constitutional constraints before dispatch.

Filed

Sophia

Local Governance Execution Container

P1 Isolation boundary — air-gapped execution environment
P2 Governance engine — local policy enforcement
P3 Provenance replay — audit trail reconstruction

f: Isolated container enforces governance locally; all operations produce provenance records enabling full replay.

Filed

Orion

Governance-Aware Compression

P1 Multi-modal Wisp — composite identity object
P2 Compression function — coherence-preserving quantization
P3 Rehydration function — governed reconstruction

f: Compression preserves semantic coherence and governance metadata; rehydration reconstructs full Wisp with trust verification.

Filed

Nova

Aligned Semantic Instantiation

P1 Declarative intent — role/agent/procedure specification
P2 Layered validation — ethics, coherence, role, reflection
P3 Instantiated entity — governed runtime object

f: Declaration passes through four validation layers; only coherent, ethical, role-authorized intents instantiate to live entities.

Filed

Providence

Constitutional Oversight

P1 Value embeddings — human values as vectors
P2 Behavioral coherence — real-time action evaluation
P3 Override authority — constitutional constraint enforcement

f: Actions are evaluated against value embeddings; behavioral incoherence triggers constitutional override before execution.

Filed

Loom

Semantic Relationship Discovery

P1 Wisp graph — semantic memory lattice
P2 Relationship inference — automatic edge discovery
P3 Governance validation — trust-gated connection approval

f: Inferred relationships between Wisps are validated by governance before becoming persistent edges in the memory graph.

Filed

Scribe

Multi-Modal Wisp Composition

P1 Multi-modal input streams — text, voice, biometric, spatial
P2 Transformer fusion — cross-attention composition
P3 Coherent Wisp — fused identity representation

f: Cross-attention mechanism fuses disparate modalities into single coherent identity object preserving inter-modal relationships.

Gap

Shadow

Append-Only Audit Ledger

P1 Governance event — any system action producing audit
P2 Merkle chain — hash-linked immutable record
P3 Verification proof — cryptographic integrity attestation

f: Every governance event appends to Merkle chain; any record is verifiable via cryptographic proof without exposing chain contents.

Gap

Metronome

Temporal Spine & Tick Engine

P1 Atomic tick — 100ms frame broadcast
P2 TimeState — spiral coord + decay factor + baseline
P3 Freshness score — composite age + recency metric

f: Atomic tick broadcasts TimeState to all subsystems; freshness score weights creation age and access recency for governance decisions.

Gap

Canon

Dual-Tier Vector Memory

P1 Quantized vector — i8 compressed embedding
P2 Dual-tier manifold — Neocortex (HNSW) + Hippocampus
P3 Governance mask — tenant-level access control

f: Vectors compress to i8 for fast search across dual-tier manifold; governance masks enforce tenant isolation on all queries.

§3 Shared Primitive Map

Primitives that appear in multiple patent families create connective tissue across the portfolio.

Primitive	Appears In	Role	Cross-Claim Potential
Identity Vector	logos, wisp, rita, mirror, hermes, loom, scribe	Semantic representation of user identity	Core primitive — anchors 7 families
Coherence Function	logos, sage, guardian_stones, providence, kronos	Similarity measurement between vectors	The universal evaluation mechanism
Governance Gate	sage, kronos, rita, hermes, loom, sophia, nova	Threshold-based state transition	The universal enforcement mechanism

Shared primitive graph — node size = number of families using it, edges = co-occurrence in same family

§4 Kronos — Full Claim Tree

The Kronos section includes the full 10-pillar structure and expanded dependent claims from your source.

Pillar 1 — Wisp as Temporal Data Primitive

1. A computer-implemented method for constructing a composite identity object using multi-modal vectors including temporal embeddings.

1a. Temporal vector uses 8-dimensional Fourier encoding for day/week/year periodicities.

1b. Temporal vector includes epoch normalization and bias term.

1c. Identity object is subject to configurable half-life decay.

§4b SAGE — Full Claim Tree

Dual-anchor geometric authorization, Schmitt-trigger hysteresis, pluggable trust modules, and governance chain coverage.

Source	Independent	Dependent	Status
SAGE provisional (filed)	5 (vague)	0	Filed — weak claims
Codebase innovations	+4	+12	Implemented — incomplete IP coverage
Full tree	9	22	Target comprehensive provisional

§4c DNA / N-Helix — Full Claim Tree

CRITICAL GAP — No filing exists. Full content-to-geometry encoding, 12D shape tensor, and motif classification coverage.

§4d Logos — Full Claim Tree (Filed Non-Provisional)

BENCHMARK FILING — Non-provisional utility patent filed. Three independent claims with eleven dependents.

§5 IP Coverage Map

Family	Filing Status	Claim Strength	Gap
Logos	Non-provisional filed	Strong	None critical
Kronos	1 thin provisional	Weak	Critical
DNA / N-Helix	Provisional ready	Strong	File immediately

§6 Formal Math Signature Registry

250 formally documented signatures across 7 registries mapped to claim families.

Registry	File	Signatures	Key Domains
sovOS Core	`mathematical_formulas.md`	127+	Temporal, Cryptographic, Geometric, Identity, Governance
Project Scribe	`project_scribe_math.md`	24	Helical Encoding, Shape Tensor, Manifold
Genesis Manifold	`m_eco_genesis_manifold_math.md`	7	Corpus Extraction, Embedding

§7 Patent Document Exports

Generate and download full provisional documents from extracted claim trees.

Generated

Pending

Kronos Claims

Dependents

✓

Kronos — Comprehensive Provisional

10 independent claims · 29 dependents · 10 figure descriptions · math signature registry

Governance-native temporal encoding with full 10-pillar claim architecture.

Kronos_Provisional_Patent.md — 611 lines · 31 KB

View Download .md

◎

Logos — Non-Provisional Reference

3 independent claims · 11 dependents · FILED — benchmark format

System/method/medium trifecta. Cross-family root of patent tree.

Sov Research · Patent Infrastructure · Method v1.0