BDFL of Quilibrium, Eng @ Farcaster, ex-Coinbase, always opinionated, never hydrated

/quilibrium

ITU Blockchain developer and designer, airdrop master, former bullet chess enjoyer and rubic cube solver,i hate gm more than mondays and my classes,I like memes

This is the cryptography channel, but it's something of interest for any networks pursuing post quantum secure schemes

Working on building products with zkTLS, and subverting web2 systems by encouraging client diversity. A ruthless empiricist.

http://opacity.network

Polynomial time for quantum computers, but yeah, definitely a serious deal if it holds.

Haven’t read the whole thing yet, but they found a polynomial time algorithm for lattice problems?

Doesn’t that throw into question that entire path to post quantum security?

Auditooor at West Ham Defence
—
MSc. Student EPFL
—
CTF player w/ 0rganizers
—
Hacker & Cypherpunk
—
🌸

the world does not deserve you 10000 $degen ty

The problem I have with the quantum solutions to polynomial and basically trap door problems is that they assume the quantum solutions are already tractable - which they are not. They are a statement that says the solution is known for the infeasibility proof which to me is just a restatement of the proof.