Hello, everyone. Welcome to this exciting world of open source software. My name is Kannan Mokgalya. I am from IIT Bombay.  I hope that at the end of this talk, you will all migrate to using Sylab. So, let us get started. It is the outline of my talk. I will not go through this right now. Let us get on with introduction. Let us start with FOSS, which denotes free and open source software. The commercial software can be very expensive and heavy penalties if unauthorized software is used by industry. Our small and medium scale enterprises do not use any software. The reason is that commercial software is expensive and they are not aware of open source software. So, it is our obligation in academia to expose our students to use free and open source software or FOSS. If you do not do this, our small companies will not be competitive. I conclude this slide by saying there is no alternative to FOSS. Some more reasons why we should use FOSS. It is free of cost. It is affordable to industry. It allows learners to become better programmers. Imagine giving a car to somebody, a car mechanic and telling him not to open the hood. Open source software makes available the code. Students can open them, see what is inside and so on, modify them, improve them and things like that. Open source software can also grow through collaborative contribution. We will explain this in this talk. So, should we not use proprietary software at all? I am not saying it. Use it when it is absolutely required, but wherever possible use open source software or FOSS. Problems with open source software or good documents are missing, lack of support and wrong impression about the quality. So, we are going to address all of these. In particular, the first one documents, we are going to address them through spoken tutorial and textbook companion. We will begin with Sylab which is a FOSS alternative to the popular software MATLAB. Sylab is an excellent open source software. It is a good substitute for MATLAB, about 95 percent compatible with MATLAB and XCAUSE which also comes free of cost with Sylab is a good alternative to Simulink. Sylab has excellent computational environment. It has LinPak, IcePak, LopPak. It also has Dassel, Vodeepak, etcetera. These are all amazing computational environments which are also used in MATLAB because these are outstanding numerical computational engines. Sylab also is absolutely reliable. So, how reliable is Sylab? I will explain this with an example. CNES is a French Aerospace Corporation. It has helped launch many of our satellites. It launches Arian rockets. There was a GSAT-16 launch by Arian. Let me click this. It takes it to this article, business line article which says that India's communication satellite GSAT-16 was launched successfully. So, you can see here GSAT-16 on board Arian space rocket from the space port of French Guyana. So, what about it? How is it connected with Sylab? So, let us come here. CNES relies on Sylab for many critical calculations, trajectory, flight dynamics, orbit, etcetera. Here is a talk by Martin of CNES on Sylab. So, let me click this. Let me zoom it a little bit. So, here is the first Sylab user conference that was held in 2009. And in that conference, I talked about the National Mission on Education through ICT. I was the keynote speaker. And lo and behold, I talked about open source software. The talk is available here in case you want to go through it. But here we are interested in the talk by Martin. So, let us click this. It gives a summary of this. You can read this. Let me zoom it a little bit. Now, if I click this, I will get the PDF file. It has come here. You open that. So, you can see that Martin talks about use of Sylab for space mission analysis and flight dynamics activities. And you can see that Sylab is now widely used in CNES in various engineering fields, such as telecommunications, RF analysis, navigation, attitude control system analysis, and dot, dot, dot. And he goes on talking about how Sylab is used in CNES. When we go to the end of this slide, Sylab is widely used within the CNES flight dynamics departments and so on. So, let us come back here. So, I always ask this question if CNES can use Sylab for launching Ariane rockets, one of which launched our G-SAT 16 communication satellite, using which possibly I am communicating, I am connecting with internet. If Sylab is good enough for that purpose, is it not good enough for your optimization problem, for plotting a 3D graph or to solve FFT or to solve a control problem? Of course, it is good enough. Sylab is a great software and it is free. And you will see many more nice things about it. So, do not leave any time until the end of this talk. So, let us go to the next slide. There are few more examples of Sylab use as given by the Sylab website. Let me click this. So, they have given lots of case studies, model reduction, this is flight dynamics, this is diesel engine. Let me just click this. Let us see what happens. You can study more about it if you are interested in. You can see many more examples here. So, if somebody says that if you learn only Sylab, you will not get a job, do not believe them. They have vested interest, that is why they are telling that. So, let us come back here.  For this purpose, I have opened a Sylab already. It is very easy to plot Sylab. So, let me plot 3D graph. It produces amazing quality plots. You can create matrices easily. So, let me create a matrix A equals 1, 0. So, I have got this matrix. So, I want to calculate, suppose determinant of A. I can calculate this. If I want to calculate the eigenvalue of matrix using the command spec, which stands for spectrum, I can calculate the eigenvalue. You can do lots of nice things. Let me give a brief demo of some of the other nice things available that come with Sylab. Let me click this here. That gives you lot of demonstrations. Now, let us go to graphics. Let us go to 2D and 3D plots. So, here are some examples of 2D plots, some other plot. Let me do it again. Let us plot this. Close this. So, let us plot a 3D plot. Here it is. There are lots of nice features. I would want you to explore it whenever you have an opportunity. It is very easy because you can download Sylab directly from the website, sylab.org, install it, use it and enjoy. So, I calculated the determinant and eigenvalues. I showed some plots. I showed some demos. The problem, as we discussed earlier with open source software is people do not know how to use. Good documents are missing. So, I am going to explain one solution that we came up with called Spoken Tutorial. So, let us start with Spoken Tutorial. What is a Spoken Tutorial? It is a 10 minute long audio video tutorial on open source software to help improve employment potential. One of the nicest features of Spoken Tutorial is that it is created for self-learning. Anybody can learn on their own, even those who do not have teachers, good teachers. If you are motivated, you can learn by yourself and the audio is dubbed into all 22 languages. I am going to show that and it also has an offline version which increased our reach 100 times and this is released as open source. You can download all our Spoken Tutorial from our website absolutely free of cost. Where is that website? I will show you shortly. 25 Sylab Spoken Tutorials are available here. Let me click this. Here it is. So, here are Spoken Tutorials on English. So, you can open any of them. For example, you can open vector operations. You can click this and play. So, let me go back. You can also choose other languages. For example, instead of English, supposing you choose Hindi, let me open the same thing. Let us open vector operations again. If I play now, the video will be in English, but the audio will be in English. And we do this in all 22 languages. As I told you earlier, let me open Tamil. Let me play matrix operations. Let me play the play button. Let me press the play button. In the spoken tutorial, I would encourage you to go through this. Matrix. Try out the spoken tutorials. Keep the video and the Sylab software side by side. As I show you now, let me open Sylab here. Now, we can see that video is on one side. Software is on the other side. You listen to the video and try it out. Listen to one command at a time. If it works, go to the next command. If it does not work, rewind, listen to it and try it again. It will always work because spoken tutorials are guaranteed to be used by self-learners. This method is called side by side learning. You open the video on one side. You open the software on the other side and listen to one command at a time and practice until the video is completed. Notice that there is no need to log in. For example, if you come to my website, it says login. That is because I have not logged in. So, why do we have login? So, this is for creators. This is for people who want to answer in the forum, who want to ask questions in the forum and so on. Some of these things I will show later, but if you just want to listen to spoken tutorials, you do not even have to log in. As I told you, it is created for self-learning. We dub this in all our 22 languages. For example, it is also available in Sanskrit. Sanskrit happens to be one of our 22 languages. I would encourage you to try the Sanskrit dubbing and see how Sanskrit dubbed tutorials sound. Many universities use spoken tutorials as MOOCs. MOOCs, of course, you know, stands for Massive Open Online Course. You can see a list of universities that use spoken tutorials as MOOCs. I have a list here. If I click this, it takes me to the spoken tutorial website. You can also access this by clicking, coming to our website here, spoken tutorial website, academics, MOOCs acceptance. That is what I clicked to get this. Now, you can see various universities doing it. At the end of it, there is a second page. Let me go here, second page. And I want to go to this university. This is the first university, one of the largest universities to accept sila as MOOCs. Let me click this. This university has about 200 colleges affiliated to it. So, let me click this. We make this slightly smaller so you can see the web page clearly. Spoken tutorial as MOOCs in ECE department. So, let us see the attachment and let us search for sila. Let us search for spoken tutorials. So, here it is. It is a spoken tutorial. They have given our website and they say that the following observations are made in respect of the practical paper and they say that is part of the design lab course. Let me come back here. The spoken tutorial team provides certificates based on an online test. It is made available at a very affordable prices. If the cost of a certificate can be as low as 20-25 rupees for a college that uses this resource extensively. It is a fixed cost per college, per year irrespective of the number of students it has. So, I would encourage you to try this out. So, let me go to another solution that we came up for this problem that good documents are missing. That solution is called textbook companion or TBC in short. So, let us see more about it. Students are good in coding, but not documenting. But India has about 10 lakh engineering students every year. Can we use these students to create documents? We need documents. We are short of documents. Unfortunately, students do not like documentation even if they are good in coding. So, how do we solve this problem? We have lots of students who can do coding, but we want documentation. So, we decided to address this by solving the inverse problem. What is the inverse problem? Ask the students to write code for existing documents. For students, of course, textbooks are the best documents. So, we said ask them to write Sylab code for solved examples of standard textbooks. Notice this solved examples. We are not talking about unsolved problems. Solved examples, good textbooks give every step step by step explanation and solution. One can implement it in Sylab and verify the Sylab code line by line and any good student should be able to contribute. So, this is how we started. If they do it for all solved examples of a book, you get one textbook companion and we pay rupees 12,000 rupees for one textbook companion. As Honduriam, we also give certificate. We also give a link for it. As a matter of fact, there is one student from IIT Madras. He wrote to us saying that thanks to this textbook companion, he got an internship in a Japanese company. So, he was very happy about it. Funding for this comes from the funds, the grant that we received from the National Mission on Education through ICT, MHRD, which has been very generous in supporting this activity. So, I would like to invite all students to benefit by this, to contribute to this and also to use this. How does one use it? I am going to explain it shortly. 1000 college students and faculty contributed. These students came from all over India, all parts of India. 600 textbooks were covered and 70,000 examples were coded. If you assume that there are 100 examples in a textbook, then there will be 60,000. Some textbooks have actually more than 100 examples. So, we have 70,000 examples coded. You can download these textbook companions for offline use. So, let me click this. So, this is sylab.in on the left hand side. So, this is the website that we have created and we support at IIT Bombay. By the way, the software sylab is not created by us. Sylab is, in fact, we have given a disclaimer also that it is, of course, we have said that it is a trademark of Inria and sylab enterprises and it has been now bought over by a company. And I will show the link for that here, but let us come here. Let us come back to this page and let us go to textbook companion project and you have something called completed books. When we click this, you can see that there are 594 books that have been completed. So, it has, if I just scroll down, you will see that there are indeed 594 books. Here it is. It is possible to get books according to specialization. So, let me do that. Instead of choosing all categories, let me choose electrical engineering, for example. And in that, let me choose, there are more here, signal processing. Now, if you go through this, you see that in signal processing alone, there are 17 books. So, this is a very popular book, Prokis and Vanillakis DSP. So, let me click this and it says that download codes. Notice that we are not giving a book. We are only giving Sylab code. To understand that code, you need the book. As a result, this is a true textbook companion. It only gives the Sylab code. It does not give the book. We cannot copy the book and distribute. That will be a violation of copyright. We do not do such illegal things. So, here if you click this, you can download the entire Sylab code. If you click here, you can get the PDF. Let us click this and see what it has. So, it is downloaded here. So, here you are. This is created by Professor Senthil Kumar from IRTT in E-Route. He is a college teacher and let us go down. So, it has all the examples by chapter. You also have it in terms of example number. So, for example, if you want to say exponential decreasing signal, example 2.1.09, let me click this. There it is, example 2.1.09. So, you can reach this directly and notice that it has code after code after code, which is not given in the book. What is given in the book is not reproduced here. As a result, there is no copyright violation at all. As a matter of fact, it is the other way around. We are helping authors of books by giving Sylab code. There may be authors who may not have given any code with their book, but we have given Sylab code and we have given it for 600, close to 600 books. In fact, 594 as of now and there are some more books in pipeline. Those are undergoing reviews, revision and so on and so forth. Let me just see. We have anything else here. We can download the code for an entire book or a chapter. Let me show you. So, here I showed how to download a PDF version. Let me close this. We are back in the download course that we saw earlier. So, instead of download PDF, if you download here, you will get all the Sylab code as a zip file. Instead, you can say that let me download it for only let us say frequency analysis of signals and systems. Let me click this and in that, if you click this, you will download that chapter as a zip file, but you can say that let me download it for only plotting discrete time Fourier transform. So, it says that reconstruction se. So, let me see what happens if I click this. So, it comes here. Let me see if I can open it. Let us see what happens if I open this. I can show it in finder. Here it is. So, let me right click it, run with Sylab it says. Let me try this. So, here it is. Let us clear the console. Sampling frequency in hertz. Let us put 50. Let us open discrete time signals and systems. Chapter 2. Let us choose an example. Let us say exponential increasing decreasing signal. Here is the code. So, I do not have to download the entire book. I have I can choose a chapter. If I click here and download, I will get the zip file for that chapter only. Instead, I can say that I do not want it for the whole chapter. There are too many things. I get confused. I want Sylab code for only one example. So, I have selected this. So, let me click this. Let me show in finder. I ran it. You see the output. So, it is possible to do that. Let me close this. So, as I told you earlier, you can download the code for an entire book or a chapter or an example. So, which is very useful because you can just go to the example that you like. Download only that code, run it and test it.  So, here is the link. Let me click this. So, let me demonstrate it. Let me choose once again electrical engineering. I will choose control systems. I will choose VCCO frequency domain analysis. See how it is organized. First, the main category, then subcategory in that what is the name of the book and what is the chapter and what is the example. So, let me select that example. I want to choose body plot. The moment I select it, I get the code here. So, this is written by some student, one of your friends from across the country. So, let us execute this. So, it gives the body plot. You can download it if you want. Let us close it and here is the result. Let me zoom it a little bit. You can actually see that. Now, I am going to ask you a quiz. Suppose, I increase the gain of this transfer function. Let us go to 5000. That is right. You can actually edit this page. So, I have changed this from 2500 to 5000. Now, if I do that, what will happen to gain margin and face margin? I want you to note down. Gain margin is 14. Face margin is 31. If I increase the gain, what will happen for this system? Let us go ahead. So, this goes to Garuda Cloud, which is hosted in Bangalore by CDAC. Let me close this. Yes, if you guessed it correct, the margins will come down. 14 has become 8 and 31 has become 17. So, it is possible for you to try out all the 70000 examples on the cloud. So, how do we use this TBC as a documentation? What do I mean by that? Supposing you want to know how to use Sylab for fast Fourier transform, because you have it in your course. So, open the textbook and there must be an example that shows how to solve fast Fourier transform, how to implement fast Fourier transform. So, that example is given. You go to that textbook companion in Sylab. As 600 books are covered, most likely your textbook also is covered. You go to that chapter, that particular example and open the Sylab code. It tells you how fast Fourier transform is done. What do we do? If your book is not covered, you propose. You propose that you ask a smart classmate in your class to do this for you and that person can create a textbook companion on that book and the problem is solved. It can be used as a documentation as I mentioned. It can be used for what if studies like I mentioned for example, like we did for example, increase the gain by 2. You may want to reduce the friction factor by 10th. You may want to change the bandwidth of some communication channel and so on and so forth. So, it is very easy. If you are a faculty member, you are teaching the class, just project this and then you can just do this online. Of course, you need internet connection. If you do not have internet connection, use the offline version that I showed you little while ago. It is of course, useful for students also. You want to understand how a particular topic is covered. You want to improve it. So, you can do that. As a matter of fact, I believe that this alone, that is the textbook companion alone is useful to most of the 40 lakh engineering students who are in our colleges at any time. So, for them, Sylab is more than enough. It is only for a very small fraction of the students who may want some extra things which may not be available in Sylab. They might say they want to use some other software. My question to you is, so for that 1 percent of the students, should you use some other software that will tax all the 99 percent of the students? That is why I say that use Sylab wherever possible and that Sylab is good enough for the 99 percent of the students like we demonstrated. For the remaining 1 percent of the applications, use whatever software whether it is open source or commercial whatever it is, but do not impose that commercial software on the 99 percent of the students who can get by with Sylab. It is also true for industry. How many companies solve earth shattering problems all the time? Very rarely do they solve such problems. For most of them, what is available in Sylab is more than enough and it is absolutely open source. All companies can also use Sylab absolutely free of cost.  Imagine this is something created by us, by our students, by who are funded by our tax payers made available to the whole world. And that is the beauty of open source software. You create a good product and share it and lots of people can benefit by that. Just like Sylab was created by somebody and they left it as open source for all our students to benefit, we also reciprocate in this manner. There is another very nice thing that we have created on top of this textbook companion, Code Search. Let me show you. Let me click this link. If you click this, it comes here. Once again, it is in Sylab.in website. How did I reach here? Search TBC Code Search. This is what I find. So, how do I use it? Well, you need to know the name of the command. How do I locate the name of the command? I do a Google search. For example, I wanted to set a problem in partial fraction in Sylab. I had forgotten the command. I had forgotten the syntax. So, I said partial fraction Sylab. So, the very first link is PFSS. So, I know the command name. I found the command name. Now, how do I find examples? I have had many bad experiences of trying to get a working example in the past. And I do a Google search. I get lots of hits, 100,000 hits, but not a useful one. I had to really search one after another to find a working code. But we have solved the problem in our code search here. Remember, the command is PFSS. So, I come here and I search PFSS. When I search, it says 140 results found. Where are these from? Remember, I told you that there are 70,000 examples that have been coded by your classmates, students across the country. They have made available. Out of the 70,000 examples, 140 of them have used PFSS. The first one is by this circuit analysis book. So, let me go down. Here is a book by Ashok. Here is a book by Babu. Here is a book by Sali Vahanan. Here is a book by Mankhe. You keep doing it until you like a book that is displayed. Here is a book by Koffner, which I used when I was a student. I said, hey, I have used this book. Let me view this example. It immediately takes me to the Sylab on cloud that we have seen before. This is example 4.2 in that book. And if you see here, notice that PFSS is here. So, all I have to do is to execute and I get the result. Only the denominator is displayed. That is because after numerator, there is a semicolon. Let me delete it. Let me run it and I get numerator also displayed. You can see that partial fraction is with the denominator s minus 2. This is s plus 1, s minus 1 and so on. So, if I do not like this, I can modify it, rerun it, I get an example and so on. So, this is extremely useful for faculty members if they want to set problems for lab exam, final exam, whatever it is and you can do this for all kinds of applications. Of course, it will also help you to identify examples for the command that you want to find out.  Now, I am going to talk about lab migration. So, do you want to migrate your lab to Scilab? We will help you. State your experiments. You code them in Scilab. We will give Honduriam under certificate. We will also host them on our website so that you can give a link for that in your resume or we can get your problem solved by experts, Scilab experts who may be your colleagues in some other college. We have already migrated more than 60 labs. Let me click this. Once again it takes us to Scilab.in. On the left hand side, you see this lab migration project and completed labs that has been clicked. So, here are all the labs. Let me zoom it a little bit. It has come here below. Here are the examples. So, as a matter of fact, at this point we have 73 labs that have been migrated. Now, if you click this, let us say control of electric drive. So, once again it looks the same. It looks same as before. They are like the textbook companion. If I click this, I will get the PDF file. If I open it, here it is. So, this is done by Priyan Patel from this college. As we go down, you can actually see the experiments. Speed torque, if I click this, it takes you to whatever. So, here are all the problem statement, solution and so on. So, let me close this. We come here. Now, let me come here and we go back. So, these 73 labs that have already been migrated may solve all your problems. You can immediately migrate your lab.   Of course, if I zoom it slightly less, you will see both of them in the same page. So, here are labs in progress. So, there are 26 labs in progress. I encourage you to participate in this, migrate your labs and also help others migrate their labs to Sylab. We are also improving Sylab toolboxes. We can call all octave right now from Sylab. We have a great optimization toolbox already available. I am going to show some links. We have developed a signal processing toolbox, image processing toolbox. We are working on control systems toolbox. We have made lot of progress in identification toolbox and also from Sylab to see how does one go. We have a toolbox on that. Where are they available? Available as Sylab atoms. Optimization toolbox is already released. So, if I click this, it will take you here. This is available on atoms.sylab.org page and here it is Fosse optimization toolbox. You can see that this has been downloaded 6500 times out of which 5500 are for this version, probably about 1000 for previous versions. So, I would encourage you to download, try it. Other toolboxes to be released shortly. The code is available here. By the way, how did I get this here? By clicking Fosse Sylab toolbox. Remember that we are in Sylab.in Fosse Sylab toolbox which is what I clicked. If I click it, I get this. You can actually access them and where is the code available? The code is available here. Let me click this. It is in that page. So, if I click this, you will get the code for Fosse optimization toolbox. It says that installation instructions, installation instructions, documentation, example and so on. Here is the source code of this toolbox. So, let us proceed. Here is a paper that we wrote. It appeared in an IEEE control conference. Let us move ahead. We want your participation to add more functions to Sylab toolboxes. We are also creating an X-Cos cloud. Let me give you the link for that. So, this is in X-Cos.Fosse.in. Commonly used blogs. For example, as I told you, it is still under progress. You can click this. You can move things. You can connect them. You can simulate them and so on. I would want you to explore this. Help us improve it. You may be very good in coding. Please join us. You may have lots of X-Cos code. You want to try them out? Try them out. Find the bugs in Formas. We will be very happy to have you as our partners. We have Sylab forums to answer your doubts. If you have a general doubt, come to Fosse forum. Click this. If you want to see the previously posed questions, you can see them. You can search. Sorry, forum. You can see a lot of questions on Sylab. So, let us click this Fosse forum. It takes you to the page where Sylab questions are there. You can actually go to any of them. For example, moving average. So, there is a question and there is an answer and so on. Remember, I have still not logged in. I have not logged in. In other words, to view the previously posed questions, login is not required. But if you want to post a question, then you have to register and login. If I click this, if I say ask a question, it will come and say login. And if you have not registered, you have to register. That is only if you want to ask a question or to answer a question posed by somebody else, you have to register, login. So, this is Fosse forum. This is for general doubts. And there are lots of examples. There are lots of questions already asked and answered. Some of them may be useful to you. Our experts are here to answer your questions. And of course, if lot of people start answering questions posed by their colleagues in other colleges, then we can have instantaneous response. That is the beauty of, once again, open source forums. What if you have a question on Spokane Tutorial? You are going through, let us say, for example, matrix operations. At 3 minute 35 seconds, you had a question. What was shown in the Spokane Tutorial did not work? Or you wanted something related to what is shown at 3 minute 35 seconds. So, how do you do that? So, for that, we have a Spokane Tutorial forum. Let me click this. So, you can come here. So, here you can actually search. Let me go to Sylab, for example. Now, these questions. So, the Fosse Sylab, what is the tutorial general? This is installing x cos, getting started and so on. For every question, at what minute? So, for example, I told you 3 minute 35 seconds means, you will say between 3 and 4. You will choose that. Second, you will say between 30 and 40 seconds. You will ask the question and maybe somebody will answer. Here are the previously posed questions and answers. Here is something Sylab question asked between 16 and 17. So, here is somebody who has asked this question. It is not working and here is the answer. So, I would like you to post your doubts and also answer the doubts posed by other people. Sylab runs on many systems. This is our Sylab implementation on the world's lowest cost tablet Akash. You can see the same 3D plot coming here. That means, you can run, you can make Sylab run on almost any machine. Here is Sylab on our 10000 rupee laptop, which has lots of amazing software already installed. You can see that when I click this here, I get software organized as college level software, school level software and so on, in college level software, programming environment, matlab like software, chemical process simulation and so on. Under this, you have so many things Octave, R, Sylab and so on. So, Sylab comes with this machine also and this laptop is in the market now. How do you find out more about this laptop? From my LinkedIn post, if you click this, how do you find out more about this from my LinkedIn post? Here is the write up of this. There is a video that explains the research that went behind this work and this brochure gives the specs of this laptop. And then the website of our laptop is here. You can get more about it over here. Finally, we will come to Fossey, free and open source software for education. Here is the logo for Fossey. Here is the logo for spoken tutorial. What do we do in Fossey? We promote FOS in a big way. What does FOS stand for? Free and open source software. Here is a link. If you go through this, you will see that we have lots of things. You can go to Sylab.in through this. Python here, Esim here. Esim is for electronic circuit design. Osdag is for steel structure design. DWCM is an amazing chemical process simulation software. OpenFoam is computational fluid dynamic software. OpenModelica is for solving a collection of differential algebraic equations, differential equations, algebraic equations or combinations of these, ward tools and so on. There are lots of nice things here. All of them are open source. We are also beginning to add spoken tutorials on R. In many of them, we have textbook companions, lab migration and actually many more nice things. I would like you to go through this, explore this page and find something very useful and I would also encourage you to join us. To conclude, I would encourage you to learn Sylab. Also, contribute to it. Visit the websites I have shown. Use other FOS that we promote. Partner with us. Use commercial software only when absolutely required. Our project, as I mentioned, has been funded by MHRD through two missions, National Mission on Education through ICT and funded Madan Mohan Malviya, National Mission on Teacher's and Teaching. We are very grateful to MHRD for funding our activities and for helping us pay students, we have paid hundreds of thousands of students who participated in this activity. Without the contribution of students and faculty members from across the country, we could not have achieved so much. In fact, I would like to take this opportunity to thank our contributors. I would like to thank you for staying with me. It has turned out to be a longish lecture. I hope you do not mind it. Thanks for joining. Goodbye and jai hind.


