Do not put any faith in AI generated code. For example AI will never guess that filling bloomfilter with multiple threads requires no mutex locks. Since the resulting files from one thread and multiple threads will be binary equal.
Can you explain why a mutex is not required? What if 2 threads need to update different bits of the same byte? Sounds like a race condition to me.
What he said is technical misleading. A mutex might not strictly be necessary if you use atomic operations, but you need some synchronization, otherwise its data race and therefore undefined behaviour in C++/C.
Im not claiming to be any good at coding (even though I coded when since I was 12 and I have an education in it) - but that statement from Alexander was just misleading.
Btw, thanks for your answers on my rust question weeks back. You were 100% right. Batched affine point addition (using montgomerys trick) is the fastest possible way to generate as many points as possible - thats pretty much what JLP/Cyclone (what everybody talks about nowadays) is doing. I implemented Montgomerys trick on affine points (in montgomerys form) and surprise surpise - 44 Mkeys/s (with avx2 sha2/ripemd) - so pretty much on par with cyclone - except for the fact Ive implemented the math myself using a highly optimized C library - and the code does not suck that hard like on Cyclone.
take care