Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
tromp
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
151.
▲
by
tromp
9mo ago
> For the chess problem we propose the estimate number_of_typical_games ~ typical_number_of_options_per_movetypical_number_of_moves_per_game. This equation is subjective, in that it isn’t yet justified beyond our opinion that it might be
152.
▲
by
tromp
9mo ago
> The GeForce RTX 5090, which could typically be found for around $2,500 in November 2025, now sells for $3,300 or even far more, a hike of at least 65%. Nope; that's a 32% increase. Looks like they edited the old price from $2000 t
153.
▲
by
tromp
9mo ago
This sounds quite similar to pure functional languages like Haskell, where a function call cannot have any side effect. But those go further in that they don't even have any mutable data. Instead of var foo = { a: 1 }; var ba
154.
▲
by
tromp
9mo ago
I find this other article [1] more informative, including for instance the global map of Vulnerability to Water-Related Challenges taken from the actual report [2]. [1] https://www.thebrighterside.news/post/our-world-is
155.
▲
by
tromp
9mo ago
https://archive.is/azgrq
156.
▲
by
tromp
9mo ago
A maze generator in the shape of a maze whose corridors spell a 4-letter word: char*M,A,Z,E=40,J[40],T[40];main(C){for(*J=A=scanf(M="%d",&C); -- E; J[ E] =T [E ]=
157.
▲
by
tromp
9mo ago
Also discussed at https://news.ycombinator.com/item?id=46744892 and https://news.ycombinator.com/item?id=46745047 (flagged)
158.
▲
by
tromp
9mo ago
> One thing is certain, and that is economics will force a change in how we actually use the main Bitcoin blockchain. In the future, using the primary chain will feel a lot more like sending a bank wire transfer. It will become the settl
159.
▲
by
tromp
9mo ago
Ben Lynn's page https://crypto.stanford.edu/~blynn/compiler/ compiles (a large subset of) Haskell to web assembly (which you can download; a prime number sieve yielded 40KB of code) and runs it in the browser
160.
▲
by
tromp
9mo ago
I'm a bit saddened that a language with 29 keywords is now considered tiny...
161.
▲
by
tromp
9mo ago
https://archive.is/YkDgL
162.
▲
by
tromp
9mo ago
https://tromp.github.io/ Happy browsing/linking!
163.
▲
by
tromp
9mo ago
I had trouble solving the 2nd puzzle "No Twins Today". According to Wikipedia > Twins are two offspring produced by the same pregnancy. Which Ronald and Donald are, so according to Wikipedia, they're twins. But according t
164.
▲
by
tromp
9mo ago
Sometimes the airlines chess app gives you the option to play another passenger, but even after waiting for half an hour I've never been hooked up with another player. Has anyone else been able to?
165.
▲
by
tromp
9mo ago
Among 4 pawns like white and black a&b pawns, you only need 1 pawn capture to allow the other 3 pawns to promote.
166.
▲
by
tromp
9mo ago
Multiplying 32 numbers each over 5 bits long obviously results in more than 160 bits. 64!/32! > 2^178.3
167.
▲
by
tromp
9mo ago
To make this work, the rook can only have the king's position, if neither the king nor that rook have moved.
168.
▲
by
tromp
9mo ago
> Either we have to say that the position does not dictate the possible moves, or that this does not fully capture the position. It does not fully capture the history needed for determining future claims of draw by repetition. But by def
169.
▲
by
tromp
9mo ago
96 bits is not nearly enough, as there are ~4.8 * 10^44 > 2^148 legal chess positions (with side to move/castling/ep info) [1]. Chess Position Ranking provides a 153 bit encoding but it's very slow to decode. If the encodi
170.
▲
by
tromp
9mo ago
Closer to n3 or n5 I would think. Intel's node numbering is far more aspirational than TSMCs.
171.
▲
by
tromp
9mo ago
From February 2025...
172.
▲
by
tromp
9mo ago
The proof of Lemma 1 says that a string of length n can be output by a program of length n+O(1) in any Turing complete programming language, but that ignores the fact that nearly all languages require certain characters in string literals t
173.
▲
by
tromp
9mo ago
> It has been seventeen long years since Dr Craig Wright published the Bitcoin paper. That lowlife did no such thing.
174.
▲
Chinese Tennis Playing Robot
(supercarblondie.com)
1 points
by
tromp
9mo ago
|
0 comments
175.
▲
by
tromp
9mo ago
https://archive.is/46PIv
176.
▲
by
tromp
9mo ago
They're more expert at demolishing democracy right now, their very own.
177.
▲
by
tromp
9mo ago
> Attach something to an EV to tow and you kill the range It reduces the range, just as it reduces how far an ICE truck can go on one tank. But that's only an issue if you tow long distance and cannot find a place to charge on the w
178.
▲
by
tromp
9mo ago
It seems you avoided answering the most crucial question: What prevents an issuer from generating a proof that something existed arbitrarily far in the past? Opentimestamps achieves that by Proof of Work. Do you require trusting the issuers
179.
▲
by
tromp
9mo ago
The hashing rate is not directly relevant. That's roughly proportional to the daily dollar value of the reward times the efficiency of the leading mining hardware. The latter has gone up many orders of magnitude over the years. > bl
180.
▲
by
tromp
9mo ago
> it doesn't have as much state as the BF program Actually, it has much more, as it's an infinitely large prime number sieve, as shown on top of my webpage https://tromp.github.io/cl/cl.html
More ›