  The purpose of this manuscript is to describe the deterministic partially
synchronous version of Bullshark in a simple and clean way. This result is
published in CCS 2022, however, the description there is less clear because it
uses the terminology of the full asynchronous Bullshark. The CCS version ties
the description of the asynchronous and partially synchronous versions of
Bullshark since it targets an academic audience. Due to the recent interest in
DAG-based BFT protocols, we provide a separate and simple description of the
partially synchronous version that targets a more general audience. We focus
here on the DAG ordering logic. For more details about the asynchronous
version, garbage collection, fairness, proofs, related work, evaluation, and
efficient DAG implementation please refer to the fullpaper. An intuitive
extended summary can be found in the "DAG meets BFT" blogpost.
