HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
mikewarot
Bitgrid
Pascal2023–2024
mikewarot / Bitgrid

Bitgrid

Bitgrid - a new model of computation

2Distinct people
42Mentions
0Explicit recommenders
23GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Bitgrid - a new model of computation

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

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

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 2:04:58 PM 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 month42 dated mentions

Observed mentions: 2023-06-17 03:26:35 UTC to 2024-12-27 16:26:26 UTC.

02462023-06-01 00:00:00 UTC to 2023-07-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 commentsJun 20232023-07-01 00:00:00 UTC to 2023-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-08-01 00:00:00 UTC to 2023-09-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2023-09-01 00:00:00 UTC to 2023-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-10-01 00:00:00 UTC to 2023-11-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2023-11-01 00:00:00 UTC to 2023-12-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2023-12-01 00:00:00 UTC to 2024-01-01 00:00:00 UTC (exclusive): 6 mentions; 0 submissions, 6 comments2024-01-01 00:00:00 UTC to 2024-02-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2024-02-01 00:00:00 UTC to 2024-03-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2024-03-01 00:00:00 UTC to 2024-04-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 commentsMar 20242024-04-01 00:00:00 UTC to 2024-05-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-01 00:00:00 UTC to 2024-06-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2024-06-01 00:00:00 UTC to 2024-07-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-07-01 00:00:00 UTC to 2024-08-01 00:00:00 UTC (exclusive): 5 mentions; 1 submissions, 4 comments2024-08-01 00:00:00 UTC to 2024-09-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2024-09-01 00:00:00 UTC to 2024-10-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2024-10-01 00:00:00 UTC to 2024-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-11-01 00:00:00 UTC to 2024-12-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2024-12-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsDec 2024

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
Jun 20232023-06-01 00:00:00 UTC2023-07-01 00:00:00 UTC303
Jul 20232023-07-01 00:00:00 UTC2023-08-01 00:00:00 UTC000
Aug 20232023-08-01 00:00:00 UTC2023-09-01 00:00:00 UTC404
Sep 20232023-09-01 00:00:00 UTC2023-10-01 00:00:00 UTC000
Oct 20232023-10-01 00:00:00 UTC2023-11-01 00:00:00 UTC505
Nov 20232023-11-01 00:00:00 UTC2023-12-01 00:00:00 UTC101
Dec 20232023-12-01 00:00:00 UTC2024-01-01 00:00:00 UTC606
Jan 20242024-01-01 00:00:00 UTC2024-02-01 00:00:00 UTC101
Feb 20242024-02-01 00:00:00 UTC2024-03-01 00:00:00 UTC101
Mar 20242024-03-01 00:00:00 UTC2024-04-01 00:00:00 UTC303
Apr 20242024-04-01 00:00:00 UTC2024-05-01 00:00:00 UTC000
May 20242024-05-01 00:00:00 UTC2024-06-01 00:00:00 UTC202
Jun 20242024-06-01 00:00:00 UTC2024-07-01 00:00:00 UTC000
Jul 20242024-07-01 00:00:00 UTC2024-08-01 00:00:00 UTC514
Aug 20242024-08-01 00:00:00 UTC2024-09-01 00:00:00 UTC404
Sep 20242024-09-01 00:00:00 UTC2024-10-01 00:00:00 UTC202
Oct 20242024-10-01 00:00:00 UTC2024-11-01 00:00:00 UTC000
Nov 20242024-11-01 00:00:00 UTC2024-12-01 00:00:00 UTC303
Dec 20242024-12-01 00:00:00 UTC2025-01-01 00:00:00 UTC202

What Hacker News says

