luizfelberti

7 ms·

1.
by luizfelberti 1mo ago
> A repository is a name, a URL prefix, and one or more RSA public keys that are trusted to sign the extensions served from it. Is it too late to beg Hannes and Mark to let us have something like minisign instead of RSA? :) Very excited
2.
by luizfelberti 2mo ago
I love MikroTik, but ffs just let me install something else on it. SONiC or any other Linux would be awesome. I love their hardware, but their software is absolutely awful. Is there any manufacturer out there who produces high quality hardw
3.
by luizfelberti 6mo ago
It might be good to explain how this differs from zerobrew [0], which is trying to accomplish the same thing [0] https://github.com/lucasgelfond/zerobrew
4.
by luizfelberti 7mo ago
A bit dated in the sense that for Linux you'd probably use io_uring nowadays, but otherwise it's a timeless design Still, I'm conflicted on whether separating stages per thread (accept on one thread and the client loop in ano
5.
by luizfelberti 7mo ago
You left out the most bizarre part of the email: > Action needed: Please go to my.1password.com/billing to register your approval. If you do not provide consent by your next renewal date on or after March 27, 2026, your subscripti
6.
by luizfelberti 9mo ago
I also find this to be an elegant way of doing this, and it is also how the Thompson VM style of regex engines work [0] It's a bit harder to adapt the technique to parsers because the Thompson NFA always increments the sequence pointer
7.
by luizfelberti 10mo ago
> If sqlite had a generic "strictly ascending sequence of integers" type Is that not what WITHOUT ROWID does? My understanding is that it's precisely meant to physically cluster data in the underlying B-Tree If that is not
8.
by luizfelberti 10mo ago
Actually for this kind of workload 15Gbps is still mediocre. What you actually want is the `n` variant of the instance types, which have higher NIC capacity. In the c6n and m6n and maybe the upper-end 5th gens you can get 100Gbps NICs, and
9.
by luizfelberti 10mo ago
Honestly this benchmark feels completely dominated by the instance's NIC capacity. They used a c5.4xlarge that has peak 10Gbps bandwidth, which at a constant 100% saturation would take in the ballpark of 9 minutes to load those 650GB f
10.
by luizfelberti 11mo ago
It seems to talk about Rosetta 2 as a whole, which is what the containerization framework depends on to support running amd64 binaries inside Linux VMs (even though the kernel still needs to be arm) Is there a separate part of Rosetta that
11.
by luizfelberti 11mo ago
They barely just released Containerization Framework[0] and the new container[1] tool, and they are already scheduling a kneecapping of this two years down the line. Realistically, people are still going to be deploying on x64 platforms for
12.
by luizfelberti 11mo ago
Do not reference these kinds of docs whenever you need practical, actionable advice. They serve their purpose, but are for a completely different kind of audience. For anyone perusing this thread, your first resource for this kind of securi
13.
by luizfelberti 11mo ago
Documenso[0] is a pretty cool alternative that is increasingly compliant with more and more e-signature standards https://documenso.com/
14.
by luizfelberti 11mo ago
There used to be a similarly names one called CozoDB[0] which was pretty awesome but it looks like its development significantly slowed down. [0] https://github.com/cozodb/cozo
15.
by luizfelberti 11mo ago
Ah yes, pretending we can access infinite amounts of memory instantaneously or in a finite/bounded amount of time is the achilles heel of the Von Neumann abstract computer model, and is the point where it completely diverges from physi
16.
by luizfelberti 1y ago
I was trying to do this in 2023! The hardest part about building a search engine is not the actual searching though, it is (like others here have pointed out), building your index and crawling the (extremely adversarial) internet, especiall
17.
by luizfelberti 1y ago
I also switched away from Tarsnap because I needed to restore my personal PDF collection of like 20GB once and my throughput was like 100Kb/s, maybe less. It has been a problem for at least a decade, with no fix in sight. I'm care
18.
by luizfelberti 1y ago
This looks amazing, I've been shopping for an implementation of this I could play around with for a while now They mention promising results on Apple Silicon GPUs and even cite the contributions from Vello, but I don't see a Metal
19.
by luizfelberti 1y ago
For those looking to break free and are considering self-hosting, I can strongly recommend Stalwart. I'm surprised how almost no one seems to have heard of it, but it's amazing (and supports JMAP!)
20.
by luizfelberti 1y ago
Feels like the complete opposite s-expressions which are the easiest possible thing to parse, this sounds like a complete nightmare to write a parser for. It might even be easier to treat the input string as a 2D grid than as a sequence and
21.
by luizfelberti 2y ago
Upvoted for using Redbean. I've been using it recently and it has been absolutely amazing, the built-in functionality that it has exposed through the Lua interface makes it an extensively programmable proxy that you can sandbox the cra
22.
by luizfelberti 2y ago
Computation model behind this vaguely reminds me of the Epic Games programming model thing for Verse Calculus: https://simon.peytonjones.org/verse-calculus/
23.
by luizfelberti 2y ago
Sure, but is EOL really a defense given the absolutely pathetic security posture that created this exploit in the first place? Is there a statute of limitations on mind boggling levels of incompetence? I'd usually give the EOL argument
24.
by luizfelberti 2y ago
> Then a couple of weeks ago, added [direct] links to the Wayback Machine Hopefully they are also making substantial donations to the Internet Archive, since they will be directing a lot of traffic into it and basically using their inf
25.
by luizfelberti 2y ago
Since you're using Rust, the Cranelift JIT compiler implements something like this[0] to construct an e-graph for its expression rewriting subsystem called ISLE, however if I'm not mistaken it is for disjoint sets (not intervals
26.
by luizfelberti 3y ago
You are correct that this is a detectable and entirely preventable failure, however, this is the way in which this can manifest: - UTF-8 is a prefix-free self-synchronizing code; - If the first byte of a UTF-8 codepoint starts with 0b0?????
27.
by luizfelberti 3y ago
There are also other concerns depending on your threat model: if you're parsing user-generated strings you definitely want to be able to handle corrupted unicode, for security reasons, and in these scenarios the way you handle recovery
28.
by luizfelberti 3y ago
I mostly agree with this, but what I mean with the unbounded lookahead part of it is that bounding the amount of speculation (or lookaheads/backtracking) is equivalent to limiting the "size" of the error you can recover from.
29.
by luizfelberti 3y ago
What dezgeg said is pretty much spot on, and also I think what you're describing related to "compiling the codepoints down to bytes" is in many ways equivalent to handling the UTF-8. My opinion is, stated in a way that a Tige
30.
by luizfelberti 3y ago
Agreed on all counts, except with the remark that even with sane grammars unbounded lookahead will still appear if you want to have IDE-grade error resilience. But I wholeheartedly agree with the sentiment of "don't make the gramm

More ›