kvakil

6 ms·

1.
by kvakil 3y ago
I worked on that Node.js issue. If you can share a repro, I'd love to take a look: https://github.com/nodejs/node/issues/new?assignees=&labels=...
2.
by kvakil 3y ago
wow, this is impressive. I wrote a similar x86-16 assembler in < 512 B of x86-16 assembly, and this seems much more difficult < https://github.com/kvakil/0asm/ >. I did find a lot of similar tricks were hel
3.
by kvakil 7y ago
In addition, even if a normal number was used, it's far simpler to describe the data by just using a single number alone. For example, a binary encoding of the data (perhaps using a prefix-free code). Using a normal number and two &quo
4.
by kvakil 7y ago
Anecdote: for me the actor model has been the most understandable and useful concurrency primitive I've used. Pi-calculus, which was inspired by the actor model, is similarly elegant.
5.
by kvakil 7y ago
This assumes that pi is a normal number [0], a fact that is widely believed but has not been proven. [0]: https://en.wikipedia.org/wiki/Normal_number
6.
by kvakil 7y ago
jsfuck is hardly obfuscation: remove the first 828 bytes (for "eval(") and the last 3 bytes (for ")()"), and then execute the remaining string, and that gives you the original source code.
7.
Show HN: 0asm: x86 assembler in 512 bytes of x86 machine code(github.com)
7 points by kvakil 7y ago|0 comments
8.
by kvakil 7y ago
> Maksymilian Piskorowski found that if you happen to have a spare eight 9s, you can compute 𝑒 = (9/9 + 9^(-9^9))^(9^(9^9)), which is accurate to a little over 369 million decimal places. Sure, because 9/9 = 1 and if you take x
9.
by kvakil 7y ago
Seems likely that the hard reset works on a lower level as it works even if the phone is hung.
10.
by kvakil 7y ago
Maybe take a look at gg [0]? It seems to solve the problem of slow compilation quite nicely. [0] https://github.com/StanfordSNR/gg
11.
by kvakil 7y ago
From the article: "As an extra bonus, the generated proofs tend to be shorter than the ground truth proofs collected in CoqGym." This feels a little misleading, the paper itself says that the phenomena "... suggests that theo
12.
by kvakil 8y ago
how does this compare to oss-fuzz [0]? is the main value proposition that its easier to set up? [0]: https://github.com/google/oss-fuzz/
13.
by kvakil 8y ago
Modern secure messaging systems are typically OTR and have deniability: after the session ends, anybody can forge messages to make it look like they came from you. Sure the messages can become public, but they're no more "proof&qu
14.
by kvakil 8y ago
In French, there is a space before exclamation and question marks. Based on the author's name, I'd also guess that they are French.
15.
by kvakil 8y ago
I think that an age-based criterion would reflect that younger people (on average) have greater tech literacy. But I don't think Congresspeople reflect the general population, so I agree that using age is probably not the best idea.
16.
by kvakil 8y ago
It depends on how you define the modulo operator [0]--there are definitions where (-1)%5 == 4 and definitions where (-1)%5 == -1. Presumably the GP is referring to the former case. [0]: https://en.wikipedia.org/wiki/Mod
17.
by kvakil 8y ago
I believe they're almost certainly referring to Clojure macros
18.
by kvakil 8y ago
and just like that, you've convinced me to install it. Different strokes for different folks, I suppose. :)
19.
by kvakil 8y ago
You might find this interesting: https://unhosted.org/
20.
by kvakil 8y ago
Of course the answer is N1 - 3 N2 + 3 N3, since that naturally completes the cubic interpolating polynomial.
21.
by kvakil 8y ago
Reminds me quite a bit of this, which also includes FOL: http://proofs.openlogicproject.org/
22.
by kvakil 9y ago
This looks like a nice variety of challenges! I've always found constructing ROP chains extremely satisfying, even more than regular exploit development. As a plug, I wrote a blog post solving a similar exercise using a ROP chain: htt
23.
by kvakil 9y ago
No, the reason you aren't supposed to use it to generate cryptographic keys is because it's public: so it effectively provides no (or nearly no) entropy. It's the same reason you shouldn't use the current time as a seed