abound

11 ms·

151.
by abound 2y ago
Very cool! Seems like a Rust version of something like Bento? [1] Have you done any benchmarking against similar stream processing tools? [1] https://github.com/warpstreamlabs/bento
152.
by abound 2y ago
The note about using C-14 (introduced from nuclear blasts) to date the age of living cells is fascinating.
153.
by abound 2y ago
I think I've commented this elsewhere, but using Cue [1] is also great for this purpose, with no extra infrastructure. E.g. you define a Cue Template [2], which seems analogous to Yoke/ATC's CRDs, and then your definitions ju
154.
by abound 2y ago
But then, the next question down: > Are you planning to sell this keyboard at scale? > Dependent on the reception, likely yes. But it wont be exactly this design. A second iteration is in the works with improved sound profile and ergo
155.
by abound 2y ago
I think mdq [1], which was recently on HN somewhere, fits this. [1] https://github.com/yshavit/mdq
156.
by abound 2y ago
> I have added more details in the notes at the end of the article to explain how I found God, but for now, just have faith that I did.
157.
by abound 2y ago
The most interesting thing about Fish 4.0.0 for most people will be that it is now written in Rust, which they talk about here [1]. Looking forward to testing it out and seeing if there are any noticeable differences. [1] https:/&#x2F
158.
by abound 2y ago
It is open-source, you are of course more than welcome to take a crack at it.
159.
by abound 2y ago
"A lot" is an understatement, rendering the screen at ~320p took 12 days.
160.
by abound 2y ago
I think that 177 TB is for the whole shebang, it's just that it took 12 days to render the first frame.
161.
by abound 2y ago
> don't want to crash the party > I just see a massive waste of time & effort Kinda seems like you do wanna "crash the party". I disagree that this is a "waste of time" of course, the value I see here is m
162.
by abound 2y ago
I self-host Cal.com and broadly agree: it works great, has a clean look, and is super customizable. That said, getting it running was kind of a nightmare. I forget the details, but I had to edit a few different codebases and Docker images.
163.
by abound 2y ago
The soldered RAM is surprising for Framework, and doubly surprising for being so in a form-factor that usually doesn't have soldered RAM. Similar to what other commenters have expressed, it just seems like they shouldn't have bu
164.
by abound 2y ago
Privacy Pass!
165.
by abound 2y ago
I interpreted this as a batch write, e.g. "write these 10k entries and then come back". The benefit of that is way less overhead versus 10k concurrent background routines each writing individual rows to the DB. The downside is, as
166.
by abound 2y ago
And on a related note, this project was for educational purposes, but if the author wants to do more parsing in Rust, there's the excellent `nom` crate [1], which provides a JSON parser as an example [2]. It uses a very similar paradig
167.
by abound 2y ago
[I work at Kagi] Indeed, this is the intended interpretation of "Kagi's implementation of Privacy Pass" - we're talking about building out the server infrastructure, the UX, the browser extensions, the mobile application
168.
by abound 2y ago
FWIW, the person you're replying to did write most of the blog post. We work together at Kagi on Privacy Pass.
169.
by abound 2y ago
> The token can only be redeemed once, which means that, realistically, the client is going to be in a loop generating and redeeming tokens in a given search session, which makes the pairs trivial to correlate. One token request can prod
170.
by abound 2y ago
[I work at Kagi] The extension is open-source [1], including the Rust code that produces the WASM [2]. You should be able to produce a bit-compatible binary from these repos, and if not, please file a bug! [1] https://github.com&
171.
by abound 2y ago
> You could publish it on some sort of blockchain to make sure it can’t be changed and is public for everyone, right? Your understanding is correct, that's definitely something we could do. It is also something anyone else could do
172.
by abound 2y ago
There's no auth required at this stage of the handshake, so you can test from any number of devices/locations/networks/etc and confirm you get the same value. We could publish it, but it will change every epoch/mont
173.
by abound 2y ago
[I implemented this at Kagi] And you can validate this, if you try to issue a Privacy Pass search without a private token, you'll get a `WWW-Authenticate` header that kicks off the handshake, and that should be the same for all users f
174.
by abound 2y ago
[I worked on building this at Kagi] Since we have no idea who is issuing search requests in Privacy Pass mode, if there was no limits on token issuance, you could simply generate infinite tokens and give them out (or use them as part of som
175.
by abound 2y ago
IANAL, but the problem with these types of licenses (e.g. WTFPL, Beerware, etc) is that they lack any liability/warranty clauses. If you want a simple, open-as-possible license, you should generally just go with MIT or a similar (and w
176.
by abound 2y ago
This is excellent, thank you! I've had my own `jj bm` (for "bookmark move") alias to do this, but that implementation is way better.
177.
by abound 2y ago
Kagi has taken some investment, mostly from its users: https://blog.kagi.com/safe-round Disclosure: I work at Kagi
178.
by abound 2y ago
> I'm 100% on the path of least resistance when it comes to tool adoption. Different folks will have different preferences when it comes to adopting new tools. Some like "tried and true", some want to experiment and see wh
179.
by abound 2y ago
Indeed, the article notes that the lat/long wasn't "GPS exact", more like "postal code exact".
180.
by abound 2y ago
For people who don't want to click into X or don't have an account to see the thread: The rig in question uses dual-socket EPYCs and no GPUs, relying on 768 GB of fast DDR5 RAM. It gets about 6 - 8 tokens/sec for the full D

More ›