Γεια σας, είναι Vicky εδώ και σήμερα θα πω να κάνω εύκολα παιδίες και ευκαιρήσεις βίντεο. Λοιπόν, πρέπει να δούμε τα εύκολα παιδίες. Η number 1 εύκολα παιδίες που έχω όλη την ώρα είναι αν θα κάνω εύκολα παιδίες και ευκαιρήσεις. Λοιπόν, υπάρχουν δύο εύκολες γιατί έχω πρόσπω να κάνω εύκολα παιδίες και αυτό είναι κυρίως πρώτα, γιατί έχω πολλές ευκαιρήσεις και δεν θέλω να μάθω για αυτά, γιατί δεν θέλω να δώσει την δύο ευκολα παιδίες, γιατί έχω πρόσπω να δώσει τα πρόσπω να κάνω εύκολα παιδίες. Αλλά μετά την ευκολα παιδίες θα φτιάξω ένα ρούμπτουρ, που θα πω πριν σε κάποτε λόγες ευκολα. Λοιπόν, άλλη ευκολα παιδίες που έχω όλη την ώρα είναι όπου βρήκω ευκολα. Εδώ είναι ένα πολύ σύγχρο παιδίες και είναι πολύ δύσκολο να πω, but I mainly get inspiration by the season. Sometimes I get inspiration by a color combination, or by a quote. And many times I get inspired by the stamp that I am going to be working with. However, I do have an online class that is going to teach you a method on how you can find inspiration and how you can translate that inspiration into a layout. I am going to link you down below in the description area to this online class και αν εγώ χρειαζόντας αυτό το βιντεί, θα γίνεις ένα 50% δισκάουντ. Τώρα, εγώ πρόσφευγω τα μία παίδια μου. Όταν βλέπεις ένα βιντεί, δεν πρόσφευγω τίποτα όταν έρχεται σε ένα καρδί. Φεύγω το βιντεί και κάνω το πρόσφευγό της καμερας. Τώρα, η αγή είναι ότι πρέπει να σταματήσω την καμερα, αν πρέπει να πρέπει να πιθυνάω, ή αν κάνω κάτι πουνυκλό, σαν κόλωση για αγές, και όχι εμπροσφευγό του καμερα και όχι που έγινε το βιντεί, και πρέπει να βγω πάνω με αυτή την καμερα για 45 ειντς ή ένα εργασία. Τώρα για όχι δυσκολαία, πρέπει να έχω ένα πρόσφευγό της, τι θα κάνω, και πρέπει να ξέρει το σκέφτα που θα οδηγώ πρόσφευγόντητα, ή πρέπει να έχω ένα φοβόρο, αλλά δεν έχω δισάγωση για τι θα κάνω, και δημιουσιαστώ δεν ξέρω πώς θα φύγω. αυτοί θέλω να είναι αδελί At some times i do have a plan in my mind and as i'm working on it i think might take a different road and I think that's the beauty of it i just shoot the camera and see what is going on you also ask me if I make mistakes of course i make mistakes all the time but I try to somehow cover them up and I usually when I make a mistake on an art journal My friend is Jesu, so I use Jesu as an eraser to cover up the mistake and start over. And if I make a mistake on a card, I can usually stick something on top and cover up everything so nobody will ever know. Now, what do I do for a living and if I have an art background? I am going to take things from the beginning. I do have a university degree and a master's degree in computer science. And I have been working as a high school teacher for ages, teaching computers in high school. But after my blog and YouTube channel became so popular, I quit my job and now my full-time job is crafting. So I am a professional blogger and YouTuber and in the meantime I also do live workshops all around the world. I also participate in online classes and you can find some links on my online classes down below. So do I have any art background? Well, as long as I can remember, I have been drawing and painting. I always had brushes and paints in my hands and as I grew up I went to take some painting lessons. I do have my own oil paintings decorating my house. Of course, my biggest love is card making and art journaling but I am doing many other types of crafts that you don't see on camera from pottery to jewelry making to even showing my own clothes. What do I love most, card making or art journaling? Now, this is a very difficult question because it's so difficult for me to choose one of them. I love them both equally and they give me a different satisfaction when I make a card or an art journal. Now, card making is obviously quicker and it satisfies the OCD in me. I can be very precise, I can make many details and I always want my card to be perfect since it's meant to be sent to somebody else. Now, on the other side, when I am doing an art journal I can be more free. This is a layout just for me, just for playing and having fun. And I don't have to be perfect but at the same time I think it helps me express the creativity that I have in me. I get many questions about my live workshops and if I am ever going to visit certain cities. Now, I do go and teach live workshops when I am invited by shops or by certain events. So, if I get an invitation from a certain shop or an event that takes place in your city then you probably see one of my live workshops. About the supplies, basic supplies for art journaling and card making. First of all, I do have a one-on-one video on art journaling which I am going to link here and you will find a link down below in the description area where I am taking you through all the essentials for me, for my own style on art journaling. But in any case, if you want to start an art journal then the simplest things that you can get is of course a book that has nice thick pages that can take paint nicely and acrylic paints.  Cut them out, stick them down and you have a nice page to start with. Now, about card making. I believe that if you are starting out you can start with the basics by maybe getting a couple of stamp sets. For example, one for birthdays and another one for Christmas so that you can make your greeting cards. And just get a couple of ink pads, like a black one or a red or a green one. Now, as you go along month by month you can allocate a certain amount to buy things for your new hobby. So you don't really have to buy everything from the beginning. So for the first month you can buy for example an embossing powder and a heat gun. And the next month you can buy a paper trimmer and you can go on like that. You will not believe how much stash you will have by the end of one year. My monthly feature about one kit, 10 cards, has been a very popular feature on my YouTube channel which I am planning to continue. And I do get a lot of questions about that. Mainly on how long does it take me to make the 10 cards. Now, I probably work about two evenings for making all those cards but I never pre-plan what I am going to do. I start the camera and start working on it. However, I do have a process. For example, I take all the cardstock and cut them in half even if I don't have anything on my mind at that point. And you will see that once you get started to make the first card ideas will start coming for the next card and the other one after that. I even think that it's even easier to work with supplies that come in a kit rather than having to think on what you can use from all the stash. Sometimes having so much stuff around you can get overwhelming. So in my one card kit, 10 cards, is usually easier for me because I know that these are the supplies that I have on the table and these are the only things that I have to work with so ideas come easily for me. Now, I get a lot of questions about my distress blending and how can you make blending look so smooth. Now, I do have a secret and I always work on the Simon Says Stamp white cardstock which I am going to link you down below. I think that blending your distress inks on that cardstock really makes a difference but also in any type of cardstock that you might be working on, you need to remember two things. The first one is not to press your blending tool too hard and the second one is not to load your blending tool with too much ink. If you add too much ink from the beginning, you won't be able to blend it with the rest of the colors and you will never end up with a nice and smooth finish. Why do I choose to use American size standard cards rather than European standard sized cards? Well, there are two main reasons for that. The first reason is of course that all my supplies come from the US and obviously I do have cardstock that is a letter sized cardstock. That means that if I cut it in half I end up with two American sized standard cards and the second reason is because 90% of my audience here on YouTube is from the US so I tend to use US standards like inches and letter sized cardstock. So what do I do with all the cards that I am making? Now, as you can see, I decorate my craft room with my cards, some of the cards that I make, the ones that I really love as well as with my art journals but I do send a lot of cards to my friends and sometimes I even make sets out of the cards that I make and hand them out as gifts to friends so that they can send them on their own. Now, I never sell my cards, never sell the cards so I don't really know how much it would cost you to sell a card. Now about the scrapbooking layouts. Don't do scrapbooking, however I do think project life type albums for our family vacation but I don't tend to post about them on YouTube.  Now I also get a lot of questions about how you can start having a blog and do what I am doing. Now all I can say is just have a blog, post your photos, your projects there it's going to work as a portfolio for your projects as well as a way to track how you progress as a designer. Try to get a place in a design team and at the same time try to play along in challenges. This is going to get you more out there and you will gain more audience. Now in case you want to start making YouTube videos in the video that I will be posting in about 2 weeks along with my craft room tour I will post my setup and all the equipment that I use so probably this is going to help you out. So that's it for today, I hope that was fun for you as it was for me. If you have more questions just pop them down below and I probably make another questions and answer video in the next months. Thank you all for watching and I'll see you on my next video. Bye!


