Skip to content
#

modular-polynomials

Here are 3 public repositories matching this topic...

Language: All
Filter by language

Elliptic curve 2-cycle realize pipeline: constructs CM-method curve pairs over p = 2^255-19 for recursive proof composition (IVC/SNARK/FCMP++). Finds polynomial roots over finite fields, converts class invariants to j-invariants, and emits short Weierstrass parameters with twist security analysis

  • Updated Apr 13, 2026
  • C++

Browser-based isogeny graph demo — the seven open problems, eprint 2026/1431. Compute a real supersingular graph over GF(431²) from the modular polynomials, walk a path between two curves, then see each open problem drawn as a path, cycle, or endomorphism. Real field arithmetic. No backend.

  • Updated Aug 2, 2026
  • TypeScript

Improve this page

Add a description, image, and links to the modular-polynomials topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

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

Learn more