That in effect boils down to consistently selecting server S with probability P, where P is function of weight and total number of servers?

Surely there must be better way to select server with a given probability without storing a massive lookup table of hashes? Randevouz hashing of some sorts

Small note, if I remember correctly PostgreSQL allocates small buffer within shared_buffers for bulk reads. It is so that single sequential scan won't flush all of shared buffers content.

Similar mechanism exists for a pagecache implementation on Linux. It is divided into generations based on access patterns.

I wonder if traffic lights were invented today, would it be just one light changing colour?

I have skimmed alternatives offered in comments to this post (vibepod-cli, code-on-incus, opencode-docker, sandboxy, smolvm, amazing-sandbox) and none of them seem to do credentials injection at the proxy level.

TLDR; `jj edit ; $EDITOR` will update a commit in the middle of the branch

`curl --http1.1` sends `Connection: Close` so sender (hyper) must attempt to shutdown connection after sending whole body. Surely any network is slower than memory copy into socket kernel buffers, so it must reliably trigger condition "buffer flush can't be done in one go" and thus trigger early TCP shutdown.