Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
leijurv
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
leijurv
1y ago
OP did actually host a tracker. "I then started the tracker. After about an hour, it peaked at about 1.7 million distinct torrents across 3.1 million peers!"
2.
▲
by
leijurv
2y ago
Here's the submission that won the Hutter Prize in 2021: https://github.com/amargaritov/starlit It uses a LSTM to predict the next token lossily, then uses https://en.wikipedia.org/wiki/Arithm
3.
▲
by
leijurv
2y ago
I suspect it was, given that they've now deleted their comment.
4.
▲
by
leijurv
2y ago
`for char in message: encrypted_char = ord(char) ^ (shared_secret[0] % 256)` This is not real encryption, it picks only one byte of shared secret and XORs it into the plaintext. Therefore, there are only 256 possible decryption keys to chec
5.
▲
by
leijurv
2y ago
It was a one-way collaboration, in that we referenced their discoveries and code such as LattiCG https://github.com/mjtb49/LattiCG , but they were unaware of anything we were doing until now. https://twitter.
6.
▲
by
leijurv
2y ago
I'm just a regular SWE! Infosec or algorithmic trading - maybe someday.
7.
▲
by
leijurv
2y ago
Yes, absolutely :) that's why we went to FitMC to make the video, he always delivers.
8.
▲
by
leijurv
2y ago
I believe that may be the spectral test https://en.wikipedia.org/wiki/Spectral_test which I mentioned in the explanation when showing the lattices visually
9.
▲
Randar: A Minecraft exploit that uses LLL lattice reduction to crack server RNG
(github.com)
530 points
by
leijurv
2y ago
|
116 comments
10.
▲
by
leijurv
3y ago
HN thread: https://news.ycombinator.com/item?id=29615428 :)
11.
▲
by
leijurv
3y ago
No that's not at all how this works. The iterator could "return" a boolean by passing a boolean to "yield". The return value of "yield" just indicates if the generator should continue, or stop because the
12.
▲
by
leijurv
3y ago
This inspired me to plumb the depths of FizzBuzz, seeking further into it than anyone ever has before: the 10^10000000000th digit (it's a "1"): https://github.com/leijurv/reverse-fizzbuzz
13.
▲
by
leijurv
4y ago
One person one vote is democracy, one dollar one vote is web3. Very different.
14.
▲
by
leijurv
4y ago
> I wonder how Blockchain explorers deal with more complex scripts. For example on blockchain.com one can look up coins by putting an "address" into the search bar. But how would one look up coins that are not locked by a scrip
15.
▲
by
leijurv
4y ago
Some mistake or miscommunication happened there, as Wikipedia does have a policy that people can be cited for information about themselves, the policy is called SELFSOURCE. See: https://en.wikipedia.org/wiki/WP:SELFSOUR
16.
▲
by
leijurv
4y ago
I think it has to do with verifiability. https://en.wikipedia.org/wiki/WP:V Essentially everything written has to be verifiable, and if a person doesn't have enough reliable sources talking about them, it isn'
17.
▲
by
leijurv
4y ago
Well it's a continuous process: today the fees make up maybe three percent of revenue, but that fluctuates as transaction space demand changes, and as the coinbase halves every few years. But your point is good - miners are not really
18.
▲
by
leijurv
4y ago
I've heard the metaphor that "writing your ledgers in pen instead of pencil doesn't make transactions irreversible" - meaning that in the same sense, actions on the blockchain could be coded to be irreversible. The diffe
19.
▲
by
leijurv
4y ago
Why do you think it all comes down to that? Clearly there's much more to it. For example, cryptocurrencies with those two properties you mentioned are a dime a dozen. I could make one right now by git cloning bitcoin, changing some pro
20.
▲
by
leijurv
4y ago
I don't think that's true, fees are not proportional to that. Fees compete for a finite and precise limited space in blocks. There's no limit to how high fees could grow in this competition, because only the 7 most lucrative
21.
▲
by
leijurv
4y ago
No need to speculate on how big or small the gaps may be, the article looks at the actual random gap values used on Wikipedia. Quote: "The least viewed article in the sample, Erygia sigillata, has a page_random value of 0.500764585777.
22.
▲
by
leijurv
5y ago
There's a download button in the bottom right, if you hit Original you get the actual original. Here it is: https://live.staticflickr.com/65535/51847931721_c3feebd201_o...
23.
▲
by
leijurv
5y ago
That is handled by MakeMKV, which the blog posts refers to. https://www.makemkv.com/ "MakeMKV is a format converter, otherwise called "transcoder". It converts the video clips from proprietary (and usually en
24.
▲
by
leijurv
5y ago
Well, read https://news.ycombinator.com/item?id=29621262 if you want to know why this ended up happening :)
25.
▲
by
leijurv
5y ago
Not quite a shortcut, it was actually to patch a bug in vanilla minecraft that causes desync, see https://news.ycombinator.com/item?id=29621262 And it may seem silly that it tells you that it's block type ABC, but the
26.
▲
by
leijurv
5y ago
Well, Paper is trying to fix the result of vanilla Minecraft's range check. Taking their perspective, they wanted to fix the issue where <6 blocks worked, but >6 blocks caused desync. So it is natural to reply in the "else&q
27.
▲
by
leijurv
5y ago
Yeah, https://users.isy.liu.se/rt/schon/Publications/HolSG2006.pdf was great to refer to, just the right level of complexity for me.
28.
▲
by
leijurv
5y ago
If I remember correctly, for ZFS it was some stuff about cache size and RAM usage, since we were in a VM and couldn't be too greedy. Something about a NVME drive needing slightly different settings. I didn't spend much time on thi
29.
▲
by
leijurv
5y ago
Thanks!
30.
▲
by
leijurv
5y ago
For tracking, the spatial resolution was 1 chunk, which is 16 by 16 blocks, and the temporal resolution was 1 second. So, we have a few billion rows of tracking data for every player, localizing them to roughly that distance, roughly once a
More ›