Fastest Wins Strategy using Futures (recommended)

We recommend to use the grpcmultiplex_fastestwins implementation based on Futures. You can take the example code from stream_blocks_mainnet.rs.

Reconnects will handled transparently in inside the Futures. Multiple Futures are executed in parallel and the first result is returned.

No guarantees are made about if the messages are continuous or not.

Fastest Wins Strategy using task/channel (experimental)

(see grpcmultiplex_fastestwins_channels.rs)

This implementation is built with Tokio Tasks and Channels instead of futures. It is simpler and more predictable than the Futures implementation. It uses a push model rather than a pull model, i.e. the task pushes the result to the channel while the Futures implementation pulls the result from the chain of Futures.

Perfect Seq Strategy (experimental)

(see grpcmultiplex_perfectseq.rs)

This strategy guarantees that the messages are continuous and in the correct order. The continuous property is defined by linking a Block with previous Block using block.parent_slot and block.parent_hash. The disadvantage is that it will not produce messages if a Block is missing.

It is limited to the commitment levels confirmed and finalized. For processed level there is no sequence due to the potential presence of forks with form a tree.