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

4 sources
In my benchmark of a simple ledger I generate and do 25,021,365 (25 million) random transactions per second. (Withdraw and deposit over 80,000 accounts) Paralellise it via sharding and I get 80,958,379 transctions per second. If I remove the randomness, I get 134,600,233 transactions per second. If I parallelise with 12 threads I get 931,024,042 transactions per second. My point being, if you paralellise properly and do not use shared data, then you can boost performance by a multiple of the number of threads. https://github.com/samsquire/multiversion-concurrency-contro... For the technique I use for this scalability, see my journal entries on sharded structs and sharded integers https://github.com/samsquire/ideas4#565-sharded-struct-pseud... https://github.com/samsquire/ideas4#608-sharded-integers
In C++ Coroutines
Thanks for this. I have never deployed a service mesh or used one but I am designing something similar at the code layer. It is designed to route between server components. That is, at the architecture between threads in a multithreaded system. The problem I want to solve is that I want architecture to be trivially easy to change with minimal code changes. This is the promise and allure of enterprise service buses and messaging queues and probably Spring. I have managed RabbitMQ and I didn't enjoy it. If I want a system that can scale up and down and that multiples of any system object can be introduced or removed without drastic rewrites. I would like to decouple bottleneck from code and turn it into runtime configuration. My understanding of things such as Traefik and istio is that they are frustrating to set up. Specifically I am worki
Read the rest
ng on designing interthread communication patterns for multithreaded software. How do you design an architecture that is easy to change, scales and is flexible? I am thinking of a message routing definition format that is extremely flexible and allows any topology to be created. https://github.com/samsquire/ideas4#526-multiplexing-setting... I think there is application of the same pattern to the network layer too. Each communication event has associated with it an environment of keyvalues that look similar to this: petsserver1 container1 thread3 socket5 user563 ingestionthread1 These can be used to route to keyspace ranges (such as particular users to tenant shards or load balance) to other components. For example users1-1000 are handled by petsserver1 and socket5 is associated with thread3. In other words: changing the RabbitMQ routing settings doesn't change the architecture of your software. You need to change the architecture of the software to match the routing configuration. But what if you changed the routing configuration and the application architecture changed to match?
In Service mesh use cases (2020)
This is interesting. Correct me if I don't understand is this only concurrent with respect to IO is that right? If you run a IO operation or network call (fetch api) in those promises, those shall be concurrent with the CPU execution of your Javascript? I think async/await is a great primitive. I've been working on implementing a async/await switch statement based state machine* in Java for multithreaded async/await. I want to handle the scheduling of multiple promises eagerly, so when you call async task1(); async task2(); async task3(); it schedules them all independently on different threads. * if you've used protothreads in C, this is what it is similar to. To do interleaved concurrency in Javascript, you could do the same pattern (switch based state machine) or do my concurrent looping approach. You break up your long CPU task into l
Read the rest
ots of microtasks and switch between them concurrently with a switch statement. You switch between tasks with a scheduler loop, so you do a bit of work on each task independently. It's concurrent but not parallel. here's my writeup of concurrent loops which takes arbitrarily nested loops and turns them into an iterator https://github.com/samsquire/ideas4#133-concurrent-loops---l... here's my java state machine of multithreaded async/await in Java, that could be adapted to Javascript except it wouldn't be parallel. https://github.com/samsquire/multiversion-concurrency-contro...
In Go-like channels in 10 lines of JavaScript
Thanks for remembering me :-) I would like things to run locally by default and then deployed to the cloud where they run. Should be easier to debug problems if I can get the code to my machine and investigate issues with tools that my computer has such as "strace", "perf" and debug logging that I liberally apply to the build script. In production we would have log aggregation and log search (such as ELK stack) and it is a good habit to get into the perspective of debugging production via tooling. But CICD feels before that tooling in the pipeline. You could wire up your CICD to log to ELK but I would prefer local deployable software. I think my focus on automating things means I want to be capable of seeing how the thing works without relying on a deployed black box in the cloud and using assumptions of how it works rather than direct in
Read the rest
vestigation. One of my journal entries is almost a lamentation of all the things that need to be done to release and use software. This is that entry: https://github.com/samsquire/ideas4#5-permanent-softwareplat... I wonder if software could be deployed more like a URL that has all the information to configure a virtual machine. Docker over URL or something.
In Release engineering is exhausting so here's cargo-dist

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.