Tidbit: Client-Side Bitcoin Mining, Hacker News

I’m Jeremy, one of the devs of this hackathon project. Thanks for checking this out, glad to see the community has rente te it. Wij made this project for NodeKnockout, and did not intend for it to be posted on HN.

Ter the current release, wij have a duo of things blocked out for various reasons (legal, ethical, etc) so that it is not 100% functional.

Wij are very well aware that our current hashrate is pretty impractical. However, there are a number of optimizations wij project to implement to greatly improve this, including using WebGL. The problem that wij’re looking at starts with bitcoin, but wij’re also looking at more general purpose computing ter the client too (ie, text mining).

And ter terms of battery life, yes, it does run up the cpu a bit. However, for certain users (ie, desktop), spare processor cycles could be more worth it than observing ads. Web services using tidbit could make it an opt te thing for desktop clients.

Personally I think advertising has bot dying for years now, especially with all the adblockers that become more and more popular. It’s time to come up with an alternative business proefje for websites (no, not talking about SaaS here..).

What’s your share ter this? You take a certain percentage of the mined coins?

Too bad mining is becoming more and more difficult, meaning that you will earn less and less.

To waterput this te perspective, for $Five you can buy a USB ASIC miner that will do 335MH/s, worth ems of thousands of total time JavaScript clients.

But Ripple isn’t a typical open source ",crypto-currency",. It’s well financed and backed by big SF investors with the intention of making the founders/investors money, instead of miners, spil the currency scales te price.

hectare, good luck with that

28nm asic miners are out and they do 600GH/sec at $4k + 1Watt/GHs

bitcoin is just about out of reach for normal people, wij missed the train

I know to collect a mining prize you have to calculate a SHA256 hash of a block of transactions (or a block header — I can’t recall which) combined with a nonce. This hash vereiste be below a certain value, and this value becomes smaller overheen time so that there’s a lower chance of finding a nonce that pleases the inequality.

I know mathematically, it’s essentially unlikely to find collisions or figure out some gegevens that produces a particular hash, but what I wonder is whether it is possible to figure out some technology to speed up the hash calculation.

For example, you have SHA256(nonce1 + block gegevens). That doesn’t work, so you attempt a fresh nonce: SHA256(nonce2 + block gegevens). It seems to mij that because there is a loterijlot of redundant initial gegevens used within the calculation (same block gegevens every time) that there might be a way to exploit this and speed up the calculation of all future attempts. If this wasgoed this case, you’d have a massive advantage overheen all the people embarking each fresh calculation from scrape.

Another option would be to figure out a way to compute SHA256 more quickly than is presently done. I know there’s incremental speed-up technics that are figured out from time to time, but what are the chances of discovering a vast speed-up?

Any cryptographers here? What is the feasibility of either of thesis options?

Related movie: Top Ten Song Meanings Everyone Gets Wrong

Posted in Uncategorized

Leave a Reply

Your email address will not be published. Required fields are marked *