Morning everybody, especially you right there. We're in vint in Virginia just delivered my first of four drops My last drop is gonna be all the way up in Maine. So we're going right up the east eastern seaboard here in the US There's only two skids two skids coming all the way to Virginia for two skids Now I've got another how many is going up this next one one skid Yeah, one skid that's going to Woburn, Massachusetts. I got to go there today Deliver tomorrow. It's gonna be a full day drive getting there. It's about 1100 kilometers 620 650 miles something like that It'll be a full day Deliver that and then after that I've got another two or three skids that are going to that. They're big skids They're big. They're not just like right these next ones are big Or pardon me No, no, sorry, I got four big skids that are going to be ending off in Bideford, Maine the next day But first we have to go to Beverly. So it's a little confusing. Okay, so it's just gonna be one at a time We got vint in Virginia then now we're going to Woburn, Massachusetts Let's just worry about one thing at a time.  There's a petrol stop in center up ahead about an hour down the road It's got a streak and beacon. I think that's where I'm gonna stop I'm gonna roll through the eastern seaboard here or up the east coast I want to do it. I want to do it in a clean truck and it was at night It's kind of disappointed, but I could just imagine the scenery must have been beautiful. I love driving through West Virginia It's amazing how they build these cities that are right on like right into the hills or else They have the electric wires Turn right on Have all the electrical wires underground right at least that's how they do it around where we live But these older developments they have wires hanging over always makes me nervous when they make a pang over the road like this And sometimes it looks like they're a little bit too low By law they have to be above 13 foot 6 so that the trucks can get underneath them these wires here It just it looks so low, but I know I'm on a truck road, right? I'm not hitting any of them These trees look low neighbor here could use their services. I gave my GPS here says that this is a pilot That's why I pulled in here. I wanted to get a coffee. I Saw this on the map and I thought of maybe parking here last night because it's right close by where I delivered But as you can see in front of me here, you don't want to park here.  I mean obviously it's working for all these guys We're on the East Coast. That means parking is limited and The truck stops that are available are usually very small in my opinion But yeah one nine like oh any like the the letters Spelled out one and then the number nine Is that flying J now did they buy it out or what happened? So yeah, this is my pilot card worked here for the coffee It says one nine on it, but everything in there is still pilot look at the coffee even says pilot on it So what happened people somebody learned me What happened it pilot flying J by one nine or did one nine by five pilot line J who bought who what happened? What's going on here if they're changing from pilot to one nine you think that they bought pilot the pilot flying J is huge That would be a massive purchase. I thought I would have heard about that in the news or something. That's huge Space in here. Let's try it over there but in front of us a lot of people a lot of people everywhere It's a petrol stopping center. There's a blue beacon here. I want a truck wash Turn right a man approaching destination on the left side in 60 meters Oh, I see it. I see it. How do I get over to blue beacon? I see it's over there. Okay, so I want to go this way This is a huge truck stop, but what do we see the other side to 205 on interstate 81 Virginia, okay Truck wash enter here. Maybe this is a way to get out if the lineups too long and you sort on a give up You can Virginia R8 R8 PH. I any working. I bet you it fills right up The highway is right up here beside me and I passed by here. There was no one in line The time I figured out how to get in here two people in line in front of me, but there's just one on each side I don't know which one's gonna be faster yet. I'll get ourselves all cleaned up looking good smelling good Okay, we're out. Let's go check their work. I Wash the trailer to it's not my trailer But I paid to wash it because I want to drive to drive the rest of this week with a clean one behind me So we'll see how well they done. I don't always wash their equipment But sometimes sometimes when I'm feeling generous Why not? Okay, here we go. He's ready. Not bad. Not bad. It looks a lot better The wheels and tanks and steps definitely needs to still be repolished Right now that's on the agenda for next spring But maybe throughout the winter I might try my hand on it if I can get the right tools I need to get a power buffer and see if I can figure out how to do it myself But that's only if I have the time and when I'm at home be honest with you I don't really want to spend the time polishing my truck though. I do want it to be polished I want to be at home more than I want my truck polished so Truck can be polished later the moments at home once they're they're gone. You can't have them again It's looking nice looking nice It's box underneath here's nice and shiny now. That's good It's good Feel a lot better rolling down the road in a clean rig. I just I'm not happy and I don't feel comfortable when the truck's not clean I mean, I didn't go all out on the trailer since it's not mine Warned it washed off because nobody ever washes our trailers Nobody ever takes the initiative going wash the trailer. So we'll end up looking like these could be polished wheels That'd be great, right? But then someone's got to polish them But you know if we pay to polish the wheels these trailers change hands so often that They would just look like this right away again And they blew off one of my light basils here. I'm gonna have to go back there and ask them. Oh boy, this is still dirty Let's be wiped down Okay, well it's better than it was but uh, I'm gonna have to ask them where this went Because these just come off, right? I think I have some spares with me, but Kind of defeats the purpose of having a nice clean rig if you're missing one of these basils All the rings and look at this. It still needs to be wiped down. I'm crying out loud You never get it all. Okay. Well, I've got to walk back over there and uh See if I can find that ring Look at this. It's all stained on me This here that's not stained on Oh, come on blue beacon. Look at this. Okay. Want something done, right?  You need to replace them. They're not too expensive But see this it just hooks in there, right? It's in around that rubber Getting a place there Center it and there you go. Yeah, they definitely need to be replaced already It's not real chrome, right? Not real aluminum. It's just It's plastic. It's like a A fake chrome layer over it. It needs to be It needs to have a close Close look at all this stuff here yet, man I'm gonna get some bullsnot out right now and work on that. I can't I can't leave it like that I can't leave it like that. Don't worry, old blue. We'll shine up your rear end there. Good Gotta have a nice looking rear end Going down the highway. Everyone's looking at it, right? All right, we're feeling a lot better now See we can figure out how to get out of here What you guys, but when the truck is dirty, I just I don't enjoy the day as much It almost gets my anxiety Just having the dirt washed off makes me feel so much better I'm in a parking lot Karen calm down trying to follow the Arrows to the exit Those arrows point this way those arrows point that way I think it's this way I'm 200 meters turn left on grad hind road and then turn right in 100 meters Look at this Kenworth here turn left on commerce park drive and then turn right in 210 meters Look at that. Oh, it's for sale There's a for sale sign in the window. Should I buy it? Okay Well, this this did not lead me down towards the exit. This is not the exit Why are the arrows pointing me this way? Okay, we're gonna turn around we had it right the first time apparently we're gonna take a second look at this truck Turn right on commerce park drive and then turn left into 160 meters quiet Karen. I'm dreaming Interrupting my dreams the wrong turn you told me to go that way Leaders turn left on grad hind road and then turn right in 100 meters. It says no truck exit here How do we get out of here? No truck exit that way Okay I don't think I've ever been to this truck stop before so you can tell Turn right. I know I know Yes, this way. Okay For first timers. This is a very confusing truck stop. I'm just gonna let you know Very confusing like they could have just made a straightforward like here. Here's how you get in straight shot into the parking lot There's how you get out straight shot out I know it's like weaseling in and out of here go around here turn left here turn right there If you get lost well Good luck. Check google maps I bet it's real nice inside. I just don't have time to go in there right now. I got to get moving This was my break for the day I'll still have to stop for my half hour sometime Probably have a shower then if I can find a good shower along the way Yeah, what a break 300 meters turn left on rad hind road and then take the entrance to the right in 120 meters And one way you can tell the truck is from the u.s. When you're in canada is that they have a a nice clean painted frame Believe me you drive in canadian winter and canadian weather conditions your frame isn't going to look that good for that long I need to redo mine But it's like these old trucks here every time you're in canadian weather conditions You're not going to be able to get out of here. You're not going to be able to get out of here But it's like these old trucks here everybody's got like a perfectly clean frame because they they never leave the pavement Right, none of these trucks leave the pavement ever Come deliver a load up in manitoba once Show you some real backwards trucking It's hard to keep a truck looking nice I'm gonna turn the left here using their signals around here All right, two more vehicles coming from our right. All right three more Four more I'm going for it on the shoulder of a freeway in the united states unless it's an emergency, right? I don't correct me if I'm wrong in my comment section there. I'm okay with that But even if it was legal, I would highly recommend everybody watching this video if you need to stop for a quick bathroom break Find an off ramp and park on the shoulder on the off ramp or the on ramp coming back onto the freeway It's parking on the shoulder is just asking to just get whacked. Oh, there's another car It's like every couple of miles all the way since like virginia already. It's been a weird day Weird day lots of cars on the shoulder lots of trucks, too I never feel safe parking on the shoulder. I would never do that myself You see there's an exit coming up here exit 57. We're still on i81 here So here I would go onto the on ramp on the other side because I'm kind of back onto i81, right? And I'd park on the shoulder of the on ramp on the other side Of the cross road, right of the interchange That's where I park if I have to make an emergency like bathroom stop because my bladder's about to explode I feel safer there because traffic is moving slower And I'm off of the freeway. You never know if someone blows a steer or isn't paying attention Half the people out here are on their phones You know they'll wander onto the shoulder just a bit and WHAM! And someone's got to do up your obituary and everything and that's no fun Parked on the shoulder of the on ramp to our right over here off the highway Then I have this whole on ramp to gain speed so that by the time I hit the highway I'm doing as close to highway speed as possible. That's the way I do it We're just parking on the shoulder just to hang out with my destination But it's getting pretty late. It's gonna work then Into the night in this region because everything fills up I'd like to get closer tonight, but if I can find parking here I'm just gonna stay here do my 10 hours and we'll be on the road tomorrow I should still be about an hour early. So I have about an hour to play with. We have four hours of driving If there's no big traffic jams We're here in uh New York state, I believe trying to see where we're at here. Not quite. We're in pennsylvania still Where I might lay down my head tonight. We'll see We'll see. I'll take a look up ahead on my trucker path app. See what parking is like I'd like to go further, but low light capabilities. I know I'm gonna grab that one I'm just gonna quickly walk up here to see if there's any better spots I don't want to come all the way up here with the truck.  All these lights here are blue. Doesn't that mean they're defective? I'm pretty sure see you looking Pretty full pretty full or is that an open spot right there? Well, that might be a handicap spot. There's one spot open Well, if no one else comes in by the time I get down to my truck I'll pull up here. I'm just gonna go make sure it's not a handicap spot It's really humid out really hot and humid So I was able to roll up and park In the parking lot up here actually so I think we'll be okay here I wouldn't mind parking on the ramp on the way up there too. It's a nice big wide shoulder Guaranteed no neighbors, but you do have trucks passing you all the time and I was just thinking like where would I feel safest? Well, if anything happened on the highway say someone fell asleep lost control I was driving drunk or whatever veered off the highway fell asleep I'm right there Right up the ramp they could slam right into the back of me and while I'm sleeping and I'm off to meet Jesus Not ready to go there today yet. So I figure The best safest safest place for me would be to park up here in the parking lot if there's space There was that one space available Parked up here. Now. I just have to worry about my neighbor Dragging his trailer into me in the morning, but I think we'll be okay here Let me show you I'll grab my other camera so we can see the low light a little better All right, sony work your magic All these lights are blue here. He needs to be able to get out This way in the morning. I think I left him plenty of space I left my nose a little bit further back So he can get out because the curb is right here, right? Not much space He did the same thing so that the guy beside him could easily get out There's still plenty of space around the back for people to get by And get around me if they need to Plenty of space. So that's that Decision's been made. We're parking right here So thank you for joining to hang out with me today. I really do appreciate it If you don't mind go down below the video Make sure you're subscribed or make sure you're still subscribed Leave me a comment down below. Let me know what you're thinking Tomorrow we head through new york state Into connecticut and then into massachusetts. We're gonna get to wolburn Afternoon sometime the appointments for 2 p.m. I'm planning to be there for 1 p.m It's one of those places that if I'm early, it's good.   They get mad Show up early. They get mad sometimes you show up on time. They get mad They want you in that five minute window before your appointment Five ten minutes before so that they can start unloading at your appointment time So if your appointment times at three o'clock, they want the forks under the first pallet At three p.m. Did I say three? Right at your appointment time How uh, it'll be it'll be pretty straightforward. We'll go deliver that It's just one skid all the way to massachusetts here for one skid And then I got another four skids. I believe that are going to beaverly Is it four or is it almost a whole front piece contraption in front of my trailer going to beaverly? That's at eight a.m. The following morning So I'm going to have a little bit of time tomorrow and just uh go find a good place to park go have a shower And probably work on some videos And then after we deliver that eight a.m. Then we'll rush up to bideford in main get that unloaded thursday afternoon And then we'll be empty and we'll See what life has in store for us after that I'll have to call them to the load gods and tell them to start working I'm gonna need a load Remember everybody to be safe out there. Stay safe Drive safe and see you tomorrow


