  As blockchains continue to seek to scale to a larger number of nodes, the
communication complexity of protocols has become a significant priority as the
network can quickly become overburdened. Several schemes have attempted to
address this, one of which uses coded computation to lighten the load. Here we
seek to address one issue with all such coded blockchain schemes known to the
authors: transaction confirmation. In a coded blockchain, only the leader has
access to the uncoded block, while the nodes receive encoded data that makes it
effectively impossible for them to identify which transactions were included in
the block. As a result, a Byzantine leader might choose not to notify a sender
or receiver of a transaction that the transaction went into the block, and even
with an honest leader, they would not be able to produce a proof of a
transaction's inclusion. To address this, we have constructed a protocol to
send the nodes enough information so that a client sending or receiving a
transaction is guaranteed to not only be notified but also to receive a proof
of that transaction's inclusion in the block. Crucially, we do this without
substantially increasing the bit complexity of the original coded blockchain
protocol.
