06:43 mediaim: The battle has been one, and mission completed in so many trees, that i am beginning to test, and a lot of genius kind of code too. I have five trees at my spectrum, and they all work. I want to talk a bit about go gini solver that i looked at first today, those gpio calls are known as memory state variables, it has crisp cnf presentation, syscalls are not different to state, where as succint bitvectors are literal clause sets. Long story short, the code
06:43 mediaim: appears as nearly perfect to me.
06:45 mediaim: it's an implementation of a solver through compressed bitvectors, there are so many out there already, i am a bit behind with testing all of them as of yet
06:45 mediaim: but i looked at the packing methods, and it is correct
06:53 mediaim: I am unsure what the server client backend is, cause i need to look from go modules, it might be even DMA that go offers through their abstraction.
07:00 mediaim: so variables start from offset 1 to two in power of 30 , and literals are have offset 2 to two in power of 31
07:01 mediaim: and packing is bitvectors of succint, i once looked at it, they propagate into a final answer
07:18 mediaim: it should be elias-fano , but i am still bit looking into this, as i woke up, elias fano is very much the best , pretty much the same as i did
07:21 megumin: >freesync_video = "0"
07:22 megumin: it should be enabled in 6.5
07:27 mediaim: elias fano is documented in the web very well, the highest compression rates of 32bit variable also, it's bookmarked, it's slightly over one million entries
07:33 mediaim: I must go now, taking a nap, several days more competitions, I am old and injured, and were not good in maths in school, just the web has all the POC and all confirmation documents , yeah
07:34 mediaim: were/was
07:34 mediaim: cheers.
20:31 arsenm: mareko: you need the sqrt fpmath thing now