modalduality

6 ms·

1.
by modalduality 9y ago
Most languages with monads have tools for working with them. In Haskell, for example, even without `liftM2` or `sequenceM`, you can simply do case (xm, ym) of (Just x, Just y) -> x + y _ -> 0
2.
by modalduality 9y ago
About ten of us are playing in https://modalduality.org/sibylant-graze/play/lobby if you'd like to join! A bit about the technical stack: the server was written in Haskell using WebSockets. Source at https:&
3.
Show HN: Sibylant graze, play the multiplayer word game Contact (Haskell/WS)(modalduality.org)
1 points by modalduality 9y ago|1 comments
4.
by modalduality 9y ago
In general forward security involves generating a new key for each conversation with Diffie-Hellman or similar. According to https://crypto.stackexchange.com/questions/5610/diffie-hellm... , Diffie-Hellman is not p
5.
by modalduality 9y ago
The main idea is to explore the concept of skinny triangles being unaesthetic (and thus undesirable for triangulations). This is true for many tasks in computational geometry, but not so true in art. Bringing these two together shows jarrin
6.
Show HN: Delaunay Triangulating Robert Delaunay's Eiffel Tower Paintings(modalduality.org)
39 points by modalduality 9y ago|11 comments
7.
Recurse Center Application Process(recurse.com)
1 points by modalduality 9y ago|0 comments
8.
by modalduality 9y ago
Ah, so Aaronson is talking about the Busy beaver shifts function of 2 there. I gave the answer to the busy beaver function counting the maximum number of 1s.
9.
by modalduality 9y ago
> What makes it okay to identify the naming of a large number with producing that large number of things (e.g. 1's)? Nice catch! I glossed over this but this is pretty important. The issue is that for any _specific number_, it takes
10.
by modalduality 9y ago
In case you think you've figured out the 2-state solution and you want to check that you can't do better, I've uploaded the number of 1s your machine should output at https://modalduality.org/static/busy-
11.
Show HN: Tzimtsum, an auto theorem prover for addition (Presburger arithmetic)(modalduality.org)
2 points by modalduality 9y ago|0 comments
12.
by modalduality 9y ago
In addition to 4Clojure, I found the Brave Clojure book ( https://www.braveclojure.com/ ) helpful for understanding how to structure programs in a "Clojure-y" way, e.g., to a greater extent than OOP representing dat
13.
by modalduality 9y ago
Is it easy to write timing-attack-resistant crypto code in Clojure? Sounds interesting, what company was this for? Thinking of implementing Damgard-Jurik myself sometime.
14.
by modalduality 9y ago
yup! they should have used a commitment scheme instead - for example, SHA256(winning numbers || 512-bit nonce). To reveal, reveal the winning numbers and the nonce and Mr X can check that the hash matches. The nonce is to introduce more ent
15.
by modalduality 9y ago
Does anyone know why they might choose to encrypt-then-MAC vs. an AEAD scheme? Seems less error prone.
16.
Show HN: Thetapack: Type-homogenous, crypto-friendly, padded binary serialization(github.com)
1 points by modalduality 9y ago|0 comments
17.
by modalduality 9y ago
Web developers may be also interested in https://gotham.rs/ , which was released very recently and looks to be a promising competitor to Rocket.
18.
by modalduality 9y ago
P = NP implies the polynomial hierarchy collapses, thus P = Sigma2, so by contradiction P != NP.
19.
by modalduality 9y ago
Wow, how did you find that commit?
20.
by modalduality 9y ago
Good article (didn't realize there were other kinds of lookaround), but maybe the bottom should link to well-tested standards-based regexes instead. URL: ^(((http|https|ftp):\/\/)?([[a-zA-Z0-9]\-\.])+(\.)([[a-zA-Z0-9]])
21.
by modalduality 9y ago
As the author mentions, this solution doesn't create identical distributions between the found case and the not-found case. One other concern is that a db hit and miss could take very different amount of times (e.g., L1 hit vs miss tha
22.
by modalduality 9y ago
In general it's much easier to reason about Boolean circuits because they always have an answer, unlike arbitrary programs that may never halt, for example, so you see a lot of theoretic results focusing on Boolean circuits (sometimes
23.
by modalduality 9y ago
Does anyone know what the proof actually proves, and how the reduction was formulated?
24.
by modalduality 9y ago
My bad, I meant profiling, not benchmarking.
25.
by modalduality 9y ago
Not a Rust expert, but some thoughts on the negatives. > Compilation time is too large Can you try compiling incrementally? https://blog.rust-lang.org/2016/09/08/incremental.html . Might still only be on ni
26.
by modalduality 9y ago
.newsbeuter/config has a "browser" command where you can give arbitrary a shell command where %u is the URL, you could give it your own script that matches on the URL. For example, mine is 'browser "urxvt -e elinks
27.
by modalduality 9y ago
One common use is to test out your new contract code without using real ethereum. You could even imagine a time where you could run a fuzzer on your contract to try to find bugs. Personally I don't think there's a real risk of exp
28.
by modalduality 9y ago
Good article. I found while doing the same thing a lot of the information online was out of date (for example referencing geth's built-in solc) and unusable. One addition--Geth 1.6 released a very nice interactive tool called puppeth t
29.
by modalduality 9y ago
That's fine, but `p` is a variable, not a constant, in the original post's case, right?
30.
by modalduality 9y ago
Right, but then the problem is no longer linear and approximating is more difficult. I'm not exactly sure what you mean by "exponential weight" in a linear program, do you have an example?

More ›