hacker.org

megabreit wrote:@Meelo: I'm a bit confused... your profile says you're in level 3 in OneOfUs

This is the forum for the Runaway-bots

osterlaus wrote:Hopefully have all the members not (!) taken the same PW on their mailservers...

Well, this was no posting of mine - so someone already used my account...

Hopefully have all the members not (!) taken the same PW on their mailservers...

Well, having decoded your base64ed string, I don't see any code after [code...

Don't you need a table name for UNION?

That was a nice challenge - what did you try first? I approached a bitwise (or should I say pixelwise in this case) OR which worked immediately. However the solution was not very readable in white. Did a XOR combination maybe lead to success too? Don't ask me why, but this was my first approach. I ...

I took another nice approach: I calculated the ending strings from 1 upwards recognizing that the ending patterns occur only at some numbers. At the end of my optimization, I had the condition "l % 390625 == 259683" which I added to the while-loop which sets l to the next random number. An...

I got the same solution on another way: I converted the java code into C which should compile to faster code. But it didn't compile on the first run and so I found the loop. After having it erased, the solution was near. My first approach didn't help that much: I started to inline a lot of functions...

Oh, yeah, now I got it - well, according to the solution of the challenge, this is a pipelining feature / problem called "Delayed branching" in MARS. I got it disabled, and so you are right. What do you think - should I give Adum a new version with delayed branches or should this be a nice...

Hmmm, as I see, the program would not break at 0x15200001 as this line tests $9 (which is $t1, filled with 10 in the line above) against 0. If this is not equal, branch by one line - we've stepped over break.

This seems to depend onto the disassembler you used. I also heard about unusable labels.

There is a fast program to solve it via brute-force, and surely you could also arrange some kind of formula instead of running the program.

Once more: Who could give me a hint about the axis' meaning.....?

Yeah, this was a really nice challenge! Loved to handle this different ways of simplification

remark _for_ the moderators: i think this thread gives away too much information on the well-scaling algorithms, even when i read it after coding mine... may someone removes at least some of the information given? After all it takes a lot of fun out of the coding, if you know exactly what to do.. I...