HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
samsquire
ideas4
HISTORICAL RECORD2022–2023
samsquire / ideas4 · Not publicly available

ideas4

Discover this repository through its Hacker News conversations.

3Distinct people
47Mentions
1Explicit recommenders
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

I love these words "As I continued that work, I've also started talking about the feasibility of creating a supercompiler." and thoughts already. One of my ideas is a…

samsquire used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 4:59:52 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by month47 dated mentions

Observed mentions: 2022-05-30 03:50:01 UTC to 2023-08-18 15:43:39 UTC.

02462022-05-01 00:00:00 UTC to 2022-06-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsMay 20222022-06-01 00:00:00 UTC to 2022-07-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2022-07-01 00:00:00 UTC to 2022-08-01 00:00:00 UTC (exclusive): 6 mentions; 0 submissions, 6 comments2022-08-01 00:00:00 UTC to 2022-09-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2022-09-01 00:00:00 UTC to 2022-10-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2022-10-01 00:00:00 UTC to 2022-11-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2022-11-01 00:00:00 UTC to 2022-12-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2022-12-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsDec 20222023-01-01 00:00:00 UTC to 2023-02-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2023-02-01 00:00:00 UTC to 2023-03-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2023-03-01 00:00:00 UTC to 2023-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-04-01 00:00:00 UTC to 2023-05-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2023-05-01 00:00:00 UTC to 2023-06-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2023-06-01 00:00:00 UTC to 2023-07-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2023-07-01 00:00:00 UTC to 2023-08-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2023-08-01 00:00:00 UTC to 2023-09-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsAug 2023

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 20222022-05-01 00:00:00 UTC2022-06-01 00:00:00 UTC202
Jun 20222022-06-01 00:00:00 UTC2022-07-01 00:00:00 UTC505
Jul 20222022-07-01 00:00:00 UTC2022-08-01 00:00:00 UTC606
Aug 20222022-08-01 00:00:00 UTC2022-09-01 00:00:00 UTC202
Sep 20222022-09-01 00:00:00 UTC2022-10-01 00:00:00 UTC505
Oct 20222022-10-01 00:00:00 UTC2022-11-01 00:00:00 UTC404
Nov 20222022-11-01 00:00:00 UTC2022-12-01 00:00:00 UTC303
Dec 20222022-12-01 00:00:00 UTC2023-01-01 00:00:00 UTC202
Jan 20232023-01-01 00:00:00 UTC2023-02-01 00:00:00 UTC404
Feb 20232023-02-01 00:00:00 UTC2023-03-01 00:00:00 UTC404
Mar 20232023-03-01 00:00:00 UTC2023-04-01 00:00:00 UTC000
Apr 20232023-04-01 00:00:00 UTC2023-05-01 00:00:00 UTC202
May 20232023-05-01 00:00:00 UTC2023-06-01 00:00:00 UTC303
Jun 20232023-06-01 00:00:00 UTC2023-07-01 00:00:00 UTC101
Jul 20232023-07-01 00:00:00 UTC2023-08-01 00:00:00 UTC303
Aug 20232023-08-01 00:00:00 UTC2023-09-01 00:00:00 UTC101

What Hacker News says

5 sources
My side project is to generate ideas for how I want computing to be and try implement algorithms that do so. My vision of computing is so far away from how computing works in this era, it's more like Xanadu and The Mother of All Demos. I am a DevOps engineer interested in parallel programming and distributed systems amongst other things, see my GitHub. I posted my idea pages. I figure they are sources of inspiration for this clique of software engineers and makers. https://mysideproject.rocks/p/62a947aaed8fdc00174a90f0 https://mysideproject.rocks/p/62a94821ed8fdc00174a90f4 https://mysideproject.rocks/p/62a94899ed8fdc00174a90f8 https://github.com/samsquire/ideas https://github.com/samsquire/ideas2 https://github.com/samsquire/ideas3 https://github.com/samsquire/ideas4 (incomplete) Ideas4 is more data structure ideas and futuristic computin
Read the rest
g ideas and automated program synthesis.
In Show HN: My Side Project Rocks – Share and discover side projects
I agree that compilers and schedulers should be enforcing partial orders of concurrency. I talk of various multiversion concurrency control ideas in my ideas4 page. As an example I think Thread yield should take an argument for a matching data structure that when the state of that data structure changes you trigger rescheduling at that point and avoid a busy wait. HTTPS://GitHub.com/samsquire/ideas4
In Must be this tall to write multi-threaded code (2015)
I implemented multiversion concurrency control and a poor but safe lock free algorithm. I am still coming up with rules. As the Serializable Snapshot Isolation paper attests, you can avoid dangerous 2 reads and writes to the same data structure with an algorithm (in the paper) with timestamp ordering and trying to detect cycles with a heuristic in the graph with two booleans inConflict and outConflict. The answer to concurrency bugs is that languages implement MVCC. See my ideas4 page for concurrency control ideas. Most software doesn't scale with threads and doesn't offer true parallelism. In other words programs don't use threads to their full potential. I have an idea for LMAX disruptors with a multiproducer multiconsumer ringbuffer in ideas4. Don't block the event loop! I like process calculus and pi calculus and CSP. But I think we
Read the rest
can combine them altogether. Universal constructors and work stealing and compare and set is a powerful primitive for concurrency. HTTPS://GitHub.com/samsquire/multiversion-concurrency-control HTTPS://GitHub.com/samsquire/compare-and-swap-sort HTTPS://GitHub.com/samsquire/ideas4
In Must be this tall to write multi-threaded code (2015)
Don't underestimate how performant a single thread is! Some problems are embarrassingly parallel. Of course coordinating threads is difficult. I am designing an LMAX disruptor system that translates a synchronous piece of code into nested LMAX disruptors. Essentially you can do high IO and high CPU and not block other requests as they're pipelined. https://github.com/samsquire/ideas4#51-rewrite-synchronous-c... Don't block the UI thread or the node js event loop. We don't have to pick between tokio and rayon. We can have multiple event loops.
In Fallacies of distributed systems
This is apt timing. I wrote a thought recently of chunking loops and yielding after a certain number of chunks. The Loom scheduler does NOT guarantee resource starvation avoidance for high CPU usage. You need to Thread.yield. I also thought of creating a mapping from synchronous code and rewriting it to a tree of LMAX disruptors. I ported a wait-free ringbuffer from C++ to Java today - it was written by Alexander Krizhanovsky[1] In LMAX disruptor you split each IO request in half - you have a disruptor that enqueuing events events to request the IO and to pass the event on to a callback you enqueue the response on a different disruptor. If a synchronous request handler has 27 lines it represents a tree of 27 disruptor threads independently scaled. We can pipeline the request with 27 threads all in an event loop that pipeline each task ×
Read the rest
core count and without blocking the servicing thread or other work. So event loops without blocking! So CPU heavy tasks do not block other heavy CPU tasks and do not block the servicing thread and are not blocked by IO. https://github.com/samsquire/ideas4#51-rewrite-synchronous-c... [1]: https://www.linuxjournal.com/content/lock-free-multi-produce...
In On Java/JVM: Loom and Thread Fairness

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.