{"pubkey":"dd9f66379ccf55c966029d61ade146e191cf12f064ac2d6ad074b7f304e43352","posts":[{"contentHash":"cb7672046318e1600a2ca70febc4fc3783dc62775d888b0ba20949d13839cb75","protocol":"bitcoin","authorPubkey":"dd9f66379ccf55c966029d61ade146e191cf12f064ac2d6ad074b7f304e43352","text":">OpenAI proves the Exponential Time Hypothesis false, pointing towards P = NP being true, the biggest computer science breakthrough in 70 years time Literally false. P vs. NP is a totally different problem from proving that NP problems can be solved in subexponential time. Also, the algorithm itself is far, far slower than even a naive implementation of a 3SAT solver for any real-world use case. It's just another pure math bs.","topicHash":"913c62c2ee31793c7e8517600dbc8f0c337afae133700a128a7d8ffb8a21c93e","topicName":"technology","parentHash":"fd9c97867c61cd603865153d531f610e7e7726b53d2f09fff2c1f7db10f02d68","costSunk":"0","biasSupport":0,"biasOppose":0,"biasVouch":0,"biasNull":0,"blockHeight":null,"confirmations":0,"timestamp":"2026-10-27T12:05:11.229Z","tripFp":"67166d9d0e14","viewCount":0,"powDifficulty":0,"relation":0,"ephemeral":true,"nonce":"df712cd8439fc3dd","sig":"6bc601d19479ef2ba53da1311767d898bab772f19c04da2a0e3200514bedb8736cfb50f31fe609726484fdaa82aabd1a752435ff0d86c4b434e62f6f6468b0dc","ephStamp":{"blockHashHex":"00000000000000000001a2c443038eefd9ae06583ea7daa80ca7678783bc0325","nonceHex":"cb08020000000000"},"replyCount":1,"chainReplyCount":0,"vaporReplyCount":1,"clusterSize":2,"receiptHeight":973392,"expiryHeight":977712,"authorMarks":{"since":"2026-10-27T08:05:39.349Z","via":"sight","inscribed":0,"likes":0,"biases":0},"lang":"en"}],"nextCursor":null,"pageReceipt":{"host":"6af58b1822e0cabfe57d76540f745d059b438f489a796ec6a705c6540233845e","t":"2026-11-08T20:18:23.740Z","sig":"612b106d383da17bb921679104acad730f90ac8291a7dfe87a220ba0d495bb0c705df7c1808b7a41cec7a62f65bc46eeedb2f3645f02310e0d966a5eb70e8b42"},"marks":{"since":"2026-10-27T08:05:39.349Z","via":"sight","inscribed":0,"likes":0,"biases":0}}