Viewing profile — modalduality

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…

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 We…

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-…

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 …

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.

> 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. T…

Thanks! I should probably include some more details on how to program the simulator. Turing machines are just one simple way for formalizing programs, without all the complexities …

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://modal…

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 great…

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.

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 che…

Does anyone know why they might choose to encrypt-then-MAC vs. an AEAD scheme? Seems less error prone.

Web developers may be also interested in https://gotham.rs/ , which was released very recently and looks to be a promising competitor to Rocket.

P = NP implies the polynomial hierarchy collapses, thus P = Sigma2, so by contradiction P != NP.

Wow, how did you find that commit?

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):\/\/)?…

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 v…

I think the OP is referring to simulating an oblivious Turing machine on the encrypted data, which itself is a Turing machine and some data. I don't think this is known to be intra…