Skip to content
mindpeeker-sdk
@mindpeeker/vdfIntegrity & time

VDF

Verifiable delay functions over RSA-2048 in the signed quadratic residues — Pietrzak and Wesolowski proofs, checkpoints and beacon seals.

Computing y = |x^(2^T)| mod n takes T sequential squarings that no amount of parallelism can shortcut, yet anyone can check the answer in O(log T) — a proof that time passed. This page runs the whole thing in a Web Worker: both proof systems side by side, the negated-output forgery that 0.2.0 closed, the modulus policy, a sealed beacon pulse broken four ways, and the calibration that turns T into seconds. A seal is a no-earlier-than bound, never a no-later-than one.
README Research § 7 Recipe 2

Loading the demo — every computation runs in your browser.

mindpeeker-sdk v0.2.0 MIT

Fifteen packages at 0.2.0. Every demo runs client-side, in your browser. The mathematics is asserted; the contested hypotheses — psi, radionics, the meaning of a divination draw, sidereal-time effects — are stated as hypotheses, and no result here is evidence that any of them is real.