fhelium.benchmarks.suite.primitives

Integer input construction and analytic oracles for complete RNS/NTT calls.

analytic_ntt_rows

function View source

def analytic_ntt_rows(config: CkksConfig, radix: int) -> tuple[torch.Tensor, torch.Tensor]: ...

Return $R{z}_k$ and $R{z}_k^2$ for the bit-reversed odd roots of each Q prime.

With $z_k={\psi }^{2\mathrm{br}(k)+1}$, these rows evaluate the monomials $X$ and $X^2$. Host integer multiplication constructs the oracle without invoking an NTT or a Montgomery kernel.

ntt_operands

function View source

def ntt_operands(moduli: tuple[int, ...], radix: int, linear: torch.Tensor, square: torch.Tensor, batch: int) -> tuple[torch.Tensor, torch.Tensor]: ...

Construct $a_b(X)=(b+1)+X-X^2$ and its analytic Montgomery NTT.

rns_operands

function View source

def rns_operands(moduli: tuple[int, ...], n: int, batch: int, radix: int, *, multiply: bool) -> tuple[torch.Tensor, torch.Tensor, torch.Tensor]: ...

Build dense full-width residue inputs with an integer closed-form result.

The fixed scale-50 suite primes and coefficients below $N+31B$ keep every oracle product inside signed int64. Montgomery multiplication uses stored coordinates $a=q-k$ and $b=tRmodq$, hence output $-ktmodq$.