Show HN: GrahamBell – 如果区块链挖矿是这样的,你会挖吗?
1 分•作者: HurairahShamsi•4 个月前
Hi HN,
我一直在研究一种区块链设计,它在解决 51% 攻击问题上采用了不同的方法。它没有像传统系统那样通过硬件或资金来立即提高攻击成本,而是让攻击在结构上执行缓慢,进而使其代价高昂且难以长期维持。
核心思想很简单:(1)每个节点/身份在工作量证明过程中被限制在约 1 次哈希/秒,无论硬件如何(2)消除并行挖矿优势(无法共享工作量)(3)将影响力转移到持续的、持久的参与,而不是原始的算力(4)使批量生成女巫身份变得缓慢、昂贵且困难。
我已经构建了一个基于浏览器的 MVP,演示了受限工作量证明模型(作为参考实现):<a href="https://grahambell.io/mvp/Proof_of_Witness.html" rel="nofollow">https://grahambell.io/mvp/Proof_of_Witness.html</a>
这里还有一个简短的演示(受限工作量证明):<a href="https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY" rel="nofollow">https://youtu.be/i5gzzqFXXUk?si=y_Pv5ZDv9SGhRFjY</a>
网站:<a href="https://grahambell.io/" rel="nofollow">https://grahambell.io/</a>
好奇这种方法听起来是否有趣,或者您是否认为它立即就存在问题。
和平
查看原文
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