In the Tailstorm protocol participants choose which (sub) blocks to include into the next summary (or strong block) such that their own reward is maximized. The current implementation use a brute-force algorithm to select the optimal combination of sub blocks. This is very expensive for high $k$.
Things can be sped up with a dynamic programming algorithm. I think George has some notes about that somewhere.
In the Tailstorm protocol participants choose which (sub) blocks to include into the next summary (or strong block) such that their own reward is maximized. The current implementation use a brute-force algorithm to select the optimal combination of sub blocks. This is very expensive for high$k$ .
Things can be sped up with a dynamic programming algorithm. I think George has some notes about that somewhere.