At first I was only trying to make a tool that makes my day easier, I want AI to follow the exact procedure to perform my requests, soon I realize almost 80% of the "expected procedure" is deterministic without even needing AI, in most cases AI is only needed in judge/review/summarize/orchestrate actions, all the rest of the dirty work can be done without AI and without paying a dime.
As a result I created https://github.com/recued/recued, it stores all my data in my own home, executes predefined recipes whenever I ask for, fast, and cheaply.
Is it a success? I don't know, but I am still actively improving it on daily basis.
I guess neither success nor failure fits my description, I found something that I am passionated about, and it is also making my day easier.
From the sentimental perspective, I call it my success.
Specifically about dependencies: one piece of the puzzle is a lightweight wrapper for buffers (such as the builtin `array.array`) to allow treating them like Numpy arrays (still with accelerated code for simple operations like elementwise addition). Video basically requires a 4d-array (length x width x colour x time). For drawing, rather than PIL I'm working with Cairo and Harfbuzz directly.
https://en.wikipedia.org/wiki/SuperMemo https://github.com/melpomenex/plethora
I've been spouting off on the advantages of air gaps and data diodes from a theoretic perspective for more than a decade, I decided it's time to get my hands dirty.
I'll be open sourcing the whole thing, and writing code by hand in Free Pascal, the language I'm most familiar with.
0101.0102[(0101)[0102
0103.0104[(0103)[0104
0105
[0101.0102 0101.0104 0102.0104
0204
in my formal calculus the above generates an addition structure relating arbitrary length bit patterns - because these are constraints, any known bits can be specified and the calculations can proceed backwards, forwards, or inside out
the formalism produces trees of parentheses by way of composition rules that are interpreted as in the Laws of Form "calling" and "crossing" (Spencer-Brown)
()()->()
(())->
the ultimate goal is to take high level programs and compile them directly into hardware descriptions without a simulation step