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, 6:28:55 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
Remember that all science, mathematics, education, theology comes from understanding an idea. So ideas are valuable to society. If you think they're worthless, then I don't want your ideas, I want people in academia and industry to have good ideas and push society forward. Science, mathematics, theories, research, theology all are built on the shoulders of giants, with ideas that provide foundations of truth, wisdom and understanding to push society forward. It's not always the person that has the ideas that puts the idea into execution. The more ideas you have and the more you work on them the more you grow as a person. I also work on building software to put my ideas to the test. I journal/blog all my computer and technology related ideas on GitHub out in the open. I have published 700+ ideas on GitHub. I create a repository called "ide
Read the rest
as" then I journal 100-400 ideas using markdown and then create a new repository and repeat. They're all in markdown and written as simple numbered markdown headings and a few one paragraph to a page of notes. They should be enough to understand the idea and do something with it. I reread my ideas repeatedly and I uncover new ideas from my existing ideas. Ideas should be built on and improved precept by precept. For reference, they're about software design, software architecture, parallelism, multithreading, efficiency, growth, futurism, progress. https://github.com/samsquire/ideas <- 2013 https://github.com/samsquire/ideas2 https://github.com/samsquire/ideas3 https://github.com/samsquire/ideas4 <- this year, unfinished, up to 400 ideas https://github.com/samsquire/startups <-- startups ideas
In Dealing with Your Ideas
samsquire·Oct 25, 2022Recommendation phrase
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 supercomputer compiler I wrote about it here https://github.com/samsquire/ideas4#112-compiler-as-a-servic... Application performance monitoring, scheduling, control loops ala Kubernetes, parallelism, multithreading, data scheduling (shifting and sharing data to where it needs to be used), advanced caching and regeneration and container scheduling and binpacking and data layout scheduling could all be compiled by a supercompiler for extreme performance.
In Graphviz 7
I am really interested in this space. There's an article that Cal Paterson wrote that async doesn't speed up code - it is not parallel. The GIL prevents Python from being parallel. So even if you create a thread to run an async method in Python, it shall not run in parallel to the main thread of execution. (In fact, it shall block the main thread of execution if you start a thread in the thread you are in, due to the blocking run_in_executor) https://calpaterson.com/async-python-is-not-faster.html I wrote a multithreaded userspace 1:M:N scheduler (1 scheduler thread, M kernel threads and N lightweight/green threads) which resembles Golang M:N model. I implemented the same design in Rust, C and Java. I am thinking it could be combined with my epoll-server and it would be an application server. https://github.com/samsquire/preemptible-threa
Read the rest
d https://github.com/samsquire/epoll-server I am also interested in structured concurrency. This article by Vala developers is good. https://verdagon.dev/blog/seamless-fearless-structured-concu... I am trying to find a concurrent software design that is scalable and is easy to write and hides complicated lock programming. I document my studies and ideas in the open in ideas4. https://github.com/samsquire/ideas4 I've implemented multithreaded parallel multiversion concurrency control in Java, which is the same approach used by Postgresql and MySQL for concurrent read and writing to the same data atomically. I still think concurrency is hard to write and understand. Even with async/await. // 3 requests in flight result1 = async_task1(); result2 = async_task2(); result3 = async_task3(); await result1; await result2; await result3; I ported a parallel multiconsumer multiproducer ringbuffer from Alek https://www.linuxjournal.com/content/lock-free-multi-produce... I use Python threads in https://github.com/samsquire/devops-schedule and https://github.com/samsquire/parallel-workers to parallelise a topologically sorted graph of IO of devops programs. This allows efficient scheduling and blocking with thread.join() for each split of the work graph and then a regrouping before doing other things, also potentially in parallel. This pattern is efficient and easy to use.
In Python and Async Simplified (2018)
This is very good work One of my ideas is "lazy invariant maintenance". It should be possible to layer the tip of execution (what should go on next) with lazy incremental materialized invariants. Let the computer decide what is the most efficient approach to solving the computational problem. In other words everything is a query and queries are layered ontop of eachother in arbitrary directions. I think storage or source of truth should be decided by the software. It might be more efficient to arrange data a certain way to sustain multiple types of queries. https://github.com/samsquire/ideas4#20-lazy-arrange-or-invar...
In Codebase as Database: Turning the IDE Inside Out with Datalog (2020)

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.