Crooked crockford [misc]

someone could have some hints to put me on the right track because with the hints of the challenge, I do not understand much and I do not know where to start. Thanks for your help

I started with the understanding of the name of challenge.

May be the task is to add missed bits to the sample to get base32?

Is it something to do with JavaScript ?

@Crafty said:
Is it something to do with JavaScript ?

The sample is to small to be related to JS. Go my way.

Tabacci is likely right. The problem is how to transform the initial string into something processable by CC.

I have no idea to decode that "r"commas… Maybe i should try to change that to JS?

Obvious transformations (r->1, ,->0) don’t seem to lead to anything.

Type your comment> @davidlightman said:

Obvious transformations (r->1, ,->0) don’t seem to lead to anything.

They do lead somewhere…but some bits are missing :slight_smile:

@cyberus said:
They do lead somewhere…but some bits are missing :slight_smile:

I think this is misleading a bit, it’s rather a representation of specific character encoding scheme until the output makes sense after doing the obvious transformation, and taking into consideration the challenge name. “Missing bits” implies that you manually need to manipulate (add/remove) bits – however, that was not the case in this challenge.

In my opinion (and I don’t know if I’m even close), the first transformation is what has been suggested.
Now, the missing bits… Considering all alphanumeric ascii are below 128, we can try making sure all octets start with 0 (adding the missing bits there)…

Just an idea tho… the result is not clear so far.

God bless dcode.fr :wink:

Type your comment> @GibParadox said:

In my opinion (and I don’t know if I’m even close), the first transformation is what has been suggested.
Now, the missing bits… Considering all alphanumeric ascii are below 128, we can try making sure all octets start with 0 (adding the missing bits there)…

Just an idea tho… the result is not clear so far.

Actually ,u got the right idea.

I need to find the correct locations tho… :slight_smile:

Type your comment> @GibParadox said:

I need to find the correct locations tho… :slight_smile:

How many bits are in a byte?

@cyberus said:
How many bits are in a byte?
Eight, but what next? Output of creating 0-started octects makes 3 bits alone and output is unreadable.

Done!

I was on the right track, but overcomplicating it…

Ordinary ASCII is not 8 bits. :stuck_out_tongue:

Spoiler Removed

Done, if you wanna help, please PM me :wink: … thanks a lot @Kucharskov
All hints are mentionned above like:

  • God bless dcode.fr
  • Bit missing are unnecesarry
  • ASCII is not 8 bit
  • challenge name gives you all
  • the ch******* name will tell you what to do to validate

OMG, dont get lost as myself when you try to use flag as password for zip file you downloaded to get source txt:D