-
Pollard's Rho Algorithm is a very interesting and quite accessible algorithm for factoring numbers. It is not the fastest algorithm by far but in practice it outperforms trial
division by many orders…
-
Reported to Paul Zimmermann by his colleague Pierrick Gaudry.
In [SageMath](../wiki/SageMath) version 9.0 (but also 9.2) this takes ages:
```
sage: p = 135066410865995223349603927
sage: Fp6 = GF(p…
-
-
## 💥 Proposal
I think there are some FFTs in the Marlin prover that can be removed (almost) for free. Namely:
- In the sumcheck inside the third round of the Marlin prover, we need to [compute](…
-
Currently `multiplicative_generator` is a method defined on FFTField. We should instead move this to Field, since all fields have a multiplicative generator, not just FFTField's. (Furthermore, there a…
-
```
In [1]: factor(987)
Out[1]: 987
In [2]: factor(S(987)/4)
Out[2]: 987/4
```
Is there a reason for this? I know there is the specialized `factorint`. It would be convenient to have it all in one c…
-
I'm not sure if this is really a bug or not, as I'm a little unclear on what `horner` is supposed to do on multivariate polynomials. Take this example, taken from https://stackoverflow.com/questions/3…
-
The following gives an error:
```
sage: R0. = GF(2)[]
sage: k1 = GF(2).extension(z^2+z+1, 'z1')
sage: R1. = k1[]
sage: k2 = k1.extension(z^2+z+k1.gen(), 'z2')
sage: k2
Univariate Quotient Polyn…
-
I pulled this as the key:
8811106517749122387396306544400207294871116053309887778576518664178301264939320656920208097906596791502301012940291279838618778984913079372866311136903184
Which factors out …
-
Hi,
There are some number of topics/exercises/videos with not proper json response.
Some of them have "space" in their id.
Could you please fix them?
Here is the list of them:
Category: history Kind…