-
Hi, I find crc16 algorithms has many other polynomials.
In helper.py, crc16 function is:
"
def crc16(string, value=0):
"""
CRC-16 poly: p(x) = x**16 + x**15 + x**2 + 1
"""
crc16_table…
-
Method `StandardComposer::add_blinding_factors` uses 4 random scalars to blind wire polynomials `w_l` and `w_r` and the permutation polynomial `z_poly` polynomial. Also notice that blinding factors of…
krnak updated
11 months ago
-
Finite field methods are frequently used in many areas of theoretical physics. In particular "multivariate rational functions over the integers mod n" would be a useful addition to flint. Is there an …
-
Hi!
When using Measurement types, Polynomials plays nicely with Measurements.jl until the polynomials get large enough / complicated enough in fitting that Vandermonde is used. Is there any way to…
-
A lot of conflicts:
```
sage: S. = QQ[]
sage: from itertools import product
sage: values = [S(t) for t in product((0,1/2,1,2), repeat=5)]
sage: len(set(map(hash,values)))
565
sage: len(values)
1024…
-
Two polynomial numbers represented by a linked list. Write a function , that add these lists i.e. add the coefficients who have same variable powers. It is Expected to Write entire workable solution …
-
It seems that the exponentiation of polynomials (in Poly form or as Expr) could be improved by using a recursive calculation (see [presentation of J.C.P. Miller's algorithm](https://www.researchgate.n…
-
With v4.0.0:
```julia-repl
julia> using Test, Polynomials
julia> p = ImmutablePolynomial((1,))
ImmutablePolynomial(1)
julia> q = Polynomial([10, 20])
Polynomial(10 + 20*x)
julia> @inferre…
-
@CheukHinHoJerry -- I think before we can get rid of ACE1 and ACE1x we may want to implement at least the 2B purification in the new implementation. Do you have any thoughts on that? Can we both thin…
-