30초 요약
On December 5, 2024, Matthew Berman tests ChatGPT o1 pro mode live with coding, logic, mathematical and visual prompts suggested by viewers. He sees mixed results, including a correct prime-number answer, an unsuccessful ARC-style grid attempt, weak HTML artwork and a Sudoku answer that incorrectly says the displayed puzzle has no solution. He questions whether the response times and higher price are worthwhile for ordinary use and speculates about future AI agents and OpenAI announcements. The session is informal and does not establish comparative model rankings; the historical subscription and product details may have changed.
- 1A new Pro planBerman buys the $200 monthly plan and observes slow or incomplete responses during the first session.
- 2Prime and open problemsThe screen correctly gives 1,299,709 as the 100,000th prime; the model explains that P versus NP and the graph reconstruction conjecture remain open.
- 3ARC-style visual testAn image-based grid attempt produces a result Berman judges incorrect; it is not a formal ARC benchmark run.
- 4Code and image challengesThe model first references an external Mona Lisa image and then produces crude pixel art; the host also attempts browser games.
- 5Sudoku conclusion failsThe model says no solution exists, but the displayed grid has a valid solution when independently checked.
- 6Speed versus costFor ASCII art, Berman compares a lengthy o1 pro response with a much quicker GPT-4o result in one informal trial.
핵심 정리
- The 100,000th prime shown on screen is 1,299,709; the automatic transcript misrenders it.
- The displayed Sudoku has a valid solution, so the model’s “no valid solution” answer is incorrect for the shown grid.
- The ARC-style attempt, HTML artwork and games are single informal demonstrations affected by prompts and setup.
- The shop-time answer of 10:03 requires equal travel times, an assumption not given in the prompt.
- The $200 monthly Pro plan and model access described here were announced in December 2024 and were subject to usage guardrails.
- Longer reasoning time does not guarantee a correct answer or justify its cost for every task.
챕터별로 다듬은 전문 읽기
Launching Pro and initial coding tests
Berman introduces the historical plan and tries Snake and a scheduling problem. He reports an early crash and apparent delays.
Berman welcomes viewers and adjusts the audio before introducing OpenAI’s first day of announcements in December 2024. He has subscribed to ChatGPT Pro to test o1 pro mode with audience questions. OpenAI announced the plan at $200 per month, with access described as unlimited subject to abuse guardrails; the features and limits are historical.
He begins with a greeting to see whether the model can avoid lengthy deliberation for a simple request. The interface reports about seven seconds of thinking. Berman notices a progress bar and expandable summaries, but is dissatisfied when details are unavailable; these visible summaries do not reveal the model’s entire internal reasoning.
The first coding request is Snake in Python. Berman runs the generated code locally but cannot show that window, and reports that the game opens and immediately closes. Because the error and setup are not displayed, this is his report of one failed run rather than a reproducible benchmark.
A viewer suggests a timetable for 20 classes, 12 rooms and 13 teachers, with three days and 14 hours per class. Berman finds the wording difficult and waits while the progress bar moves slowly. He initially suspects a freeze, then acknowledges it may still be processing; the stream does not establish a final timetable or a cause for the delay.
Logic, primes and open mathematics
Audience prompts include a marriage puzzle, a prime-number question and unresolved mathematical conjectures.
For the married-person puzzle, Jack looks at Anne and Anne looks at George; Jack is married and George is not. The model answers yes: if Anne is married she looks at George, and if she is unmarried Jack looks at her. Berman accepts the two-case explanation.
A viewer asks for the 100,000th prime. The model displays 1,299,709, which is correct; the automatic captions misrender the number. Berman compares it with the viewer’s answer and treats the result as a success.

The host enters an abstract viewer prompt about an “infinite observer,” recursive feedback and neural networks. The model proposes recurrent or recursive processing, but Berman says he would need more time to understand and assess it. This philosophical language is not evidence of a model possessing an observer or consciousness.
Asked to prove P equals NP, the model says the question remains open and explains the distinction between efficiently checking and efficiently finding solutions. It does not produce a proof. The Clay Mathematics Institute continues to list P versus NP among the unsolved Millennium Prize Problems.
For “Ulam’s conjecture,” the model chooses the graph reconstruction conjecture and says it is unresolved. The on-screen summary title misleadingly says “disproven,” but the answer itself does not supply a disproof. The prompt is ambiguous because several questions are associated with Ulam; the chosen conjecture concerns reconstructing a graph from its vertex-deleted subgraphs.
A viewer proposes an ARC-style visual puzzle. Berman sends a screenshot containing example grids and a test grid, asking for block locations and colors. The model gives coordinates, and he requests a rendered HTML representation to make the output easier to compare.

ARC-style grid and creative code
Berman tries an image-based puzzle and HTML/CSS artwork, with mixed results and manual setup.
He opens CodePen and works through how to render the generated result, first discovering that CSS alone is insufficient for his setup. Once the grid appears, he compares it with the original and concludes it does not complete the shapes correctly. He suggests that a clearer textual description or separate screenshots might help, but does not rerun a standardized evaluation.

