Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
hxtk
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
by
hxtk
1y ago
If you're referring to the post from yesterday, they actually relicensed it as Apache 2.0: https://news.ycombinator.com/item?id=45196173
62.
▲
by
hxtk
1y ago
I know AWS in particular does not because they do not increment the bill for every request. I don't know exactly how they calculate billing, but based on what I do know about it, I imagine it as a MapReduce job that runs on Lambda logs
63.
▲
by
hxtk
1y ago
The algorithm for BB(N) is (with some hand waving) “for each N-state Turing machine, check if it halts on an initially empty tape. If it does not, skip it. If it does, run it until it halts and count the number of steps, k. BB(N) is the max
64.
▲
by
hxtk
1y ago
> against a key-value store no less, which probably fundamentally limits what optimizations can be done in any general way I would disagree with this assumption for two reasons: first, theoretically, a file system is a key value store, a
65.
▲
by
hxtk
1y ago
CS is sort of unique in that regard. I value my university degree, but when I think about the classes that helped me the most, only one of them was a degree requirement. Not because the degree was useless, but because the information was ac
66.
▲
by
hxtk
1y ago
Streaming services were great back when they were separate from content producers and IP holders. Once every media company became a streaming company and started using anticompetitive licensing practices in an attempt to drive viewership to
67.
▲
by
hxtk
1y ago
A Markov process is any process where if you have perfect information on the current state, you cannot gain more information about the next state by looking at any previous state. Physics models of closed systems moving under classical mech
68.
▲
by
hxtk
1y ago
I thought that the point of replaceState was precisely to avoid appending elements to the history, and instead replace the most recent one, so I think I must be missing something if that line causes lots of additional history items.
69.
▲
by
hxtk
1y ago
The main “why” that I find is that it allows you to intentionally design your API types and know when a change is touching them. I worked on a project with a codebase on the order of millions of lines, and many times a response was made by
70.
▲
by
hxtk
1y ago
Off by one errors strike again, unless you EDC a machine pistol?
71.
▲
by
hxtk
1y ago
I really wish policing would take more inspiration from aviation on a different avenue for police accountability. The NTSB exists not to blame pilots (though they sometimes do), but to make air travel safer and prevent future plane crashes.
72.
▲
by
hxtk
1y ago
I’ve worked on a project with strict legal record-keeping requirements that had a plan for the primary AWS region literally getting nuked. But that was the only contingency in our book of plans that really required the S3 backup. We general
73.
▲
by
hxtk
1y ago
If you specify your constraints in pyproject.toml like this: `package1==0.4.0`; then that is the latest (and only) version satisfying your constraints. Not upgrading is expected behavior, because upgrading would violate constraints. pypro
74.
▲
by
hxtk
1y ago
Your understanding of the Change-Id footer sounds like it matches mine. I’d note that it works that way presently, but the teams behind git, gerrit, jj-vcs, and a couple of other relevant stakeholders have an email thread going in which, fr
75.
▲
by
hxtk
1y ago
GitLab is actively developing native support for stacked diff workflows. CLI support for creating stacks landed in GitLab 17, and now they’re working on the code review workflow for it. To be honest, though, I find it easiest to create seve
76.
▲
by
hxtk
1y ago
Honestly I thought I’d hate it, but if I get the transparency just right where it’s not distracting but I can still see read through it if I try, I do find that it helps when I find myself lacking screen real estate. I’d still rather have a
77.
▲
by
hxtk
1y ago
I’ve definitely been preferring a transparent background on my terminal lately, particularly when I only have one screen, because it increases my ability to read the reference material I have opened behind it. At the very least, if I have t
78.
▲
by
hxtk
1y ago
I tend to use Safari on my mac, but I will say that it evaluates CORS slightly differently than other browsers so that sometimes I have to disable CORS protection to get a site to work that works fine in Chrome or Firefox, and it's the
79.
▲
by
hxtk
1y ago
I notice that library self-identifies a problem of generally keeping a fixed-size number of buckets and addressing them with hashing, which leads to great memory usage but introduces a risk of collision. Stochastic Fair Blue shares that pro
80.
▲
by
hxtk
1y ago
Something I’ve long wondered is why you never hear about rate limiting algorithms that are based on the cost to serve the request or algorithms that dynamically learn the capacity of the system and give everyone a fair share. In the field o
81.
▲
by
hxtk
1y ago
This isn’t something I’ve found with NextJS, but I also haven’t tried a lot of other, similar frameworks because I’m mostly a backend and SRE person who just learned NextJS so I could throw together pretty UIs to demo my backend ideas, so m
82.
▲
by
hxtk
1y ago
> I use to just lose my notes. I used to do this very intentionally. In the past, I've found that taking notes is very valuable for me, but having notes seldom is. When I was in school, I would write all my notes on a dry erase bo
83.
▲
by
hxtk
1y ago
Hmm, that's a good point, since the bloom filter check is CPU-harder than the action taken on lookup, you could just do all the lookups in parallel and then do all of the copies separately.
84.
▲
by
hxtk
1y ago
I'm confused by this line here: https://github.com/ross39/new_bloom_filter_repo/blob/4798d90... It seems like this would make the compression lossy and discard, e.g., transitions from #ffffff to #fffffa,
85.
▲
by
hxtk
1y ago
The bloom filter lookups here are fundamentally not parallel because they are coupled to a serial iteration. Ultimately the data they are storing is tuples of (x,y,r,g,b), which means that it is not sufficient to ask "does (x1,y1) pas
86.
▲
by
hxtk
1y ago
From what I can tell, it also isn't lossless: https://github.com/ross39/new_bloom_filter_repo/blob/main/vi... This looks like it is not storing the diff for any pixel that had the mean of its r,g,b
87.
▲
by
hxtk
1y ago
It sounds like your instinct here is that we need to store (x,y,r,g,b) tuples for everything that changed, and leave other pixels unchanged from the previous frame. You could store all of that in a single map from (x,y) to (r,g,b), which wo
88.
▲
by
hxtk
1y ago
There's a book that I encourage everyone to read called Motivational Interviewing. I've read the 3rd edition and I'm currently working my way through the 4th edition to see what's changed, because it's a textbook th
89.
▲
by
hxtk
1y ago
I've had similar ideas regarding how US Military ID cards work. The tech enthusiast in me loves the idea of ubiquitous strong 2FA, functioning ID systems that separate "identification" from "authentication" (looking
90.
▲
by
hxtk
1y ago
I'm an idiot, of course the search space is too large. It outgrows what I can brute force by the heat death of the universe by the time it gets to 16 bytes, even if the "test" is a no-op. I would need to selectively generate
More ›