Hi, my name is Nick Spooner and I'll be presenting the paper Proofcaring Data from Accumulation Schemes This is joint work with Benedict Boontz, Alessandro Chiesa and Pratif Mishra. So let's start with some motivation The problem that we're trying to solve is the following. So you have a t-step non-deterministic communication get computation, which is given by a circuit F, which is the transition step function and an initial input z0 and a target output zt and you want to check that there exists intermediate states z1 up to zt-1 and witnesses w0 up to wt-1 such that for every time step t, F applied to ziwi takes you to the next step zi-1 So this represents essentially a non-deterministic machine computation and one way to do this, which is fairly well understood is to simply prove the entire computation at once. So this is monolithic proof. There are many ways to do this and the issues with these schemes typically they require a large amount of Prover memory. So the Prover has to hold the entire transcript of the computation in his head at the same time and so you need something like s times t memory where s is the space needed to compute the function F whereas the computation itself only needs s memory and Proving the t plus first step. So you prove t steps and now you want to prove so t plus one steps This requires recomputing the entire proof from the beginning So to avoid these issues valiant suggested in 2008 Notion called incrementally verifiable computation Which looks like this. So you take as input z0 and w0 into the Prover. The Prover produces a proof along with the next state z1 Which you then feed again into the Prover along with the input w1 and you get new proof z2 pi2 and so on And you do this over and over again Until you end up with the final state zt and the final proof pi t that attests to the correctness of the entire computation So this is what incrementally verifiable computation looks like and then there is a generalization of that Which is called proof carrying data which takes this sort of path computation. This is a normal path computation and generalizes it to Any directed acyclic graph So for the purposes of this talk, I will talk about IVC and PCD interchangeably So you can think about either some applications of IVC on and PCD includes 16 blockchains snots with low space complexity as and Verifiable delay functions. So in the latter case you can build a VDF by Taking f to be some some hash function, and this will give you a fairly efficient VDF How do we build IVC on and PCD so The sort of state-of-the-art construction is from this PCCT 2013 paper where you build IVC PCD out of a snark with succinct so polyloverithmic verification So a snark here is a succinct non-directive argument of knowledge It was shown more recently that this can be relaxed somewhat to snarks with sublinear verification and also this Holds in the in the quantum setting and post-quantum setting Unfortunately, the this sublinear verification requirement is pretty strong and it restricts the sort of class of snarks that we're able to use to construct this this primitive And so the question that we ask in this work is is sublinear verification required for IVC and PCD and recent work Suggests that maybe this is not the case. So they this is by Bo Grig and Hopwood from last year and They outlined a novel approach to obtain IVC from a specific snark, which has actually a linear verifier They give details about sort of some important practical aspects things like elliptic curve cycles that you need to implement this scheme But they don't give a detailed construction or approval security. And so that's what we Do in this work along with some other things So and essentially we take this Idea from from BGH 19 and we formalize it Using this new cryptography motion called an accumulation scheme and then we start to develop the theory of accumulation schemes So we show that a snark when the accumulation scheme Implies IVC on or PCD even if the snark verifier itself is not sublinear Secondly, we can obtain snarks with accumulation schemes by combining a snark whose verification is sublinear relative to some primitive With an accumulation scheme for that primitive So we'll see examples of that later on Where this is this is important and then finally we have a particular choice of primitive that we're interested in so We show that two popular polynomial commitment schemes have accumulation schemes So one thing to note about these results is that they don't quite all fit together So the top two theorem 1 and theorem 2 hold in the standard model Theorem 1 does not hold in the random marker model Theorem 3 holds in the random marker model But is not known to hold in the standard model and there too is black box And so it holds in both but to go from bottom to top One needs to make a heuristic assumption which you'll see in more detail in a second And we should note that there is no Relation between accumulation schemes and sense accumulators. They just have similar names So a summary of the results in a sort of pictorial form so snarks with accumulation schemes imply IVC PCD and How do you obtain a snark with an accumulation scheme? Well, you start with a snark that is efficient relative to some predicate and then you add an accumulation scheme for that predicate And moreover this allows you actually to turn snarks with your efficient relative to Sorry starts with accumulation schemes into snarks, which actually have 16 verifiers using this result of PCC 13 Unfortunately Well, this picture is very nice. We actually don't know how to instantiate these things in the standard model And so we turn to the random marker model So we have snarks which are efficient relative to polynomial commitments in the random marker model and We show how to build so there's previous work and we show how to build accumulation schemes for some polynomial commitments in the random model again We can then apply theorem 2 in the random marker model to obtain snark when the accumulation scheme in the wrong And then we have to apply this random marker heuristic. So it's a commonly applied heuristic that We make an assumption that there is a choice of concrete hash function which maintains the security of this scheme Which means that we end up with a snark with accumulation scheme in the standard model and then we apply theorem 1 so theorem 1 is a theorem but the The The the condition of the theorem only holds heuristically and so we only heuristically obtain these new PCD and IVC constructions with nice properties So Let's start with a little bit of background about previous IVC PC constructions and this method of recursive composition that is used to build them So a quick definition of IVC the prover takes in the previous state of the computation z and the previous proof pi Along with potentially a witness, but I will ignore this in the in the remainder of this talk and outputs a New state z prime and a new proof pi prime the verifier takes in the card state and the card proof Whatever they are and outputs zero one depending on whether it thinks the entire computation so far has been performed correctly and Notice that the the prover is sort of able to be Looped back into itself and this is formalized by this completeness Condition which says that if the verifier accepts a state proof pair then when you apply the prover one step Then the verifier also accepts this new so it's a prime pi prime And the soundness property or proof of knowledge property is the the following that for every adversary that produces a final proof Final state proof pair Which is accepted by the verifier we can extract from that adversary a complete transcript of the computation so far So going all the way back to this z zero So this is IVC The final property that we need from IVC which sort of makes it interesting Compared to just arguments Is this efficiency property? So we want that the size of the proof pi prime is the same As the size of the proof pi so when as you when you apply a single step of the prover The the proof does not grow in size and this means also to the verification Because it's on sort of a fixed size object. It does not grow in size either So this is what we want how do we build it So one of the building blocks that we require is a snark with preprocessing So what is this? We have a relation R which is the relation of Circuits with Inputs that evaluate to one And a snark will be an argument or a proof system for this for this relation So you start with the setup phase which takes in just the circuit and outputs approving and verification key corresponding to that circuit the prover holds X and W and Produces a proof pi that C of X W is equal to one and the verify which holds X is able to check that proof and Then knows that there exists some W such that C of X W is equal to one So we have the standard completeness and adaptive proof of knowledge properties. I won't talk about them One important thing about snark is that the proof size is sublinear This is sort of what we mean by the succinct in the in snarks So the size of the proof is much smaller than the size of the circuit and Optionally, we also obtain sublinear verification We can also also ask a sublinear verification So here we want the time of the verifier is much more than the size of the circuit so another this is optional and So there are snarks that fulfill it and there are snarks that are interesting that that don't and we will Later on be interested about in snarks that actually don't fulfill this condition But for now we're going to look at snarks that do and see how they How you can use them by this technique of recursive composition to build ABC So the way that you do it is you start with this ABC prover So the ABC prover is going to take in z t pi t and it's going to output z t plus one pi t plus one This is just the syntax of the prover and so now we're just going to fill it in based on You know what we need to go from from t to t plus one So obviously to go from z t to z t plus one you need to apply the transition function f. That's so by definition Then with the proof pi t what you do is you verify So the prover is going to is going to make sure that the proof is correct Then what he's going to do is actually encapsulate both of these things into a circuit are which Does the transition and also verifies the previous proof? This so I sort of hit this but the Snark verify needs a verification key for a circuit and in this case we will choose also the circuit are So this is sort of the recursive property of this and the snark prover then Proves that this circuit are except That it sort of outputs that this z t plus one and pi t plus one is the proof For the next the like pi t plus one which is the the output of this This prover is the proof for the next step The ABC verifier is then just the snark verify Where you key it with this with the verification key for the circuit are Completed as basically follows directly from the snark completeness like the statement will just be true soundness Essentially what you do is you use the proof of knowledge property of the snark to recursively extract From the ABC prover so you you can kind of go back in time by repeating a repeatedly applying the Prover knowledge property This note that this construction and in particular the soundness does not hold in the random oracle model because here we are using the Verifier in a non-blackbox way with proving things about the verifier and this just doesn't work when there is a random oracle In terms of efficiency well this this is good because the size of this proof pi Is the same as the size of a snark proof for this circuit are And what is the size of that? Well, this maybe takes some Some some thinking and this is actually sort of where the sublinear verification part comes in So the size of this circuit are depends on the size of the snark verifier in particular it is at least the size of the snark verifier and so if the snark verifier was a linear then this circuit are would actually Increase in size every time because you will be proving something about the circuit are from the last step And so it would get sort of slightly bigger at every step with sublinear verification. This allows you to Avoid this blow-up by just having the verifier for are be smaller than are And this is why sublinear verification is necessary. It's because you prove stuff about the snark verifier So the question we ask is what about snarks that don't have sublinear verification? What can you do? and To discuss that one I'm going to need to introduce a new sort of cryptographic tool, which is accumulation schemes An accumulation scheme is best expressed in the following way so think about a List a stream of inputs Q1 up to Qt going on forever and We have a predicate fight Which takes in Inputs qi and outputs an output to zero one value and The quantity that we're interested in is the conjunction of the predicate fire applied to all of the qi Okay, and I just want to do if I qi we want to know whether this is one and so one way we can do this is just by you know every time a queue comes in we We apply a fight to it and then we just remember the conjunction so this is Just remember this one bit But if fire is expensive this might take a long time and so an accumulation scheme allows you to To enlist a an untrusted prover to help you with this So the cryptographic object is an accumulator and what an accumulator does is a it accumulates the truth value of this this statement so the We have an accumulation prover P which takes in the old accumulator and the current Query and it outputs the next accumulator. So we do this over again Then We also have a verification algorithm which checks the prover's work at each step So it takes in the old accumulator and the next accumulator and the current query and it outputs one if the If the prover did his job correctly and We do this once again for every step And then finally we have an algorithm called the decider which which runs just once at time t and It takes in the teeth accumulator and it checks essentially whether this accumulator is is right in some sense And this has the property that if all of these checks passed so if the verify if every verify accepted and the decider accepted then This implies that the This conjunction is one So Note that we save in this case if the cost of v is much smaller than the cost of the predicate phi So Because then the sort of it even if the decider is quite expensive the cost is sort of amortized over all of these all of this time t The other thing that we would like That sort of necessary is that the size of the accumulator does not grow with the time t And this will also mean that the decider does not Grow with the like the time of the decider does not grow with the time t and this avoids sort of certain trivial constructions So what can we do with this? Well, we can actually build IBC and PCD from snogs with accumulation schemes. So if you have a snog And you add to that an accumulation scheme for the predicate corresponding to the snog verify Then you get an IBC or PCD scheme Importantly the Verifier for the snog does not need to be sublinear However, the verify for the accumulation scheme does need to be sublinear But this is okay because this is likely to be a simpler object so one thing to notice that if v is in fact sublinear then you can sort of trivially do this by by setting the Accumulation verifier to be equal to the snog verifier and the decider then does nothing But as I said, there are more interesting constructions than that More over this construction preserves both zero knowledge and post-quantum security Finally, this construction shares this drawback of the previous constructions of IBC and PCD Which is that it makes non-blackbox use of the accumulation scheme verify which means that it doesn't hold in the random oracle model So let's briefly go over the construction again We're going to sort of do the same thing as before and look at just the inputs and outputs and try and sort of go from one to the other so the IBC proof now is going to consist of two parts it consists of a snog proof pi i and an accumulator a i and The first thing that we do obviously is we compute the transition function then what we want to do is accumulate the Previous inputs to to p into a new accumulator Ai plus 1 so we do that using the accumulation pruer Then the next thing that we have to do is to check that this was done correctly Otherwise we you know we need at some point to do this verification. Otherwise We don't keep track of whether the accumulator has been correctly updated and so this we this we do and then like before we encapsulate now the the Transition function and the verifier for the accumulation scheme in the circuit are and then So this is the description of the second hour and we we then apply the snog pruer to To this second up Then the IBC verifier so it takes in takes in again this Z and then the IBC proof pi and a the first thing that it does is it runs the decider to check that the Accumulator was was sort of correctly formed And then it runs the actual smart verifier on this on this final proof so The reason that we don't need the snog verifier to be sublinear here is that the recursive circuit doesn't contain it We only actually ever run it once right at the end So the recursive circuit only contains the accumulation verifier, which means that we only need the accumulation verifier to be sublinear So that's the theorem and then the question of course is how do we obtain snogs with accumulation schemes? Where do they come from? so very quickly the The way that you get them is you start with a Well, what an easy way to get them is that you start with a snog Where the verifier is succinct except for some sort of expensive predicate fight? And then you say okay fire has an accumulation scheme So I designed an accumulation scheme for fine and this implies that the snog overall has an accumulation scheme essentially because I removed the expensive part of the snog verifier And then the question becomes naturally what predicates are actually useful to build accumulation schemes for and The answer for this comes from a very popular methodology for building snogs So you start with this information theoretic proof system, which is a called the polynomial IOP or AHP You add to that a polynomial commitment scheme and combine them together using a compiler and this gives you a snog So, you know examples of this a sonic plonk and Marlin and the polynomial commitment scheme For example, you have these KZG BBB or halo And this is a this is used to construct Many popular sort of widely used snogs And so how do you then accumulate such a snog? Well noted we noticed that whenever you build a snog with this With this framework what you end up with actually is a snog that is predicate efficient with respect to the Verification predicate of the polynomial commitment scheme and Then this means that what you Need to do is just design an accumulation scheme for the verification predicate of the PC scheme And you combine these things together using theorem do and you obtain an accumulation scheme for the snog as a whole And this is what we do. So we design accumulations schemes for two widely used polynomial commitments with different properties And these yield in a heuristic sense Two interesting new PCD constructions. The first one you start with a predicate efficient snog with With respect to PC whatever that might be your favorite snog And then you add an accumulation scheme for this KZG commitment Apply this this chain of theorems in heuristics And what you get is PCD and ABC from bilinear groups Where the you have a trusted setup But in return you get Very small proofs and more of a in compared to previous approaches Advantage that you have with this approach is that you don't do any pairings in the recursive circuit Which means that in principle you you can this will be a lot more efficient The alternative construction the other construction that we have again, you start with some predicate efficient snog with respect to polynomial commitments and You add in an accumulation scheme for a different polynomial commitment scheme, which is this Discrete log-based scheme based on the bullet proofs in a product argument apply this these theorems and what you get is PCD and ABC now from standard groups. So not necessarily with with the pairing Which has a transparent setups is no sort of secret parameter that is generated and Secondly the the proofs are pretty small. So not as small as the KZG proofs, but much smaller than previous PCD and ABC schemes with transparent setup and that is all. Thank you


