Computational complexity theory
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest. Messages are sent between the verifier and prover until the verifier has an answer to the problem and has "convinced" itself that it is correct. All interactive proof systems have two requirements: * Completeness: if the statement is true, the honest prover (that is, one following the protocol properly) can convince the honest verifier that it is indeed true. * Soundness: if the statement is false, no prover, even if it doesn't follow the protocol, can convince the honest verifier that it is true, except with some small probability. The specific nature of the system, and so the complexity class of languages it can recognize, depends on what sort of bounds are put on the verifier, as well as what abilities it is given—for example, most interactive proof systems depend critically on the verifier's ability to make random choices. It also depends on the nature of the messages exchanged—how many and what they can contain. Interactive proof systems have been found to have some important implications for traditional complexity classes defined using only one machine. The main complexity classes describing interactive proof systems are AM and IP. (Wikipedia).
Inequality Proof: Summing Reciprocals of Squares (Experimental Silent Screencast)
via YouTube Capture
From playlist The Nature of Proof
Introduction to Direct Proofs: If n is even, then n squared is even
This video introduces the mathematical proof method of direct proof provides an example of a direct proof. mathispower4u.com
From playlist Symbolic Logic and Proofs (Discrete Math)
Mathematical Notations -- How to do mathematical proofs (PART 2)
This video contains the preliminary mathematical notation that will be used in the course. This is preliminary video (part 0) on a series of videos: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (som
From playlist How to do Mathematical Proofs
My Thoughts on Constructing and Presenting Rigorous Proofs
In this video, I take a look at one of the ways induction proofs are being presented on YouTube. It turns out a lot of them are missing some pretty important details. I discuss what exactly it is they are doing, why I believe it is sloppy and imprecise, and give my general thoughts about r
From playlist Proofs
Mathematical Induction - Inequalities (1 of 4: General pointers)
More resources available at www.misterwootube.com
From playlist Introduction to Proof by Mathematical Induction
Learning to write an algebraic proof
👉 Learn how to write an algebraic proof. Algebraic proofs are used to help students understand how to write formal proofs where we have a statement and a reason. In the case of an algebraic proof the statement will be the operations used to solve an algebraic equation and the reason will
From playlist Parallel Lines and a Transversal
Introduction to Indirect Proof
This video introduces indirect proof and proves one basic algebraic and one basic geometric indirect proof. Complete Video List: http://mathispower4u.yolasite.com/
From playlist Relationships with Triangles
Link: https://www.geogebra.org/m/ATnqfej6
From playlist Geometry: Dynamic Interactives!
Efficient Zero Knowledge Proofs - A Modular Approach (Lecture 2) by Yuval Ishai
DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.
From playlist Foundational Aspects of Blockchain Technology 2020
Stanford Seminar - Doubly-efficient zkSNARKs Without Trusted Setup
zkSNARKs: what are they? How do their principles apply to security? And more importantly, what is their relationship to cryptocurrency? Join Riad Wahby as he presents his team’s work on Zero-Knowledge Succinct Non-Interactive Argument of Knowledge, also known as zkSNARKs. This presentat
From playlist Stanford Seminars
Guy Rothblum : Privacy and Security via Randomized Methods - 4
Recording during the thematic meeting: «Nexus of Information and Computation Theories » theJanuary 28, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent
From playlist Nexus Trimester - 2016 -Tutorial Week at CIRM
Bohua Zhan - Verifying symbolic computation in the HolPy theorem prover - IPAM at UCLA
Recorded 16 February 2023. Bohua Zhan of the Chinese Academy of Sciences presents "Verifying symbolic computation in the HolPy theorem prover" at IPAM's Machine Assisted Proofs Workshop. Abstract: Symbolic computation appears frequently in mathematical proofs, as well as in sciences and en
From playlist 2023 Machine Assisted Proofs Workshop
The Value of Errors in Proofs - Avi Wigderson
Members’ Seminar Topic: The Value of Errors in Proofs Speaker: Avi Wigderson Affiliation: Herbert H. Maass Professor, School of Mathematics Date: March 01, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Stanford Seminar - Zero-Knowledge and the Next Digital Revolution
March 6, 2023 Alex Pruden of Aleo
Efficient Zero Knowledge Proofs - A Modular Approach (Lecture 1) by Yuval Ishai
DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.
From playlist Foundational Aspects of Blockchain Technology 2020
Superfast Derandomization of Interactive Proof Systems - Roei Tell
Computer Science/Discrete Mathematics Seminar II Topic: Superfast Derandomization of Interactive Proof Systems Speaker: Roei Tell Affiliation: Member, School of Mathematics Date: October 11, 2022 [First half of talk is missing due to technical issues] The lifeblood of interactive proof
From playlist Mathematics
Advice on learning mathematical proofs -- How to do Mathematical Proofs (PART 10)
Advice on learning mathematical proofs -- This is the final video on a series of videos on: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mat
From playlist How to do Mathematical Proofs
Zero Knowledge Proofs - Seminar 4 - Non-interactive Zero Knowledge
This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs). This seminar continues the development of non-interactive Zero Knowledge protocols, closing in on systems that can be used in practice. Yo
From playlist Metauni
Introduction to Proof Methods!
The first video I've made on proof methods! I discuss what a proof is, give some general tips, show how to prove a conditional statement using the direct proof method, and use the direct proof method to do some very beginner friendly proofs! The goals of this video: 1. Help people underst
From playlist Proofs
Localization and delocalization for interacting 1D quasiperiodic particles - Ilya Kachkovskiy
Analysis Seminar Topic: Localization and delocalization for interacting 1D quasiperiodic particles. Speaker: Ilya Kachkovskiy Affiliation: Michigan State University Date: March 15, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics