fovc

7 ms·

31.
by fovc 2y ago
Never found so many choice quotes in one article... > Susie Thomas, a clerk for Lee County’s superior court, estimates it now takes her 10 times as many clicks to complete her case indexing. She was buried in scanning paper dockets for O
32.
by fovc 2y ago
6 months ago I predicted Algebra would be next after geometry. Nice to see that was right. I thought number theory would come before combinatorics, but this seems to have solved one of those. Excited to dig into how it was done https:&#x2F
33.
by fovc 2y ago
Scale isn’t the only reason to have distributed systems. You could very well have a tiny but distributed system
34.
by fovc 2y ago
I’ve been looking for a slightly more technical article describing how this works. I couldn’t find one on their site or through search. Anyone have a good link?
35.
by fovc 2y ago
I’m pretty sure that 2nd proof exists in some book or ebook somewhere. generating functionology was the one that came to mind. Impressive recall, but not novel reasoning
36.
by fovc 2y ago
No experience with Jason, but I have to say I’ve spent waaay too much time reading the Quill code trying to figure out how to patch around weird behavior. Which is frustrating because that’s what a RTE library (vs roll your own) is supposed
37.
by fovc 2y ago
> As a software engineer, I am lazy, so I always love to reuse existing tools as much as possible… That’s why I decided to take the chance to learn how Elliptic Curve Cryptography works. Imagine if they weren’t lazy!
38.
by fovc 3y ago
100% and going one step beyond: how do the answers to those Qs evolve as you grow from 1 engineer to 5 to 20 etc.
39.
by fovc 3y ago
Ah thanks for clarifying! I knew the code was illustrative but didn't realize the JSON part was too
40.
by fovc 3y ago
Surprised to see JSON here. I recall discussing JWT with tptacek a few years ago, and one of the concerns was the {a: x, a: y} ambiguity in JSON parsers. Was that a concern with this design? My other reaction was that this sounds scary: &gt
41.
by fovc 3y ago
Heh, can’t edit now, but s/Deep Mind/Deep Blue/
42.
by fovc 3y ago
As a consumer of those problems, first of all, thank you! Even decades on from high school I occasionally enjoy working on them. But agree that geometry was obviously going to be first. From what I’ve gathered here, it’s not “brute forcing”
43.
Sponge(1) – soak up standard input and write to a file(linux.die.net)
3 points by fovc 3y ago|0 comments
44.
by fovc 3y ago
> On average they consume about twice the memory of a fixed array of the same size. Not to split hairs, but that’s just the “unfreed” memory overhead. If you have 2^n+1 elements, you’ve provisioned 2^(n+1) slots and leaked ~2^(n+1) on to
45.
by fovc 3y ago
What’s the difference between this and other dynamic array implementations? I thought they were all data/length/capacity headers with exponential resizing. I know when using realloc the old buffer is recycled unlike with this aren
46.
by fovc 3y ago
Can’t edit now, but it should be initialized to lowerBits - (1 << (pageIndex + BASE_PAGE_BITS - 1)) for pageIndex > 0, or just lowerBits if pageIndex = 0.
47.
by fovc 3y ago
Not much of a C programmer, but here’s my ChatGPT assisted (painstakingly…) attempt at a lookup function. I think the log2 from math.h needs to be rewritten to use a fast bitwise implementation #include <stdint.h> #include &
48.
by fovc 3y ago
IIRC, NRK started down this path because normal hash tables without free leak memory on every resize. The original series of articles had me thinking about how to implement the normal hash table without leaking. I think it’s possible: First
49.
by fovc 3y ago
Would love some targeted RSS feeds if possible! Especially for the books
50.
by fovc 3y ago
I think you’re right on a narrow definition of price and quantity like what Wikipedia gives: > A natural monopoly is a monopoly in an industry in which high infrastructural costs and other barriers to entry relative to the size of the ma
51.
by fovc 3y ago
Struggled a bit to find this, but here’s a link to the other chapters already written: https://books.worksinprogress.co/ Does anyone know if there’s an RSS feed?
52.
by fovc 3y ago
That’s called a natural monopoly which is a well studied phenomenon. Most commonly they are regulated as utilities with guaranteed low returns on capital and limited ability to set prices.
53.
by fovc 3y ago
> Why do you backtrack when you hit a book? Because I usually don’t own those books and don’t have a university library > Often there are papers like '[topic] simplified' etc, and they can be quite useful. Yes! This is addin
54.
by fovc 3y ago
I guess “pun” because I proposed an exponential worst-case but usually actually fast algorithm based on backtracking, which is what SAT is.
55.
by fovc 3y ago
What’s happening to the old buses? $2M in savings on $75M in caped isn’t that great, unless the old buses were due for a refresh soon anyway
56.
by fovc 3y ago
The general purpose algorithm that’s not necessarily the fastest but has an upper bound worst-case runtime: 1. Pick a paper in the field ~at random. 1b. If it’s basic enough for you, you’re done 2. Read the first few paragraphs and find the
57.
by fovc 3y ago
We had this problem as well. For us a big part of the latency was just the bandwidth required for Postgres’s verbose text mode. It’s a shame there’s no way to compress the data on the wire
58.
by fovc 3y ago
I see from comments here that Moonbit has a GC. However, the resulting binary for Fibonacci is 253 bytes, which presumably does not include a GC. Is that using the proposed WASM-native GC, or is the build system smart enough to omit the GC
59.
by fovc 3y ago
Wow, how did you get 12 people to commit for 5h simultaneously? Not facetious, genuinely curious. I don’t think I could do that even for a shorter birthday party
60.
by fovc 3y ago
Here to plug blendl again!

More ›