Replies: 1 comment
-
|
I have opened an issue for this so I'm gonna lock this conversation. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
The current approach to find the current segment time is to loop through the segments iteratively. When the segment array has a big length, this is gas inefficient.
We could make the implementation faster by using a binary search algorithm. OpenZeppelin offers a Solidity v0.8 implementation for it.
Beta Was this translation helpful? Give feedback.
All reactions