This is a continuously updated article, that I will keep on the top of the webpage. It contains links to all PDFs (and hopefully publications in the future) uploaded here. Thimni PDF: link SQ-SVM PDF: PDF link read more →

REPO: https://codeberg.org/0x177/LSNN Typical sparse SNNs allow for general connectivity between neurons, i.e allowing a synapse between any presynaptic neuron and any postsynaptic neuron. However, in the brain, the majority of synapses are local, i. ... read more →

summary of abstract: In this text, we examine the qubit scaling of the approach of kernel generation proposed in a 2019 paper by Jiaying Yang, Ahsan Javed Awan, and Gemma Vall-Llosera, mathematically proving the redundancy of the majority of the com ... read more →

I have been working on implementing block-based optimizations for rqism, that divide the statevector into blocks depending on the type of gate to efficiently implement that gate directly, avoiding the complex linear algebra of quantum gate applicatio ... read more →

I made a new(? might be old but buried) algorithm(? idk what this thing is tbh) for rendering point clouds as surfaces. It is mean to be used in augmentation with my SDF to point cloud convsesion algorithm. It works by representing each point as a pl ... read more →

i hacked together a small demo for thimni. the player is a capsule shape that can shoot bombs to destruct the fractal controls: WASD: forward, right, left, backward space: jump left click: shoot bomb downloads linux: https://drive.proton.me/urls/0B ... read more →

a system where each cell tries to clamp its local entropy in a range. got the idea while working on my AdS/CFT emergent gravity simulation (WIP, unpublished as of the time i am writing this, probably never finishing it :3) algorithm i am losing my sa ... read more →

I wrote an implementation of collision with a menger sponge using thimni and it works surprisingly well! I added a benchmark for them and 100 random menger sponges colliding takes an average of 100 milliseconds. here is a link to the result read more →

I have been toying around with an expiremental algorithm for SDF collision detection and resolution. I have not seen anything like it, but i am still not sure if it is novel. The algorithm seems fairly performant and does not use voxelization, train ... read more →

Spheres are not a stress test, but it does run in 5 milliseconds. Also, as it turns out, the step in the algorithm where the n-d spheres are filtered should be single threaded. this is quite counter intuitive, and might be caused by the simplicity of ... read more →