Explainable declines
The decision, the signal and the transaction trace come from one layer, so an explanation does not require a second system’s logs.
- SQL
A payment is a state machine with a deadline — every step writes to one layer.
Where it starts
Authorisation and settlement records
Requests, responses, clearing files and settlement positions. It is the first of 4 workloads running in Payments.
The question it raises
Explainable declines
The decision, the signal and the transaction trace come from one layer, so an explanation does not require a second system’s logs.
Why one question is hard
From Initiate to Dispute
Payments data moves through 5 stages — Initiate → Authorise → Clear → Settle → Dispute. The shapes in play are SQL, Graph, Time series, JSON / documents, and answering one question means reading across all of them.
What PLOMID contributes
Payments are a consistency problem with a relationship problem inside it. These are the parts that hold both.
- Snapshot reads under continuous writes Readers and writers do not block each other, which is what makes a telemetry feed and an application share one system.
- One plan per request A request is planned once against the layer rather than per system, which is where cross-system glue usually accumulates.
- Relationships held as data Edges expressed directly remove the reconstruction that happens at query time when relationships live in a join.