clearprop

5 ms·

1. 1.▲
   Designing Critical Systems. Airplanes, Medical Devices, and Blockchains(alvarorevuelta.com)

   5 points by clearprop 1y ago|1 comments
2. 2.▲
   Using a Real Quantum Computer for Ethereum Keys(alvarorevuelta.com)

   1 points by clearprop 2y ago|0 comments
3. 3.▲
   Ergodicity and Stationarity. Luck but Not for You(alvarorevuelta.com)

   6 points by clearprop 2y ago|0 comments
4. 4.▲
   by clearprop 2y ago

   I thought Rust was thread-safe and I don't see any "unsafe" blocks. What am I missing?
5. 5.▲
   by clearprop 2y ago

   Indeed, updated: https://github.com/alrevuelta/myblog/commit/9fcc3dc84b1d9b66... Thanks for the feedback.
6. 6.▲
   by clearprop 2y ago

   Great feedback. I have updated the post using convolve instead. There is a huge difference convolve/naive. On the other hand, convolved is slower than the FFT as expected, but for greater than 3000 degree polynomials or so. See diff:
7. 7.▲
   by clearprop 2y ago

   Thanks! In case it helps: * Multiplying two polynomials as taught in school is in reality a convolution. * "performing the convolution of two signals in the time domain is equivalent to multiplying them in the frequency domain" *
8. 8.▲
   by clearprop 2y ago

   Thanks for the comment. That makes sense, since as you are saying, a base10 number can be expressed as a polynomial where x=10. Eg: 983 = 9x^2 + 8x + 3 aka [9, 8, 3]. Wondering how big the number has to be to make sense, and where this is u
9. 9.▲
   Convolutions, Fast Fourier Transform and polynomials (2022)(alvarorevuelta.com)

   230 points by clearprop 2y ago|57 comments