Skip to content
#

wesolowski

Here are 4 public repositories matching this topic...

Language: All
Filter by language

Browser-based Verifiable Delay Function — repeated modular squaring (y = x^(2^T) mod N) in an RSA group with a Wesolowski short proof. Watch sequential work accrue one squaring at a time, confirm parallel workers don't speed it up, then verify the proof instantly and reveal the trapdoor that collapses the delay.

  • Updated Aug 27, 2026
  • TypeScript

Add this topic to your repo

To associate your repository with the wesolowski topic, visit your repo's landing page and select "manage topics."

Learn more