Each could contain a hash of the successor.
Discussion
Yup, that's what I was planning too.
Then you just need a `head` tag, maybe, so that it builds faster.
💯 and a tag with the total number of events there are.
Well, you would know that you came to the end because it wouldn't have a successor. But that would be a good check. I mean, you could also do a mathematical check of the entire list and store that in the head and skip the successor hashes. Like, a hash of the reconstituted event.