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

Explore on GitHubRead Hacker News discussions
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, 12:45:45 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

6 sources
mikewarot·Dec 14, 2023
A while ago, I wrote gearfinder, to help find gear combinations to match a given ratio. [1] It's a little GUI written in Lazarus I've written a BitGrid simulator in Lazarus.[2] BitGrid is a hypothetical computing architecture I've been noodling with for decades. I'm hoping to learn Verilog/VHDL/RTL enough get a chip made in one of the free shuttles. Then comes the hard part... programming the thing. I keep pushing myself back into perpetual analysis paralysis. [1] https://github.com/mikewarot/GearFinder [2] https://github.com/mikewarot/Bitgrid
In Ask HN: What apps have you created for your own use?
mikewarot·Dec 6, 2023
BitGrid[1] is the most efficient general purpose compute architecture possible for Petaflops and beyond. It eliminates memory bandwidth issues. Its a nice elegant alternative architecture. I'm quite surprised nobody actually tried it earlier. [1] https://github.com/mikewarot/Bitgrid * I give 50/50 odds I'm a crackpot on this one... I'd really like to know for sure which way that coin toss comes out in the end
In Ask HN: What's a strong tech opinion you have that few agree with you on?
mikewarot·Dec 5, 2023
I think I can do it far, far cheaper than that... and I've been talking about it, in public, for over a decade.[1] I could easily be wrong, of course. It really all depends on how much power a 4x4 LUT and 4 bit latch Latch Leak, and how much energy it takes to clock data through them for a cycle, and how fast they can be cycled. If the number are good, this thing will be amazingly cool. I can't find good numbers anywhere. If you've made chips with latches and LUTS, any performance data you can share, no matter how old, would be helpful It's an idea that's been bouncing around in my head since reading George Gilder's call to waste transistors. Imagine the worst possible FPGA, no routing hardware, and slow it down even more with a latch on every single LUT. Optimize it slightly, by making cells with 4 bits in, 4 bits out (64 bits of program
Read the rest
ming per cell), with the cells clocked in 2 phases, like the colors of a chess board. This means that each white cell has static inputs from the black cells.... and is thus fully deterministic, and easy to reason about. The complement happens on the other phase. Together, it becomes turning complete. The thing is, it does computing with NO delays between compute and memory. All the memory is effectively transferred to compute every clock cycle. The latency sucks because you'll take n/2 cycles to get data across an N*N grid. However, you'll get an answer every clock cycle after that. Imagine a million GPT-4 tokens/second.... not related to each other, of course, but parallel streams, interleaved as the data streams across the chips. Imagine a bad cell.... you can detect it, and route around it. Yields don't have to be 100%. The extreme downside is that tools for programming this thing don't exist. VHDL, etc... aren't appropriate. I'm going to have to build them. I've been stuck in analysis paralysis, but I've decided to try to get Advent of Code done using my bitgrid simulator. I hope to be done before it starts again next December. ;-) [1] https://bitgrid.blogspot.com/ [2] https://github.com/mikewarot/Bitgrid
In Ask HN: Why is it taken for granted that LLM models will keep improving?
mikewarot·Dec 2, 2023
In times past, it was Pascal that was my language of choice[1]. This year, I'm going to use a virtual BitGrid[2]. Here's the repo[3] Hopefully I can finish the 2023 problems before next November, I have nothing but the simulator. Nothing to convert text to code, do I/O, etc. Oh boy.... Day 1 A... and I have to figure out how to feed text into a bitgrid, and get it out the other side... before I can even think about parsing it, making integers, and adding them, then converting back to text. BitGrid - a sea of LUTs with latches, completely parallel down to the bit processing. Each LUT has 4 bits of input, and 4 independent bits out to each cardinal direction. Clocking in 2 phases, like colors on a chess board, to eliminate undefined behavior or timing issues. [1] https://github.com/mikewarot/Advent_of_Code_in_Pascal [2] https://github.com
Read the rest
/mikewarot/Bitgrid [3] https://github.com/mikewarot/Advent_of_Code_in_BitGrid
In Advent of Code 2023 is nigh
mikewarot·Dec 2, 2023
Trying to reify the BitGrid, a novel computing architecture[1] that requires a whole new ecosystem to be useful. I've got a working simulator[2], so I can now start on compilers, routers, debugging techniques, etc. I intend to get a chip designed and made through the Google or other chip shuttles. It's all open source hardware and software. I just want to see it in use at least once, before I age out of the world. It's a bucket list item. It's deterministic, because it's basically a set of LUTs and latches, which makes it easier to reason about. Yet it's also Turning complete, as a system. It should be useful for the type of compute job you use an FPGA for, but only if you don't care about latency. Everything is pipelined, so there's no fast way to get a single answer. It should be a very cheap route to petaflops and/or low power, dependi
Read the rest
ng on how you optimize the chip. The simplicity of the design give a lot of flexibility to use, unlike routing things to fit in a specific FPGA. It could offer proveably secure computing, while being power and silicon efficient, because you can literally build a virtual wall around a function and control all access. [1] https://esolangs.org/wiki/Bitgrid [2] https://github.com/mikewarot/Bitgrid
In Ask HN: What's your big goal? What are you working towards?

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.