Stackful Coroutine Made Fast
Posted2 months agoActive2 months ago
photonlibos.github.ioTechstory
calmpositive
Debate
0/100
CoroutinesPerformance OptimizationProgramming
Key topics
Coroutines
Performance Optimization
Programming
The article discusses optimizing stackful coroutines for better performance, and the HN community shows interest in the technical details and potential applications.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
6h
Peak period
1
6-7h
Avg / period
1
Key moments
- 01Story posted
Oct 28, 2025 at 6:14 AM EDT
2 months ago
Step 01 - 02First comment
Oct 28, 2025 at 12:40 PM EDT
6h after posting
Step 02 - 03Peak activity
1 comments in 6-7h
Hottest window of the conversation
Step 03 - 04Latest activity
Oct 28, 2025 at 12:40 PM EDT
2 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
ID: 45731032Type: storyLast synced: 11/20/2025, 3:35:02 PM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
I haven't yet digested exactly how the stacks are made to work. I think fig 8 should be obvious, but I'm getting stuck on picturing how the system guarantees that frame 1 can't grow into frame 2.
EDIT: Ah, I think I understand. It seems that they're taking advantage of a large virtual address space to give each stack loads of space, rather than them being contiguous like I assumed from fig 8.
> As modern 64-bit address-space is big enough for the allocation of many large continuous stacks [...]