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
we compute and cache weight for every unique activeset. but when we start a node, we ask peers for all missed ballots layer by layer.
if we receive them at the same time code will try to compute WeightForSet for each ballot individually. if the number of simulateneously processed ballots is large it may trigger huge memory allocation.
the solution should be to compute WeightForSet only for the first ballot, and the rest should subscribe and wait until that computation has finished.
The text was updated successfully, but these errors were encountered:
we compute and cache weight for every unique activeset. but when we start a node, we ask peers for all missed ballots layer by layer.
if we receive them at the same time code will try to compute WeightForSet for each ballot individually. if the number of simulateneously processed ballots is large it may trigger huge memory allocation.
the solution should be to compute WeightForSet only for the first ballot, and the rest should subscribe and wait until that computation has finished.
The text was updated successfully, but these errors were encountered: