Max Feldman (@_maxfeldman) header
Max Feldman (@_maxfeldman) profile picture

numbers guy building with YC F26

San Francisco, USA
Joined April 2021
Photo by Max Feldman (@_maxfeldman)
Excited to share that @asherdfeldman and I won first place overall at the Vibecheck formal methods hackathon yesterday! Had a great time meeting super cool people and learning from everyone there. We built Sound and Complete, a verified tool to help guitarists practice call-and-response blues. Thanks to @maxvonhippel, @qd_forall and everyone else who helped put on this fantastic event! There are some large winds and great people moving FM forward, excited for what is to come!
5
6
2
37
2,077
Today we’re launching Hue (YC F26). We give your agent a simulated version of the environment it works in, so you can test changes in realistic worlds and ship with confidence.
95
44
21
365
32,803
First they ignore you, then they laugh at you, then ...
Rumor is P = NP, specifically there is a promising route to 3-SAT in O(n^{808017424794512875886459904961710757005754368000000000})
24
53
2
1,985
118,213
Max Feldman retweeted
What?! P might equal NP after all...
Replying to @danintheory
The computer science collaboration will understand and explain a result concerning the Exponential Time Hypothesis (ETH), a longstanding conjecture about the computational complexity of Boolean formula satisfiability, a problem deeply related to the P vs. NP problem. Surprisingly, our system has recently proved that the ETH is false, a result that was subsequently verified in Lean. The refutation of the ETH reopens questions about how much faster these tasks could become, and may help guide the search for better algorithms. Finding such algorithms, and turning theoretical advances into practical improvements, will require significant further research. Our system found its natural language disproof for the ETH we reached out to to @rrwilliams. Ryan will form a collaboration with Russell Impagliazzo and Ramamohan Paturi to verify and shepherd this result. Impagliazzo and Paturi, along with Francis Zane, are the original proposers of the Exponential Time Hypothesis, and Williams has refuted strong versions of the ETH, used ETH for hardness results, and connected algorithms and lower bounds. This group asked us to make all raw data of the results public to facilitate independent verification by the community, which we have done by posting the natural language proof and Lean formalization to our GitHub repo. The group also invites the community to help organize an open examination of the ETH claim and to discuss the broader questions that AI-generated breakthroughs raise about verification, access, credit, and the future of research. github.com/openai/math/blob/…
27
28
3
618
51,953
Rumor is P = NP, specifically there is a promising route to 3-SAT in O(n^{808017424794512875886459904961710757005754368000000000})
107
148
91
4,553
796,947