news update. Good afternoon folks. Excuse me, Steve Rhodes coming to you live from the shores of sunny Delray Beach, Florida. This year, 1pm update, slightly mixed bag out here. You got the NASDAQ and the NASDAQ composites, NASDAQ 100 and the NASDAQ composite are still green up 10 points and 15 respectively. Other than that, you've got to see your bread. The Dow's off 164. The S&P's down 13. Russell's off 7. Semi's off 49. You've got gold trading out at 1832. That's off 6 bucks. Silver's down 30 pennies. 2111 is the print there. Lights we screwed off 2 bucks and changed out at 104.01. Natural gas off 61 cents. That's a big move. That's a 9% move. Trading out at 625. The 30 treasure at 1 point in 1930 seconds. 137.18 is the print there. If we go take a look at our 9 panel market update chart, we look at the EES mini. We can still see that the EES mini, that's your up left hand panel, is trading above the center of its bullish structured daily profile. As long as price remains above 37.40, suggests to move to 38.41. That move to 38.41 needs the spot biotechs to continue to move lower, approach its 50-day expense moving average, which is at 28.09 and quite frankly close below that level. Until it does that, it says we've got a very bumpy market. If we take a look at the NQ, finding resistance up at the top of its profile, 117.16, US dollar index, consolidated with inside its daily profiles. That's between 103.62 and 105.65. Gold is consolidated with inside its daily profile. Now we're from 18.13 up to 18.79. Silver is testing the bottom of its weekly profile. That's support 21.03. We're trading right now at 21.06. Lights we screwed. This could be day number two below the bottom of its, no, that's not the bottom, that's the center of its weekly profile. That's at 106.21. Could be stiggling to move all the way back to the 94.11 area. Natural gas is trading below a new bullish structure. It's actually a bullish structured profile that formed yesterday. So this could be day number two, well this would be day number one below the bottom of that level. And that suggests lower price out there in the 30-year treasury. She's going to go target resistance and resistance to the top of its daily profile. And that's at the 13809 level out here. Our focus today, we'll take a look at it, certainly as we open up the Trader Zed show, is going to be on the 30-minute charts out there for the equity future contracts. And the reason is because those are the ones that have the topping signals in place. And those are rogement to indicator tops. Right now the NQ is testing a key level of support. That's the bottom of its 30-minute profile. That's at the 11.565 level. Closed below that at 130 suggests lower price is up. Folks, stay tuned for the Trader Zed show. But if you're off to start your Thursday, have a terrific one, and we'll look forward to speaking to you again soon.


Summer Stride is happening at your San Francisco Public Library. Keep up the reading and earn your Reading Ranger badge or summer tote designed by Christian Robinson. All reading counts. That's right, comic books, back-of-the-serial box, listening to audiobooks and e-books. Visit the San Francisco Public Library to learn more. Keep reading, keep learning, keep creating.