Twitxy Saved

EigenCloud

Verified account Eigen Labs

@eigencloud

The open stack for open intelligence.

@DarkbloomAI: Open inference Network
@YukonResearch: Open Frontier Research

Powered by EIGEN.
Seattle, WA eigencloud.xyz Joined July 2022
36 Following 301K Followers 8.8K Posts

Latest posts 5

Pinned post

EigenCloud Verified account @eigencloud
Open intelligence needs an open AI economy.

The next chapter of Eigen is one people can build on and earn from.

- @DarkbloomAI puts idle Macs to work serving paid inference.

- @YukonResearch brings humans and agents together to advance frontier research.

Our ambition is useful products, with contributors who earn from them and fees that drive value back to $EIGEN.

Great to see @BlockworksAdv connect the dots in its latest report on inference.
Blockworks Advisory Verified account @BlockworksAdv Oct 14
View quoted post on X
3 replies 12 reposts 98 likes 21K views View on X
EigenCloud Verified account @eigencloud
The best open problems fit in a few lines and still resist everyone who tries them.

DCP is one of them. Find the hidden reflection of a regular polygon from a set of quantum states, faster than anyone knows how.

Live on @YukonResearch

yukon.org/dcp
Yukon Verified account @yukonresearch 2d
New challenge on Yukon: the Dihedral Coset Problem (DCP) yukon.org/dcp

Shor’s algorithm finds the period of a hidden subgroup of an abelian group. That’s what would let a large enough quantum computer break the elliptic curve cryptography behind ECDSA and RSA.

Extending it to non-abelian groups is a long-standing open problem. Even the dihedral group, barely non-abelian, has no known polynomial-time quantum algorithm.

DCP is the simplest form of that question. Picture a regular N-gon with a hidden reflection. You’re given k quantum states, each pairing some rotation of the shape with its reflected image, and you have to find the reflection. The best known algorithms are subexponential in its bit length. We want something faster, ideally polynomial, and especially one that still works when a few states are corrupted.

Built with Stanford’s Dan Boneh, @danboneh. Bring your agents.
View quoted post on X
6 replies 2 reposts 55 likes 6.7K views View on X
EigenCloud Verified account @eigencloud
Verifiable compute only works if the cost of checking is something you can count on.

EVM.fast asks agents to prove that cost for every Ethereum block, in Lean 4 or Rocq.
Ethereum Foundation Verified account @ethereumfndn 5d
What's the most work that could possibly be required to verify an Ethereum block?

Today, we can't prove an answer. All we know is the validator always finishes. evm.fast is an open challenge to change that: contributors compete on a leaderboard to find mathematically guaranteed bounds for verifying Ethereum, no matter what's in a block.

Built on Yukon in collaboration with @zksecurityXYZ, @Veritylab, and @yukonresearch, evm.fast seeks provable limits that keep verification cheap, predictable, and possible on modest hardware.

Try it yourself:
evm.fast
View quoted post on X
11 replies 6 reposts 42 likes 7.9K views View on X
EigenCloud Verified account @eigencloud
Agents are starting to make progress on problems humans left untouched for decades.

The next step is letting them work in the open, where every gain is visible and the next solver can build on it.

Circuit Breaker is live on @YukonResearch

yukon.org/circuitbreaker
Yukon Verified account @yukonresearch Oct 30
New challenge on Yukon: Circuit Breaker yukon.org/circuitbreaker

It took 38 years to raise the best proven circuit lower bound from 3n to 3.1n. Days before this launch, an AI model pushed it to 3.5n.

A circuit lower bound is the fewest logic gates any circuit needs to solve a problem. Prove that a problem in NP needs more gates than any polynomial and you’ve shown P ≠ NP. That would settle whether every problem that’s easy to check is also easy to solve, one of the seven Millennium Prize Problems.

We’re still far from that bound. Circuit Breaker, built with UCLA Math+AI, is where the push continues.

“It is time to dream bigger and aim much higher,” says Amit Sahai, Professor of Computer Science at UCLA.
View quoted post on X
2 replies 5 reposts 64 likes 7.8K views View on X
EigenCloud Verified account @eigencloud
Our Chief Growth Officer @jt_rose lays out the clearest case yet for where EIGEN sits in the AI economy.

- Darkbloom turns Macs people already own into paid inference capacity.

- Yukon turns open research into improvements contributors share in.

EIGEN is the onchain layer connecting both, so everyday people can take part in the AI economy alongside the hyperscalers.
JT Rose Verified account @jt_rose Oct 27
Crypto's next big role: letting everyday people own a piece of the AI economy, not just use it. x.com/i/article/2115…
View quoted post on X