Viewing profile — ztorkelson

It’s concatenation.

> Given a long-term token, can I create short-term, auto-expiring tokens? I suspect the answer is: yes, via attenuation. :)

Is (non-)determinism really the right concern here? I’m aware that most hash tables do not have generally predictable iteration orders, but I nevertheless understood them to be det…

Is this still true? I understood SHA256 to be faster than SHA512 due to hardware acceleration on current CPUs; dedicated instructions exist for the former but not the latter.

Items could be placed at any pixel location within the bounds of the container. The game used the same X and Y (integer) variables which otherwise denoted the item’s location in th…

Sequential UUIDs don’t start at 0. They are a 128-bit composite of two integers; a temporal component in the high order bits and a random component in the low order bits.

You appear to suggest that programmers with “rudimentary knowledge of transactions” should prefer lower isolation levels which sacrifice correctness for performance. If anything is…

Clover | Sunnyvale, CA | ONSITE | Full-Time | Senior Software Engineer (Backend) | USD $180k+ Our Team We are a small team of experienced software engineers tasked with ensuring th…

Right. I was waiting for the author to get to this point, and much to my surprise they never did. The takeaway shouldn’t be “strings are hard”. Strings are hard, but that’s not the…

Congratulations on the launch! I’ve heard great things about Outlands and have been meaning to log in and check it out. It’s been a long time since I was involved in the RunUO comm…

Clover | Sunnyvale, CA | ONSITE | Full-Time | Senior, Distributed Systems | USD $180k+ Who we are We’re a small team of experienced software engineers tasked with ensuring that Clo…

Yes. It's durable storage with a RAM interface. Byte-addressable through conventional CPU load/store instructions. It follows the usual cache coherence protocols for memory, but on…

The benefits of persistent memory, as I understand it, are principally improved performance (higher throughput, lower latency) and secondarily ease of programming. (Edit: another o…

Clover | Sunnyvale, CA | ONSITE | Full-Time | Senior, Distributed Systems | USD $180k+ We’re a small group of experienced software engineers tasked with ensuring that Clover’s cont…

That's not a very charitable interpretation of the GP. He's not criticizing hash tables because they aren't radix trees . He's criticizing this and other hash table implementations…

Right. When you ask "how could we support deletion of nodes", am I right to assume you mean "how could we reclaim memory of deleted nodes"? Conventionally, a free list would be use…

Gotcha. Yes, while there are implementation techniques that can help (e.g. arena allocation, prefix compression, adaptive node sizes), the data structure is fundamentally a tree, a…

I've found myself reaching for radix trees more and more for the same reason you listed: competitive and predictable performance. That said, I can see two counter-arguments: 1. Reh…

Would you mind elaborating? I'm not quite sure what you mean by segmented here.

I actually don't have much hands-on experience with Postgres, so I can't speak to how it performs in practice. My comment was highlighting that Postgres' implementation of SSI is a…

The reasoning required is the same in both cases. To avoid serialization conflicts you still have to identify all those appropriate records and appropriate times in your reasoning.…