Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Backup from_base_le strategy for very large Uints #280

Open
prestwich opened this issue Jul 29, 2023 · 0 comments
Open

Backup from_base_le strategy for very large Uints #280

prestwich opened this issue Jul 29, 2023 · 0 comments
Labels
enhancement New feature or request good first issue Good for newcomers

Comments

@prestwich
Copy link
Collaborator

At some size of Uint, the recursion in from_base_le will cause stack overflows even for valid iterator sizes. This does not happen in from_base_be, as it does not recurse for each iterator item

  • Set a safe maximum size for the recursive from_base_le
  • Provide a backup strategy that is used only above that size.
    • This strategy may use alloc. If so, return an error if the alloc feature is not enable.
@prestwich prestwich added enhancement New feature or request good first issue Good for newcomers labels Jul 29, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request good first issue Good for newcomers
Projects
None yet
Development

No branches or pull requests

1 participant