In Tailstorm, participants optimize summary proposals such that their own reward is maximized. The current implementation is buggy. Optimal summaries are appended, but they are not necessarily adopted as preferred tip of the chain. The update_head function should prefer blocks that yield higher reward.
In Tailstorm, participants optimize summary proposals such that their own reward is maximized. The current implementation is buggy. Optimal summaries are appended, but they are not necessarily adopted as preferred tip of the chain. The
update_headfunction should prefer blocks that yield higher reward.Might be easier to fix after implementing #14.