Anthropic
Nov 3, 2026

Anthropic opens residency program with annualized pay of up to $500,000 and no machine learning requirement

Anthropic said on Nov. 2 that it has opened applications for Anthropic Residency, a paid fixed-term research program aimed at experienced technical professionals who want to move into AI safety research. The company said applicants do not need a machine learning background, a PhD, prior ML experience, or published papers. The program offers three duration options — six weeks, three months, and six months — with annualized compensation ranging from $350,000 to $500,000, paid on a prorated basis depending on the term, plus benefits. Anthropic said participants will be matched one-on-one with a researcher, receive time for self-study and lectures, and get access to frontier models and dedicated compute. The company prefers participants to work from its San Francisco office, though remote participation is also accepted, especially for shorter placements. Anthropic said the program extends its earlier Anthropic Fellows initiative and is now focused on established technical leaders, including professors in quantitative fields, technically trained founders, and staff-level senior engineers.

440
Anthropic opens residency program with annualized pay of up to $500,000 and no machine learning requirement
Ledger
Oct 30, 2026

Ledger CTO flags two cryptographic advances as potential risks to Bitcoin elliptic-curve security

Ledger Chief Technology Officer Charles Guillemet said in a post on X that two recent developments in cryptography are raising questions about the long-term security of Bitcoin and other cryptocurrencies. The first involves a theoretically more efficient subexponential-time algorithm for solving the elliptic curve discrete logarithm problem. Guillemet said the method currently applies only to hypothetical curves of extremely large size and does not threaten existing cryptographic schemes in practice. The second concerns major gains in the efficiency of quantum-computing attacks. One study, he noted, estimates that in theory fewer than 30,000 physical cat qubits could break Bitcoin’s secp256k1 cryptography in about an hour. He also said that fault-tolerant quantum computers capable of doing this do not yet exist. The report was cited by U.Today and carried by Techub News.

630
Ledger CTO flags two cryptographic advances as potential risks to Bitcoin elliptic-curve security
Ethereum
Oct 30, 2026

Ethereum co-founder says improved 3-SAT algorithms could threaten hash preimage security

Techub News reported that Ethereum co-founder @dankrad said hash-based cryptography would not be exempt from the same class of risk if improvements in subexponential 3-SAT algorithms prove effective on real-world problem sizes. In his post, he argued that if those advances work in practice at meaningful scales, they could likely also be applied to finding preimages for hash functions. He also cited an analysis on recent progress in the elliptic-curve discrete logarithm problem. According to that analysis, the new results only make group structure usable when curve sizes become extremely large. That threshold, he said, is far beyond the curves currently used in practice, meaning the development has no impact on existing curves at this stage. The remarks draw a distinction between a theoretical risk path for hash-based systems and the current practical limits of the elliptic-curve result referenced in his post.

620
Ethereum co-founder says improved 3-SAT algorithms could threaten hash preimage security
Consensys
Oct 30, 2026

Consensys says new subgroup membership check boosts FourQ performance by about 10.8x

Consensys said its cryptographer Youssef El Housni, working with collaborators from Wuhan University of Technology, KU Leuven, and the National Academy of Sciences of Belarus, has introduced a new subgroup membership testing method called Divide-and-Pair. The method targets curves such as Curve25519, where not every point belongs to the target subgroup and skipping the check can expose implementations to small-subgroup attacks. Consensys noted that NIST P-series curves have prime order and do not require this check. According to the company, the new approach treats two existing methods as opposite ends of the same parameter range and selects the best setting for each curve, with performance no worse than prior techniques. Reported speedups were about 1.6x for Curve25519, 1.3x for Curve448, 1.4x for GC256A, 10.8x for FourQ, and 7x for Jubjub. Consensys also said the method has been integrated into the open-source gnark-crypto library, which is currently used in Besu, Linea, go-ethereum, and gnark-based systems including Succinct and Lighter. The related paper has been accepted by IACR Transactions on Cryptographic Hardware and Embedded Systems and is set to appear at CHES 2027.

930
Consensys says new subgroup membership check boosts FourQ performance by about 10.8x
Consensys
Oct 30, 2026

Consensys says new elliptic-curve security check algorithm is now in gnark-crypto

