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
Following up on #237, there are some limitations of the initial implementation. Primarily, that the delayed node does not handle forking right now.
Optimally, the delayed node will check that the block ID's match for a given block number between its trusted node and itself, and, if they don't, pop blocks until they do. If it runs out of undo history, it needs to resync (this is currently hard to do without restarting the process, as it's impossible to clear the object graph from memory without destroying the database). Then it will resume syncing from the trusted node as usual.
The text was updated successfully, but these errors were encountered:
Following up on #237, there are some limitations of the initial implementation. Primarily, that the delayed node does not handle forking right now.
Optimally, the delayed node will check that the block ID's match for a given block number between its trusted node and itself, and, if they don't, pop blocks until they do. If it runs out of undo history, it needs to resync (this is currently hard to do without restarting the process, as it's impossible to clear the object graph from memory without destroying the
database
). Then it will resume syncing from the trusted node as usual.The text was updated successfully, but these errors were encountered: