λ
2.4K posts


Btw, a fun fact about ML and contex mixing - all the time at the end of school and the beginning of university, I was fascinated by data compression and algorithmic codecs. This is essentially how I started my career as a C developer. There's one fun fact about compression that just occurred to me: the legendary Matt Mahoney, who created the most powerful algorithmic coder and founded the PAQ family, variations of which constantly won the Hutter Prize for data compression, essentially laid the foundation for the concept of ML through data compression, since algorithmic codecs are built on predictive models and sigmoid functions for constructing frequency context models based on the data type. So, what I'm getting at is that in our "narrow" circle of those involved in this topic, there was a clear justification for what AGI is expressed through data compression. As you know - you can't bypass the Shannon limit, that's a hard math law. However, the Shannon limit is bound to a specific predictive model. If an algorithmic codec can build such a profound, context aware model of the world that its 'guessing' pushes the practical compression down to the data's absolute, intrinsic complexity, that might just be the key to unlocking AGI. If you want to start approaching AGI, you need to pay attention to data compression, bc if a context codec model can "decompress" and predict and compress the full context of Wikipedia (which in a compressed format has entropy practically within the limits of Shannon), then this may mean that one of the most important steps towards AGI has been made. PVAC-HFHE uses our own version of algorithmic mixing to compress public keys for the HFHE engine. You can see it here: github.com/octra-labs/web… Now that we're head over heels in working on circles in @octra with the goal of bringing interesting use cases, this has made sense again and we've developed a passion for trying out new hypotheses. So yes, one of the new directions for octra is ML and contextual transformation, because the treechain structure and data model are perfectly compatible with the goals of ML inference. We'll continue working on this (I think every day now) and will report if we find anything interesting.


a mini update, which actually turned out to be quite large, we updated the library and added the most important part - a recrypt that turns the HFHE (pvac ver) into a circuit with unlimited computation chain depth (we also added a bunch of examples of how to use it) this is an important part and the penultimate one before the next final update,if you want to understand what this means, run benchmarks and review past results (hfhe against everything) in the public test, 63 consecutive reset stages pass with support growing to 16 terms per stage and resetting back to 4 terms run: make test-hfhe-native PVAC_HFHE_DEPTH_ROUNDS = 63 make test-hfhe-depth github.com/octra-labs/pva…


PoC HFHE against everything (benchmarks) github.com/octra-labs/pva…



nature is clearing up, ignore the slop-noise, let the speculators and gambling addicts be blown away, there's a lot of interesting things ahead





a mini update regarding webcli - many security improvements have been added that make it worth updating your version to the latest version (don't delay with the update) we’re also reinstating the bounty program as an open portal with challenges after receiving good findings from researchers, we'll share more in the coming days once the concept is finalized github.com/octra-labs/web…