5 sources
No, I don't have any suggested reading... just a plan of action should it be required. I'm assuming that enough work has been done that it should be possible to build a CRUD application in Pascal, and have it eventually produce working WASM executable code. I have some existing code in pascal[1]... and it would be helpful for it to run in the browser.... lemme see how bad it is making this happen. It'll take a few days, I think. [1] https://github.com/mikewarot/Bitgrid
In Ask HN: If you were to build a web app today what tech stack would you choose?
I'm not sure if the idea[1,2] is stupid, or brilliant... and I'm not arrogant enough to assume its brilliant. I've been nerd sniped by it though, since the 1980s. The basics are simple enough, imagine an FPGA without any routing hardware, just a sea of 4 bit in, 4 bit out Look Up Tables (LUTs). To prevent race conditions, I'd latch the outputs of the cells, and clock then in 2 alternative phases. This makes the thing a horrible FPGA, because latency is the one thing they fight hard to overcome, but on the other hand, it makes it very easy to reason about, and immune to race conditions, timing issues, etc. The gain is that you get almost trivial routing, and essentially all of the transistors devoted to compute. It's what you get when you answer George Gilder's call to "waste transistors".[3] I've got a simulator for the chip, I still need
Read the rest
to figure out how to program it (i.e. write a compiler, debugger, etc.) The major question.... can this architecture do an Exaflop on a cheap chip? (<$10 in quantity) [1] https://esolangs.org/wiki/Bitgrid [2] https://github.com/mikewarot/Bitgrid [3] https://www.wired.com/1993/04/gilder-4/
In Ask HN: Why haven't you started your startup?
I can't... you might be able to afford $10k, but right now, I had to think hard before spending $3 last night. I hope to learn enough Verilog/VHDL/RTL to take advantage of the Free Shuttle program they have[1] eventually. Currently, I'm wondering how to go from expressions to code I can load into a bitgrid. The thought of parsing code, building an AST, converting that to an acyclic directed graph of binary expressions, to actual bits to load the grid with.... overwhelms me, and has me putting it off. 8( I do have a working simulator, written in Pascal[2], that can run fairly quickly for toy problems on my desktop PC. So, there's been some progress. I strongly suspect I can get there, but need an accountability buddy to push me along. I used to be a self starter, but I stayed in an IT Admin job too long that crushed it out of me. [1] https
Read the rest
In 22-year-old builds chips in his parents' garage (2022)
I've been pursuing a path to cheap and easy PetaFLOP on a chip architecture that is decidedly edgy... it might work out great, or might be a miserable failure... the BitGrid[1]. It's dead nuts simple... a cartesian grid of 4 bit input, 4 bit output LUTs, latched and clocked in 2 phases (like the colors on a checkerboard) to prevent race conditions. It's a Turing complete architecture that doesn't have the routing issues of an FPGA because there's no routing hardware in the way. But it is also nuts because there's no routing fabric to get data rapidly across the chip. If you can unlearn the aversion to latency that we've all had since the days of TTL and the IMSAI, you realize that you could clock an array at least 3 Ghz, giving 3 billion answers/second. It's all a question of programming. (Which is where I'm stuck right now, analysis para
Read the rest
lysis) I've got an emulator that works reasonably well on my PC. Now I've got to write the actual software that can generate binaries for it, and the eventual chip. [1] https://github.com/mikewarot/Bitgrid
In Ask HN: Show me your half baked project
I've been pursuing a path that is decidedly edgy... and might work out great, or might be a miserable failure... the BitGrid[1]. It's dead nuts simple... a cartesian grid of 4 bit input, 4 bit output LUTs, latched and clocked in 2 phases (like the colors on a checkerboard) to prevent race conditions. It's a turing complete architecture that doesn't have the routing issues of an FPGA because there's no routing hardware in the way. But it is also nuts because there's no routing fabric to get data rapidly across the chip. If you can unlearn the aversion to latency that we've all had since the days of TTL and the IMSAI, you realize that you could clock an array of 16 Billion cells slowly to save power at 1Mhz, and still get a million tokens/sec. It's all a questiron of programming. (Which is where I'm stuck right now, analysis paralysis) [1]
Read the rest
In Ask HN: Is anyone working on neuromorphic CPU architectures for AI?

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.