Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
danking00
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
danking00
3y ago
These conversations never seem to mention what seems to me a relevant and related problem: the growth in commuting time during the rush hour. Yes, there are cheaper places to move. Yes, the price of my parents' home roughly matched inf
32.
▲
by
danking00
3y ago
This reveals an interesting dichotomy in the project I work on, Hail. I think of hail as a serverless workflow, relational, and linear algebra system most similar to Dask, BigQuery, Snowflake, Spark, etc. but this map is constructed from th
33.
▲
by
danking00
3y ago
This episode was fascinating. I had heard of LZ4 but not Zstd. It spurred me to make changes to our system at work that are reducing file sizes by as much as 25%. It’s great to have a podcast in which I learn practical stuff!
34.
▲
by
danking00
4y ago
FWIW, at my non-tech company, our compensation is far far below tech compensation. HR is extremely resistant to increasing salaries for SWEs. It’s comparatively easy to argue that, if an individual has a competing offer for 300k they’re cle
35.
▲
by
danking00
4y ago
I wonder if the trouble is not whether or not they are salesman but whether or not they are effective “managers,” for want of a better word. Many of the products we use today are built by companies of tens of thousands of people. Realizing
36.
▲
by
danking00
4y ago
I don't have any funding to hire right now, but I'm always happy to chat about the industry and my experience building Hail ( https://hail.is , https://github.com/hail-is/hail ), a tool widely used b
37.
▲
by
danking00
4y ago
300ms is my ideal latency, but we don’t achieve that under all circumstances. Even for blob storage, I see as much as 100ms latency. That said, my laptop has maybe 8 cores. Even if I had 0ms reads from an SSD, I’m compute bound for some tas
38.
▲
by
danking00
4y ago
I think this post is identifying scientific computing with simulation studies and legacy workflows, to a fault. Scientific computing includes those things, but it also includes interactive analysis of very large datasets as well as workfl
39.
▲
by
danking00
5y ago
I think this might be the kind of content you seek: https://news.ycombinator.com/item?id=11244103 It’s about data structures for editable text. Surprisingly complex!
40.
▲
by
danking00
5y ago
The term to Google is “heavy weather sailing”. There are a number of techniques that start with checking the weather well ahead of time. If you’re stuck at sea with a hurricane barreling down you can try to sail around the equatorial edge o
41.
▲
by
danking00
7y ago
Yeah of course! In retrospect my initial post seems a bit neutral to negative. I'm really glad this project exists, I'm endlessly frustrated by Sphinx. I'll keep my eye on your project!
42.
▲
by
danking00
7y ago
Tried this on our project, GitHub.com/hail-is/hail. Sphinx is a persistent thorn in our side, but we've made it work. A couple things I had to do to get this working: - something thinks a filename with dots (e.g. example.8bit
43.
▲
by
danking00
8y ago
I found this advice from Jean Yang resonated with my experience: https://twitter.com/jeanqasaur/status/1074526838901202944 > Been having many conversations with people in their 20s about the paralysis that can
44.
▲
by
danking00
9y ago
Why do you want Turing completeness in your probabilistic modelling language? This seems like a domain where you can specify a lot of useful work with bounded loops and other sub-TC tools.
45.
▲
by
danking00
9y ago
Hail @ Broad Institute of MIT and Harvard | (Junior | ε | Senior ) Software Engineer | Boston, MA | ONSITE, https://hail.is , SALARY:80k-150k The Broad Institute of MIT and Harvard was launched in 2004 to improve human health by
46.
▲
by
danking00
9y ago
The Hail Team @ The Broad Institute of MIT and Harvard | Software Engineer / Senior Software Engineer | Boston, MA | ONSITE, https://hail.is , SALARY:80k-150k Broad Institute of MIT and Harvard was launched in 2004 to improv
47.
▲
by
danking00
10y ago
What you've described is precisely the Optional or Maybe type. Many folks worry about the efficiency, which is reasonable, but feels misguided. A nullable annotation would be sufficient for the safety we all crave and would have no run
48.
▲
by
danking00
10y ago
TLDR: We always knew null'a could float around and cause NPEs, but many assumed they couldn't convince the compiler to unsafely convert, e.g., a String to an Integer. However, since null can inhabit any type, we can use null as a
49.
▲
by
danking00
10y ago
A little background: we're a pair of couples, each couple having one of the two higher salaries. Others have noted the high rent/mortgage prices in the Cambridge/Somerville area. However, each couple could afford the rent on
50.
▲
by
danking00
10y ago
I wonder what type of cities you've lived in. I've lived in various parts of Boston, Cambridge, and Somerville and we've previously had rock band and currently have room scale VR (it is, in fact, in use as I write this). Neit
51.
▲
by
danking00
10y ago
People do, it's called computable analysis. https://en.m.wikipedia.org/wiki/Computable_analysis The first thing on that page are the computable real numbers. They have this annoying property that the set itself is
52.
▲
by
danking00
11y ago
Perhaps you already know this, in which case I'm sorry for being pedantic. There are portions of the academy that also care about constant factors. They would write what, I think, you mean by O(kN) as k * N. If you need more precision,
53.
▲
by
danking00
11y ago
I think in this thread when we talk about "pattern matching" (which _is_ awesome) were caught up with two notions: pattern based destructuring of input and type enforced exhaustiveness checks. Java 8's Optional does give the
54.
▲
by
danking00
11y ago
Type Systems, Contract Systems, and IFC are three terms that I think are hard to distinguish using lay language. Perhaps what you're pointing out is that there are many dynamic and static ways to verify assertions about programs? Certa
55.
▲
by
danking00
11y ago
Bostonian here. We hate our summers and our winters. We're pretty much constantly grouchy about the weather, save for a few weeks in the spring and fall.
56.
▲
by
danking00
12y ago
But by that standard ruby is python is C is assembler. Turing-completeness is a not very interesting standard.
57.
▲
by
danking00
12y ago
I feel that it is a bit disingenuous to claim they are equivalent if the solution to maintaining a call stack is to explicitly maintain a stack structure. Iterating over lists, or integers in a range is pretty straightforward. Iterating ove
58.
▲
by
danking00
12y ago
This seems like a likewise elegant solution. However, it's not immediately obvious to me how to make this work with a static type discipline. Are there languages that do this? It seems like part of the benefits of the approaches descri
59.
▲
by
danking00
12y ago
It's a play on the name "Scheme" and "Schemers" which was continued by the "Racket" and "Racketeers" name. There's something of a history of naming things like this in the LISP community. Wi
60.
▲
by
danking00
12y ago
AFAICT, It's one of the cheapest bluetooth keyboards [1] on Amazon. They just hacked in some new electronics. I recognized it immediately because I also had to tear off the plastic casing. It shipped to me with a loose connection. [1]
More ›