Open
Description
Problem Description
Inductive valuations need to compute a lot of ϕ-adic expansions. There is an asymptotic speed up possible using a divide & conquer approach, implemented in #39614.
Proposed Solution
See the draft in #39614.
Alternatives Considered
none
Additional Information
So far the speed up achieved has been a bit underwhelming, see https://sagemath.zulipchat.com/#narrow/channel/271072-padics/topic/.CF.95-adic.20expansions.
Is there an existing issue for this?
- I have searched the existing issues for a bug report that matches the one I want to file, without success.