ztorkelson

7 ms·

1.
by ztorkelson 2y ago
It’s concatenation.
2.
by ztorkelson 3y ago
> Given a long-term token, can I create short-term, auto-expiring tokens? I suspect the answer is: yes, via attenuation. :)
3.
Beyond Blockchain: Convergent Consensus (Strange Loop 2022)(youtube.com)
2 points by ztorkelson 4y ago|0 comments
4.
by ztorkelson 4y ago
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 deterministic.
5.
by ztorkelson 4y ago
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.
6.
by ztorkelson 4y ago
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 the world. This gave players more degrees of freedom to arrang
7.
by ztorkelson 5y ago
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.
8.
by ztorkelson 7y ago
You appear to suggest that programmers with “rudimentary knowledge of transactions” should prefer lower isolation levels which sacrifice correctness for performance. If anything is “grossly irresponsible” here, it’s that. Such isolation lev
9.
by ztorkelson 8y ago
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 that Clover’s rapid growth is sustainable over the long term
10.
by ztorkelson 8y ago
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 problem here. The problem is using inappropriate data typ
11.
by ztorkelson 8y ago
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 community, but as I recall, one of the biggest limiting factors
12.
by ztorkelson 8y ago
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 Clover’s rapid growth is sustainable over the long term. We s
13.
by ztorkelson 8y ago
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 once it gets flushed, it's stable—just like con
14.
by ztorkelson 8y ago
The benefits of persistent memory, as I understand it, are principally improved performance (higher throughput, lower latency) and secondarily ease of programming. (Edit: another obvious benefit is cost per gigabyte; this stuff is cheaper t
15.
by ztorkelson 8y ago
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 continued growth is sustainable over the long term. Clover recen
16.
Amazon Aurora: Avoiding Distributed Consensus for I/Os, Commits, and Membership(dl.acm.org)
2 points by ztorkelson 8y ago|0 comments
17.
by ztorkelson 8y ago
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 because they have undesirable perform
18.
by ztorkelson 8y ago
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 used, though admittedly that sacrifices loc
19.
by ztorkelson 8y ago
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, and so one can expect a higher number of random memory access
20.
by ztorkelson 8y ago
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. Rehashing can be avoided if the table size is known in a
21.
by ztorkelson 8y ago
Would you mind elaborating? I'm not quite sure what you mean by segmented here.
22.
by ztorkelson 8y ago
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 at least a better starting point than most oth
23.
by ztorkelson 8y ago
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. Well, sort of. Serializability allows you to reason local
24.
by ztorkelson 8y ago
Thanks for the citation root! I agree, in spirit, with all three of his hypotheses for why the situation doesn't seem to be as dire one might otherwise expect. Peter writes that "it's possible data is actually corrupted, and
25.
by ztorkelson 8y ago
In my experience, many useful invariants cannot be trivially expressed in a singular "target field" against which one may lock, but that's actually beside the point. The point is that--insofar as it comes to correctness--seri
26.
by ztorkelson 8y ago
Well written and detailed comparison of snapshot and serializable isolation levels. From the article: A more concrete reason than “nothing else makes sense” is a question of local vs. global reasoning. If a set of transactions must maintai
27.
by ztorkelson 8y ago
Just wanted to give a shout-out to Meghan and the rest of the team at Lyric. I interviewed to lead their platform engineering team, and while I ultimately decided to take my career in a different direction, the process was smooth, the offer
28.
by ztorkelson 9y ago
Thank you for sharing your perspective! My argument is not that such controls can't be reasoned about and applied to great effect. Rather, my argument is that having to do so is much more difficult, time consuming, and error prone than
29.
by ztorkelson 9y ago
I'm of the opinion that while those sorts of knobs sound good on the surface, they're kind of missing the point. The benefit of having strong consistency is that one doesn't have to think about the many ways concurrent tran
30.
by ztorkelson 9y ago
ServiceBroker, at least, had the capability of (transactionally) sending messages between databases. So, if you drank the kool-aid (I did; it wasn't so bad), there needn't be "the centralized database". You can separate

More ›