Re:Making CRDTs 98% More Efficient
by CodesInChaos on Tuesday October 17, 2023 @07:37PM
(#37922992)
I meant using a random initial value. This will make collisions less likely than v4 UUIDs (because the quadratic scaling of the birthday problem only applies to counter initialization), however once you get one collision you get many.
[ Parent
| on HN ]
Re:Making CRDTs 98% More Efficient
by vlovich123 on Wednesday October 18, 2023 @03:09AM
(#37925659)
That’s an interesting approach, but what’s the use case you’re thinking of? There’s no correlation of UUIDs across nodes like there is with something like UUIDv7 or ULIDs.
I guess you’ll still have batches of locality depending on the uptime of the server which might be useful and generation would of course be significantly faster although I doubt many applications are really bottlenecks by UUID generation speed.
Re:Making CRDTs 98% More Efficient
by insanitybit on Wednesday October 18, 2023 @09:26AM
(#37928330)
Within a node it would improve compression, so in theory your overall system would benefit. This diminishes as you increase the number of nodes. TBH if you have a very small number of nodes I think just having a synchronized counter is fine. You can make extremely fast counters if you allow for gaps.