4 ms·
Yes, so does WebGL and with the same efficiency. Partial hash inversion is an embarrassingly parallel problem: computing a hash from a random number is indepen
by kangz 6y ago
Yes, so does WebGL and with the same efficiency.
Partial hash inversion is an embarrassingly parallel problem: computing a hash from a random number is independent from the other random numbers you want to compute hashes for, also it is a computation bound problem and not memory bound. It means you can build a fairly efficient partial inverse finder by running many fragment shaders ("pixels") in parallel and only drawing the one that finds it. This is doable in WebGL today.
A key feature of WebGPU is compute shaders which sound like they can compute stuff so they would be better at hashing. But actually compute shaders give more flexibility which makes it possible to handle problems that are a bit less parallel, and they help optimize memory-bound programs (but don't help for computation bound programs). So compute shaders make it slightly less code to do a partial inverse finder, but do not make it dramatically more efficient.
So to answer your implicit point: no WebGPU won't unlock capabilities that will lead to a rise in ads mining Bitcoin. (though it could maybe help for Ethereum mining)
- snissn 6y agoCan you share an example or tutorial?
- grovesNL 6y agoThere are some resources for wgpu-rs linked from the blog post (such as https://sotrh.github.io/learn-wgpu/ https://sotrh.github.io/learn-wgpu/). There are also some tutorials available that demonstrate how to use the browser API directly: - Raw WebGPU https://alain.xyz/blog/raw-webgpu https://alain.xyz/blog/raw-webgpu - Get started with GPU Compute on the Web https://developers.google.com/web/updates/2019/08/get-started-with-gpu-compute-on-the-web https://developers.google.com/web/updates/2019/08/get-starte...