I have an update: No luck on finding any exploit on the million digit challenge however I am pleased to announce I discovered dynamic Unary encoding. It is the basis for a bijective codex I code-named “Wave” since Wave encodes down to and back from, two bits.
I don’t know if this is a self discovery or a discovery in general so I could use some feedback on the concept.

I have posted in the Beginners thread of the Usenet group alt.comp.compression.

Mark I placed this here because of two reasons. 1.) I have your challenge to thank for the focal point and 2.)alt.comp.compression is really slow these days. No one is even BS’ing. I hope to make use of common knowledge of those in the know. :)

So Questions; the concept is dynamic encoding where data is in motion rather than static and, has anyone said or read anything on this general concept of recoding bijectively?
Just what to look for will be helpful and I’ll bet it’s more appropriate to reply in the alt.comp.compression group to the thread Beginners Thread.

Thanks Mark.. I am trying to find a way and sharing what I find. It’s a challenge and I like that.

Ernst

I am able to encode or decode the entire file recursively here. I’m confident it can “go” many iterations in both encode and decode directions but, sequentially only.
D3, D2, D1… E1, E2, E3…
There may be a diamond in the rubble but, it’s worthless if you don’t buy it.
Just wanted to see where you stand on this.

A little “Kobayashi Maru” Cheat on the file but it’s in-line with my personal theory that there is a “quantum” of information involved and the symbolism representing it is non-permanent.

The new files are exactly the same size as the original million digit binary you provided. I am looking for a way to compress but the best hope at the moment is recoding.

I can learn to write a traditional data compressor but I will be learning from the bottom up. Why reinvent the wheel right?

So, my question, relating to recoding the file is; how would we score that. Would it be 8000 bytes + the data compressor? Maybe we might waive the size of programs all together since the codex is bijective and encodes or decodes any binary data and a publicly available data compressor is common enough? Wouldn’t that be nice…
Files don’t have to be encoded with “Wave”, the codex code name, first to be decoded.
Maybe recoding the file is out of bounds?

You are fair so I respect your rules.

Ernst

I’ll let you know when I am able to test your code. Don’t hold your breath!

I’m not sure I know what you mean. If you are suggesting that you might find a sequence in the file that compresses by 8000 bytes, then you should be able to construct a decompressor that meets the challenge.

- Mark

I have had the good fortune to discover a bijective encoding algorithm.

The size of the decoder is under 8000 bytes.

The down side is to recode a packet the size of million digit file, which is over 3 million bits, it takes nearly 48 hours using a single core at 100% This version wouldn’t divide over multi-cores.

My question is: If I find a file “some place down or up the line” sequentially that will compress, at least that 8000 bytes, with a publicly available data compressor will that qualify as compressing the million digit file?

Thanks
Ernst

Theoretically, that should do it in some universe (because the data file was only read in universe0 and probably doesn't exist in the one which returns the file). Of course your interpreter or executable would have to exist outside the universes, which could make it hard to invoke!

Hey maybe you guys see a way to manage that parity flip issue?

Oh well I will log into Random Data compression and chat.

Happy new Year all..

So If I blunder on the terms or other proper defines please correct me gently.

Again try to see this as Data compression humor and not a Big Brag.

I need to say that all bit strings except zero value ie 0 or 00000000

-----------------

If we take a string and I will just type and make up a data

1010101 -- We can show how value and symbol can be exchanged and encoded.

1010101 Starting with a limit of length of MSSB ( remember this is humor ) Ask yourself what must we subtract at the location of MSSB - 1 to get the MSSB to reset?
In this case only a single set bit at the MSSB - 1 location resets the MSSB.
1010101
-0100000
-------------
so that is 0110101 now.. Choose a parity in this case a simple 0 = 1 and 1 = 2 works so the first symbol is a zero.
repeat and you will end with the value of one which is Dark Information we assume when decoding the Symbol string. we start with a value of one and not a value of zero

So, in humor, I can reduce all greater than 0 binary values by one bit.

:)
it's 1010101 = 010101.. Where 0 and 1 are symbols rather than value.

Poo you say just drop the MSSB? well if I change the symbol meanings then it's 101010..

It's okay.. Just a little Data compression humor. I compressed all greater than one values by one bit..

There are numerous ways to do as you are describing, but they all rely on hiding information. You of course can't compress any stream by one bit without actually storing that bit elsewhere.

- Mark