展示HN:GrahamBell – 如果区块链挖矿看起来是这样的,你会参与挖矿吗?
嗨,HN,
我一直在研究一种区块链设计,它对51%攻击问题采取了不同的处理方式。与传统系统通过硬件或资本使攻击瞬间变得昂贵不同,这种设计使攻击在结构上执行起来缓慢,从而使其在时间上变得成本高昂且难以维持。
核心思想很简单:(1) 每个节点/身份在工作量证明(Proof-of-Work)过程中限制为约1个哈希/秒,无论硬件如何;(2) 消除并行挖矿的优势(没有工作是可以共享的);(3) 将影响力转向持续的、持久的参与,而不是单纯的哈希算力;(4) 使生成大量Sybil身份变得缓慢、昂贵且困难。
我构建了一个基于浏览器的最小可行产品(MVP),演示了这一限制工作量证明模型(作为参考实现):[https://grahambell.io/mvp/Proof_of_Witness.html](https://grahambell.io/mvp/Proof_of_Witness.html)
这里还有一个简短的演示(限制工作量证明):[https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY](https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY)
网站:[https://grahambell.io/](https://grahambell.io/)
我很好奇这种方法对你来说是否听起来有趣,或者是否立刻就被认为是有缺陷的。
祝好!
查看原文
Hi HN,<p>I’ve been working on a blockchain design that takes a different approach to the 51% attack problem. Instead of making attacks instantly expensive through hardware or capital (as in traditional systems), it makes them structurally slow to execute, which in turn makes them costly and difficult to sustain over time.<p>The core idea is simple: (1) Each node/identity is limited to ~1 hash/sec in the Proof-of-Work process, regardless of hardware (2) Remove parallel mining advantages (no work is sharable) (3) Shift influence toward sustained persistent participation rather than raw hashpower (4) Make generating sybil identities (in bulk) slow, costly, and difficult.<p>I’ve built a browser-based MVP demonstrating the capped PoW model (as a reference implementation): <a href="https://grahambell.io/mvp/Proof_of_Witness.html" rel="nofollow">https://grahambell.io/mvp/Proof_of_Witness.html</a><p>There’s also a short demo here (Capped PoW) : <a href="https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY" rel="nofollow">https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY</a><p>Website: <a href="https://grahambell.io/" rel="nofollow">https://grahambell.io/</a><p>Curious whether the approach sounds interesting, or immediately broken to you.<p>Peace