You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Executing Filecoin transactions are computationally expensive, caches are vital for performance but eat up memory, we rely on the p2p swarm but any individual peer may be unreliable. As of writing, Forest does not have any clear bounds on computation, memory, or network usage.
Motivation
Forest operators would benefit from clear requirements. Additionally, having bounded requirements is essential for security and resisting attacks.
Tasks
Enumerate all caches, justify their size, and minimize if possible.
Decouple the swarm from the execution layer.
Make sure only validated data is comitted to the database.
Summary
Executing Filecoin transactions are computationally expensive, caches are vital for performance but eat up memory, we rely on the p2p swarm but any individual peer may be unreliable. As of writing, Forest does not have any clear bounds on computation, memory, or network usage.
Motivation
Forest operators would benefit from clear requirements. Additionally, having bounded requirements is essential for security and resisting attacks.
Tasks
Risks & Dependencies
Additional Links & Resources
Related: #2469
The text was updated successfully, but these errors were encountered: