Binder runs on the the digital implementation of Creativ’s deterministic framework. Each acceptance decision is computed openly and time-stamped; the result is recorded in a compact, auditable ledger line. Verification requires no secrets — any party can confirm integrity by recomputing the same deterministic rule set.
Bind – A source document is analyzed by the CLE engine.
The result is a Proof-PDF and sidecar (.rpf.json) containing the deterministic envelope.
Record – A compact ledger entry captures structure, sequence, and timing.
Verify – Any party can upload the file(s) to the verifier and recompute authenticity without keys or trust.
Because Binder is structural, not cryptographic, proofs remain reproducible indefinitely and scale from a single document to national archives.
The public RPF Online Verifier now provides a complete, deterministic proof environment. Users can bind and verify directly in the browser, or confirm existing proofs through multiple paths:
Lookup by Proof-ID or sidecar reference
Verify a single bound file if created online
Verify a file with its .rpf.json sidecar
Bind a new document and instantly download the generated Proof-PDF, sidecar, and bound file
All operations are performed entirely in memory. Once the proof package is downloaded, all data are immediately flushed from the server. Only sidecars that contain no sensitive information are retained for public verification purposes.
This release completes the RPF Binder suite — bringing transparent, deterministic authenticity to everyone, directly from the browser.
Binder derives authenticity from deterministic acceptance, not encryption. Each file is analyzed by the Core-Lite Engine (CLE), which reconstructs timing and structure into a measurable acceptance frame. The result is a Proof-PDF and sidecar whose values can be recomputed directly from the document’s own physical relations — not from hidden keys or statistical models.
Every parameter in the envelope is deterministic and replayable: frequency, drift, and structural closure define whether a document passes or fails. Because the verification depends only on these invariant relations, anyone can re-compute them locally or through the Online Verifier and obtain an identical outcome.
This makes Binder fundamentally different from cryptographic trust systems: it produces authenticity as a physical invariant, not as a probabilistic signature. As a result, proofs remain valid indefinitely and reproducible across independent verifiers.
