Xiione

Thanks! The "continue" was one of those things that started off as a placeholder and didn't change much, I'll definitely be adjusting it.

Thanks for checking it out! Essentially, for any given QR code the maximum error rate is reached when you deplete every block's health bar to 1 remaining slice, making sure to invert every pixel in each codeword you've touched (the individual tetris-piece shaped chunks), and then introduce one more single pixel error in any block. This is actually independent of the arrangement of corrupted codewords within each block.

The amount of redundancy is determined solely by the specific version-ecLevel pair a code has. So, the code with the largest amount of redundancy (in bytes) is one that has version 40 and EC level H - a staggering 2.43kB of redundancy vs. 1.28kB of data! See this particular sample: https://qris.cool/decode?sample=135

Thanks so much for your kind words! As a principle I try to at least listen to what everyone has to say, I wish I could make everybody happy but in the end I incorporate the feedback I'm convinced of/already agree with. Let me know if you have any thoughts on my code, and thank you for the github follow :)

Thank you so much for the honest feedback. One of the reasons I tried to not get into the math details is because the preliminaries would be somewhat lengthy, some people would not be familiar with what a finite field is so explaining even that succinctly would be its own challenge for me. But for those that the concepts are within reach for (like the folks here on HN), you are right that I ought to make some effort to explain what is going on, at least intuitively. As for the UI considerations, great feedback, I'll definitely take it all into account when re-designing. I'm open to additional suggestions from everybody.

Ultimately I'm glad that I was able to get the main point across. That is, that QR codes can take a lot more abuse than one might assume. Thanks for checking my work out!