This seems like an optimization for an extremely unlikely use case. How many keys do you plan on sto
This seems like an optimization for an extremely unlikely use case. How many keys do you plan on storing and is it anywhere near risking hash collision?
You could also reduce probably by making a read first, and writing it if it doesn't exist. It won't deterministically guarantee that you aren't overwriting, because it may have been written/propagated to KV since the read, but it wouldn't hurt in reducing chances of collision
If you need stronger unique guarantees, DO/D1 may be better options
You could also reduce probably by making a read first, and writing it if it doesn't exist. It won't deterministically guarantee that you aren't overwriting, because it may have been written/propagated to KV since the read, but it wouldn't hurt in reducing chances of collision
If you need stronger unique guarantees, DO/D1 may be better options
