This behemoth of a block only works if you put in the right secret code.
I couldn’t upload a script pic (wanna bet why?) so, here’s the project link:
and here’s a screenshot so you guys can give up early 
(i have no idea if this is actually possible)
glhf
Is there a valid solution?
Is the solution a pair of numbers like “8796”?
If the solution is a number how long is that number?
(secret code) has to be a list
Any hints? Ive been kinda stabbing at it remove redundant code for a while but nothing to actually find the code.
Hint 1.
That last one is supposed to be a 0 i have no idea what happened
Hint 2: This block works by converting the number to binary and using the final digit.
How long is the list? does it contain all numbers? if so are the numbers from 0 to what?
Q1. This can be inferred easily from the code, so I won’t tell it here.
Q2. The least of all the numbers is -10.
This block of code:
Is actually useless. No matter what, this will return a empty list. Thus:

This will return a empty string, no matter what. Thus:
Anything divided by a empty string will become Infinity. Thus, again:
Just wanted to note this here.
I think, via:
The variable “ (a) ” is those binary digits, with the final digit at the start ( (item (1 v) of (a)) ).
This is what adds the digits:
Returns the last:

Wait, is the default for the number a hint? or just a example. Since it seems a bit weird just for a example
Incorrect. There are many cases where this returns a populated list.
Incorrect again, due to the above statement.
Correct
Oh.. Negatives! The second item must be a negative then. You need at least 13 items to get any items from that block (all of the all but first ofs, i might of misscounted) so something below -6?
“glhf” means good luck and have fun
Q1. Yes.
Q2. Can’t tell you.
Q3. It’s not a number.
secret code is [1,-10,21519]
Congratulations, and welcome to the forum!
For a secondary challenge, deobfuscate the whole script.
I am truly sorry. I was not able to post the image along with the text. I suspect it was due to a bug.