molenzwiebel 3 hours ago

For those that thought the process of speeding up CRC was interesting, I strongly recommend reading [1]. It describes a step by step process on how a naive CRC implementation might be improved, until finally arriving at an implementation in assembly with a staggering throughput of 62 processed bits (almost 8 bytes) per CPU cycle. Yes, you read that right.

[1]: https://github.com/komrad36/CRC

  • fnands 3 hours ago

    Yup, it's a fantastic read. I based most of my post off it (I clearly mention so) and it's worth it to read at least the first part of it before reading my post.

jorams 3 hours ago

For what it's worth, it appears the paper "Everything we know about CRC but afraid to forget" was originally published as part of the release of crcutil on Google Code[1]. This is a hg repository with one commit that includes the paper, the source of the paper, and an implementation.

[1]: https://code.google.com/archive/p/crcutil/

adsharma an hour ago

https://github.com/py2many/py2many/pull/653

Transpiling the python version in the blog to mojo gives me a 4x speedup.

Had to hand edit a couple of things:

    - List to bytearray conversion is not working yet
    - Can't iterate over SIMD. So a "for x in list" loop has to be rewritten as a range based loop.
With a bit more work, the manual edits won't be necessary.
bsaul 3 hours ago

How is mojo doing ? Has it made its way as a niche language in some places ?

  • khimaros an hour ago

    and is it still closed source?

    • fnands 3 minutes ago

      Yup, language is still closed, stdlib is open.