TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask HN: Cryptocurrencies – POUW (proof of useful work)

18 点作者 danielEM大约 4 年前
That topic is bugging me for a little while. Anyone who follows me (probably 0 people ;-) ) knows already that I&#x27;m not a fan of cryptocurrencies. And I&#x27;m not gonna dive into that here. Instead I&#x27;ll try to solve one of its issues - it produces CO2 for &quot;nothing&quot;. All computations it does is actually worthless, just bunch of bytes that people find precious itself.<p>So here is the idea:<p>Lets say we have a computational problem to solve and limited resources to solve it. The task would be to get as good as possible result for the problem within these limited resources. And every progress (getting better result from previous) would be gratified with &quot;hash&quot; coin based on proof of useful work.<p>Lets give a practical examples:<p>We want a video codec and best possible image quality on limited bandwidth, limited computational cycles on &quot;virtual machine&quot;, limited code size and limited RAM resources. Library of wisely selected videos would be a reference for measurement of image quality. Every improvement in overall quality would be gratified with &quot;hash&quot; of the code. As long as final result fits within limited resources the algorithm of improving would not matter (machine learning&#x2F;genetic algorithms ...) and be a subject of &quot;manual&quot; earnings.<p>Nearly same would be for audio codecs.<p>And then we would go for other important problems to solve for humanity - treatments for cancer, objects and voice recognition and so on...<p>What do you think about it? I will call it POUW (proof of useful work)

10 条评论

dboome大约 4 年前
Any value, economically, that your &quot;useful&quot; work provides must be subtracted from the network&#x27;s overall security. i.e. if you devise work so useful that people will pay for its computation, than any attacker can use that value to subsidize their attack on the network.<p>Currently if you were to buy enough hardware to attack bitcoin, for example, after the attack your hardware (which would have to be ASICs) are useless garbage, as the network would be devalued after attacking it and the hardware serves no other purpose. If I can then pivot to computing something of value, this economic hurdle isn&#x27;t as expensive.
评论 #27245241 未加载
aranchelk大约 4 年前
The point of all of that hashing is to guarantee that transactions can’t be reversed (finality). A blockchain is a directed graph, for it to be a single irreversible source of truth, some mechanism has to force it to have a linear topology. Your ideas are interesting, but I can’t see how any of your examples could be used to achieve that topology.<p>Also, the “POUW” examples you have are incredibly slow, developing codecs is going to take at least days, more likely weeks, months, or even years, meanwhile users will have transactions that need to be settled.<p>You mentioned CO2 in your statement about disliking cryptocurrencies but there are many currencies that do not utilize proof-of-work, instead using other schemes (e.g. proof-of-stake), I’m curious if you dislike those as well.
emteycz大约 4 年前
Surely many people had similar POUW ideas - I myself had that thought in 2011 when I first heard of Bitcoin as I was doing Folding@Home back then - any idea why isn&#x27;t it in common usage now? It makes me think there are serious hurdles to overcome (not my area of expertise...).
评论 #27225385 未加载
karmakaze大约 4 年前
It&#x27;s not a bad thought, though there are a number of challenges. One thing PoW has going for it is that the difficulty of computation is well known and easy to adjust.<p>Specifically for the codec cases, it&#x27;s not that we can&#x27;t come up with better codecs, but that they require more computational resources to encode and even decode. We have ones now that are still a bit much for mainstream and using bandwidth&#x2F;storage is a better market fit. As for the &#x27;overall quality&#x27; this is subjective. Anything objectively defined is optimizing for something humans may not appreciate.<p>So what we&#x27;re talking about is generalizing the hard to compute, easy to verify of finding hashes to other computations that are useful to some parties--a computational market. I do rather like this, like kickstarter for computation. A problem gets posted, with a verifier. People can choose which ones they want to sponsor and how much. Solvers can choose which problems to solve.<p>Even thinking this through, I think it&#x27;s still useful to have a PoW hash-based blockchain just to record the first solutions. So we&#x27;re back to being limited in the number of solutions we can record per second.
ezekg大约 4 年前
Although it&#x27;s true that BTC&#x27;s energy consumption is bonkers, with this definition, nearly every computation is useless. Hacker New&#x27;s cryptographically verifying your account&#x27;s password hash so that you can post this opinion was Proof of Useless Work. Why not spend those CPU cycles on curing cancer?<p>Because that&#x27;s simply not how the world works. Not everything needs some grand purpose.
randomhodler84大约 4 年前
Sorry, doesn’t work. Useful work is not “useful”. It is too difficult to meter correctly for anything beyond a trivial case, and too unknown for security modeling. Primecoin. Riecoin. Gridcoin. It’s been tried. It’s not a new idea, it doesn’t work.
评论 #27230954 未加载
danielEM大约 4 年前
Started a new github project for this idea: <a href="https:&#x2F;&#x2F;github.com&#x2F;DanielMazurkiewicz&#x2F;usefull-coin" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;DanielMazurkiewicz&#x2F;usefull-coin</a>
评论 #27234870 未加载
hulug大约 4 年前
I&#x27;m no POW fan, but validating transactions is one of the most &quot;useful&quot; things to do.
评论 #27240949 未加载
aristofun大约 4 年前
Great line of thought.<p>But let’s find some meaningful problems that come down to relatively simple calculations fist.
评论 #27227423 未加载
memming大约 4 年前
The problem of estimating algorithmic complexity comes to mind. Easy to verify, hard to improve.