The Aaronson Oracle
aaronsonoracle.com
aaronsonoracle.com
https://news.ycombinator.com/item?id=50074909
The top comment:
> This is a nice spin on the Aaronson oracle:
> In a class I taught at Berkeley, I did an experiment where I wrote a simple little program that would let people type either “f” or “d” and would predict which key they were going to push next
And today we have a web app of this that seems fully generated by Claude.
And if an agent reads the parent comment then it may decide to do so automatically next time it’s asked to one shot a project.
Your conclusion actually seems like a perfectly efficient end state of new product generation: Novel ideas land on HN > Built and validated immediately.
Haven’t HN posts always just been on some spectrum between, “New and interesting problem identified” and “New and interesting problem solved for, please critique”.
I.e., HN is simply a RFP+PR (pull request) marketplace.
So if instead you replace it with a "compressed" model that doesn't actually store all the seen n-gram options, but instead predicts them, then you've more or less just re-invented LLMs.
In which I learn most people do not have free will.
At 500 key presses (second attempt) I'm at 59%. At 50 key presses I was at 48%, and in my first attempt I was lower at 50, though I don't remember what it was, but later I got up to 70%. So I guess I don't have free will past 50 key presses!
It also inspired me to build a little game based on it. Can AI can read you mind? https://jeffyclassify.com/blog/mind-reader/
Then I went to random.org and generated 100 integers. I went through the list one by one and pressed "D" for even and "F" for odd. I got only a 48% correct guess rate!
One immediately obvious pattern you'll see is that humans not familiar with this test will have a strong aversion to generating runs of zeroes and ones. For example, you probably won't see 0-0-0-0 or 1-1-1-1 in the human-generated sample, even though it has a pretty high chance of appearing in truly random data. It just doesn't "feel" random, right?
This has a practical application: if you're building a game with a component of randomness, people will often feel that the game is unfair or biased if they lose a number of times in a row. Tetris, famously, works around this by repeatedly taking a "bag" of seven possible tiles and shuffling it, rather than picking the next tile based on a dice roll. This way, the distribution over time is still random, but you never get more than two identical tetrominoes in a row.
"One band per run length, your last five presses at the top. Every grain is one time you made that run." This was never good writing. It is weird compaction. It is just hard to picture this. It's as if this does not know that we have shared visual attention at the moment on a particular graph and is instead looking at some bizarre version of it while I am looking at/picturing something else. Maybe that's what it is, it does not get good explanation as a moment by moment transfer of understanding.
The other sin is just a lack of editing. There’s no way the text needed to be so long for such a simple premise.
The idea and the algorithm are Aaronson's, and the lineage is Hagelbarger's and Shannon's. This page is a teaching version of their work, and it is not affiliated with any of them. Prior web implementations exist and are credited in reference 6.
Built by Spencer Stanton as plain HTML, CSS and JavaScript. No framework, no build step, no analytics, and nothing about you leaves your browser: your session is held in localStorage and nowhere else.
(Scott's name is mentioned at the bottom)