#aoc25 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #aoc25, aggregated by home.social.
-
A strange package has arrived. Received for my outstanding performance on last year's #AdventOfCode. Except the year is wrong on the shirt :) I suppose it's a prediction for this year's event ;-p
-
A strange package has arrived. Received for my outstanding performance on last year's #AdventOfCode. Except the year is wrong on the shirt :) I suppose it's a prediction for this year's event ;-p
-
A strange package has arrived. Received for my outstanding performance on last year's #AdventOfCode. Except the year is wrong on the shirt :) I suppose it's a prediction for this year's event ;-p
-
A strange package has arrived. Received for my outstanding performance on last year's #AdventOfCode. Except the year is wrong on the shirt :) I suppose it's a prediction for this year's event ;-p
-
Advent of Code Day 5: Iterates over RAM holding fresh ID ranges. Autopipeline checks N IDs against M ranges each cycle. Easily does N=3,M=2 at ~235MHz, ~1.4 billion ID-in-range checks computed per sec 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day5.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 5: Iterates over RAM holding fresh ID ranges. Autopipeline checks N IDs against M ranges each cycle. Easily does N=3,M=2 at ~235MHz, ~1.4 billion ID-in-range checks computed per sec 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day5.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 5: Iterates over RAM holding fresh ID ranges. Autopipeline checks N IDs against M ranges each cycle. Easily does N=3,M=2 at ~235MHz, ~1.4 billion ID-in-range checks computed per sec 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day5.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 5: Iterates over RAM holding fresh ID ranges. Autopipeline checks N IDs against M ranges each cycle. Easily does N=3,M=2 at ~235MHz, ~1.4 billion ID-in-range checks computed per sec 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day5.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day7.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day7.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day7.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day7.c
#aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
-
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎 github.com/JulianKemmer... #aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
github.com/JulianKemmerer... -
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎 github.com/JulianKemmer... #aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
github.com/JulianKemmerer... -
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎 github.com/JulianKemmer... #aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
github.com/JulianKemmerer... -
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎 github.com/JulianKemmer... #aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
github.com/JulianKemmerer... -
Advent of Code Day 7: very simple design, good intro to #pipelinec. processing all ~hundreds of elements of an entire line each cycle. ~600 million to ~5.3 billion tachyon beams splitting per second. 😎 github.com/JulianKemmer... #aoc25 #fpga #hardware #verilog #vhdl #hdl #rtl #hls #asic #eda
github.com/JulianKemmerer... -
Advent of Code Day 4: video-like stream of 'pixel' data to a sliding 3x3 window via line buffer fifos. Auto pipeline for kernel function (counting neighbors), ~150M windows per sec. https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day4.c
-
Advent of Code Day 4: video-like stream of 'pixel' data to a sliding 3x3 window via line buffer fifos. Auto pipeline for kernel function (counting neighbors), ~150M windows per sec. https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day4.c
-
Advent of Code Day 4: video-like stream of 'pixel' data to a sliding 3x3 window via line buffer fifos. Auto pipeline for kernel function (counting neighbors), ~150M windows per sec. https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day4.c
-
Advent of Code Day 4: video-like stream of 'pixel' data to a sliding 3x3 window via line buffer fifos. Auto pipeline for kernel function (counting neighbors), ~150M windows per sec. https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day4.c
-
Advent of Code Day 9: Iterates over RAM holding points. Autopipeline computes N rectangle areas per clock cycle and finds max. Easily does N=4 at ~100MHz with few pipeline stages, ~400M rect areas computed per sec 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day9.c
-
Advent of Code Day 9: Iterates over RAM holding points. Autopipeline computes N rectangle areas per clock cycle and finds max. Easily does N=4 at ~100MHz with few pipeline stages, ~400M rect areas computed per sec 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day9.c
-
Advent of Code Day 9: Iterates over RAM holding points. Autopipeline computes N rectangle areas per clock cycle and finds max. Easily does N=4 at ~100MHz with few pipeline stages, ~400M rect areas computed per sec 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day9.c
-
Advent of Code Day 9: Iterates over RAM holding points. Autopipeline computes N rectangle areas per clock cycle and finds max. Easily does N=4 at ~100MHz with few pipeline stages, ~400M rect areas computed per sec 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day9.c
-
Advent of Code Day 3 pipelined no back pressure. N ascii chars as input each cycle. finding max pair of digits pipelined arbitrarily. 8 chars of input each cycle? no problem to get FMAX of 100+MHz.
~1 Gbyte per sec of ascii could be processed 😎 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day3.c #aoc25 #fpga #hdl #hls -
Advent of Code Day 3 pipelined no back pressure. N ascii chars as input each cycle. finding max pair of digits pipelined arbitrarily. 8 chars of input each cycle? no problem to get FMAX of 100+MHz.
~1 Gbyte per sec of ascii could be processed 😎 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day3.c #aoc25 #fpga #hdl #hls -
Advent of Code Day 3 pipelined no back pressure. N ascii chars as input each cycle. finding max pair of digits pipelined arbitrarily. 8 chars of input each cycle? no problem to get FMAX of 100+MHz.
~1 Gbyte per sec of ascii could be processed 😎 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day3.c #aoc25 #fpga #hdl #hls -
Advent of Code Day 3 pipelined no back pressure. N ascii chars as input each cycle. finding max pair of digits pipelined arbitrarily. 8 chars of input each cycle? no problem to get FMAX of 100+MHz.
~1 Gbyte per sec of ascii could be processed 😎 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day3.c #aoc25 #fpga #hdl #hls -
Advent of Code Day 3 pipelined no back pressure. N ascii chars as input each cycle. finding max pair of digits pipelined arbitrarily. 8 chars of input each cycle? no problem to get FMAX of 100+MHz.
~1 Gbyte per sec of ascii could be processed 😎 🎄
https://github.com/JulianKemmerer/PipelineC/blob/master/examples/aof25/day3.c #aoc25 #fpga #hdl #hls -
Advent of Code is in full swing! 🎄 ☃️ 🎅
It's shorter this year at 12 days, and I'm doing it in Zig.
Anyone else participating?
#AoC #AoC25 #AdventOfCode #AdventOfCode2025 #Zig #Programming
-
Advent of Code is in full swing! 🎄 ☃️ 🎅
It's shorter this year at 12 days, and I'm doing it in Zig.
Anyone else participating?
#AoC #AoC25 #AdventOfCode #AdventOfCode2025 #Zig #Programming
-
Advent of Code is in full swing! 🎄 ☃️ 🎅
It's shorter this year at 12 days, and I'm doing it in Zig.
Anyone else participating?
#AoC #AoC25 #AdventOfCode #AdventOfCode2025 #Zig #Programming
-
Advent of Code is in full swing! 🎄 ☃️ 🎅
It's shorter this year at 12 days, and I'm doing it in Zig.
Anyone else participating?
#AoC #AoC25 #AdventOfCode #AdventOfCode2025 #Zig #Programming
-
Advent of Code is in full swing! 🎄 ☃️ 🎅
It's shorter this year at 12 days, and I'm doing it in Zig.
Anyone else participating?
#AoC #AoC25 #AdventOfCode #AdventOfCode2025 #Zig #Programming