Skip to content

Reduce Tipset State Computation Overhead Using Next Epoch Lookup #5581

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

Open
2 tasks
akaladarshi opened this issue Apr 14, 2025 · 0 comments · May be fixed by #5587
Open
2 tasks

Reduce Tipset State Computation Overhead Using Next Epoch Lookup #5581

akaladarshi opened this issue Apr 14, 2025 · 0 comments · May be fixed by #5587
Assignees
Labels
Type: Task Discrete task to implement

Comments

@akaladarshi
Copy link
Contributor

Summary

When retrieving the tipset state, instead of computing it every time as done here, we should try to look it up using the next tipset if it’s available, similar to how lotus handles it handles it. This optimisation would help reduce the overhead of recomputing the state for every tipset unnecessarily (in some specific cases)

Completion Criteria

  • Create a function for looking up tipset state for a provided tipset from next tipset (epoch)
  • Use the function fro specific condition, check lotus
@akaladarshi akaladarshi added the Type: Task Discrete task to implement label Apr 14, 2025
@akaladarshi akaladarshi linked a pull request Apr 16, 2025 that will close this issue
4 tasks
@sudo-shashank sudo-shashank moved this from New to In review in Forest Backlog 🌲 Apr 24, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Type: Task Discrete task to implement
Projects
Status: In review
Development

Successfully merging a pull request may close this issue.

1 participant