Coordinative Transactional Processing (CTP)
A patented approach that protects data by fragmenting it and separating responsibility across three independent modules.
No single location contains the original data — reassembly happens only during a controlled restoral using a restoration-only key.
- Fragmentation: Module A splits pieces so no module holds the whole.
- Codesets: Transactional transport is validated with fresh codes (7 codes per transaction).
- Restoral-only A Code: The A Code is the only link back to the original data — used only during controlled restoration.
Covered by U.S. Patent
9,405,927 · $5,000 Unanswered Breach Challenge
How CTP Works — simplified walkthrough
- Module A (Access): fragments data, encrypts the B portion with keys only A holds, and sends to B.
- Module B (Base): stores the encrypted B portion, generates dynamic linking codes, and syncs with C.
- Module C (Control): holds linking keys (including the A Code) and validates via codeset exchange.
- Verification chain: A ↔ B ↔ C with codesets; B returns BOK, C returns COK — ensuring sync at every step.
- Restoral: full data is only reassembled in a controlled restore when A+B are combined under C’s keys and the A Code.
Fragmented Data Protection — why separation matters
CTP’s core advantage is physical and logical separation. Each protected item is split and distributed:
Module A — Access
Fragments, keeps the A portion, encrypts the B portion, initiates transaction.
Module B — Base
Stores encrypted B portion, generates dynamic linking codes.
Module C — Control
Holds linking keys (including A Code), coordinates validation.
Fragmented Security
No single module contains usable data; breaches yield nothing reconstructable.
Key Benefits
- True compartmentalization: data split across modules eliminates centralized risk.
- Transport validation: rolling codesets ensure exchanges are synchronized and verifiable.
- Controlled restoration: A Code is the sole path to reassembly, only in explicit, auditable restores.
- Reduced attack surface: breaching A, B, or C alone yields nothing useful.
Why this design is unique (and genius):
🔐 No single module can compromise the whole. A handles fragmentation, B storage, C validation.
🔑 The A Code as the only path back to originals — invisible to B — makes breaches useless.
🔄 Rolling codesets add dynamism, unpredictability, and real-time validation.
🧩 Restoration-only dependency keeps operations efficient while ensuring practical unhackability.
