iiinova — where your digital self keeps evolving

DuskyElf

@duskyelf.com

Blessed with great vocals, Rust, NixOS, Neovim & pi agent github.com/DuskyElf

DuskyElf @duskyelf.com · 23/08/2026

One can write code as a craft and at the same time vibecode experiments that they would have never done otherwise. Like this bluesky real time post tracker that I made, which aggregates hot posts among my followees and their followees...

010

DuskyElf @duskyelf.com · 11/06/2026

A mind blowing insight that prediction and compression are mathematically equivalent, and prediction needs some sort of intelligence That means intelligence is somehow deeply related to compression here are more insights from the latest 3b1b video straight from my journal #compsci #maths

claude shannon known as the "father of information theory" as he laid the foundations of information age, interesting thing that, prediction and compression are mathematically equivalent, prefix-free code, is a clever way to compress weighted data based off of frequency, the relation between data size and probabilities is the founding insight of information theory, random noise should be incompressible,, and therefore a perfect compression algorithm's output should be indistinguishable from random noise, `p(any n-bit message) = 1 / 2^n`, => `-log_2(p) = n`, that the number of bits allocated to a message, assuming perfect compression, is `-log_2(p)`, where p is the probability of occurring, `-log_2(p)` is the same as `log_2(1/p)` but more intuitive, entropy h(p), describes the minimum number of bits per symbol necessary to encode a message following this distribution, `h(p) = sigma for i, p_i(-log_2(p_i))`, this is from the noiseless coding theorem by claude shannon's in his paper "a mathematical theory of communication" 1948, which states that no encoding can ever be more efficient than this limit, and it shows that it's always possible to get arbitrarily close to this limit, requires that every symbol follow the same distribution p, but in natural language, the probability of next char is a stochastic process, which works over context, and this is well beyond what exact calculation can give you, that's why claude shannon turned to estimates based on observation, needing to probe at intelligent models of language (humans at that time)

270

DuskyElf @duskyelf.com · 11/06/2026

yess, my X account is filled with nothing but bot requests.. btw, did you know that thanks to AT protocol, bluesky's database is all public and can be used to create backend less applications.. here's the last posts you liked (while bluesky's UI doesn't show it, other UIs can)

1120

DuskyElf @duskyelf.com · 20/05/2026

I'm able to just do that with this up arrow

github PR review UI, up arrow button to expand the changed file into unchanged lines and plus button to comment on those lines

100

DuskyElf @duskyelf.com · 18/11/2025

Game developers are the true engineers...

searching "engineer definition" on duckduckgo, second result - "One who operates an engine"

080

DuskyElf @duskyelf.com · 06/04/2025

#khabylame

Screenshot of python code -
import itertools as it
Outputs: None
list(range(12))
Outputs: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
list(it.batched(list(range(12)), 3))
Outputs: [(0, 1, 2), (3, 4, 5), (6, 7, 8), (9, 10, 11)]

0190

DuskyElf @duskyelf.com · 06/04/2025

CSS had nesting all along #webdev #html #css

A screenshot form MDN reference with the example syntax of CSS nesting using the `&` operator. At https://developer.mozilla.org/en-US/docs/Web/CSS/Nesting_selector

160

DuskyElf @duskyelf.com · 13/03/2025

Rust Infinite ♾️ Compile Time 😂 It hangs on ```rs trait Foo { type Gat<'a>; } trait Bar { type Ty: Foo where for<'a> <Self::Ty as Foo>::Gat<'a>: Assoc<Ty = ()>; } trait Assoc { type Ty; } ``` #rustlang #code #opensource #linux #programming github.com/rust-lang/rust

Screenshot of btop+ program showcasing 100% CPU core usage from rustc for 1 minute 26 seconds and counting. Side note, 2 instances of clippy-driver are also using 100% CPU

cargo run command stuck in Building phase

193