PaulRBerg / PaulRBerg/prb-math
Optimize `log10` with binary search
Open
Nobody has claimed this yet.
effort: medium
priority: 3
type: perf
work: complicated
- Dominant language
- Solidity
- Stars
- 1k
- Forks
- 145
- PR merge metrics
- No merged PRs in 30d
Description
See high_byte's tweet.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the existing log10 implementation and the high_byte tweet linked in the issue. Determine how a binary-search optimization would preserve the current result, then verify that the revised implementation is measurably more efficient without changing behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- solidity
- Domain
- blockchain
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100