Code #2

Observations

Mix of numbers, small cap and upper cap letters. This looks like a cipher we know.

[hint]Remember that the passcode format changed so it doesn’t need to start with M, N, O or P now[/hint]

Spoiler

It does look like Base64 but doesn’t it usually start M, N, O or P? Not anymore, the passcode format has changed. Let’s try converting Base64 to text, nothing good.

Reverse the sting

BxPUnJvNCMvLBJyZnMH3

Still nothing good

Let’s swap the cases

bXpuNjVncmVlbjYzNmh3

Convert Base64 to text

mzn65green636hw

It does look like Base64 but doesn’t it usually start M, N, O or P? Not anymore, the passcode format has changed. Let’s try converting Base64 to text, nothing good.

Reverse the sting

BxPUnJvNCMvLBJyZnMH3

Still nothing good

Let’s swap the cases

bXpuNjVncmVlbjYzNmh3

Convert Base64 to text

mzn65green636hw

Code #3

Observations

Thanks goes out to yushi2000 for submitting the solve to us!

It looks like HEX, but converting it just gives gibberish.
Will need to look further for alternatives.

[hint]

Alternating values reminds you of what kind of code?
How many frequently used versions do we have of such kind of code?

[/hint]

Spoiler

We see that in the code there is a constant alternation between numbers and letters
This normally points to some form of binary/bit kind of code where we have only two characters (Binary, Morse, Braille)
We also see that within the code, we have no letter greater than c and no number greater than 5.

Let us assume that the value of a character indicates the repetition, then we’ll have a workable string of alternating 1’s and 0’s
So using the below index, we can substitute each value in the code

Symbol

Value

a

0

b

00

c

000

1

1

2

11

3

111

4

1111

5

11111

111001101111101110011001011011100110010100011100100100101010111001100010111010010001011001011011101100111110
Because the length of this code (108) is only divisible by 6, we know what the next step would be 😉
Group up the code to form proper Braille in the format of

Translating this into text gives us the final solve:vyn87discover587mq

We see that in the code there is a constant alternation between numbers and letters
This normally points to some form of binary/bit kind of code where we have only two characters (Binary, Morse, Braille)
We also see that within the code, we have no letter greater than c and no number greater than 5.

Let us assume that the value of a character indicates the repetition, then we’ll have a workable string of alternating 1’s and 0’s
So using the below index, we can substitute each value in the code

Symbol

Value

a

0

b

00

c

000

1

1

2

11

3

111

4

1111

5

11111

111001101111101110011001011011100110010100011100100100101010111001100010111010010001011001011011101100111110
Because the length of this code (108) is only divisible by 6, we know what the next step would be 😉
Group up the code to form proper Braille in the format of