Let's say I receive a large sequence $s$ of numbers $n_0$, $n_1$, $n_2$, $\ldots$ Later I expect to receive the same sequence $s^*$ with the same numbers $n_0$, $n_1$, $n_2$, $\ldots$ but errors might occur. For instance $n_2$ gets altered. I'd like to detect errors as soon as possible with high probability.
- solution: store cumulative hash sum every $k$ elements (but here I detect the error too late)
- solution: store the whole sequence (way too large to store on disk)
Is there anything in between those two trade-offs that allows me to detect the error per element with high probability?