Hey, how come when I try out the varyings rainbow I just get black? I did it exactly like you but I'm using a model I made in from Blender. Does it have something to do with transforms?
Thanks for helping bridge enthusiasts to start creating amazing experiences with WebGPU, all thanks to your passion for creating invaluable videos like this. Much love!
Hey man, great tutorial. I have a question. I was able to implement it in React Three Fiber up until the point where I have to inject my shaders into the ThreeJs materials. Any idea of how I can do that in React Three Fiber?
Idk man, I wasn't sure if it's faster to bounce off a pointer to the value, or to perform one entire multiplication every time I want a specific index. I went with an array of arrays approcach to access indeces simply by pointers instead of having extra calculations (multiplication is expensive).
@@danser_theplayer01 Fair. It could be faster as I haven’t done any performance testing. You brought up a good point 👍 However for building a tensor math system you need a buffer and a shape for flexibility. Also WebGPU only supports CS shaders up to 3 dimensions. For higher dimensional tensors we’re forced to flatten the array anyways.
Darn shame it's not supported in Node. I'm making some math package and I could really benefit from like a hundred distinct cores on the GPU instead of an average of 12 logical processors in a mid range computer CPU.
Congratulations for the very nice and informative tutorial. Love the way you used markdown to write into the video. Hope you get a lot of subs and likes you deserve it. Cheers 🙃
0:05 skill issue. You can at the very least rewrite standard javascript multiplication as an "instruction" loop of bitwise operations and that alone will speed up important game stuff like matrix multiplication. Imagine having to perform n^3 multiplications but now every multiplication is 20 times faster. That'd be great, much better than calling recursion for weird "faster" algorithms that remove only 1-2 multiplications in the end.
You must be doing something wrong with Rust, because it is not slower than C++ and certainly not slower than JavaScript. Maybe you are running an unoptimized debug build of your code, which can easily be 10x slower than an optimized release build. Or maybe you're implementing the algorithms in an inefficient way in Rust (for example, copying data unnecessarily when passing it to functions).
The rust code is available on github ( link in the description ). in my cargo.toml file: [profile.release] lto = true opt-level = 3 --------------- let me add that you may be right! I'm not that experienced with Rust. However I haven't been able to find why Rust is slow in this case.
I'm just experimenting and sharing the result... Lets have some fun 😉 Clarifications: 01:26 learn about hallucination vs confabulation: community.openai.com/t/hallucination-vs-confabulation/172639 www.beren.io/2023-03-19-LLMs-confabulate-not-hallucinate/
My biggest reason is that It reduces portability. I might not be able to use R3F in my other projects. I am also not in favour of installing a UI library to make a web game or experience.
0:13 "You can use it to render 3D objects using a technique called sphere tracing. Now the amount of games that get shipped every year with this technique is 0" The YT channel CodeParade made a game called Marble Marcher that uses this technique.
0:38 even Vulkan isn't totally considered as a "replacement" to OpenGL , people still uses OpenGL in their old/new project (if it's not much graphic demanding) bcoz Vulkan being more low level is too verbose and kinda tougher compared to OpenGL
