#9206: faster finite field creation with proof=False, done right (via proof
architecture)
--------------------------------+-------------------------------------------
Reporter: was | Owner: AlexGhitza
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5
Component: basic arithmetic | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
--------------------------------+-------------------------------------------
Comment(by was):
This example illustrates the effect of this patch:
{{{
sage: time GF(next_prime(10^40)^5,'a')
CPU times: user 0.51 s, sys: 0.00 s, total: 0.52 s
Wall time: 0.52 s
Finite Field in a of size 10000000000000000000000000000000000000121^5
sage: proof.arithmetic(False)
sage: time GF(next_prime(10^40)^5,'a')
CPU times: user 0.07 s, sys: 0.00 s, total: 0.07 s
Wall time: 0.07 s
Finite Field in a of size 10000000000000000000000000000000000000121^5
}}}
Unfortunately, it does *not* address this problem that David Harvey
mentioned. However, it has a similar "flavor":
{{{
sage: R.<x> = PolynomialRing(Integers(16219299585*2^16612 - 1))
}}}
David Harvey: "Maybe not literally forever, but I got sick of waiting.
Should be instantaneous."
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9206#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
