Viewing profile — kvakil
kvakil
HN member- Joined
- Mon, Oct 23, 2017, 8:06 PM UTC
- HN karma
- 69
- Public activity
- 24 items
- HN profile
- View on Hacker News ↗
About kvakil
Recent public activity
- comment
-
comment
Comment #39075796
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=...
-
comment
Comment #36066769
wow, this is impressive. I wrote a similar x86-16 assembler in https://github.com/kvakil/0asm/ >. I did find a lot of similar tricks were helpful: using gadgets and hashes. Once tr…
-
comment
Comment #22031785
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 …
-
comment
Comment #22031710
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 elega…
-
comment
Comment #22031670
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
-
comment
Comment #22031373
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 sour…
- story
-
comment
Comment #21508888
> 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…
-
comment
Comment #21111410
Seems likely that the hard reset works on a lower level as it works even if the phone is hung.
-
comment
Comment #20850223
Maybe take a look at gg [0]? It seems to solve the problem of slow compilation quite nicely. [0] https://github.com/StanfordSNR/gg
-
comment
Comment #20788479
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 sa…
-
comment
Comment #19021183
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/
-
comment
Comment #18942220
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 message…
-
comment
Comment #18872397
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.
-
comment
Comment #18833972
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…
-
comment
Comment #18754226
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.…
-
comment
Comment #18742207
I believe they're almost certainly referring to Clojure macros
-
comment
Comment #18670101
and just like that, you've convinced me to install it. Different strokes for different folks, I suppose. :)
-
comment
Comment #18107937
You might find this interesting: https://unhosted.org/
-
comment
Comment #17776602
Of course the answer is N1 - 3 N2 + 3 N3, since that naturally completes the cubic interpolating polynomial.
-
comment
Comment #17641407
Reminds me quite a bit of this, which also includes FOL: http://proofs.openlogicproject.org/
-
comment
Comment #16095164
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 …
-
comment
Comment #16042990
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 s…