created (updated in this commit)


Writing fast encoders is hard. Yet, few software has to be faster than encoders. There is simply no way of knowing how fast is “fast enough”. And since I wanted to achieve it in pure Go, there was no way of just linking (node.)yencode. This is my take on it where I used a technique inspired by vectorized calculations and accidentally “made my own” implementation of SIMD (not catching up to the originals speed though.


This project is a subproject of Goosenet and is will be used inside it.


Sourcehut: https://git.sr.ht/~mpldr/go-yenc



MPL 2.0


Software is never perfect. If you have issues or suggestions, please do not hesitate to report them here. If you do not have an account you can submit an issue nonetheless by sending an email with the details to: ~mpldr/issues@todo.sr.ht.

If you feel like it, you can Liberapay receiving, or GitHub Sponsors.
Unless stated otherwise the texts of this website are released under CC-BY and code-snippets are released into the public domain.
© Moritz Poldrack

RSS Feed available I am sponsoring the letter @. Yes, that's a thing. This website's content doesn't need AI to be stupid! Website Status