Idea is look at likelihood that honest party would find n null blocks in a row. For highly unlikely (eg E-2), start penalizing (eg halve weight per additional null block).
Or something like W(X, N) = alphaX * .99^N with X past weight and N null blocks in a row...
This is the threat: https://github.com/filecoin-project/consensus/issues/22
Idea is look at likelihood that honest party would find n null blocks in a row. For highly unlikely (eg E-2), start penalizing (eg halve weight per additional null block).
Or something like W(X, N) = alphaX * .99^N with X past weight and N null blocks in a row...