Skip to content

Ren

Ren is a lazy polynomial IR, scheduler, and runtime for RNS quotient-ring computation. User code works with Poly values or higher-level CKKS objects, while Ren builds a graph and only runs backend programs when a concrete result is needed.

Start with the CKKS pages for encrypted computation or the engine pages for Ren's execution model.

Ren's core polynomial object lives in a quotient ring such as \(R_q = \mathbb{Z}_q[X] / (X^n + 1)\). In CKKS paths, encoded plaintext and ciphertext polynomials use several RNS primes, and Ren tracks whether each polynomial is in coefficient or NTT representation.

Start here

  • Getting started creates a Ren project and runs the first CKKS, polynomial, and JIT examples.
  • Build a CKKS circuit walks through a reusable encrypted computation.
  • CKKS workflow is the main entry point for encoding values, encrypting them, running encrypted computations, and decoding results.
  • First polynomial graph covers creating a graph, inspecting it, and computing its coefficients.

Main topics

To work on Ren itself, see Contributing.