-
https://github.com/lurk-lab/solidity-verifier/pull/51 adds IPA verification over Grumpkin. Successful verification is tested using polynomial with 2 variables. It is rather interesting and useful to t…
-
The introduction of the convenience macro @variable a few months ago was somewhat inconvenient for me since it clashes with the same macro in JuMP, resulting in `WARNING: both Polynomials and JuMP exp…
-
*This issue has been tagged for a bounty during [unitaryHACK](https://unitaryfund.github.io/unitaryhack/participating-projects.html)*
Currently all calculations of [multidimensional hermite polynom…
-
Currently Cryptol has built-in polynomial arithmetic functions like pmult, pmod, and pdiv. However, pmult is restricted to polynomials with Bit coefficients. It would nice if Cryptol supported _optimi…
-
Hey Justin, just had a chat with @kburns on spin-weighted spherical harmonics, which
1) remove the cos scaling when calculating gradients (convenience and simplicity)
2) simplify meridional gradi…
-
At the moment just the Chebyshev polynomials are symbolic. Missing are `hermite`, `laguerre`, `legendreP`, `legendreQ`, `ultraspherical` (=`gegenbauer`), and, while the Stirling and Euler polynomial…
-
@MikaelSlevinsky Is there a routine for pointwise evaluation for these bases?
CC @tsgut
-
```
I'm logging this here as this seems to be a mpmath problem. The polynomial
'f' defined below is of order 2, and so it does not contain the 3rd
Chebyshev polynomial of the first kind: taking the sc…
-
## Motivation
It seems in the recryption procedure, the conversion time from coefficient format to DoubleCRT is quite large. I hope to reduce the number of necessary plaintext polynomials, especially…
-
From a user on slack, I am just the messenger.
```
julia> R, (x,y) = polynomial_ring(GF(2), ["x","y"]);
julia> A, _ = quo(R, ideal(R, [x^2+1, y^2+1]));
julia> F = free_module(A,2);
julia> …