←
Max Resnick9,816 posts
Max Resnick avatar✓

Max Resnick ✓

@MaxResnick

Artisanal magic state cultivation and distillation

◷ Joined June 2020▧ 642 Photos and videos
Kyle Samani avatar
⟳ Max Resnick retweeted
Kyle Samani@KyleSamani·Nov 16

In addition to my traditional annual Breakpoint shoes, this year I also have a Solana Watch!

Post attachmentPost attachment
Max Resnick avatar
Max Resnick@MaxResnick·Nov 15

It is a common misconception that the office of pontifex maximus which Caesar famously held in Rome is the same as the one which the Roman catholic popes now bear. In fact this is only an accident of nomenclature. According to Livy, king Numa appointed Numa Marcius as first pontifex circa 712 BC "Pontificem deinde Numam Marcium Marci filium ex patribus legit eique sacra omnia exscripta exsignataque attribuit, quibus hostiis, quibus diebus, ad quae templa sacra fierent, atque unde in eos sumptus pecunia erogaretur." Livy, Ab Urbe Condita 1.20.5 "Then he chose as pontifex Numa Marcius, son of Marcus, from the fathers, and to him he assigned all the sacred rites, written out and sealed: with which victims, on which days, at which temples the rites should be performed, and from where money should be paid out for those expenses." But livy doesn't apply the full title until he describes Quintus Furius creating the tribunes of the plebs. Circa 449 BC "Factum senatus consultum ut decemviri se primo quoque tempore magistratu abdicarent, Q. Furius pontifex maximus tribunos plebis crearet; et ne cui fraudi esset secessio militum plebisque." Livy 3.54.5 A decree of the senate was made that the decemvirs should resign their magistracy at the earliest possible time, that Quintus Furius, pontifex maximus, should create tribunes of the plebs, and that the secession of the soldiers and the plebs should be a cause of harm to no one. In 254 BC Tiberius Coruncanius is the first in the unbroken line of Roman pontifex maximi. Lucius Caecilius Metellus, c. 243BC Lucius Cornelius Lentulus Caudinus, 221 Publius Licinius Crassus Dives, 212 Gaius Servilius Geminus, 183 Marcus Aemilius Lepidus, 180 Publius Cornelius Scipio Nasica Corculum, 150 Publius Cornelius Scipio Nasica Serapio, 141 Publius Licinius Crassus Dives Mucianus, 132 Publius Mucius Scaevola, 130 Lucius Caecilius Metellus Delmaticus, 114 Gnaeus Domitius Ahenobarbus, 103 Quintus Mucius Scaevola, c. 89 Quintus Caecilius Metellus Pius, c. 81 Gaius Julius Caesar, 63 Marcus Aemilius Lepidus (the triumvir), 44 After Lepidus died, Augustus took the office and it was passed down to each of the Roman emperor in turn until Gratian, a Christian emperor dropped the title in 382 AD. From 382- 1400 nobody held the title of pontifex maximus until the pope assumed it as an honorific.

Max Resnick avatar
Max Resnick@MaxResnick·Nov 15

Pittsburgh TE Darnell Washington is currently a starter in just 4% of espn leagues. With Friermouth added to the injury report Saturday due to illness, he could look to gain meaningful TE route share. Currently both Friermouth and Washington are projected about 8 points for tonight's game. If Friermouth doesn't play, Washington could be TE3-4 territory.

Post attachment
Max Resnick avatar
Max Resnick@MaxResnick·Nov 14

Emmet Johnson is the chiefs rb1 this week with both other backs on the active roster likely not playing this weekend and he is probably on waivers in your league

Post attachment
Stefano Gogioso avatar
⟳ Max Resnick retweeted
Stefano Gogioso@StefanoGogioso·Nov 9

This is the most important point to keep in mind in the Aaronson-Ambanis discussion, in my opinion. In "Verifiable Quantum Advantage without Structure" (arXiv:2204.02063), Yamakawa and Zhandry show that, relative to a random oracle, there are NP search problems that are in FBQP (solvable in quantum polytime), but not in FBPP (solvable in classical probabilistic polytime). In particular, they show that there exist functions that are one-way / collision resistant against classical adversaries, but are easily inverted by quantum adversaries. Replacing the random oracle with a concrete cryptographic hash function then yields plausible Minicrypt instantiations.

Henry Yuen avatar
⟳ Max Resnick retweeted
Henry Yuen@henryquantum·Nov 7

This is too strong of an interpretation, for a couple reasons. First, Aaronson-Ambainis compares quantum vs classical algorithms when they have access to an idealized, perfectly unstructured black box oracle. All cryptographic hash functions are not black box and definitely not unstructured (because their source code is succinct and public). We should be very wary about transferring conclusions about random oracles to concrete hash functions. Second, Aaronson-Ambainis is about decision problems concerning the black box oracle. We now know there is no exponential quantum advantage for decision problems on unstructured oracles. On the other hand, search problems are a completely different story. We know there can be exponential quantum advantage for solving search problems related to unstructured oracles; this is the famous Yamakawa-Zhandry result from 2022. This second item is particularly relevant to breaking hash functions, where you want to do things like "Find me a preimage -- any preimage -- of this hash value".

Miranda Christ avatar
⟳ Max Resnick retweeted
Miranda Christ@miranda__christ·Nov 4

Happy to be a part of this project. zk proofs of inference are a key tool for AI safety, and I'm excited to see the protocol improved & used in applications (the code is public!)

Craig Gidney avatar
⟳ Max Resnick retweeted
Craig Gidney@CraigGidney·Nov 4

Between the 2024 draft and the 2026 finalization of NIST IR 8547, the estimated qubit cost of quantum attacks dropped by >100x. The final document still recommends the same PQC timeline (deprecate by 2030, disallow by 2035). csrc.nist.gov/pubs/ir/8547/f…

Max Resnick avatar
Max Resnick@MaxResnick·Oct 31

Rutgers should not timeout here. It gives Michigan the chance to take a shot and still run it out

Craig Gidney avatar
⟳ Max Resnick retweeted
Craig Gidney@CraigGidney·Oct 29

On the cat qubit factoring paper: as with most of Élie's estimates, it comes down to whether you buy the insane upfront assumption. This time the assumption is LITERALLY ZERO bit flip errors. The algorithmic work looks good, the conclusion follows, but brother what a premise.

Alejandro avatar
⟳ Max Resnick retweeted
Alejandro@alranpe·Oct 28

Can't miss it: Key players in the industry have gotten together to answer critical questions on MCP by creating the first workshop on Multiple Concurrent Proposers is happening at Financial Cryptography 2027, Barbados, Feb 12. MCP lets many validators propose at once instead of one leader per block: fair market access and censorship resistance. Submit talks or papers by Nov 24 AoE! fc27.ifca.ai/mcp/cfp.html

Post attachment