KLOOM
Book a demo
PLATFORM
Morphic Identity EngineImmutable Evidence APIPoint-in-Time InvestigationsAgent Identity Layer
SOLUTIONS — BY INDUSTRY
National Security & IntelFinancial Intelligence & BankingCrypto & Web3 Compliance
BY MISSION
Sanctions & SDN ScreeningAdverse Media MonitoringOSINT Subject ResolutionContinuous Due Diligence & KYC
COMPANY
CareersContact
Book a demo
Platform/Morphic Identity Engine
Platform

Identity that never overwrites history.

Entities and relationships are probabilistic clusters over a permanent mention graph. New evidence reshapes boundaries — never the past. Splits, merges, and predicate revisions are recomposition events, not data mutations.

Book a technical walkthrough
architecture · Morphic Identity Engine · v2
01 evidence
Andrey Volkov · doc_4821 Андрей Волков · doc_2203 A. Volkov · doc_9901
append-only · timestamped · original script preserved
02 mention graph
3 nodes phonetic: 0.91 shared attrs: 3
weighted edges · confidence-propagating
03 cluster
ent_4821 PERSON coherence: 0.87 · certainty: 0.82
probabilistic boundary · blocking_evidence: null
04 curated
Andrey Volkov nationality: RU reviewed: 2026-05-14
reviewer-approved · audit-logged · replayable
mentions
3
cluster version
v3
prior states
2
01 · Where incumbent systems fail

Reconciliation destroys data.
Resolution should not.

Three failure modes that compound silently in traditional identity infrastructure.

01

Destructive reconciliation

When an identity system merges two records, the pre-merge state is gone. The original evidence basis that justified keeping them separate is overwritten. Re-running an old query does not give you the old answer — it gives you whatever the current graph says.

entity_id: "ent_9012" // prior_record: null
02

Binary cluster boundaries

Most systems force a decision at the cluster boundary: match or no-match. Evidence that falls below the threshold is discarded, not preserved as underdetermined. The result is a confidence interval collapsed to a boolean — with no record of what was sacrificed.

score: 0.72 // threshold: 0.75 // action: discard
03

Silent conflict reconciliation

Contradictory attributes — two dates of birth, conflicting nationalities, incompatible relationship edges — are resolved by winner-takes-all. The losing evidence disappears without a trace. Reviewers see only the winner and cannot interrogate what disagreed.

dob: "1971-04-02" // conflict: silently_resolved
02 · What the engine provides

Permanent graph.
Probabilistic clusters.

Non-destructive splits and merges

A merge is a recomposition event over the permanent mention graph — not a data mutation. The pre-merge cluster boundary remains addressable at any prior graph version. A split redraws the boundary without touching the underlying mentions. Both operations are fully replayable.

recomposable append-only graph prior state addressable

Probabilistic cluster decisions

Cluster decisions return structured uncertainty on two independent axes: coherence (is there disqualifying evidence?) and certainty (is there enough qualifying evidence?). Blocking evidence and resolving attributes are fields in the response — not threshold knobs to tune blindly.

coherence axis certainty axis underdetermined state preserved

Typed conflict resolution

Conflicting evidence is typed and preserved, not silently reconciled. When two sources disagree on an attribute, both are retained with full provenance. The conflict surface is visible in the API response — reviewers see what disagreed and why, not just the current winner.

conflict typed both values retained provenance intact

Uniform attribute and relationship handling

The same engine handles attributes and relationships without a separate codepath for "who is X" versus "what does X do." Relationship evidence feeds identity resolution directly — so a director edge can narrow or widen a cluster boundary the same way a name match does.

attributes + relationships single engine cross-feeds evidence
03 · Merge event model

Yesterday’s entity is still there.

When new evidence bridges two clusters, the engine reshapes the boundary as a recomposition event — not a data mutation. The pre-merge cluster versions remain addressable through the append-only evidence layer. Pin a session to T₀ and the old clusters resolve exactly as they did before the merge.

This is what makes investigations replayable, audits defensible, and agentic pipelines safe to act on: the answer Kloom returns is grounded in an evidence record that no subsequent operation can retroactively alter.

differentiation

“Most identity systems destroy data when they reconcile. Kloom does not — and that is what makes investigations replayable.”

April 12 · two separate clusters
ent_2201 · PERSON
Andrey Volkov
3 mentions
ent_3304 · ORG
Lumen Reserve LLC
2 mentions
bridging evidence · doc_1182 · append
"Volkov, Director — Lumen Reserve"
org_affiliation → 0.88 · prior mentions: not overwritten
May 14 · merged cluster
ent_4821 · cluster_version: v3 · mentions: 5
ent_2201 · addressable
Andrey Volkov
ent_3304 · addressable
Lumen Reserve LLC
prior states: 2 · no data overwritten · both still resolvable
Platform

Relevant platform capabilities

Immutable Evidence API

The append-only substrate the cluster layer operates over. Every mention, attribute, and relationship — permanently addressable. Blocking evidence and resolving attributes returned inline.

Read the page

Point-in-Time Investigations

Deterministic session pinning over the permanent graph. Pin an investigation to a graph version and it resolves identically against the same evidence basis weeks or months later.

Read the page

Agent Identity Layer

The structured uncertainty surface the cluster layer produces — coherence, certainty, blocking evidence — shaped as a tool-callable API surface for agentic compliance and investigative pipelines.

Read the page
Ready when you are

Book a technical walkthrough.

Thirty minutes with engineering. We walk the cluster layer live, show a merge event with prior-state recall, and demonstrate how the evidence record survives any subsequent operation on the graph.

Book a demo