Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
giovannibonetti
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
31.
▲
by
giovannibonetti
6mo ago
>There was a time that Google cared deeply about UX. Now, on macOS Google remaps CMD-G in Google Docs to launch some LLM bullshit That reminds me of a few years ago when Android phones replaced the behavior of "long press sleep/
32.
▲
by
giovannibonetti
6mo ago
As far as I can tell, Postgres is not designed with this inclination towards doing lighter work when clients are waiting and piling up maintenance work to do in background. I think the background work it does is mostly running vacuum on tab
33.
▲
by
giovannibonetti
6mo ago
Yes, partitioning will decrease a bit the read performance of queries not correlated with the partition key. That's why you need to periodically merge smaller partitions, so that you can keep the overall partition count bounded. It is
34.
▲
by
giovannibonetti
6mo ago
Say, if you know the function is a polynomial of degree N, with N+1 datapoints you can find it – e.g. with Lagrange's polynomial, although the finite precision of computer numbers might make that more complex.
35.
▲
by
giovannibonetti
6mo ago
With some extra admin work, you can greatly increase your insert throughput, as long as the table load is comprised mostly of inserts: 1. Partition your table by range of a monotonic ID or timestamp. Notice the primary key will have to cont
36.
▲
by
giovannibonetti
6mo ago
That's why these niche languages need state-of-the-art compilers that enforce invariants more strongly. This way, they can catch most of the subtle bugs the LLM produces, sort of like antibodies.
37.
▲
by
giovannibonetti
6mo ago
For those of you using a browser to generate PDFs, the Rust crate you should look into is Typst [1]. Regardless of your application language, you can use their CLI. It takes some time to get used to their DSL to write PDFs, but nowadays wit
38.
▲
by
giovannibonetti
7mo ago
I find it fascinating when different people independently arrive at the same architecture when working on a hard problem like this. In my company we built our offline-first apps with PowerSync, which has the same idea of optimistic local ch
39.
▲
by
giovannibonetti
7mo ago
Micro-payments, probably
40.
▲
by
giovannibonetti
7mo ago
For those of you in Brazil, my company jota.ai has built a financial AI-assistant that you can chat with to open a bank account, connect with accounts from other banks, make instant Pix payments with any of them, all of that through WhatsAp
41.
▲
by
giovannibonetti
7mo ago
You might be interested in a library that flips around the concept of an ORM, like sqlc [1] or aiosql [2]. You specify just what you want from the database, without needing to couple so much API with database tables. [1] https://
42.
▲
by
giovannibonetti
8mo ago
That's the space where Go shines
43.
▲
by
giovannibonetti
8mo ago
> OTOH, if and only if you design your schema to exploit MySQL’s clustering index (like for 1:M, make the PK of the child table something like (FK, some_id)), your range scans will become incredibly fast. But practically no one does that
44.
▲
by
giovannibonetti
9mo ago
I think the PowerSync [1] team is missing out on an opportunity to showcase their impressive data sync technology by building a minimalist Slack clone. [1] https://www.powersync.com/
45.
▲
by
giovannibonetti
9mo ago
Clustered indexes only save up to 2x write amplification in the very rare case where you're indexing the entire table (e.g. if it has very few columns). However, that is usually the least of your concerns with write amplification. If y
46.
▲
by
giovannibonetti
9mo ago
You assume it is valid, until it isn't and you can have different strategies to handle that, like just skipping the broken part and carrying on. Anyway, you write a state machine that processes the string in chunks – as you would do wi
47.
▲
by
giovannibonetti
10mo ago
I have been using Powersync, and it works great for mobile apps with offline-first functionality.
48.
▲
by
giovannibonetti
10mo ago
I think only Turso — SQLite rewritten in Rust — supports that.
49.
▲
by
giovannibonetti
1y ago
That's Mojo's selling point. https://www.modular.com/mojo
50.
▲
by
giovannibonetti
1y ago
Roc says hi!
51.
▲
by
giovannibonetti
1y ago
Why does type inference contribute to that issue?
52.
▲
by
giovannibonetti
1y ago
> Soon we'll have shiitake replacing transistors in our airplane and spacecraft computers, while sitting and eating ramen on the vehicles themselves. The future is shaping up to be interesting. By the way, some people say eating mea
53.
▲
by
giovannibonetti
1y ago
> This community has pockets of people who like authoritarian control, and genuinely believe in Apple or Google Play as some kind of superego that they need to defend, that they believe is protecting us. Perhaps you meant Leviathan inste
54.
▲
by
giovannibonetti
1y ago
I've noticed that LIMIT 1 makes a huge difference when working with LATERAL JOINs in Postgres, even when the WHERE condition has a unique constraint.
55.
▲
by
giovannibonetti
1y ago
Watch out, Meta. OpenAI is going to eat your lunch.
56.
▲
by
giovannibonetti
1y ago
> You can model multiple-hop dependencies as a Markov chain by just blowing up the state space as a Cartesian product. Where the state space would be proportional to the token length squared, just like the attention mechanisms we use tod
57.
▲
by
giovannibonetti
1y ago
> Quality needs to come from the process, not the people. Not sure which Japanese school of management you're following, but I think Toyota-style goes against that. The process gives more autonomy to workers than, say, Ford-style, w
58.
▲
by
giovannibonetti
1y ago
Vector clocks, since they keep a separate counter for each client
59.
▲
by
giovannibonetti
1y ago
It seems to be a side-gig to bring attention to their company. Well done.
60.
▲
by
giovannibonetti
1y ago
> What changes does Zig make to "implement" this? The user has to pass the allocator around to all the functions that need to allocate data on the heap. I don't think every language is ready for that.
More ›