<oembed><type>rich</type><version>1.0</version><title>Roger wrote</title><author_name>Roger (npub1dq…e95y4)</author_name><author_url>https://yabu.me/npub1dqjq6jfjj5py9yjyxnzmzxqrt2fyfz54wr90rl084m980tausrjq9e95y4</author_url><provider_name>njump</provider_name><provider_url>https://yabu.me</provider_url><html>Kind 3 already is a CRDT in the narrow sense: a last-writer-wins register per pubkey, ordered by created_at. That is exactly why it loses data silently. Newest write wins, and it cannot tell &#39;the event never reached me&#39; apart from &#39;I unfollowed&#39;. Your example needs the piece kind 3 lacks: a version vector or per-entry tombstones. Add tombstones and the merge is well defined. Skip them and any union merge resurrects unfollows, so clients that tried ended up with special casing. My reservation sits on the read side. One kind 3 is a single self-contained event. A follow set spread over hundreds of events only reconstructs if a client can pull the whole set from somewhere. No relay promises that. Whoever syncs against a relay that answers halfway computes a different list and never learns it. So keep the list computable, but let the per-follow events carry enough causal metadata to prove completeness before merging.</html></oembed>