Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
afiodorov
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
31.
▲
by
afiodorov
1y ago
There's another level after fluency (C1), which is near-native fluency (C2). At the level of such mastery you don't feel the need to simplify just to be understood, your utterances now define the language itself as you've ach
32.
▲
by
afiodorov
1y ago
I use my third language, Spanish, every day, and my second, English, for work. On top of that, my partner is a native Portuguese speaker, so I'm passively soaking up a fourth. (I usually reply to her in Spanish, but we watch everything
33.
▲
by
afiodorov
1y ago
I am not saying rewrites are always warranted, but I think LLMs change the cost-benefit balance considerably.
34.
▲
by
afiodorov
1y ago
> So, it was really fascinating that I had the menu gem basically demo working on my laptop in a few hours, and then it took me a week because I was trying to make it do it Reminds me of work where I spend more time figuring out how to r
35.
▲
by
afiodorov
1y ago
I like this reply because it shows the shifting paradigm of hireability. Years ago, software engineers used to be hired just for their coding talent and would be put up with even if they were arrogant and had poor hygiene. With time, we all
36.
▲
by
afiodorov
1y ago
The article's 'useful vs. valued' distinction is spot on, and for me, it largely hinges on perceived replaceability. Being a diligent workhorse makes you 'useful' - you're reliably closing tickets. But 'va
37.
▲
by
afiodorov
1y ago
Regarding the common analogy about GPS atrophying map skills, I have a slightly different take based on observation and experience. My dad, who learned to drive pre-GPS, struggles to simultaneously drive and follow navigation – it's to
38.
▲
by
afiodorov
1y ago
NASA* :D
39.
▲
by
afiodorov
1y ago
Running AI itself is not low effort though, far from it at current efficiency levels it burns way more energy to produce outputs than humans. Setting latest advanced models to think about the problem on your behalf doesn't necessarily
40.
▲
by
afiodorov
1y ago
I think it is a losing battle. People are energy preserving creatures and we skip paying attention if we can. Because paying attention is effort. Vibe coding is exactly this, low effort development and thus is enticing. Now if we can get aw
41.
▲
by
afiodorov
1y ago
I agree but optimisation often reveals implementation details helping to understand limits of current tech more. It might not be worth the time but part of engineering is optimisation and another part is deep understanding of tech. It is s
42.
▲
The Age of Personalized Software: How LLMs Are Changing Programming
(afiodorov.github.io)
1 points
by
afiodorov
1y ago
|
0 comments
43.
▲
by
afiodorov
2y ago
I wonder if Apple will extend their iCloud+ private relay service to apps as a result of this.
44.
▲
by
afiodorov
2y ago
I’ve generally regarded gRPC as a high-performance protocol mainly suited for connecting microservices—something you’d keep internal rather than expose publicly. But it shines in use cases like live captioning, where a transcription service
45.
▲
by
afiodorov
2y ago
Why don’t you build it? Just the features people need of course. Seems like the kind of thing LLMs are quite good at (giving you prototypes).
46.
▲
by
afiodorov
2y ago
Overall, I like the sentiment. However, there’s a common pitfall: as experts transition into decision-making roles, they often rely on their older technical knowledge. Over time, this once-valuable expertise can work against them, because i
47.
▲
by
afiodorov
2y ago
All I need is the proportion of the qualifying numbers to the input array to run the algorithm and the number of samples. Then we can sample min, max index of the qualifying array and return their difference without having to sample many ti
48.
▲
by
afiodorov
2y ago
I claim we can do O(1) complexity (minus precompute) in all cases, see another comment of mine. Curious if O1 will figure it out.
49.
▲
by
afiodorov
2y ago
a = [int(x) for x in str(n)][::-1] assert n == sum(d*(10**i) for i, d in enumerate(a)) Now when you're operating mod 9, 10 == 1 % 9, thus 10**i == 1 % 9 Comes from the fact that (a*b) % 9 == (a % 9) * (b % 9) N
50.
▲
by
afiodorov
2y ago
This gave me an idea that we can skip the whole pass over the million draws by noting that the count of draws landing in my precomputed set M (digits-sum=30) is Binomial(n=1mln, p=|M|/100k). Then we sample that count X. If X=0, the dif
51.
▲
by
afiodorov
2y ago
Another speed-up is to skip the sum of digits check if n % 9 != 30 % 9. Sum of digits have the same remainder divided by 9 as the number. This rules out 8/9 = 88% candidates.
52.
▲
by
afiodorov
2y ago
Vilnius Riga connection missing
53.
▲
by
afiodorov
2y ago
Blockchains are examples worth learning from about how to build ledgers. Append-only transactions which start as pending and then eventually confirmed. Balances are cumsums of confirmed transactions.
54.
▲
by
afiodorov
2y ago
Not sure why Go is compared to Rust all the time, whilst most appropriate comparison is Java.
55.
▲
by
afiodorov
2y ago
This query appears to work as well https://www.imdb-sql.com/?query=SELECT+*+EXCLUDE+%28titleTyp...
56.
▲
by
afiodorov
2y ago
I am quite excited about the new era of WASM webapps - those are cross-platform & fast. Unlike traditional desktop programs those are sand-boxed & unlike mobile apps the distribution channels are open ("side-loading" by de
57.
▲
by
afiodorov
2y ago
Yes
58.
▲
by
afiodorov
2y ago
done :)
59.
▲
by
afiodorov
2y ago
deduped all rows with a simple .uniq() call in polars before saving
60.
▲
by
afiodorov
2y ago
done
More ›