Documentation

CompPoly.Univariate.NTT.KoalaBear

KoalaBear NTT Domains #

Concrete radix-2 NTT domains over the KoalaBear field.

source
def CompPoly.CPolynomial.NTT.KoalaBear.bitsOfLogN (logN : ℕ) (hlogN : logN ≤ KoalaBear.twoAdicity) :
Fin (KoalaBear.twoAdicity + 1)

Build a finite index into the KoalaBear two-adic generator table.

Instances For
    source
    def CompPoly.CPolynomial.NTT.KoalaBear.domainOfLogN (logN : ℕ) (hlogN : logN ≤ KoalaBear.twoAdicity) :
    Domain KoalaBear.Field

    KoalaBear radix-2 NTT domain for a supported two-adic size.

    Instances For
      source
      def CompPoly.CPolynomial.NTT.KoalaBear.bestDomainForLength? (requiredLen : ℕ) :
      Option (FittingDomain KoalaBear.Field requiredLen)

      KoalaBear NTT domain lookup for dynamic multiplication contexts.

      Instances For
        source
        def CompPoly.CPolynomial.NTT.KoalaBear.fastDomainOfLogN (logN : ℕ) (hlogN : logN ≤ KoalaBear.twoAdicity) :
        Domain KoalaBear.Fast.Field

        Fast KoalaBear radix-2 NTT domain for a supported two-adic size.

        Instances For
          source
          def CompPoly.CPolynomial.NTT.KoalaBear.fastBestDomainForLength? (requiredLen : ℕ) :
          Option (FittingDomain KoalaBear.Fast.Field requiredLen)

          Fast KoalaBear NTT domain lookup for dynamic multiplication contexts.

          Instances For