Last time we succeeded at producing the following proof: "I, prover, know a certain word w that is accepted by the automata A" Where A is public and w "private" (not really yet, because we haven't applied out of domain randomisation, coming soon). But
Last time we had the following constraints for our automata: * \(C_0 = \frac{S(0) - q_0}{X-0}\) * \(C_1 = \frac{\prod_{q \in F}{S(n-1) - q}}{X - (n-1)}\) where n is the number of steps and \(F\) the accepting states * \(C_2 = \frac{\text{step
I assume you've already heard about STARK (Scalable Transparent Argument of Knowledge) somewhere. Here is the quick recap. Prove a computation without needing to execute it again to verify it. Thanks to this you'll be able to: 1. Make the verification faster than executing the whole
I stopped reading the news, it changed my life, and how it can change yours. I will cover the following objections during this short essay: * reading the news is being a good citizen (and we need more of those) * reading the news helps me to feel smarter and aware of
The recent boom in generative AI especially of images and videos has sparked controversy, and mainly in the artist community. Artists feel disowned and stolen from, because AI models have been trained on datasets taken from artists’ work without their consent. There are mainly two types of reactions to this
How come this movie hasn’t been mentioned as the modern image of absurdism. After feeling the emptiness left by the death of his beloved, Forrest runs. First, through the neighbourhood, then the city, the whole state and finally the entire country. Again and again. After two years of running,
The unsatisfying truth Screen time it's not the problem in itself. And I realised this too recently, last week when I went alone to Barcelona for a one week trip. Everyday was the same and I had a screen time of around 10 hours per day. Which is