Hacker News

Top stories

Live mirror
30 storiesupdated just nowView source snapshot
  1. Android 17 is the first since 3.x to add new APIs without releasing to the AOSP(grapheneos.social ↗)
    264comments
  2. Cloudflare Quick Tunnels(cloudflare.com ↗)
    251comments
  3. Saving another 100TB of RAM(cloudflare.com ↗)
    44comments
  4. The Farnese letter(simonklee.dk ↗)
    5comments
  5. How to Write with an LLM(sockpuppet.org ↗)
    271comments
  6. Xcode 27.1 Beta Release Notes(developer.apple.com ↗)
    68comments
  7. Photon-Emission-Guided Laser Fault Injection Enables RP2350 Secure Debug(ledger.com ↗)
    54comments
  8. How OpenAI Used Its Own LLMs to Design Its Jalapeño Chip(ieee.org ↗)
    58comments
  9. Show HN: Cactus Needle 3: 8-29MB automation models can match DeepSeek V4 Flash(cactuscompute.com ↗)
    78comments
  10. Cache-to-Cache: Direct Semantic Communication Between LLMs (2025)(arxiv.org ↗)
    12comments
  11. The first new cat species discovered in 100 years(nationalgeographic.com ↗)
    62comments
  12. OpenJev(openjev.com ↗)
    246comments
  13. Claude Code now reads AGENTS.md if there is no Claude.md(claude.com ↗)
    183comments
  14. Cyclomatic Complexity in C#(ndepend.com ↗)
    15comments
  15. Show HN: LiveWorld – Every 24/7 YouTube live camera on one globe(liveworld.info ↗)
    5comments
  16. LispBM is a concurrent Lisp for microcontrollers with message passing(lispbm.com ↗)
    1comments
  17. Minimal Phone 2(minimalcompany.com ↗)
    178comments
  18. The Implications of Linguistic Illegibility for LLM Security(arxiv.org ↗)
    19comments
  19. Warez: The Infrastructure and Aesthetics of Piracy (2021)(archive.org ↗)
    26comments
  20. Alibaba open-sources AI model that can detect cancer and nearly 150 conditions(scmp.com ↗)
    4comments
  21. Two parallel neural ectoderm progenitors contribute to the developing brain(newscientist.com ↗)
    55comments
  22. C++26: Trivial infinite loops are no longer undefined behaviour(sandordargo.com ↗)
    201comments
  23. Inside ZCode: Silently uploading your Git history to the cloud(ferstar.org ↗)
    91comments
  24. Column built an issuer processor from scratch(column.com ↗)
    5comments
  25. How SpaceX streamlined the Raptor engine(construction-physics.com ↗)
    40comments
  26. A search-and-inference database from scratch in pure Zig(antfly.io ↗)
    16comments
  27. I vibed a proof of Conway's conjecture(overreacted.io ↗)
    186comments
  28. Size-Specialized Memory Allocation(go.dev ↗)
    3comments
  29. North Korean nuclear test sets off years of earthquakes(science.org ↗)
    152comments
  30. From Geometry to Algebra and Back Again: 4000 Years of Papers (2023) [video](youtube.com ↗)
    discuss

Ask HN: Anyone Doing Advent of Code with ChatGPT?

10 pointsby 3y ago
5 comments
I've been thinking that it could be an interesting idea to see how far it can go, and to document each step along the way.
3y agoHN ↗

Just finished Day 1. Series of prompts were:

- --- Day 1: Calorie Counting --- (verbatim copied and pasted the problem text)

    To solve this problem, we need to read the list of food Calories and keep track of how many Calories each Elf is carrying. We can do this by keeping a list of the Calories carried by each Elf and updating the list as we read the input.

    (gave the answer here in Python-like pseudocode)

- Solve the above problem in Python

    (gave the answer in actual Python)

- Give me the answer but with the input hardcoded also (wanted to try some input hardcoded just to see if it works)

    (worked)

- I'm getting an error

    Traceback (most recent call last):
      File "main.py", line 18, in <module>
        ElfCalories[-1] += Calories
    IndexError: list index out of range

    The error IndexError: list index out of range means that you are trying to access an index in a list that does not exist. In this case, it looks like it is happening when you try to add the Calories to the current Elf (ElfCalories[-1] += Calories).

    The problem is that you are not adding a new Elf to the list when you encounter the first non-blank line in the input. This means that when you try to add the Calories to the current Elf, the list is empty, so there is no -1 index to access.

    To fix this, you can add a new Elf to the list when you first encounter a non-blank line in the input, like this:

    (fixed the error)

- Give me a function that reads in a file and solves the previous problem with the elves

    (gives the answer)

- Give me the same solution above but with the ability to input a link address to download the input file instead

    (gives the answer but the code itself didn't work, so I manually copied and pasted the input file and added it to the folder, which then gave the right answer)
3y agoHN ↗

Can it find the answer which doesn't use so much memory and doesn't have the edge case which caused the index error, or is it stuck at day 3 bootcamper level even with so much prompting?

3y agoHN ↗

I tried this prompt:

The Elves take turns writing down the number of Calories contained by the various meals, snacks, rations, etc. that they've brought with them, one item per line. Each Elf separates their own inventory from the previous Elf's inventory (if any) by a blank line. Find the total number of calories being carried by the elf who is carrying the most calories. Write Python code to solve this problem. This is the key paragraph from the problem description, plus the sentence asking for the solution.

The code it produced was correct, although it doesn't include reading the input from a file: https://pastebin.com/M00t217u

I then asked, "Can you modify the code to read the input from a file?"

Again, the code it produced was correct and it now reads from a file: https://pastebin.com/N6mcZu55

I then tried, "Can you make the code more memory efficient?".

It said, "Yes, we can make the code more memory efficient by avoiding the use of the intermediate list of lists that contains the number of calories for each Elf. Instead, we can directly compute the total number of calories for each Elf as we parse the input, and find the maximum value at the end. Here is an example:"

https://pastebin.com/NCtx4KHc

3y agoHN ↗

I tried this on a lark for Day 3 last night and it got Part 1 correct with no changes (other than using go:embed for the input file). Part 2 required a bit of tweaking. It is pretty impressive nonetheless.

Today, I used it to solve Day 2 (rock/paper/scissors). It got pretty close, but had 95% of the logic correct.