Hi guys, I searched the whole mailing list and haven't found any discussion so wanted to ask directly. What was the thinking behind using reversed polynomials in the crc32 instead of the normal ones (or giving an option to use either at will). At times it may produce complications (as it did in my case while my colleague just found out that Google's hashing library for java [guava] implements the normal form (actually hardcodes the table in the code) https://github.com/google/guava/blob/master/guava/src/com/google/common/hash/Crc32cHashFunction.java#L46).
If anyone knows what was the thinking/decision behind this choice and has time to share, would love to learn more about it. Thanks -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
