byteware

polynomial commitment based zero knowledge proof system

zero-knowledge proof framework to prove for example that a bank has the necessary funds, or for a loan application that I make enough without revealing how much

why would foveated rendering break down? it does not stop rendering where you are not looking just lowers the resolution

tangent: do we have to censor words here as well? i thought it was for youtube and tiktok recommendation systems (unalive is particularly funny imo)

in theory some publications are available as torrents, in theory they are in batches zipped together and in theory one could, by requesting certain parts of the zip file using a crafted torrent client, download only the publication they are looking for, in theory

10 races we should sterilize, number 6 will shock you, click here to learn more

talking as someone who is building such a system, why would an avarage participant of the network give their own money, i dont think they would for the same reason i'm not running a bounty program with my dollars, the only use of having it on the blockchain is rewards without using your own money (so it's economics depends on the eventual value of the coin), for that it has to be bound to the minting process, but a purely algorithmic system for determining who gets how much based on their proofs seems elusive (think of the infinite possible proofs 1+2=3, 1+3=4...), we are going for having a central authority doing the minting for proofs (as voting based on money would hardly reflect mathematical experties)

I am in a such a "meaningless" pickle myself, I have never imagined that hard tasks with strict deadlines are a breeze compared to this, it slowly but surely chips away my will to live, even though on the outside it sounds wonderful

well for their definition of tech "approaching zero cost", the only tech companies are pure software ones, the cost of manifacturing a rocket can hardly approach zero

I'm trying to find the takeaway, should kids not go to college? or that nobody reads the comments, since one of them raises the question, "is there proof?" and claims that not according to their linkedin

although zero knowledge proofs can compress the "proof of gradient" so it takes much less time to verify than recompute, it take orders of more work to generate the proof, moreover can we merge multiple "improvements"? if not then upon the selection of the "winner" all those are lost?

not like I am vocalizing this damn, that would be effed up, I am just silently feeling this way then respond and act according to the expected norms

yes, coworkers thanking me for a bugfix or a feature bothers the hell out of me. man I am not doing it for you, I am doing it for money that is thanks enough