Consensys said a new cryptographic method called Divide-and-Pair has been published by its cryptographer Youssef El Housni together with researchers from Wuhan University of Technology, KU Leuven’s COSIC lab, and the National Academy of Sciences of Belarus. The method is designed to speed up subgroup membership testing in elliptic-curve cryptography, a check used to defend against small-subgroup attacks and one that is required on non-prime-order curves such as Curve25519. According to Consensys, the new approach is no slower than the two mainstream methods currently used across different curves. It reported speedups of about 1.6x on Curve25519, 1.3x on Curve448, 1.4x on GC256A, 10.8x on FourQ, and 7x on Jubjub. The company also said the method has already been integrated into its open-source cryptography library gnark-crypto, which is used by Besu, Linea, Geth, and gnark-based systems including Succinct and Lighter. The paper has been accepted by IACR Transactions on Cryptographic Hardware and Embedded Systems, or IACR TCHES, and is scheduled to be presented at CHES 2027.

1040
Consensys says new elliptic-curve security check algorithm is now in gnark-crypto
Bitcoin
Oct 29, 2026

Study estimates 29,588 physical qubits could break a Bitcoin key in about an hour

A research estimate cited by Odaily says a fault-tolerant quantum computer with about 29,588 physical qubits could solve the 256-bit elliptic curve cryptography problem used by Bitcoin in roughly 61.8 minutes. The same study estimates that 22,593 physical qubits could break RSA-2048 in about 3.14 days. The work was described as a theoretical resource estimate rather than evidence that current quantum machines can already perform such attacks. According to the report, the calculations used cat qubits designed to reduce quantum errors, along with more efficient error-correcting codes and improvements to Shor’s algorithm. The study also noted that if a sufficiently powerful quantum computer could derive private keys from already exposed public keys, affected Bitcoin could face unauthorized signatures and theft risk. It added that the estimated attack time is still longer than Bitcoin’s average block interval of about 10 minutes, while around 6.9 million BTC may be exposed because their corresponding public keys have already been revealed.

550
Study estimates 29,588 physical qubits could break a Bitcoin key in about an hour
OpenAI
Oct 28, 2026

OpenAI unveils three AI-generated research results spanning ETH, quantum field theory and the Kakeya conjecture

OpenAI said on Oct. 26 that its internal models produced three research results across computer science, physics and mathematics, touching long-standing foundational questions in each field. The company described the documents as "raw research outputs" and said the academic community is being invited to verify, interpret and build on them. In computer science, OpenAI said its system proved the Exponential Time Hypothesis, or ETH, false, and that the result was later verified in Lean. The company stressed that this ETH refers to the complexity-theory hypothesis, not Ethereum. MIT professor Ryan Williams, according to the report, had asked OpenAI to examine whether the result could affect cryptographic systems, and OpenAI concluded with some confidence that it does not imply existing cryptosystems have been broken. In physics, OpenAI said the model produced rigorous existence proofs for pure Yang-Mills theory, quantum chromodynamics and a grand unified theory containing Standard Model gauge fields, though only the Yang-Mills portion has completed Lean verification. In mathematics, the company said its model proved the local smoothing conjecture in all dimensions, which in turn resolves the Kakeya conjecture and the Stein restriction conjecture in all dimensions. OpenAI also said it does not claim academic credit for discoveries generated by internal models, while noting a previously announced $5 million donation to the Simons Foundation to support workshops, conferences and related programs.

550
OpenAI unveils three AI-generated research results spanning ETH, quantum field theory and the Kakeya conjecture
Ethereum
Oct 27, 2026

Ethereum developer dankrad says cryptography could remain viable even if P=NP

Ethereum developer dankrad argued in a post on X that complexity classes are highly theoretical and do not, by themselves, determine whether an algorithm is practical in the real world. He said the real-world gap between n^1000 and 2^n depends heavily on constants, even though the former sits in P and the latter in EXP. He added that cryptography could still remain workable even if P=NP, provided a reduction increases the exponent by 1000 times. In his view, real cryptographic systems are not secured by abstract theoretical assumptions alone, but by the amount of resources required for the best known attacks. dankrad also said he is more concerned about AI uncovering concrete security breaks than about theoretical advances such as breaking exponential-time assumptions.

690
Ethereum developer dankrad says cryptography could remain viable even if P=NP
Total 127 items
Go topage