kimjune01

7 ms·

61.
by kimjune01 5mo ago
coopetition
62.
by kimjune01 5mo ago
numpy is the APL reincarnate
63.
by kimjune01 5mo ago
I appealed one time, took 3 weeks to get my 30 dollars back. will never deal with that again
64.
56% merge rate on 316 cold OSS PRs in a week(github.com)
3 points by kimjune01 5mo ago|2 comments
65.
by kimjune01 5mo ago
I've been running a public experiment on how far I can take agentic coding harnesses. When I ran out of my own stuff to work on, I looked to open source. So far, I got the harness to create 368 PRs, 110 of which were resolved. Of those
66.
by kimjune01 5mo ago
Although Arena is adversarial and resistant to goodharting, it's not immune. Models that train on Arena converge on helpfulness, not necessarily truthiness
67.
by kimjune01 5mo ago
are merged PRs a measure of velocity? github.com/kimjune01/
68.
by kimjune01 5mo ago
we lack the shared data structure for it
69.
by kimjune01 5mo ago
the garbage gets smarter with each iteration
70.
Show HN: I submitted 316 AI-generated PRs to open source(june.kim)
6 points by kimjune01 5mo ago|2 comments
71.
by kimjune01 6mo ago
AI labs should compete on a bench that's adversarial, such as go or Starcraft
72.
by kimjune01 6mo ago
internet ads are largely a story of parasitic exchanges using information asymmetry to suck as much surplus out of the middle as possible. https://june.kim/advertising-journey/
73.
by kimjune01 6mo ago
I agree. silent agent doing agentic things async is what would be helpful, not requiring a modification to the main prompt
74.
by kimjune01 6mo ago
this is a patch on top of the broken flat-compaction caching algorithm used by coding agents. Why not fix the cache algorithm directly? Union-find is a better impl june.kim/union-find-compaction
75.
by kimjune01 6mo ago
hi Thariq, I dont know how else to reach someone at claude code, so here goes: I solved context compaction by using a better caching algorithm. It's being implemented in gemini-cli with limited success. https://june.kim&#x2F
76.
by kimjune01 6mo ago
ishitani
77.
by kimjune01 6mo ago
'a bit' is load-bearing
78.
Continuous context compaction using Union-find(june.kim)
2 points by kimjune01 7mo ago|0 comments
79.
Show HN: Union-find for chatbot memory instead of flat compaction(june.kim)
1 points by kimjune01 7mo ago|0 comments
80.
by kimjune01 8mo ago
it erodes their monopoly margins
81.
Show HN: How ads should work on chatbots, and why no one has built it yet(june.kim)
2 points by kimjune01 8mo ago|2 comments
82.
The Journey of Internet Ads – A Scrollytelling(june.kim)
2 points by kimjune01 8mo ago|0 comments
83.
by kimjune01 8mo ago
It is my pleasure to write for you. https://www.june.kim/cord-human
84.
by kimjune01 8mo ago
on Wednesday, I had a dream about agents. Thursday evening, I talked to Claude about trees. That same night, I pushed out the post. There wasn't much rigor involved but yes I will explore more and report back to you!
85.
by kimjune01 8mo ago
The criticism about the labeling is valid and I oversold. For clarity, this is what the agent sees: `spawn`: "Create a spawned child node under your node." `fork`: "Create a forked child node (inherits parent context) under y
86.
by kimjune01 8mo ago
no solution is final, but if you have a better working solution, please share!
87.
by kimjune01 8mo ago
context rot. The human equivalent is saying, why cant the CEO write all the code and reply to all the emails
88.
by kimjune01 8mo ago
i noticed the same, so in the README, I describe `cord` as a protocol: ``` This repo is one implementation of the Cord protocol. The protocol itself — five primitives, dependency resolution, authority scoping, two-phase lifecycle — is indep
89.
by kimjune01 8mo ago
Yes, but as far as I'm aware, subagents can't spawn their own subagents, so the root agent tends to grow its context linearly
90.
by kimjune01 8mo ago
Thank you for the suggestion, I will explore this in the next iteration. I'm learning how to translate how humans do context management into how agents should do them

More ›