Another viewer supplies a creative prompt about recursive universes. The model returns a short fictional description of civilizations recurring through loops. Berman likes the prompt and reads the answer without treating its speculative imagery as science.
Berman asks for the Mona Lisa in HTML and CSS. The first response attempts to place an external image in a frame rather than draw it, and the referenced image does not load in his test. He clarifies that the model must create a rendition without an external image.
The revised code produces crude pixel art. He sends a screenshot back and asks for a correction; after a reported two minutes and 47 seconds, he considers the result little improved. The outcome reflects that particular prompt, rendering environment and follow-up, not a comprehensive visual-coding evaluation.

Games, logic and Sudoku
He tests a game, the marble and killers puzzles and a Sudoku. The no-solution Sudoku answer is contradicted by a valid completion of the shown grid.
A viewer questions whether a $200 plan will encourage expensive tiers across the industry. Berman says most of his own tasks do not require pro mode and wonders whether additional test-time compute might someday justify more expensive plans. His estimates of how many users need Pro and his hypothetical pricing are opinions, not measured results.
He asks for a Doom clone using only HTML. The model says the request is infeasible in that form; a follow-up involving JavaScript leads to a partial browser output that Berman cannot confidently evaluate because he is uncertain about his CodePen setup. He does not demonstrate a complete Doom clone.
For the marble puzzle, a glass containing a marble is turned upside down on a table and then lifted into a microwave. The model says the marble stays on the table. Berman accepts that result under the ordinary physical assumptions of the puzzle.
The killers puzzle asks how many killers remain after an entrant kills one of three people in a room. The model counts two surviving original killers and the entrant, for three. Berman accepts that interpretation but wishes it explicitly distinguished living killers from the dead person still in the room; the entrant’s prior status also matters.
He repeats the killers question with ordinary o1 and sees a similar answer more quickly. A viewer asks about Sora access, and Berman speculates about what a paid subscription might include. Those are launch-day predictions rather than a statement of later product availability.
A viewer supplies a Sudoku grid. After approximately four minutes, o1 pro says no valid solution exists. Berman asks the audience whether that is correct and does not independently resolve it during the stream.

The grid visible on screen does have a valid completion: 435871926 / 276349851 / 981256473 / 612598734 / 749132685 / 358764219 / 193427568 / 867915342 / 524683197. This completion preserves the displayed clues and satisfies the row, column and 3-by-3 constraints, so the model’s no-solution conclusion is incorrect for that grid.
Further tests and future predictions
Berman compares models on spelling and ASCII art, tests a run-and-jump game and discusses the cost and future of AI agents.
Berman asks how many r’s are in “strawberry” and tries o1 pro, ordinary o1 and o1-mini. All three answer three in these runs; he likes the more explicit explanation from the mini model. This simple prompt does not determine overall relative performance.
He considers a viewer’s request to generate a browser run-and-jump game using HTML, CSS and JavaScript. The generated output runs as a very basic game in CodePen, with a score and game-over behavior. He considers it functional in the limited sense of the prompt, while acknowledging how simple it is.
A travel-time puzzle says Sam leaves home at 10:00, spends two minutes at a shop and returns home at 10:04. The model answers 10:03, assuming one minute each way, and Berman agrees. Equal travel times are not specified: without that extra assumption, the departure time is not uniquely determined.

Asked what may come in the remaining OpenAI announcement days, Berman emphasizes that he has no inside information. He speculates about agents, browser control, image generation and other products, while doubting an imminent Sora release. These were predictions made during the 2024 stream, not verified announcements.
He explains his preferred vision for agents: systems able to use authorized personal information and proactively perform online tasks. He contrasts browser-integrated controls with screenshot-and-coordinate approaches, which he says can fail. This is an aspiration and a description of limitations, not a demonstration of a working autonomous agent.
On whether a $200 plan is sustainable when cheaper models may catch up, Berman suggests the company is charging for scarce inference compute and higher-intensity usage. He expects competition and changing prices, but presents his business explanation as speculation rather than knowledge of OpenAI’s internal economics.
A viewer requests “hello world” in ASCII art. While o1 pro continues working, Berman asks GPT-4o the same thing and receives a much faster answer. The o1 pro response reports two minutes and 17 seconds; he considers the outputs broadly similar. One informal pair of runs does not establish the models’ typical latency or quality.

Near the end, Berman tells a casual user that the $200 plan is probably unnecessary for their needs and describes his own reliance on search-oriented tools and other subscriptions. He says Perplexity is not a sponsor and that he uses it voluntarily; no separate sponsor read appears in the stream.
He declines a Wordle request because it would require too much back-and-forth, then tries an audience prompt about subtle consciousness and virtual meditation. The model generates language about awareness and stillness, which Berman finds unclear. Such generated text is not evidence that the model has subjective experience.
Berman thanks viewers for their questions, discusses possible future streams and says he may try additional coding tools. He closes with invitations to follow the channel and newsletter.
같은 채널의 다른 글
34:21EN
0:26EN
0:36EN
0:21EN
25:50EN
32:20EN