  With recent high-throughput technology we can synthesize large heterogeneous
collections of DNA structures, and also read them all out precisely in a single
procedure. Can we use these tools, not only to do things faster, but also to
devise new techniques and algorithms? In this paper we examine some DNA
algorithms that assume high-throughput synthesis and sequencing. We aim to
monitor, record, and read out the order in which a number $N$ of events occur,
using $N^2$ redundant detectors, and (after sequencing) reconstructing the
order by transitive reduction.
