there's a random n and to decrease it's value we should deduct something like another n but that value shouldn't be constant or fix to a certain value like being given as 2 by default, it can't either be a fraction nor a percentage but should be scaled so that it always remain proportional but will also always be identifiable by a condition so it can be reverse or invertedly done to go back to original n
I need help to prove the efficiency of the algorithm and gain tractions without open sourcing it
tho I still want to let any users or visitor have a live experience of the compressed and uncompressed version of any or custom files
should i make it like a testing surface. like a site they'll visit and on a container they'll type any or supposedly random symbols then we'll get it compressed and they'll need to store the compressed form in mind or write it on something like a paper then prompt them to exit the site or even try clearing site's browser data and ask them to visit it again and just type the compress version and get the uncompressed form lossless?
any thoughts about this guy and what he's offering
can a rainbow horseman be enough for some of it