Ethereum OG Sells 1,500 $ETH ($3.48M) From $0.31 Purchase Stash

Machi(@machibigbrother) has lost all his money on @papertrade_xyz! He also has just $4,517.7 left on Hyperliquid. An hour ago, he sold another Mutant Ape at a loss to fund more trading.

According to an official announcement, Binance will adjust the minimum price increment (TickSize) of BLURUSDT and QUSDT linear perpetual contracts at 14:30 Beijing Time on October 28, 2026. Specifically, BLURUSDT’s TickSize will be adjusted from 0.00001 to 0.000001, while QUSDT’s TickSize will be adjusted from 0.000001 to 0.00001. This adjustment will not impact U-margined contract trading operations, and existing orders will remain unaffected.

According to Scam Sniffer’s monitoring, a user’s Ethereum and Base network assets were stolen due to an alleged private key leak, resulting in total losses of approximately $1.58 million. The attacker transferred 682 ETH within less than two hours, and around 281 of those ETH were subsequently sent to Tornado Cash.

On-chain analyst Ai Yi has monitored that address 0x721…E5991—marked by Arkham as an address linked to Justin Sun—withdrew 4.65 trillion PEPE tokens (valued at approximately $20.32 million) from Poloniex 10 hours ago. Since October 17, this address has transferred out a total of $48.76 million worth of PEPE, currently holds 11.8 trillion PEPE tokens, has an average withdrawal price of $0.000004114, and an unrealized profit of $2.085 million.

According to Lookonchain's monitoring, two whales that had been dormant for roughly three years deposited a total of 2,571 BTC into Coinbase Prime 10 hours ago, worth approximately $206.52 million.

OpenAI recently announced that its AI model has "cracked" ETH, a news that quickly sparked heated discussions in both the tech and crypto communities. It is important to note that the ETH here is not the widely known Ethereum cryptocurrency, but rather a key conjecture in computer science that has existed for over two decades: the Exponential Time Hypothesis (ETH). The core question of the Exponential Time Hypothesis is: how "extremely difficult" are problems that appear computationally hard? Take the SAT problem (Boolean satisfiability problem), which many have heard of, as an example: it asks, given a set of logical conditions, can you find an assignment that satisfies all conditions at the same time? As the problem scale grows, the best known approach basically has to test all possible answers one by one, with time complexity increasing exponentially with the scale—this is what we commonly call "exponential time". The Exponential Time Hypothesis further asserts that such problems are inherently incapable of being significantly accelerated, and no truly efficient "sub-exponential time" algorithm exists for them. Since its proposal in 1999, this hypothesis has been a cornerstone of theoretical computer science. Hundreds of papers have used it as a basis to prove that "certain problems are hard" and "certain algorithms are near-optimal". If the Exponential Time Hypothesis is disproven, it would mean that many problems we thought were "almost impossible to solve faster" might theoretically have better solutions. OpenAI claimed that its model has found a deterministic algorithm that can accurately count the number of solutions to the k-SAT problem in sub-exponential time, and has conducted formal verification via Lean. If this result ultimately passes expert review, it will directly undermine the Exponential Time Hypothesis.