Random Thought: LC Theorem

The PACELC theorem seems awfully named to me.

Isn’t it really just that there’s a trade-off between latency and consistency? I think you can treat network partitions as infinite latency, so availability is a special case of latency (available = finite latency).

So shouldn’t it just be the LC theorem? Seems more fundamental to me.

Related Posts

NTK reparametrization

Kate from Vancouver, please email me

ChatGPT Session: Emotions, Etymology, Hyperfiniteness

Some ChatGPT Sessions

2016 ML thoughts

My biggest takeaway from Redwood Research REMIX

finite, actual infinity, potential infinity

Actions and Flows

PSA: reward is part of the habit loop too

a kernel of lie theory