Congrats to conjectures and the SN66 miners.
About SN128 ByteLeap
byteleap.ai@byteleap_aiCongrats to conjectures and the SN66 miners. Erdős Problem 96 sat open for 66 years. The construction shows strictly convex polygons can have superlinearly many unit-distance pairs, and the Lean kernel checks the file. This is the part that matters: same statement for everyone, any method allowed, settlement by a proof assistant, payment for a result that enters the record.Benchmarks have answer keys,Open problems don’t. That asymmetry is why Bittensor can fund real research instead of leaderboard theater. More of this, and the network’s case gets stronger. I’m more constructive on Bittensor’s future after seeing it.
Quoting @conjectures_io
Today, we’re announcing a solution found by our miners to Erdős Problem 96, open for over 66 years. The result disproves the conjectured linear bound, constructing strictly convex polygons with superlinearly many unit-distance pairs. Verified in Lean through Conjectures. Full proof below.
SN128 ByteLeap at a glance
SN128, ByteLeap (α token න), is one of the independent markets on the Bittensor network, each with its own α token and its own price. Its α currently trades at 0.002800 τ (≈ $0.85), against 4,032 τ of pool liquidity. On-chain, the best-delegated validator on it yields about 34.99% APR (simple) and 41.89% APY (compounded), emissions add 0.000085 τ to the pool each block, epochs run every 360 blocks. It was registered at block #5,856,038.
More from SN128 ByteLeap
Taosis indexes announcements, articles, posts and releases about Bittensor subnets from their own channels and keeps a record of each. The text above is the source’s; the figures are read from the chain by Taosis.