61–70 of 123 posts
256 bytes is in the "let's try every combination" range, I think. So, write a program that tries all of them and determines if any do something interesting enough to forward to a human for review.
Wouldn’t that be 256^256? That’s certainly a hell of a haystack
256 bytes is in the "let's try every combination" range, I think. So, write a program that tries all of them and determines if any do something interesting enough to forward to a human for review.
Wouldn’t that be 256^256? That’s certainly a hell of a haystack
For handy reference:
8^8: 16,777,216
8^16: 281,474,976,710,656
8^32: 79,228,162,514,264,337,593,543,950,336
8^64: 6,277,101,735,386,680,763,835,789,423,207,666,416,102,355,444,464,034,512,896
8^128: ...
8^256: ?
8^512: hello from the other side of the quantum dimension
8^8 sounds interesting. 16 million reboots of a real {PC,C64,ST,Amiga,Mac,Z80,...} sounds like a collectively highly entertaining kind of hilarious. The issues only begin when you start wondering if any of the programs wedges the hardware into "interesting" states that are preserved across reboots - or at least the what if of that dimension of entropy... then the problem space becomes 8^8^8...
[I decided to compute 8^8^8. The result is apparently 15 million digits long. (`echo 8^8^8 | bc -ql | wc` -> `222814 222814 15596963`)
nchelluri@grugbarn:~/dev/hello $ cat > hello.go
package main
import "fmt"
func main() {
fmt.Println("hello world")
}
nchelluri@grugbarn:~/dev/hello $ go build
nchelluri@grugbarn:~/dev/hello $ strip hello
nchelluri@grugbarn:~/dev/hello $ ./hello
hello world
nchelluri@grugbarn:~/dev/hello $ du -h
1.4M .Since these are so small I don't see why we couldn't have a "demoscene launcher" with a "mailto:" style protocol handler and just let people click on base64 encoded links to start the demo.
A handler for executing arbitrary code. What could possibly go wrong?
You may argue that JS is sandboxed, but so is DOSBox. At least DOSBox can’t easily connect to remote servers over the internet.
Earlier quoted context omitted.
Wouldn’t that be 256^256? That’s certainly a hell of a haystack
Unreasonably impossible as of yet, yes. For handy reference: 8^8: 16,777,216 8^16: 281,474,976,710,656 8^32: 79,228,162,514,264,337,593,543,950,336 8^64: 6,277,101,735,386,680,763,835,789,423,207,666,416,102,355,444,464,034,512,896 8^128: ... 8^256: ? 8^512: hello from the other side of the quantum dimension 8^8 sounds interesting. 16 million reboots of a real {PC,C64,ST,Amiga,Mac,Z80,...} sounds like a collectively…
The smallest category in pouet for reference is 32b (or 256 bits), so 2^256 combinations to brute force. For comparison usually 128bit encryption is considered "safe" and infeasible to brute force.
You might be able to constrain the search space to only valid IA32 instructions, but realistically I don't see it helping that much
256 bytes is in the "let's try every combination" range, I think. So, write a program that tries all of them and determines if any do something interesting enough to forward to a human for review.