WEBVTT
Kind: captions
Language: en

00:00:00.000 --> 00:00:04.350 align:start position:0%
 
foreign

00:00:04.350 --> 00:00:04.360 align:start position:0%
 
 

00:00:04.360 --> 00:00:12.789 align:start position:0%
 
[Music]

00:00:12.789 --> 00:00:12.799 align:start position:0%
 
 

00:00:12.799 --> 00:00:16.790 align:start position:0%
 
I'm<00:00:13.799><c> Nolan</c><00:00:14.219><c> I'm</c><00:00:15.059><c> ingtong</c><00:00:15.660><c> and</c><00:00:16.440><c> today</c><00:00:16.560><c> we're</c>

00:00:16.790 --> 00:00:16.800 align:start position:0%
I'm Nolan I'm ingtong and today we're
 

00:00:16.800 --> 00:00:18.769 align:start position:0%
I'm Nolan I'm ingtong and today we're
going<00:00:16.980><c> to</c><00:00:17.100><c> talk</c><00:00:17.220><c> about</c><00:00:17.400><c> recursive</c><00:00:18.000><c> ZK</c><00:00:18.300><c> snarks</c>

00:00:18.769 --> 00:00:18.779 align:start position:0%
going to talk about recursive ZK snarks
 

00:00:18.779 --> 00:00:20.529 align:start position:0%
going to talk about recursive ZK snarks
the<00:00:19.199><c> kinds</c><00:00:19.380><c> of</c><00:00:19.440><c> applications</c><00:00:19.859><c> they</c><00:00:20.220><c> unlock</c>

00:00:20.529 --> 00:00:20.539 align:start position:0%
the kinds of applications they unlock
 

00:00:20.539 --> 00:00:23.630 align:start position:0%
the kinds of applications they unlock
and<00:00:21.539><c> how</c><00:00:21.720><c> we</c><00:00:21.840><c> can</c><00:00:21.960><c> Implement</c><00:00:22.260><c> them</c><00:00:22.500><c> so</c><00:00:23.400><c> first</c>

00:00:23.630 --> 00:00:23.640 align:start position:0%
and how we can Implement them so first
 

00:00:23.640 --> 00:00:25.250 align:start position:0%
and how we can Implement them so first
we<00:00:23.880><c> should</c><00:00:24.060><c> talk</c><00:00:24.240><c> about</c><00:00:24.359><c> what</c><00:00:24.779><c> recursive</c>

00:00:25.250 --> 00:00:25.260 align:start position:0%
we should talk about what recursive
 

00:00:25.260 --> 00:00:27.470 align:start position:0%
we should talk about what recursive
proofs<00:00:25.619><c> even</c><00:00:25.800><c> are</c><00:00:26.039><c> so</c><00:00:26.880><c> in</c><00:00:27.060><c> the</c><00:00:27.119><c> context</c><00:00:27.300><c> of</c>

00:00:27.470 --> 00:00:27.480 align:start position:0%
proofs even are so in the context of
 

00:00:27.480 --> 00:00:29.810 align:start position:0%
proofs even are so in the context of
snork<00:00:27.779><c> recursion</c><00:00:28.500><c> is</c><00:00:28.920><c> usually</c><00:00:29.340><c> the</c><00:00:29.519><c> ability</c>

00:00:29.810 --> 00:00:29.820 align:start position:0%
snork recursion is usually the ability
 

00:00:29.820 --> 00:00:31.970 align:start position:0%
snork recursion is usually the ability
to<00:00:30.060><c> verify</c><00:00:30.420><c> a</c><00:00:30.660><c> smart</c><00:00:30.840><c> proof</c><00:00:31.260><c> inside</c><00:00:31.679><c> of</c>

00:00:31.970 --> 00:00:31.980 align:start position:0%
to verify a smart proof inside of
 

00:00:31.980 --> 00:00:34.430 align:start position:0%
to verify a smart proof inside of
another<00:00:32.099><c> snug</c><00:00:32.579><c> proof</c><00:00:32.880><c> so</c><00:00:33.540><c> this</c><00:00:33.899><c> is</c><00:00:34.079><c> the</c>

00:00:34.430 --> 00:00:34.440 align:start position:0%
another snug proof so this is the
 

00:00:34.440 --> 00:00:36.650 align:start position:0%
another snug proof so this is the
ability<00:00:34.680><c> to</c><00:00:34.920><c> say</c><00:00:35.100><c> something</c><00:00:35.340><c> like</c><00:00:35.640><c> I</c><00:00:36.300><c> know</c><00:00:36.420><c> is</c>

00:00:36.650 --> 00:00:36.660 align:start position:0%
ability to say something like I know is
 

00:00:36.660 --> 00:00:38.930 align:start position:0%
ability to say something like I know is
not<00:00:36.960><c> proof</c><00:00:37.380><c> that</c><00:00:38.100><c> when</c><00:00:38.340><c> I</c><00:00:38.460><c> run</c><00:00:38.579><c> the</c><00:00:38.760><c> smart</c>

00:00:38.930 --> 00:00:38.940 align:start position:0%
not proof that when I run the smart
 

00:00:38.940 --> 00:00:40.850 align:start position:0%
not proof that when I run the smart
verification<00:00:39.360><c> algorithm</c><00:00:39.899><c> on</c><00:00:40.140><c> it</c><00:00:40.440><c> returns</c>

00:00:40.850 --> 00:00:40.860 align:start position:0%
verification algorithm on it returns
 

00:00:40.860 --> 00:00:44.330 align:start position:0%
verification algorithm on it returns
true<00:00:41.040><c> inside</c><00:00:41.460><c> of</c><00:00:41.879><c> another</c><00:00:42.300><c> is</c><00:00:42.660><c> not</c><00:00:42.780><c> proof</c><00:00:43.340><c> and</c>

00:00:44.330 --> 00:00:44.340 align:start position:0%
true inside of another is not proof and
 

00:00:44.340 --> 00:00:46.130 align:start position:0%
true inside of another is not proof and
the<00:00:44.760><c> sort</c><00:00:44.940><c> of</c><00:00:45.059><c> key</c><00:00:45.180><c> part</c><00:00:45.420><c> here</c><00:00:45.660><c> is</c><00:00:45.899><c> that</c>

00:00:46.130 --> 00:00:46.140 align:start position:0%
the sort of key part here is that
 

00:00:46.140 --> 00:00:48.290 align:start position:0%
the sort of key part here is that
verification<00:00:46.680><c> of</c><00:00:46.920><c> regressive</c><00:00:47.340><c> ZK</c><00:00:47.579><c> snarks</c><00:00:48.059><c> is</c>

00:00:48.290 --> 00:00:48.300 align:start position:0%
verification of regressive ZK snarks is
 

00:00:48.300 --> 00:00:51.290 align:start position:0%
verification of regressive ZK snarks is
usually<00:00:48.780><c> not</c><00:00:49.160><c> significantly</c><00:00:50.160><c> slower</c><00:00:50.579><c> than</c>

00:00:51.290 --> 00:00:51.300 align:start position:0%
usually not significantly slower than
 

00:00:51.300 --> 00:00:55.729 align:start position:0%
usually not significantly slower than
ordinary<00:00:52.219><c> regular</c><00:00:53.219><c> CK</c><00:00:53.579><c> smart</c><00:00:53.820><c> verification</c>

00:00:55.729 --> 00:00:55.739 align:start position:0%
ordinary regular CK smart verification
 

00:00:55.739 --> 00:00:57.950 align:start position:0%
ordinary regular CK smart verification
so<00:00:56.699><c> now</c><00:00:56.879><c> that</c><00:00:57.059><c> we</c><00:00:57.180><c> have</c><00:00:57.300><c> this</c><00:00:57.420><c> primitive</c><00:00:57.719><c> in</c>

00:00:57.950 --> 00:00:57.960 align:start position:0%
so now that we have this primitive in
 

00:00:57.960 --> 00:01:00.290 align:start position:0%
so now that we have this primitive in
mind<00:00:58.140><c> we</c><00:00:58.680><c> should</c><00:00:58.800><c> think</c><00:00:59.039><c> about</c><00:00:59.160><c> the</c><00:00:59.940><c> sort</c><00:01:00.180><c> of</c>

00:01:00.290 --> 00:01:00.300 align:start position:0%
mind we should think about the sort of
 

00:01:00.300 --> 00:01:02.150 align:start position:0%
mind we should think about the sort of
natural<00:01:00.480><c> question</c><00:01:00.899><c> is</c><00:01:01.260><c> why</c><00:01:01.800><c> would</c><00:01:01.920><c> you</c><00:01:02.039><c> want</c>

00:01:02.150 --> 00:01:02.160 align:start position:0%
natural question is why would you want
 

00:01:02.160 --> 00:01:04.369 align:start position:0%
natural question is why would you want
to<00:01:02.219><c> make</c><00:01:02.399><c> recursive</c><00:01:02.879><c> smart</c><00:01:03.120><c> proofs</c><00:01:03.539><c> so</c>

00:01:04.369 --> 00:01:04.379 align:start position:0%
to make recursive smart proofs so
 

00:01:04.379 --> 00:01:06.469 align:start position:0%
to make recursive smart proofs so
typically<00:01:04.860><c> regular</c><00:01:05.400><c> ZK</c><00:01:05.760><c> snarks</c><00:01:06.240><c> you</c><00:01:06.299><c> know</c><00:01:06.360><c> we</c>

00:01:06.469 --> 00:01:06.479 align:start position:0%
typically regular ZK snarks you know we
 

00:01:06.479 --> 00:01:08.690 align:start position:0%
typically regular ZK snarks you know we
think<00:01:06.600><c> of</c><00:01:06.780><c> them</c><00:01:06.900><c> as</c><00:01:07.140><c> having</c><00:01:07.380><c> two</c><00:01:07.799><c> uh</c><00:01:08.400><c> sort</c><00:01:08.640><c> of</c>

00:01:08.690 --> 00:01:08.700 align:start position:0%
think of them as having two uh sort of
 

00:01:08.700 --> 00:01:10.310 align:start position:0%
think of them as having two uh sort of
properties<00:01:09.060><c> such</c><00:01:09.600><c> signals</c><00:01:10.080><c> and</c><00:01:10.200><c> their</c>

00:01:10.310 --> 00:01:10.320 align:start position:0%
properties such signals and their
 

00:01:10.320 --> 00:01:12.830 align:start position:0%
properties such signals and their
knowledge<00:01:10.740><c> so</c><00:01:11.400><c> recursion</c><00:01:12.000><c> in</c><00:01:12.180><c> fact</c><00:01:12.299><c> unlocks</c>

00:01:12.830 --> 00:01:12.840 align:start position:0%
knowledge so recursion in fact unlocks
 

00:01:12.840 --> 00:01:15.170 align:start position:0%
knowledge so recursion in fact unlocks
powerful<00:01:13.320><c> versions</c><00:01:13.740><c> of</c><00:01:14.340><c> both</c><00:01:14.880><c> of</c><00:01:15.000><c> these</c>

00:01:15.170 --> 00:01:15.180 align:start position:0%
powerful versions of both of these
 

00:01:15.180 --> 00:01:16.090 align:start position:0%
powerful versions of both of these
properties

00:01:16.090 --> 00:01:16.100 align:start position:0%
properties
 

00:01:16.100 --> 00:01:19.910 align:start position:0%
properties
in<00:01:17.100><c> the</c><00:01:17.220><c> form</c><00:01:17.400><c> of</c><00:01:17.820><c> compression</c><00:01:18.659><c> which</c><00:01:19.200><c> is</c><00:01:19.740><c> a</c>

00:01:19.910 --> 00:01:19.920 align:start position:0%
in the form of compression which is a
 

00:01:19.920 --> 00:01:21.710 align:start position:0%
in the form of compression which is a
stronger<00:01:20.159><c> version</c><00:01:20.340><c> of</c><00:01:20.580><c> the</c><00:01:20.640><c> cygnus</c><00:01:21.119><c> and</c>

00:01:21.710 --> 00:01:21.720 align:start position:0%
stronger version of the cygnus and
 

00:01:21.720 --> 00:01:24.530 align:start position:0%
stronger version of the cygnus and
multi-party<00:01:22.380><c> composibility</c><00:01:23.060><c> from</c><00:01:24.060><c> zero</c>

00:01:24.530 --> 00:01:24.540 align:start position:0%
multi-party composibility from zero
 

00:01:24.540 --> 00:01:26.210 align:start position:0%
multi-party composibility from zero
knowledge

00:01:26.210 --> 00:01:26.220 align:start position:0%
knowledge
 

00:01:26.220 --> 00:01:29.030 align:start position:0%
knowledge
so<00:01:26.880><c> first</c><00:01:27.119><c> let's</c><00:01:27.420><c> talk</c><00:01:27.659><c> about</c><00:01:27.780><c> compression</c><00:01:28.500><c> we</c>

00:01:29.030 --> 00:01:29.040 align:start position:0%
so first let's talk about compression we
 

00:01:29.040 --> 00:01:30.530 align:start position:0%
so first let's talk about compression we
think<00:01:29.220><c> of</c><00:01:29.340><c> compression</c><00:01:29.759><c> as</c><00:01:29.939><c> supercharging</c>

00:01:30.530 --> 00:01:30.540 align:start position:0%
think of compression as supercharging
 

00:01:30.540 --> 00:01:33.350 align:start position:0%
think of compression as supercharging
succinctness<00:01:31.200><c> and</c><00:01:32.159><c> in</c><00:01:32.280><c> particular</c><00:01:32.640><c> usually</c>

00:01:33.350 --> 00:01:33.360 align:start position:0%
succinctness and in particular usually
 

00:01:33.360 --> 00:01:35.090 align:start position:0%
succinctness and in particular usually
the<00:01:33.540><c> applications</c><00:01:33.900><c> of</c><00:01:34.200><c> compression</c><00:01:34.619><c> tend</c><00:01:34.979><c> to</c>

00:01:35.090 --> 00:01:35.100 align:start position:0%
the applications of compression tend to
 

00:01:35.100 --> 00:01:37.190 align:start position:0%
the applications of compression tend to
share<00:01:35.340><c> a</c><00:01:35.579><c> sort</c><00:01:35.759><c> of</c><00:01:35.880><c> common</c><00:01:36.000><c> pattern</c>

00:01:37.190 --> 00:01:37.200 align:start position:0%
share a sort of common pattern
 

00:01:37.200 --> 00:01:38.569 align:start position:0%
share a sort of common pattern
um<00:01:37.259><c> and</c><00:01:37.560><c> this</c><00:01:37.680><c> common</c><00:01:37.860><c> pattern</c><00:01:38.159><c> looks</c><00:01:38.520><c> like</c>

00:01:38.569 --> 00:01:38.579 align:start position:0%
um and this common pattern looks like
 

00:01:38.579 --> 00:01:40.310 align:start position:0%
um and this common pattern looks like
you<00:01:38.939><c> know</c><00:01:39.060><c> let's</c><00:01:39.180><c> say</c><00:01:39.360><c> we</c><00:01:39.540><c> have</c><00:01:39.659><c> a</c><00:01:39.780><c> prover</c><00:01:40.020><c> who</c>

00:01:40.310 --> 00:01:40.320 align:start position:0%
you know let's say we have a prover who
 

00:01:40.320 --> 00:01:42.170 align:start position:0%
you know let's say we have a prover who
wants<00:01:40.500><c> to</c><00:01:40.560><c> show</c><00:01:40.740><c> a</c><00:01:40.979><c> verifier</c>

00:01:42.170 --> 00:01:42.180 align:start position:0%
wants to show a verifier
 

00:01:42.180 --> 00:01:44.270 align:start position:0%
wants to show a verifier
um<00:01:42.240><c> some</c><00:01:42.540><c> n</c><00:01:42.780><c> pieces</c><00:01:43.140><c> of</c><00:01:43.320><c> knowledge</c><00:01:43.619><c> how</c><00:01:44.159><c> do</c>

00:01:44.270 --> 00:01:44.280 align:start position:0%
um some n pieces of knowledge how do
 

00:01:44.280 --> 00:01:45.490 align:start position:0%
um some n pieces of knowledge how do
they<00:01:44.460><c> do</c><00:01:44.640><c> this</c>

00:01:45.490 --> 00:01:45.500 align:start position:0%
they do this
 

00:01:45.500 --> 00:01:49.190 align:start position:0%
they do this
they<00:01:46.500><c> make</c><00:01:46.680><c> a</c><00:01:46.860><c> proof</c><00:01:47.100><c> showing</c><00:01:47.720><c> two</c><00:01:48.720><c> sort</c><00:01:49.079><c> of</c>

00:01:49.190 --> 00:01:49.200 align:start position:0%
they make a proof showing two sort of
 

00:01:49.200 --> 00:01:51.109 align:start position:0%
they make a proof showing two sort of
things<00:01:49.560><c> first</c><00:01:49.979><c> they</c><00:01:50.340><c> show</c><00:01:50.579><c> one</c><00:01:50.820><c> piece</c><00:01:51.000><c> of</c>

00:01:51.109 --> 00:01:51.119 align:start position:0%
things first they show one piece of
 

00:01:51.119 --> 00:01:53.569 align:start position:0%
things first they show one piece of
knowledge<00:01:51.420><c> and</c><00:01:52.320><c> then</c><00:01:52.380><c> they</c><00:01:52.740><c> also</c><00:01:52.979><c> show</c><00:01:53.100><c> you</c>

00:01:53.569 --> 00:01:53.579 align:start position:0%
knowledge and then they also show you
 

00:01:53.579 --> 00:01:55.010 align:start position:0%
knowledge and then they also show you
know<00:01:53.640><c> Additionally</c><00:01:53.939><c> the</c><00:01:54.240><c> N</c><00:01:54.420><c> minus</c><00:01:54.720><c> one</c><00:01:54.780><c> other</c>

00:01:55.010 --> 00:01:55.020 align:start position:0%
know Additionally the N minus one other
 

00:01:55.020 --> 00:01:56.929 align:start position:0%
know Additionally the N minus one other
pieces<00:01:55.380><c> of</c><00:01:55.500><c> knowledge</c><00:01:55.799><c> but</c><00:01:56.340><c> for</c><00:01:56.640><c> these</c><00:01:56.820><c> n</c>

00:01:56.929 --> 00:01:56.939 align:start position:0%
pieces of knowledge but for these n
 

00:01:56.939 --> 00:01:59.330 align:start position:0%
pieces of knowledge but for these n
minus<00:01:57.240><c> one</c><00:01:57.360><c> pieces</c><00:01:57.799><c> instead</c><00:01:58.799><c> of</c><00:01:58.860><c> showing</c><00:01:59.159><c> each</c>

00:01:59.330 --> 00:01:59.340 align:start position:0%
minus one pieces instead of showing each
 

00:01:59.340 --> 00:02:01.670 align:start position:0%
minus one pieces instead of showing each
piece<00:01:59.640><c> individually</c><00:02:00.060><c> they</c><00:02:00.479><c> will</c><00:02:00.659><c> show</c><00:02:01.439><c> that</c>

00:02:01.670 --> 00:02:01.680 align:start position:0%
piece individually they will show that
 

00:02:01.680 --> 00:02:05.270 align:start position:0%
piece individually they will show that
they<00:02:01.860><c> know</c><00:02:02.040><c> a</c><00:02:02.399><c> another</c><00:02:02.759><c> smart</c><00:02:03.420><c> proof</c><00:02:03.840><c> of</c><00:02:04.439><c> these</c>

00:02:05.270 --> 00:02:05.280 align:start position:0%
they know a another smart proof of these
 

00:02:05.280 --> 00:02:07.249 align:start position:0%
they know a another smart proof of these
n<00:02:05.399><c> minus</c><00:02:05.700><c> one</c><00:02:05.820><c> pieces</c>

00:02:07.249 --> 00:02:07.259 align:start position:0%
n minus one pieces
 

00:02:07.259 --> 00:02:09.109 align:start position:0%
n minus one pieces
so<00:02:07.799><c> the</c><00:02:08.039><c> next</c><00:02:08.160><c> question</c><00:02:08.280><c> is</c><00:02:08.459><c> how</c><00:02:08.759><c> do</c><00:02:08.880><c> you</c><00:02:09.000><c> make</c>

00:02:09.109 --> 00:02:09.119 align:start position:0%
so the next question is how do you make
 

00:02:09.119 --> 00:02:10.550 align:start position:0%
so the next question is how do you make
the<00:02:09.360><c> smart</c><00:02:09.539><c> pool</c><00:02:09.780><c> for</c><00:02:09.959><c> the</c><00:02:10.020><c> N</c><00:02:10.200><c> minus</c><00:02:10.440><c> one</c>

00:02:10.550 --> 00:02:10.560 align:start position:0%
the smart pool for the N minus one
 

00:02:10.560 --> 00:02:12.530 align:start position:0%
the smart pool for the N minus one
pieces<00:02:10.860><c> of</c><00:02:10.979><c> knowledge</c>

00:02:12.530 --> 00:02:12.540 align:start position:0%
pieces of knowledge
 

00:02:12.540 --> 00:02:14.270 align:start position:0%
pieces of knowledge
um<00:02:12.599><c> and</c><00:02:12.900><c> in</c><00:02:13.140><c> fact</c><00:02:13.260><c> we</c><00:02:13.500><c> use</c><00:02:13.680><c> the</c><00:02:13.860><c> same</c><00:02:14.040><c> kind</c><00:02:14.160><c> of</c>

00:02:14.270 --> 00:02:14.280 align:start position:0%
um and in fact we use the same kind of
 

00:02:14.280 --> 00:02:16.850 align:start position:0%
um and in fact we use the same kind of
strategy<00:02:14.640><c> again</c><00:02:14.900><c> the</c><00:02:15.900><c> N</c><00:02:16.080><c> minus</c><00:02:16.319><c> one</c><00:02:16.440><c> pieces</c><00:02:16.739><c> of</c>

00:02:16.850 --> 00:02:16.860 align:start position:0%
strategy again the N minus one pieces of
 

00:02:16.860 --> 00:02:18.470 align:start position:0%
strategy again the N minus one pieces of
knowledge<00:02:17.160><c> we</c><00:02:17.459><c> show</c><00:02:17.640><c> one</c><00:02:17.879><c> piece</c><00:02:18.060><c> of</c><00:02:18.180><c> knowledge</c>

00:02:18.470 --> 00:02:18.480 align:start position:0%
knowledge we show one piece of knowledge
 

00:02:18.480 --> 00:02:19.729 align:start position:0%
knowledge we show one piece of knowledge
and<00:02:18.780><c> additionally</c><00:02:19.080><c> we</c><00:02:19.260><c> show</c><00:02:19.440><c> that</c><00:02:19.560><c> we</c><00:02:19.620><c> know</c>

00:02:19.729 --> 00:02:19.739 align:start position:0%
and additionally we show that we know
 

00:02:19.739 --> 00:02:21.830 align:start position:0%
and additionally we show that we know
another<00:02:19.920><c> proof</c><00:02:20.340><c> of</c><00:02:20.580><c> n</c><00:02:20.819><c> minus</c><00:02:21.180><c> two</c><00:02:21.300><c> pieces</c><00:02:21.720><c> of</c>

00:02:21.830 --> 00:02:21.840 align:start position:0%
another proof of n minus two pieces of
 

00:02:21.840 --> 00:02:22.990 align:start position:0%
another proof of n minus two pieces of
knowledge

00:02:22.990 --> 00:02:23.000 align:start position:0%
knowledge
 

00:02:23.000 --> 00:02:25.369 align:start position:0%
knowledge
and<00:02:24.000><c> so</c><00:02:24.180><c> then</c><00:02:24.300><c> you</c><00:02:24.540><c> know</c><00:02:24.660><c> you</c><00:02:24.780><c> just</c><00:02:24.900><c> Cascade</c>

00:02:25.369 --> 00:02:25.379 align:start position:0%
and so then you know you just Cascade
 

00:02:25.379 --> 00:02:27.290 align:start position:0%
and so then you know you just Cascade
down<00:02:25.560><c> this</c><00:02:25.800><c> sort</c><00:02:25.980><c> of</c><00:02:26.099><c> strategy</c><00:02:26.459><c> and</c><00:02:26.879><c> you</c><00:02:27.120><c> end</c>

00:02:27.290 --> 00:02:27.300 align:start position:0%
down this sort of strategy and you end
 

00:02:27.300 --> 00:02:28.430 align:start position:0%
down this sort of strategy and you end
up<00:02:27.360><c> with</c><00:02:27.540><c> the</c><00:02:27.660><c> situation</c><00:02:27.959><c> where</c><00:02:28.260><c> you're</c>

00:02:28.430 --> 00:02:28.440 align:start position:0%
up with the situation where you're
 

00:02:28.440 --> 00:02:32.630 align:start position:0%
up with the situation where you're
verifying<00:02:29.040><c> uh</c><00:02:29.580><c> one</c><00:02:30.060><c> uh</c><00:02:30.480><c> snark</c><00:02:31.040><c> proof</c><00:02:32.040><c> and</c><00:02:32.340><c> in</c>

00:02:32.630 --> 00:02:32.640 align:start position:0%
verifying uh one uh snark proof and in
 

00:02:32.640 --> 00:02:34.850 align:start position:0%
verifying uh one uh snark proof and in
that<00:02:32.819><c> it's</c><00:02:33.660><c> automatically</c><00:02:34.140><c> verifying</c><00:02:34.560><c> these</c>

00:02:34.850 --> 00:02:34.860 align:start position:0%
that it's automatically verifying these
 

00:02:34.860 --> 00:02:37.910 align:start position:0%
that it's automatically verifying these
n<00:02:35.040><c> items</c><00:02:35.459><c> of</c><00:02:35.580><c> knowledge</c><00:02:36.420><c> another</c><00:02:37.319><c> instance</c><00:02:37.739><c> of</c>

00:02:37.910 --> 00:02:37.920 align:start position:0%
n items of knowledge another instance of
 

00:02:37.920 --> 00:02:39.350 align:start position:0%
n items of knowledge another instance of
compression<00:02:38.340><c> that's</c><00:02:38.580><c> particularly</c><00:02:39.000><c> helpful</c>

00:02:39.350 --> 00:02:39.360 align:start position:0%
compression that's particularly helpful
 

00:02:39.360 --> 00:02:42.710 align:start position:0%
compression that's particularly helpful
to<00:02:39.480><c> point</c><00:02:39.660><c> out</c><00:02:39.840><c> is</c><00:02:40.819><c> the</c><00:02:41.819><c> setting</c><00:02:42.180><c> where</c><00:02:42.420><c> you</c>

00:02:42.710 --> 00:02:42.720 align:start position:0%
to point out is the setting where you
 

00:02:42.720 --> 00:02:44.990 align:start position:0%
to point out is the setting where you
want<00:02:42.959><c> to</c><00:02:43.560><c> compose</c><00:02:43.860><c> between</c><00:02:44.160><c> different</c><00:02:44.519><c> proof</c>

00:02:44.990 --> 00:02:45.000 align:start position:0%
want to compose between different proof
 

00:02:45.000 --> 00:02:47.570 align:start position:0%
want to compose between different proof
systems<00:02:45.360><c> or</c><00:02:45.480><c> arithmetizations</c><00:02:46.200><c> and</c><00:02:46.800><c> at</c><00:02:47.459><c> the</c>

00:02:47.570 --> 00:02:47.580 align:start position:0%
systems or arithmetizations and at the
 

00:02:47.580 --> 00:02:49.729 align:start position:0%
systems or arithmetizations and at the
time<00:02:47.700><c> also</c><00:02:48.420><c> pick</c><00:02:48.599><c> the</c><00:02:48.840><c> good</c><00:02:48.959><c> features</c><00:02:49.260><c> of</c><00:02:49.500><c> each</c>

00:02:49.729 --> 00:02:49.739 align:start position:0%
time also pick the good features of each
 

00:02:49.739 --> 00:02:51.890 align:start position:0%
time also pick the good features of each
of<00:02:49.920><c> them</c><00:02:50.040><c> so</c><00:02:50.700><c> for</c><00:02:50.940><c> instance</c><00:02:51.239><c> you</c><00:02:51.599><c> can</c><00:02:51.720><c> have</c>

00:02:51.890 --> 00:02:51.900 align:start position:0%
of them so for instance you can have
 

00:02:51.900 --> 00:02:53.390 align:start position:0%
of them so for instance you can have
some<00:02:52.260><c> setting</c><00:02:52.800><c> where</c><00:02:52.980><c> you</c><00:02:53.099><c> have</c><00:02:53.220><c> two</c>

00:02:53.390 --> 00:02:53.400 align:start position:0%
some setting where you have two
 

00:02:53.400 --> 00:02:55.490 align:start position:0%
some setting where you have two
different<00:02:53.580><c> proving</c><00:02:54.060><c> schemes</c><00:02:54.420><c> one</c><00:02:55.019><c> where</c><00:02:55.319><c> you</c>

00:02:55.490 --> 00:02:55.500 align:start position:0%
different proving schemes one where you
 

00:02:55.500 --> 00:02:57.350 align:start position:0%
different proving schemes one where you
have<00:02:55.620><c> a</c><00:02:55.739><c> fast</c><00:02:55.800><c> prover</c><00:02:56.160><c> but</c><00:02:56.760><c> unfortunately</c><00:02:57.180><c> the</c>

00:02:57.350 --> 00:02:57.360 align:start position:0%
have a fast prover but unfortunately the
 

00:02:57.360 --> 00:02:59.990 align:start position:0%
have a fast prover but unfortunately the
verifier<00:02:57.780><c> is</c><00:02:57.900><c> slow</c><00:02:58.140><c> and</c><00:02:58.980><c> another</c><00:02:59.220><c> where</c><00:02:59.640><c> the</c>

00:02:59.990 --> 00:03:00.000 align:start position:0%
verifier is slow and another where the
 

00:03:00.000 --> 00:03:02.030 align:start position:0%
verifier is slow and another where the
approver<00:03:00.360><c> is</c><00:03:00.599><c> lower</c><00:03:00.780><c> but</c><00:03:01.379><c> you</c><00:03:01.860><c> get</c><00:03:01.980><c> the</c>

00:03:02.030 --> 00:03:02.040 align:start position:0%
approver is lower but you get the
 

00:03:02.040 --> 00:03:03.949 align:start position:0%
approver is lower but you get the
trade-offs<00:03:02.459><c> that</c><00:03:02.519><c> the</c><00:03:02.580><c> verifier</c><00:03:02.940><c> is</c><00:03:03.060><c> fast</c><00:03:03.239><c> so</c>

00:03:03.949 --> 00:03:03.959 align:start position:0%
trade-offs that the verifier is fast so
 

00:03:03.959 --> 00:03:06.290 align:start position:0%
trade-offs that the verifier is fast so
using<00:03:04.440><c> recursion</c><00:03:04.980><c> you</c><00:03:05.519><c> can</c><00:03:05.580><c> compose</c><00:03:05.940><c> between</c>

00:03:06.290 --> 00:03:06.300 align:start position:0%
using recursion you can compose between
 

00:03:06.300 --> 00:03:08.089 align:start position:0%
using recursion you can compose between
the<00:03:06.720><c> proving</c><00:03:07.080><c> system</c><00:03:07.260><c> from</c><00:03:07.560><c> The</c><00:03:07.739><c> Wider</c>

00:03:08.089 --> 00:03:08.099 align:start position:0%
the proving system from The Wider
 

00:03:08.099 --> 00:03:10.850 align:start position:0%
the proving system from The Wider
setting<00:03:08.879><c> to</c><00:03:09.180><c> the</c><00:03:09.420><c> narrower</c><00:03:09.959><c> setting</c><00:03:10.379><c> and</c><00:03:10.739><c> get</c>

00:03:10.850 --> 00:03:10.860 align:start position:0%
setting to the narrower setting and get
 

00:03:10.860 --> 00:03:12.530 align:start position:0%
setting to the narrower setting and get
a<00:03:10.980><c> tiny</c><00:03:11.220><c> proof</c><00:03:11.459><c> output</c><00:03:11.760><c> as</c><00:03:12.239><c> well</c><00:03:12.420><c> as</c>

00:03:12.530 --> 00:03:12.540 align:start position:0%
a tiny proof output as well as
 

00:03:12.540 --> 00:03:14.570 align:start position:0%
a tiny proof output as well as
fast-provers<00:03:13.500><c> getting</c><00:03:13.920><c> sort</c><00:03:14.099><c> of</c><00:03:14.220><c> the</c><00:03:14.280><c> best</c><00:03:14.400><c> of</c>

00:03:14.570 --> 00:03:14.580 align:start position:0%
fast-provers getting sort of the best of
 

00:03:14.580 --> 00:03:16.670 align:start position:0%
fast-provers getting sort of the best of
the<00:03:14.700><c> Both</c><00:03:14.879><c> Worlds</c>

00:03:16.670 --> 00:03:16.680 align:start position:0%
the Both Worlds
 

00:03:16.680 --> 00:03:18.410 align:start position:0%
the Both Worlds
um a<00:03:16.920><c> concrete</c><00:03:17.280><c> sort</c><00:03:17.519><c> of</c><00:03:17.640><c> instantiation</c><00:03:18.180><c> of</c>

00:03:18.410 --> 00:03:18.420 align:start position:0%
um a concrete sort of instantiation of
 

00:03:18.420 --> 00:03:20.449 align:start position:0%
um a concrete sort of instantiation of
this<00:03:18.720><c> interoperability</c><00:03:19.500><c> is</c><00:03:19.980><c> the</c><00:03:20.159><c> setting</c>

00:03:20.449 --> 00:03:20.459 align:start position:0%
this interoperability is the setting
 

00:03:20.459 --> 00:03:22.910 align:start position:0%
this interoperability is the setting
which<00:03:20.580><c> starts</c><00:03:21.060><c> and</c><00:03:21.239><c> grot16</c><00:03:21.780><c> in</c><00:03:22.680><c> particular</c>

00:03:22.910 --> 00:03:22.920 align:start position:0%
which starts and grot16 in particular
 

00:03:22.920 --> 00:03:25.910 align:start position:0%
which starts and grot16 in particular
grads<00:03:23.459><c> grad</c><00:03:23.940><c> 16</c><00:03:24.120><c> is</c><00:03:24.599><c> very</c><00:03:24.900><c> cheap</c><00:03:25.319><c> to</c><00:03:25.500><c> verify</c>

00:03:25.910 --> 00:03:25.920 align:start position:0%
grads grad 16 is very cheap to verify
 

00:03:25.920 --> 00:03:28.729 align:start position:0%
grads grad 16 is very cheap to verify
whereas<00:03:26.519><c> Starks</c><00:03:26.879><c> are</c><00:03:27.060><c> very</c><00:03:27.480><c> easy</c><00:03:27.659><c> to</c><00:03:27.900><c> prove</c><00:03:28.200><c> so</c>

00:03:28.729 --> 00:03:28.739 align:start position:0%
whereas Starks are very easy to prove so
 

00:03:28.739 --> 00:03:30.530 align:start position:0%
whereas Starks are very easy to prove so
if<00:03:28.980><c> you</c><00:03:29.099><c> verify</c><00:03:29.400><c> a</c><00:03:29.519><c> stark</c><00:03:29.760><c> roof</c><00:03:30.000><c> inside</c><00:03:30.180><c> of</c><00:03:30.420><c> a</c>

00:03:30.530 --> 00:03:30.540 align:start position:0%
if you verify a stark roof inside of a
 

00:03:30.540 --> 00:03:32.330 align:start position:0%
if you verify a stark roof inside of a
graphics<00:03:30.900><c> scene</c><00:03:31.080><c> snark</c><00:03:31.440><c> you</c><00:03:31.739><c> end</c><00:03:31.860><c> up</c><00:03:31.980><c> with</c><00:03:32.159><c> a</c>

00:03:32.330 --> 00:03:32.340 align:start position:0%
graphics scene snark you end up with a
 

00:03:32.340 --> 00:03:34.130 align:start position:0%
graphics scene snark you end up with a
proof<00:03:32.819><c> of</c><00:03:32.940><c> the</c><00:03:33.060><c> original</c><00:03:33.180><c> statement</c><00:03:33.780><c> with</c><00:03:33.959><c> the</c>

00:03:34.130 --> 00:03:34.140 align:start position:0%
proof of the original statement with the
 

00:03:34.140 --> 00:03:35.990 align:start position:0%
proof of the original statement with the
fast-prover<00:03:34.620><c> as</c><00:03:34.920><c> well</c><00:03:35.099><c> as</c><00:03:35.220><c> a</c><00:03:35.340><c> fast</c><00:03:35.459><c> verifier</c>

00:03:35.990 --> 00:03:36.000 align:start position:0%
fast-prover as well as a fast verifier
 

00:03:36.000 --> 00:03:38.930 align:start position:0%
fast-prover as well as a fast verifier
so<00:03:36.959><c> generally</c><00:03:37.440><c> compression</c><00:03:38.040><c> has</c><00:03:38.459><c> this</c><00:03:38.760><c> sort</c>

00:03:38.930 --> 00:03:38.940 align:start position:0%
so generally compression has this sort
 

00:03:38.940 --> 00:03:41.330 align:start position:0%
so generally compression has this sort
of<00:03:39.060><c> property</c><00:03:39.360><c> that</c><00:03:39.599><c> is</c><00:03:39.720><c> very</c><00:03:39.900><c> mechanical</c><00:03:40.379><c> and</c>

00:03:41.330 --> 00:03:41.340 align:start position:0%
of property that is very mechanical and
 

00:03:41.340 --> 00:03:42.949 align:start position:0%
of property that is very mechanical and
usually<00:03:41.640><c> you're</c><00:03:41.819><c> rolling</c><00:03:42.180><c> up</c><00:03:42.299><c> some</c><00:03:42.540><c> giant</c>

00:03:42.949 --> 00:03:42.959 align:start position:0%
usually you're rolling up some giant
 

00:03:42.959 --> 00:03:45.410 align:start position:0%
usually you're rolling up some giant
list<00:03:43.140><c> of</c><00:03:43.379><c> computation</c><00:03:43.920><c> or</c><00:03:44.340><c> items</c><00:03:45.299><c> of</c>

00:03:45.410 --> 00:03:45.420 align:start position:0%
list of computation or items of
 

00:03:45.420 --> 00:03:48.170 align:start position:0%
list of computation or items of
knowledge<00:03:46.159><c> increment</c><00:03:47.159><c> into</c><00:03:47.459><c> a</c><00:03:47.700><c> single</c><00:03:47.940><c> proof</c>

00:03:48.170 --> 00:03:48.180 align:start position:0%
knowledge increment into a single proof
 

00:03:48.180 --> 00:03:50.330 align:start position:0%
knowledge increment into a single proof
so<00:03:49.019><c> just</c><00:03:49.140><c> to</c><00:03:49.319><c> give</c><00:03:49.379><c> a</c><00:03:49.560><c> flavor</c><00:03:49.799><c> for</c><00:03:50.040><c> sort</c><00:03:50.220><c> of</c>

00:03:50.330 --> 00:03:50.340 align:start position:0%
so just to give a flavor for sort of
 

00:03:50.340 --> 00:03:52.970 align:start position:0%
so just to give a flavor for sort of
what<00:03:50.459><c> applications</c><00:03:51.060><c> this</c><00:03:51.540><c> unlocks</c><00:03:52.080><c> let's</c>

00:03:52.970 --> 00:03:52.980 align:start position:0%
what applications this unlocks let's
 

00:03:52.980 --> 00:03:54.410 align:start position:0%
what applications this unlocks let's
look<00:03:53.220><c> at</c><00:03:53.340><c> things</c><00:03:53.519><c> that</c><00:03:53.760><c> are</c><00:03:53.940><c> interesting</c><00:03:54.299><c> to</c>

00:03:54.410 --> 00:03:54.420 align:start position:0%
look at things that are interesting to
 

00:03:54.420 --> 00:03:58.850 align:start position:0%
look at things that are interesting to
roll<00:03:54.659><c> up</c><00:03:55.220><c> so</c><00:03:56.220><c> first</c><00:03:56.640><c> is</c><00:03:56.879><c> signatures</c><00:03:57.680><c> over</c><00:03:58.680><c> the</c>

00:03:58.850 --> 00:03:58.860 align:start position:0%
roll up so first is signatures over the
 

00:03:58.860 --> 00:04:01.009 align:start position:0%
roll up so first is signatures over the
summer<00:03:59.040><c> we</c><00:03:59.280><c> built</c><00:03:59.519><c> applications</c><00:04:00.000><c> using</c><00:04:00.659><c> sort</c>

00:04:01.009 --> 00:04:01.019 align:start position:0%
summer we built applications using sort
 

00:04:01.019 --> 00:04:02.589 align:start position:0%
summer we built applications using sort
of<00:04:01.080><c> this</c><00:04:01.200><c> primitive</c><00:04:01.560><c> of</c><00:04:01.860><c> recursive</c>

00:04:02.589 --> 00:04:02.599 align:start position:0%
of this primitive of recursive
 

00:04:02.599 --> 00:04:04.729 align:start position:0%
of this primitive of recursive
compression<00:04:03.599><c> of</c><00:04:03.900><c> signatures</c><00:04:04.440><c> called</c>

00:04:04.729 --> 00:04:04.739 align:start position:0%
compression of signatures called
 

00:04:04.739 --> 00:04:07.610 align:start position:0%
compression of signatures called
isocratia<00:04:05.519><c> where</c><00:04:06.420><c> we</c><00:04:06.720><c> end</c><00:04:06.959><c> up</c><00:04:07.080><c> with</c><00:04:07.260><c> a</c><00:04:07.500><c> low</c>

00:04:07.610 --> 00:04:07.620 align:start position:0%
isocratia where we end up with a low
 

00:04:07.620 --> 00:04:10.550 align:start position:0%
isocratia where we end up with a low
trust<00:04:07.980><c> low</c><00:04:08.340><c> cost</c><00:04:08.640><c> sort</c><00:04:09.360><c> of</c><00:04:09.420><c> roll-up</c><00:04:10.140><c> of</c>

00:04:10.550 --> 00:04:10.560 align:start position:0%
trust low cost sort of roll-up of
 

00:04:10.560 --> 00:04:13.309 align:start position:0%
trust low cost sort of roll-up of
off-chain<00:04:11.040><c> modes</c><00:04:11.540><c> and</c><00:04:12.540><c> end</c><00:04:12.780><c> up</c><00:04:12.900><c> securing</c>

00:04:13.309 --> 00:04:13.319 align:start position:0%
off-chain modes and end up securing
 

00:04:13.319 --> 00:04:15.649 align:start position:0%
off-chain modes and end up securing
governance<00:04:13.860><c> and</c><00:04:14.700><c> then</c><00:04:14.760><c> more</c><00:04:15.000><c> related</c><00:04:15.360><c> to</c><00:04:15.540><c> sort</c>

00:04:15.649 --> 00:04:15.659 align:start position:0%
governance and then more related to sort
 

00:04:15.659 --> 00:04:18.110 align:start position:0%
governance and then more related to sort
of<00:04:15.720><c> blockchain</c><00:04:16.019><c> land</c><00:04:16.680><c> you</c><00:04:17.579><c> can</c><00:04:17.699><c> do</c><00:04:17.820><c> the</c><00:04:18.000><c> same</c>

00:04:18.110 --> 00:04:18.120 align:start position:0%
of blockchain land you can do the same
 

00:04:18.120 --> 00:04:20.990 align:start position:0%
of blockchain land you can do the same
kind<00:04:18.239><c> of</c><00:04:18.359><c> trick</c><00:04:18.660><c> with</c><00:04:18.840><c> light</c><00:04:19.680><c> climb</c><00:04:20.100><c> boots</c><00:04:20.220><c> and</c>

00:04:20.990 --> 00:04:21.000 align:start position:0%
kind of trick with light climb boots and
 

00:04:21.000 --> 00:04:23.330 align:start position:0%
kind of trick with light climb boots and
in<00:04:21.120><c> fact</c><00:04:21.239><c> plumo</c><00:04:21.780><c> which</c><00:04:22.380><c> is</c><00:04:22.560><c> solos</c><00:04:22.979><c> light</c>

00:04:23.330 --> 00:04:23.340 align:start position:0%
in fact plumo which is solos light
 

00:04:23.340 --> 00:04:25.310 align:start position:0%
in fact plumo which is solos light
client<00:04:23.699><c> is</c><00:04:23.820><c> based</c><00:04:24.060><c> on</c><00:04:24.180><c> this</c><00:04:24.300><c> sort</c><00:04:24.419><c> of</c><00:04:24.540><c> idea</c><00:04:24.840><c> and</c>

00:04:25.310 --> 00:04:25.320 align:start position:0%
client is based on this sort of idea and
 

00:04:25.320 --> 00:04:27.890 align:start position:0%
client is based on this sort of idea and
there's<00:04:25.440><c> also</c><00:04:25.740><c> another</c><00:04:25.860><c> group</c><00:04:26.419><c> named</c><00:04:27.419><c> Axiom</c>

00:04:27.890 --> 00:04:27.900 align:start position:0%
there's also another group named Axiom
 

00:04:27.900 --> 00:04:30.469 align:start position:0%
there's also another group named Axiom
which<00:04:28.080><c> is</c><00:04:28.139><c> exploring</c><00:04:28.560><c> sort</c><00:04:28.800><c> of</c><00:04:28.919><c> more</c><00:04:29.479><c> cooler</c>

00:04:30.469 --> 00:04:30.479 align:start position:0%
which is exploring sort of more cooler
 

00:04:30.479 --> 00:04:32.450 align:start position:0%
which is exploring sort of more cooler
use<00:04:30.660><c> cases</c><00:04:30.840><c> for</c><00:04:31.080><c> this</c><00:04:31.259><c> with</c><00:04:31.500><c> aggregating</c><00:04:32.100><c> and</c>

00:04:32.450 --> 00:04:32.460 align:start position:0%
use cases for this with aggregating and
 

00:04:32.460 --> 00:04:35.150 align:start position:0%
use cases for this with aggregating and
providing<00:04:33.120><c> historical</c><00:04:33.540><c> data</c><00:04:34.020><c> through</c><00:04:34.979><c> the</c>

00:04:35.150 --> 00:04:35.160 align:start position:0%
providing historical data through the
 

00:04:35.160 --> 00:04:37.969 align:start position:0%
providing historical data through the
use<00:04:35.280><c> of</c><00:04:35.460><c> recursive</c><00:04:35.940><c> snarks</c><00:04:36.560><c> and</c><00:04:37.560><c> then</c><00:04:37.680><c> finally</c>

00:04:37.969 --> 00:04:37.979 align:start position:0%
use of recursive snarks and then finally
 

00:04:37.979 --> 00:04:40.550 align:start position:0%
use of recursive snarks and then finally
the<00:04:38.340><c> sort</c><00:04:38.580><c> of</c><00:04:38.699><c> Hot</c><00:04:39.120><c> Topic</c><00:04:39.540><c> in</c><00:04:39.900><c> blockchain</c><00:04:40.320><c> land</c>

00:04:40.550 --> 00:04:40.560 align:start position:0%
the sort of Hot Topic in blockchain land
 

00:04:40.560 --> 00:04:42.350 align:start position:0%
the sort of Hot Topic in blockchain land
these<00:04:40.860><c> days</c><00:04:40.919><c> is</c><00:04:41.160><c> making</c><00:04:41.759><c> roll</c><00:04:42.000><c> ups</c><00:04:42.300><c> of</c>

00:04:42.350 --> 00:04:42.360 align:start position:0%
these days is making roll ups of
 

00:04:42.360 --> 00:04:44.629 align:start position:0%
these days is making roll ups of
transactions<00:04:42.960><c> two</c><00:04:43.800><c> particular</c><00:04:44.160><c> ones</c><00:04:44.520><c> that</c>

00:04:44.629 --> 00:04:44.639 align:start position:0%
transactions two particular ones that
 

00:04:44.639 --> 00:04:46.070 align:start position:0%
transactions two particular ones that
are<00:04:44.820><c> sort</c><00:04:44.940><c> of</c><00:04:45.060><c> interesting</c><00:04:45.419><c> to</c><00:04:45.540><c> point</c><00:04:45.660><c> out</c><00:04:45.780><c> are</c>

00:04:46.070 --> 00:04:46.080 align:start position:0%
are sort of interesting to point out are
 

00:04:46.080 --> 00:04:48.590 align:start position:0%
are sort of interesting to point out are
Mina<00:04:46.680><c> who</c><00:04:47.160><c> sort</c><00:04:47.280><c> of</c><00:04:47.340><c> use</c><00:04:47.520><c> this</c><00:04:47.820><c> recursion</c>

00:04:48.590 --> 00:04:48.600 align:start position:0%
Mina who sort of use this recursion
 

00:04:48.600 --> 00:04:50.629 align:start position:0%
Mina who sort of use this recursion
primitive<00:04:49.500><c> as</c><00:04:49.740><c> a</c><00:04:49.919><c> consensus</c><00:04:50.280><c> player</c>

00:04:50.629 --> 00:04:50.639 align:start position:0%
primitive as a consensus player
 

00:04:50.639 --> 00:04:54.110 align:start position:0%
primitive as a consensus player
primitive<00:04:51.419><c> and</c><00:04:52.139><c> polygon</c><00:04:52.860><c> Hermes</c><00:04:53.220><c> who</c><00:04:53.699><c> use</c><00:04:53.940><c> the</c>

00:04:54.110 --> 00:04:54.120 align:start position:0%
primitive and polygon Hermes who use the
 

00:04:54.120 --> 00:04:56.749 align:start position:0%
primitive and polygon Hermes who use the
exact<00:04:54.419><c> strategy</c><00:04:54.780><c> of</c><00:04:54.960><c> like</c><00:04:55.139><c> using</c><00:04:55.740><c> Starks</c><00:04:56.220><c> for</c>

00:04:56.749 --> 00:04:56.759 align:start position:0%
exact strategy of like using Starks for
 

00:04:56.759 --> 00:04:59.150 align:start position:0%
exact strategy of like using Starks for
fast-prover<00:04:57.300><c> settings</c><00:04:57.540><c> and</c><00:04:58.080><c> grad</c><00:04:58.740><c> 16</c><00:04:58.860><c> or</c>

00:04:59.150 --> 00:04:59.160 align:start position:0%
fast-prover settings and grad 16 or
 

00:04:59.160 --> 00:05:02.150 align:start position:0%
fast-prover settings and grad 16 or
snarks<00:04:59.759><c> for</c><00:05:00.000><c> fast</c><00:05:00.720><c> verification</c><00:05:01.199><c> settings</c>

00:05:02.150 --> 00:05:02.160 align:start position:0%
snarks for fast verification settings
 

00:05:02.160 --> 00:05:04.969 align:start position:0%
snarks for fast verification settings
next<00:05:02.880><c> let's</c><00:05:03.419><c> talk</c><00:05:03.600><c> about</c><00:05:03.780><c> composability</c><00:05:04.380><c> my</c>

00:05:04.969 --> 00:05:04.979 align:start position:0%
next let's talk about composability my
 

00:05:04.979 --> 00:05:06.710 align:start position:0%
next let's talk about composability my
personal<00:05:05.100><c> favorite</c><00:05:05.400><c> property</c><00:05:05.940><c> unlocked</c><00:05:06.600><c> by</c>

00:05:06.710 --> 00:05:06.720 align:start position:0%
personal favorite property unlocked by
 

00:05:06.720 --> 00:05:09.530 align:start position:0%
personal favorite property unlocked by
recursive<00:05:07.259><c> Snooks</c><00:05:07.759><c> so</c><00:05:08.759><c> to</c><00:05:08.880><c> give</c><00:05:09.060><c> some</c><00:05:09.240><c> context</c>

00:05:09.530 --> 00:05:09.540 align:start position:0%
recursive Snooks so to give some context
 

00:05:09.540 --> 00:05:11.930 align:start position:0%
recursive Snooks so to give some context
for<00:05:09.840><c> this</c><00:05:10.080><c> let's</c><00:05:10.500><c> take</c><00:05:10.680><c> a</c><00:05:10.800><c> step</c><00:05:10.979><c> back</c><00:05:11.160><c> let's</c>

00:05:11.930 --> 00:05:11.940 align:start position:0%
for this let's take a step back let's
 

00:05:11.940 --> 00:05:14.810 align:start position:0%
for this let's take a step back let's
think<00:05:12.120><c> about</c><00:05:12.240><c> what</c><00:05:12.720><c> a</c><00:05:13.259><c> normal</c><00:05:13.500><c> ZK</c><00:05:13.979><c> proof</c><00:05:14.400><c> uh</c>

00:05:14.810 --> 00:05:14.820 align:start position:0%
think about what a normal ZK proof uh
 

00:05:14.820 --> 00:05:16.189 align:start position:0%
think about what a normal ZK proof uh
you<00:05:15.000><c> know</c><00:05:15.120><c> what's</c><00:05:15.419><c> the</c><00:05:15.600><c> context</c><00:05:15.840><c> of</c><00:05:16.020><c> a</c><00:05:16.080><c> normal</c>

00:05:16.189 --> 00:05:16.199 align:start position:0%
you know what's the context of a normal
 

00:05:16.199 --> 00:05:17.870 align:start position:0%
you know what's the context of a normal
ziki<00:05:16.680><c> proof</c><00:05:16.860><c> we</c><00:05:17.220><c> usually</c><00:05:17.460><c> think</c><00:05:17.580><c> of</c><00:05:17.699><c> you</c><00:05:17.820><c> know</c>

00:05:17.870 --> 00:05:17.880 align:start position:0%
ziki proof we usually think of you know
 

00:05:17.880 --> 00:05:19.790 align:start position:0%
ziki proof we usually think of you know
DK<00:05:18.180><c> proofs</c><00:05:18.479><c> in</c><00:05:18.540><c> this</c><00:05:18.660><c> context</c><00:05:18.840><c> where</c><00:05:19.139><c> approver</c>

00:05:19.790 --> 00:05:19.800 align:start position:0%
DK proofs in this context where approver
 

00:05:19.800 --> 00:05:21.230 align:start position:0%
DK proofs in this context where approver
is<00:05:20.040><c> showing</c><00:05:20.280><c> knowledge</c><00:05:20.520><c> to</c><00:05:20.699><c> a</c><00:05:20.820><c> verifier</c>

00:05:21.230 --> 00:05:21.240 align:start position:0%
is showing knowledge to a verifier
 

00:05:21.240 --> 00:05:24.409 align:start position:0%
is showing knowledge to a verifier
without<00:05:22.139><c> revealing</c><00:05:22.860><c> the</c><00:05:23.100><c> underlying</c><00:05:23.639><c> fact</c><00:05:23.880><c> of</c>

00:05:24.409 --> 00:05:24.419 align:start position:0%
without revealing the underlying fact of
 

00:05:24.419 --> 00:05:27.230 align:start position:0%
without revealing the underlying fact of
the<00:05:24.600><c> knowledge</c><00:05:25.020><c> with</c><00:05:25.620><c> recursion</c><00:05:26.160><c> in</c><00:05:26.340><c> fact</c><00:05:26.460><c> you</c>

00:05:27.230 --> 00:05:27.240 align:start position:0%
the knowledge with recursion in fact you
 

00:05:27.240 --> 00:05:28.450 align:start position:0%
the knowledge with recursion in fact you
can<00:05:27.300><c> unlock</c><00:05:27.419><c> something</c><00:05:27.780><c> more</c><00:05:28.080><c> powerful</c>

00:05:28.450 --> 00:05:28.460 align:start position:0%
can unlock something more powerful
 

00:05:28.460 --> 00:05:30.469 align:start position:0%
can unlock something more powerful
approver<00:05:29.460><c> can</c><00:05:29.759><c> show</c><00:05:29.940><c> knowledge</c><00:05:30.240><c> to</c><00:05:30.360><c> a</c>

00:05:30.469 --> 00:05:30.479 align:start position:0%
approver can show knowledge to a
 

00:05:30.479 --> 00:05:33.170 align:start position:0%
approver can show knowledge to a
verifier<00:05:30.780><c> without</c><00:05:31.560><c> fully</c><00:05:32.220><c> knowing</c><00:05:32.580><c> the</c>

00:05:33.170 --> 00:05:33.180 align:start position:0%
verifier without fully knowing the
 

00:05:33.180 --> 00:05:35.810 align:start position:0%
verifier without fully knowing the
underlying<00:05:33.720><c> facts</c><00:05:34.380><c> themselves</c>

00:05:35.810 --> 00:05:35.820 align:start position:0%
underlying facts themselves
 

00:05:35.820 --> 00:05:38.150 align:start position:0%
underlying facts themselves
so<00:05:36.360><c> this</c><00:05:36.600><c> is</c><00:05:36.660><c> a</c><00:05:36.780><c> bit</c><00:05:36.840><c> hard</c><00:05:37.020><c> to</c><00:05:37.199><c> model</c><00:05:37.320><c> so</c><00:05:37.680><c> I'll</c>

00:05:38.150 --> 00:05:38.160 align:start position:0%
so this is a bit hard to model so I'll
 

00:05:38.160 --> 00:05:40.189 align:start position:0%
so this is a bit hard to model so I'll
just<00:05:38.400><c> lead</c><00:05:38.639><c> with</c><00:05:38.880><c> an</c><00:05:39.000><c> example</c><00:05:39.300><c> over</c><00:05:40.020><c> the</c>

00:05:40.189 --> 00:05:40.199 align:start position:0%
just lead with an example over the
 

00:05:40.199 --> 00:05:41.450 align:start position:0%
just lead with an example over the
summer<00:05:40.320><c> we</c><00:05:40.560><c> build</c><00:05:40.740><c> this</c><00:05:40.860><c> application</c><00:05:41.160><c> called</c>

00:05:41.450 --> 00:05:41.460 align:start position:0%
summer we build this application called
 

00:05:41.460 --> 00:05:44.510 align:start position:0%
summer we build this application called
eat<00:05:41.820><c> dos</c><00:05:42.360><c> which</c><00:05:43.199><c> is</c><00:05:43.380><c> a</c><00:05:43.740><c> dash</c><00:05:44.039><c> number</c><00:05:44.220><c> is</c><00:05:44.400><c> on</c>

00:05:44.510 --> 00:05:44.520 align:start position:0%
eat dos which is a dash number is on
 

00:05:44.520 --> 00:05:46.310 align:start position:0%
eat dos which is a dash number is on
social<00:05:44.639><c> graphs</c><00:05:45.000><c> so</c><00:05:45.419><c> these</c><00:05:45.660><c> social</c><00:05:45.780><c> graphs</c><00:05:46.199><c> are</c>

00:05:46.310 --> 00:05:46.320 align:start position:0%
social graphs so these social graphs are
 

00:05:46.320 --> 00:05:48.890 align:start position:0%
social graphs so these social graphs are
sort<00:05:46.620><c> of</c><00:05:46.740><c> graphs</c><00:05:47.340><c> of</c><00:05:47.520><c> relationships</c><00:05:48.479><c> of</c>

00:05:48.890 --> 00:05:48.900 align:start position:0%
sort of graphs of relationships of
 

00:05:48.900 --> 00:05:51.710 align:start position:0%
sort of graphs of relationships of
people<00:05:49.740><c> saying</c><00:05:50.220><c> I</c><00:05:50.520><c> am</c><00:05:50.699><c> your</c><00:05:50.880><c> friend</c><00:05:51.120><c> kinds</c><00:05:51.660><c> of</c>

00:05:51.710 --> 00:05:51.720 align:start position:0%
people saying I am your friend kinds of
 

00:05:51.720 --> 00:05:54.050 align:start position:0%
people saying I am your friend kinds of
things<00:05:52.039><c> and</c><00:05:53.039><c> for</c><00:05:53.280><c> instance</c><00:05:53.460><c> here</c><00:05:53.699><c> we</c><00:05:53.880><c> have</c>

00:05:54.050 --> 00:05:54.060 align:start position:0%
things and for instance here we have
 

00:05:54.060 --> 00:05:56.930 align:start position:0%
things and for instance here we have
this<00:05:54.180><c> graph</c><00:05:54.539><c> and</c><00:05:55.320><c> vitalik</c><00:05:55.919><c> sent</c><00:05:56.160><c> someone</c><00:05:56.520><c> who</c>

00:05:56.930 --> 00:05:56.940 align:start position:0%
this graph and vitalik sent someone who
 

00:05:56.940 --> 00:05:58.730 align:start position:0%
this graph and vitalik sent someone who
sends<00:05:57.300><c> someone</c><00:05:57.419><c> who</c><00:05:57.720><c> sends</c><00:05:58.020><c> someone</c><00:05:58.080><c> and</c>

00:05:58.730 --> 00:05:58.740 align:start position:0%
sends someone who sends someone and
 

00:05:58.740 --> 00:06:01.610 align:start position:0%
sends someone who sends someone and
finally<00:05:59.039><c> I</c><00:05:59.639><c> ended</c><00:05:59.880><c> up</c><00:06:00.000><c> with</c><00:06:00.180><c> a</c><00:06:00.780><c> four</c><00:06:01.259><c> degree</c>

00:06:01.610 --> 00:06:01.620 align:start position:0%
finally I ended up with a four degree
 

00:06:01.620 --> 00:06:04.249 align:start position:0%
finally I ended up with a four degree
path<00:06:01.860><c> to</c><00:06:02.160><c> vitalik</c><00:06:02.699><c> now</c><00:06:03.300><c> I</c><00:06:03.419><c> can</c><00:06:03.539><c> prove</c><00:06:03.780><c> that</c><00:06:03.960><c> I</c>

00:06:04.249 --> 00:06:04.259 align:start position:0%
path to vitalik now I can prove that I
 

00:06:04.259 --> 00:06:06.010 align:start position:0%
path to vitalik now I can prove that I
have<00:06:04.380><c> a</c><00:06:04.680><c> four</c><00:06:04.919><c> degree</c><00:06:05.160><c> path</c><00:06:05.400><c> of</c><00:06:05.580><c> italic</c>

00:06:06.010 --> 00:06:06.020 align:start position:0%
have a four degree path of italic
 

00:06:06.020 --> 00:06:08.629 align:start position:0%
have a four degree path of italic
without<00:06:07.020><c> reviewing</c><00:06:07.620><c> any</c><00:06:07.740><c> or</c><00:06:07.979><c> without</c><00:06:08.160><c> knowing</c>

00:06:08.629 --> 00:06:08.639 align:start position:0%
without reviewing any or without knowing
 

00:06:08.639 --> 00:06:10.850 align:start position:0%
without reviewing any or without knowing
any<00:06:08.880><c> of</c><00:06:09.060><c> the</c><00:06:09.180><c> intermediate</c><00:06:09.720><c> parties</c><00:06:10.560><c> in</c><00:06:10.740><c> this</c>

00:06:10.850 --> 00:06:10.860 align:start position:0%
any of the intermediate parties in this
 

00:06:10.860 --> 00:06:14.330 align:start position:0%
any of the intermediate parties in this
path<00:06:11.100><c> so</c><00:06:11.400><c> how</c><00:06:11.580><c> do</c><00:06:11.699><c> I</c><00:06:11.820><c> do</c><00:06:11.940><c> this</c><00:06:12.080><c> I</c><00:06:13.080><c> say</c><00:06:13.259><c> I</c><00:06:14.039><c> am</c><00:06:14.160><c> a</c>

00:06:14.330 --> 00:06:14.340 align:start position:0%
path so how do I do this I say I am a
 

00:06:14.340 --> 00:06:17.450 align:start position:0%
path so how do I do this I say I am a
friend<00:06:14.460><c> of</c><00:06:14.699><c> adhian</c><00:06:15.320><c> and</c><00:06:16.320><c> adyan</c><00:06:16.860><c> has</c><00:06:17.039><c> a</c><00:06:17.160><c> ZK</c>

00:06:17.450 --> 00:06:17.460 align:start position:0%
friend of adhian and adyan has a ZK
 

00:06:17.460 --> 00:06:19.070 align:start position:0%
friend of adhian and adyan has a ZK
proof<00:06:17.759><c> that</c><00:06:18.000><c> he</c><00:06:18.180><c> is</c><00:06:18.360><c> three</c><00:06:18.600><c> degrees</c><00:06:18.780><c> from</c>

00:06:19.070 --> 00:06:19.080 align:start position:0%
proof that he is three degrees from
 

00:06:19.080 --> 00:06:21.830 align:start position:0%
proof that he is three degrees from
italic<00:06:19.620><c> so</c><00:06:20.400><c> in</c><00:06:20.639><c> this</c><00:06:20.759><c> process</c><00:06:21.060><c> I</c><00:06:21.419><c> do</c><00:06:21.479><c> not</c><00:06:21.660><c> know</c>

00:06:21.830 --> 00:06:21.840 align:start position:0%
italic so in this process I do not know
 

00:06:21.840 --> 00:06:24.770 align:start position:0%
italic so in this process I do not know
the<00:06:22.199><c> three</c><00:06:22.560><c> degrees</c><00:06:22.740><c> that</c><00:06:23.460><c> precede</c><00:06:23.819><c> adyan</c><00:06:24.240><c> and</c>

00:06:24.770 --> 00:06:24.780 align:start position:0%
the three degrees that precede adyan and
 

00:06:24.780 --> 00:06:27.469 align:start position:0%
the three degrees that precede adyan and
I<00:06:25.020><c> have</c><00:06:25.139><c> still</c><00:06:25.380><c> convinced</c><00:06:26.039><c> any</c><00:06:26.280><c> external</c><00:06:26.819><c> as</c>

00:06:27.469 --> 00:06:27.479 align:start position:0%
I have still convinced any external as
 

00:06:27.479 --> 00:06:29.749 align:start position:0%
I have still convinced any external as
well<00:06:27.600><c> as</c><00:06:27.720><c> myself</c><00:06:27.840><c> that</c><00:06:28.680><c> there</c><00:06:28.979><c> is</c><00:06:29.160><c> a</c><00:06:29.400><c> valid</c>

00:06:29.749 --> 00:06:29.759 align:start position:0%
well as myself that there is a valid
 

00:06:29.759 --> 00:06:31.610 align:start position:0%
well as myself that there is a valid
path<00:06:30.060><c> of</c><00:06:30.300><c> four</c><00:06:30.479><c> degree</c><00:06:30.900><c> between</c><00:06:31.199><c> me</c><00:06:31.440><c> and</c>

00:06:31.610 --> 00:06:31.620 align:start position:0%
path of four degree between me and
 

00:06:31.620 --> 00:06:34.370 align:start position:0%
path of four degree between me and
vidalic<00:06:32.160><c> so</c><00:06:33.000><c> of</c><00:06:33.300><c> course</c><00:06:33.419><c> this</c><00:06:33.780><c> is</c><00:06:33.900><c> not</c><00:06:34.139><c> the</c>

00:06:34.370 --> 00:06:34.380 align:start position:0%
vidalic so of course this is not the
 

00:06:34.380 --> 00:06:36.350 align:start position:0%
vidalic so of course this is not the
only<00:06:34.440><c> application</c><00:06:34.919><c> you</c><00:06:35.160><c> can</c><00:06:35.280><c> build</c><00:06:35.699><c> um</c><00:06:35.759><c> in</c>

00:06:36.350 --> 00:06:36.360 align:start position:0%
only application you can build um in
 

00:06:36.360 --> 00:06:37.790 align:start position:0%
only application you can build um in
general<00:06:36.479><c> we</c><00:06:36.840><c> think</c><00:06:37.020><c> composability</c><00:06:37.560><c> is</c>

00:06:37.790 --> 00:06:37.800 align:start position:0%
general we think composability is
 

00:06:37.800 --> 00:06:40.129 align:start position:0%
general we think composability is
particularly<00:06:38.280><c> cool</c><00:06:38.759><c> to</c><00:06:39.000><c> think</c><00:06:39.180><c> of</c><00:06:39.300><c> in</c><00:06:39.600><c> sort</c><00:06:40.020><c> of</c>

00:06:40.129 --> 00:06:40.139 align:start position:0%
particularly cool to think of in sort of
 

00:06:40.139 --> 00:06:41.870 align:start position:0%
particularly cool to think of in sort of
incomplete<00:06:40.860><c> information</c><00:06:41.039><c> game</c><00:06:41.460><c> kinds</c><00:06:41.819><c> of</c>

00:06:41.870 --> 00:06:41.880 align:start position:0%
incomplete information game kinds of
 

00:06:41.880 --> 00:06:45.469 align:start position:0%
incomplete information game kinds of
settings<00:06:42.560><c> and</c><00:06:43.560><c> of</c><00:06:44.220><c> course</c><00:06:44.340><c> the</c><00:06:44.639><c> sort</c><00:06:45.180><c> of</c><00:06:45.300><c> very</c>

00:06:45.469 --> 00:06:45.479 align:start position:0%
settings and of course the sort of very
 

00:06:45.479 --> 00:06:47.270 align:start position:0%
settings and of course the sort of very
typical<00:06:45.780><c> example</c><00:06:46.139><c> the</c><00:06:46.440><c> the</c><00:06:46.680><c> phrase</c><00:06:47.100><c> starting</c>

00:06:47.270 --> 00:06:47.280 align:start position:0%
typical example the the phrase starting
 

00:06:47.280 --> 00:06:49.309 align:start position:0%
typical example the the phrase starting
point<00:06:47.460><c> we</c><00:06:47.759><c> thought</c><00:06:47.940><c> of</c><00:06:48.180><c> was</c><00:06:48.419><c> games</c><00:06:49.080><c> like</c>

00:06:49.309 --> 00:06:49.319 align:start position:0%
point we thought of was games like
 

00:06:49.319 --> 00:06:51.830 align:start position:0%
point we thought of was games like
telephone<00:06:49.560><c> or</c><00:06:50.100><c> Chinese</c><00:06:50.400><c> Whispers</c><00:06:51.000><c> where</c><00:06:51.360><c> you</c>

00:06:51.830 --> 00:06:51.840 align:start position:0%
telephone or Chinese Whispers where you
 

00:06:51.840 --> 00:06:53.330 align:start position:0%
telephone or Chinese Whispers where you
know<00:06:51.900><c> you</c><00:06:52.020><c> pass</c><00:06:52.199><c> a</c><00:06:52.380><c> word</c><00:06:52.500><c> around</c><00:06:52.800><c> or</c><00:06:53.160><c> something</c>

00:06:53.330 --> 00:06:53.340 align:start position:0%
know you pass a word around or something
 

00:06:53.340 --> 00:06:55.730 align:start position:0%
know you pass a word around or something
and<00:06:53.699><c> you</c><00:06:53.940><c> want</c><00:06:54.120><c> to</c><00:06:54.240><c> make</c><00:06:54.360><c> edits</c><00:06:54.780><c> to</c><00:06:54.900><c> it</c><00:06:55.080><c> uh</c>

00:06:55.730 --> 00:06:55.740 align:start position:0%
and you want to make edits to it uh
 

00:06:55.740 --> 00:06:58.070 align:start position:0%
and you want to make edits to it uh
incrementally<00:06:56.340><c> and</c><00:06:57.120><c> then</c><00:06:57.240><c> you</c><00:06:57.539><c> can</c><00:06:57.600><c> make</c><00:06:57.780><c> more</c>

00:06:58.070 --> 00:06:58.080 align:start position:0%
incrementally and then you can make more
 

00:06:58.080 --> 00:07:00.650 align:start position:0%
incrementally and then you can make more
complex<00:06:58.380><c> applications</c><00:06:58.860><c> like</c><00:06:59.819><c> party</c><00:07:00.360><c> games</c>

00:07:00.650 --> 00:07:00.660 align:start position:0%
complex applications like party games
 

00:07:00.660 --> 00:07:03.230 align:start position:0%
complex applications like party games
like<00:07:00.840><c> Mafia</c><00:07:01.319><c> those</c><00:07:01.919><c> kinds</c><00:07:02.160><c> of</c><00:07:02.220><c> things</c><00:07:02.340><c> and</c>

00:07:03.230 --> 00:07:03.240 align:start position:0%
like Mafia those kinds of things and
 

00:07:03.240 --> 00:07:04.610 align:start position:0%
like Mafia those kinds of things and
then<00:07:03.300><c> more</c><00:07:03.539><c> relevant</c><00:07:03.900><c> to</c><00:07:04.020><c> blockchain</c><00:07:04.380><c> land</c>

00:07:04.610 --> 00:07:04.620 align:start position:0%
then more relevant to blockchain land
 

00:07:04.620 --> 00:07:06.890 align:start position:0%
then more relevant to blockchain land
you<00:07:05.160><c> can</c><00:07:05.280><c> build</c><00:07:05.400><c> private</c><00:07:05.880><c> State</c><00:07:06.060><c> channels</c><00:07:06.539><c> and</c>

00:07:06.890 --> 00:07:06.900 align:start position:0%
you can build private State channels and
 

00:07:06.900 --> 00:07:09.529 align:start position:0%
you can build private State channels and
roll<00:07:07.740><c> ups</c><00:07:08.160><c> of</c><00:07:08.280><c> that</c><00:07:08.460><c> sort</c>

00:07:09.529 --> 00:07:09.539 align:start position:0%
roll ups of that sort
 

00:07:09.539 --> 00:07:13.010 align:start position:0%
roll ups of that sort
so<00:07:10.380><c> now</c><00:07:10.560><c> that</c><00:07:10.800><c> we</c><00:07:10.979><c> have</c><00:07:11.160><c> some</c><00:07:11.639><c> intuition</c><00:07:12.360><c> for</c>

00:07:13.010 --> 00:07:13.020 align:start position:0%
so now that we have some intuition for
 

00:07:13.020 --> 00:07:15.590 align:start position:0%
so now that we have some intuition for
the<00:07:13.380><c> high</c><00:07:13.620><c> level</c><00:07:13.800><c> properties</c><00:07:14.639><c> of</c><00:07:15.120><c> recursive</c>

00:07:15.590 --> 00:07:15.600 align:start position:0%
the high level properties of recursive
 

00:07:15.600 --> 00:07:18.230 align:start position:0%
the high level properties of recursive
proofs<00:07:15.960><c> and</c><00:07:16.740><c> now</c><00:07:16.919><c> that</c><00:07:17.100><c> we've</c><00:07:17.340><c> seen</c><00:07:17.699><c> some</c>

00:07:18.230 --> 00:07:18.240 align:start position:0%
proofs and now that we've seen some
 

00:07:18.240 --> 00:07:21.050 align:start position:0%
proofs and now that we've seen some
classes<00:07:18.900><c> of</c><00:07:19.080><c> applications</c><00:07:19.620><c> that</c><00:07:20.460><c> are</c><00:07:20.580><c> enabled</c>

00:07:21.050 --> 00:07:21.060 align:start position:0%
classes of applications that are enabled
 

00:07:21.060 --> 00:07:23.330 align:start position:0%
classes of applications that are enabled
by<00:07:21.240><c> them</c><00:07:21.479><c> you</c><00:07:22.319><c> might</c><00:07:22.500><c> be</c><00:07:22.740><c> feeling</c><00:07:22.979><c> that</c>

00:07:23.330 --> 00:07:23.340 align:start position:0%
by them you might be feeling that
 

00:07:23.340 --> 00:07:24.830 align:start position:0%
by them you might be feeling that
recursive<00:07:23.819><c> proofs</c><00:07:24.180><c> are</c><00:07:24.419><c> kind</c><00:07:24.720><c> of</c>

00:07:24.830 --> 00:07:24.840 align:start position:0%
recursive proofs are kind of
 

00:07:24.840 --> 00:07:27.290 align:start position:0%
recursive proofs are kind of
unreasonable<00:07:25.560><c> we</c><00:07:26.520><c> get</c><00:07:26.699><c> unlimited</c>

00:07:27.290 --> 00:07:27.300 align:start position:0%
unreasonable we get unlimited
 

00:07:27.300 --> 00:07:29.930 align:start position:0%
unreasonable we get unlimited
compression<00:07:28.020><c> and</c><00:07:28.319><c> compostability</c>

00:07:29.930 --> 00:07:29.940 align:start position:0%
compression and compostability
 

00:07:29.940 --> 00:07:32.930 align:start position:0%
compression and compostability
so<00:07:30.660><c> I</c><00:07:31.319><c> guess</c><00:07:31.440><c> the</c><00:07:31.620><c> natural</c><00:07:31.860><c> question</c><00:07:32.280><c> now</c><00:07:32.639><c> is</c>

00:07:32.930 --> 00:07:32.940 align:start position:0%
so I guess the natural question now is
 

00:07:32.940 --> 00:07:36.350 align:start position:0%
so I guess the natural question now is
how<00:07:33.720><c> do</c><00:07:33.840><c> we</c><00:07:34.020><c> Implement</c><00:07:34.440><c> and</c><00:07:34.800><c> construct</c><00:07:35.360><c> these</c>

00:07:36.350 --> 00:07:36.360 align:start position:0%
how do we Implement and construct these
 

00:07:36.360 --> 00:07:38.270 align:start position:0%
how do we Implement and construct these
systems

00:07:38.270 --> 00:07:38.280 align:start position:0%
systems
 

00:07:38.280 --> 00:07:41.990 align:start position:0%
systems
so<00:07:39.060><c> right</c><00:07:39.360><c> now</c><00:07:39.539><c> there's</c><00:07:40.460><c> broadly</c><00:07:41.460><c> three</c>

00:07:41.990 --> 00:07:42.000 align:start position:0%
so right now there's broadly three
 

00:07:42.000 --> 00:07:44.330 align:start position:0%
so right now there's broadly three
classes<00:07:42.660><c> of</c><00:07:43.139><c> recursive</c><00:07:43.680><c> proofs</c><00:07:44.039><c> in</c>

00:07:44.330 --> 00:07:44.340 align:start position:0%
classes of recursive proofs in
 

00:07:44.340 --> 00:07:47.450 align:start position:0%
classes of recursive proofs in
production<00:07:44.780><c> and</c><00:07:45.780><c> as</c><00:07:46.199><c> we</c><00:07:46.440><c> descend</c><00:07:47.039><c> the</c>

00:07:47.450 --> 00:07:47.460 align:start position:0%
production and as we descend the
 

00:07:47.460 --> 00:07:50.270 align:start position:0%
production and as we descend the
hierarchy<00:07:48.000><c> we</c><00:07:48.900><c> are</c><00:07:49.080><c> relaxing</c><00:07:49.860><c> the</c>

00:07:50.270 --> 00:07:50.280 align:start position:0%
hierarchy we are relaxing the
 

00:07:50.280 --> 00:07:53.629 align:start position:0%
hierarchy we are relaxing the
requirements<00:07:51.000><c> on</c><00:07:51.660><c> the</c><00:07:51.780><c> proof</c><00:07:52.080><c> systems</c><00:07:52.639><c> which</c>

00:07:53.629 --> 00:07:53.639 align:start position:0%
requirements on the proof systems which
 

00:07:53.639 --> 00:07:57.770 align:start position:0%
requirements on the proof systems which
are<00:07:53.819><c> eligible</c><00:07:54.380><c> for</c><00:07:55.580><c> recursive</c><00:07:56.580><c> schemes</c>

00:07:57.770 --> 00:07:57.780 align:start position:0%
are eligible for recursive schemes
 

00:07:57.780 --> 00:08:00.950 align:start position:0%
are eligible for recursive schemes
so<00:07:58.319><c> at</c><00:07:58.560><c> the</c><00:07:58.740><c> very</c><00:07:58.919><c> top</c><00:07:59.160><c> of</c><00:07:59.520><c> the</c><00:07:59.639><c> hierarchy</c><00:08:00.120><c> we</c>

00:08:00.950 --> 00:08:00.960 align:start position:0%
so at the very top of the hierarchy we
 

00:08:00.960 --> 00:08:02.450 align:start position:0%
so at the very top of the hierarchy we
have<00:08:01.139><c> really</c><00:08:01.440><c> the</c><00:08:01.740><c> most</c><00:08:01.919><c> stringent</c>

00:08:02.450 --> 00:08:02.460 align:start position:0%
have really the most stringent
 

00:08:02.460 --> 00:08:05.510 align:start position:0%
have really the most stringent
requirements<00:08:03.300><c> so</c><00:08:03.840><c> we</c><00:08:04.139><c> we</c><00:08:04.319><c> need</c><00:08:04.560><c> proof</c><00:08:04.979><c> systems</c>

00:08:05.510 --> 00:08:05.520 align:start position:0%
requirements so we we need proof systems
 

00:08:05.520 --> 00:08:08.870 align:start position:0%
requirements so we we need proof systems
with<00:08:05.960><c> verifiers</c><00:08:06.960><c> that</c><00:08:07.380><c> are</c><00:08:07.560><c> sub-linear</c><00:08:08.220><c> that</c>

00:08:08.870 --> 00:08:08.880 align:start position:0%
with verifiers that are sub-linear that
 

00:08:08.880 --> 00:08:11.150 align:start position:0%
with verifiers that are sub-linear that
are<00:08:09.060><c> succinct</c><00:08:09.599><c> in</c><00:08:10.440><c> the</c><00:08:10.620><c> size</c><00:08:10.800><c> of</c><00:08:11.039><c> the</c>

00:08:11.150 --> 00:08:11.160 align:start position:0%
are succinct in the size of the
 

00:08:11.160 --> 00:08:14.210 align:start position:0%
are succinct in the size of the
statement<00:08:11.400><c> being</c><00:08:11.699><c> proven</c><00:08:12.259><c> and</c><00:08:13.259><c> this</c><00:08:13.680><c> enables</c>

00:08:14.210 --> 00:08:14.220 align:start position:0%
statement being proven and this enables
 

00:08:14.220 --> 00:08:17.029 align:start position:0%
statement being proven and this enables
us<00:08:14.400><c> to</c><00:08:14.699><c> do</c><00:08:14.880><c> full</c><00:08:15.300><c> recursion</c><00:08:15.960><c> at</c><00:08:16.800><c> every</c>

00:08:17.029 --> 00:08:17.039 align:start position:0%
us to do full recursion at every
 

00:08:17.039 --> 00:08:18.650 align:start position:0%
us to do full recursion at every
recursive<00:08:17.639><c> step</c>

00:08:18.650 --> 00:08:18.660 align:start position:0%
recursive step
 

00:08:18.660 --> 00:08:22.309 align:start position:0%
recursive step
so<00:08:19.500><c> this</c><00:08:19.979><c> has</c><00:08:20.160><c> been</c><00:08:20.340><c> implemented</c><00:08:21.000><c> for</c><00:08:21.660><c> the</c>

00:08:22.309 --> 00:08:22.319 align:start position:0%
so this has been implemented for the
 

00:08:22.319 --> 00:08:27.589 align:start position:0%
so this has been implemented for the
growth<00:08:22.680><c> 16</c><00:08:23.039><c> and</c><00:08:23.759><c> Fry</c><00:08:24.740><c> priv</c><00:08:25.740><c> systems</c>

00:08:27.589 --> 00:08:27.599 align:start position:0%
growth 16 and Fry priv systems
 

00:08:27.599 --> 00:08:31.129 align:start position:0%
growth 16 and Fry priv systems
so<00:08:28.259><c> if</c><00:08:28.620><c> we</c><00:08:28.860><c> relax</c><00:08:29.280><c> our</c><00:08:29.940><c> requirements</c><00:08:30.660><c> a</c><00:08:31.020><c> little</c>

00:08:31.129 --> 00:08:31.139 align:start position:0%
so if we relax our requirements a little
 

00:08:31.139 --> 00:08:35.510 align:start position:0%
so if we relax our requirements a little
bit<00:08:31.760><c> and</c><00:08:32.760><c> we</c><00:08:33.120><c> say</c><00:08:33.360><c> even</c><00:08:34.260><c> if</c><00:08:34.560><c> we</c><00:08:34.800><c> don't</c><00:08:34.919><c> have</c><00:08:35.279><c> a</c>

00:08:35.510 --> 00:08:35.520 align:start position:0%
bit and we say even if we don't have a
 

00:08:35.520 --> 00:08:37.190 align:start position:0%
bit and we say even if we don't have a
succinct<00:08:35.940><c> verifier</c>

00:08:37.190 --> 00:08:37.200 align:start position:0%
succinct verifier
 

00:08:37.200 --> 00:08:40.070 align:start position:0%
succinct verifier
maybe<00:08:37.979><c> we're</c><00:08:38.399><c> happy</c><00:08:38.640><c> enough</c><00:08:38.940><c> just</c><00:08:39.479><c> with</c><00:08:39.839><c> a</c>

00:08:40.070 --> 00:08:40.080 align:start position:0%
maybe we're happy enough just with a
 

00:08:40.080 --> 00:08:43.790 align:start position:0%
maybe we're happy enough just with a
succinct<00:08:40.500><c> accumulator</c><00:08:41.479><c> so</c><00:08:42.479><c> intuitively</c><00:08:43.440><c> what</c>

00:08:43.790 --> 00:08:43.800 align:start position:0%
succinct accumulator so intuitively what
 

00:08:43.800 --> 00:08:46.389 align:start position:0%
succinct accumulator so intuitively what
this<00:08:44.039><c> means</c><00:08:44.399><c> is</c><00:08:44.820><c> that</c><00:08:45.120><c> we</c><00:08:45.420><c> want</c><00:08:45.600><c> a</c><00:08:45.899><c> verifier</c>

00:08:46.389 --> 00:08:46.399 align:start position:0%
this means is that we want a verifier
 

00:08:46.399 --> 00:08:50.210 align:start position:0%
this means is that we want a verifier
with<00:08:47.399><c> this</c><00:08:47.760><c> shape</c><00:08:48.320><c> that</c><00:08:49.320><c> they</c><00:08:49.560><c> have</c><00:08:49.800><c> a</c>

00:08:50.210 --> 00:08:50.220 align:start position:0%
with this shape that they have a
 

00:08:50.220 --> 00:08:53.150 align:start position:0%
with this shape that they have a
succinct<00:08:50.700><c> check</c><00:08:51.060><c> a</c><00:08:51.540><c> cheap</c><00:08:51.720><c> check</c><00:08:52.040><c> and</c><00:08:53.040><c> then</c>

00:08:53.150 --> 00:08:53.160 align:start position:0%
succinct check a cheap check and then
 

00:08:53.160 --> 00:08:55.250 align:start position:0%
succinct check a cheap check and then
separately<00:08:53.700><c> they</c><00:08:54.060><c> have</c><00:08:54.180><c> an</c><00:08:54.480><c> expensive</c><00:08:54.959><c> check</c>

00:08:55.250 --> 00:08:55.260 align:start position:0%
separately they have an expensive check
 

00:08:55.260 --> 00:08:59.150 align:start position:0%
separately they have an expensive check
and<00:08:56.220><c> so</c><00:08:56.459><c> here</c><00:08:56.880><c> we</c><00:08:57.300><c> can</c><00:08:57.480><c> instantiate</c><00:08:58.200><c> an</c><00:08:58.680><c> atomic</c>

00:08:59.150 --> 00:08:59.160 align:start position:0%
and so here we can instantiate an atomic
 

00:08:59.160 --> 00:09:01.970 align:start position:0%
and so here we can instantiate an atomic
accumulator<00:08:59.720><c> and</c><00:09:00.720><c> at</c><00:09:00.959><c> each</c><00:09:01.200><c> recursive</c><00:09:01.740><c> step</c>

00:09:01.970 --> 00:09:01.980 align:start position:0%
accumulator and at each recursive step
 

00:09:01.980 --> 00:09:05.410 align:start position:0%
accumulator and at each recursive step
we<00:09:02.580><c> only</c><00:09:02.820><c> perform</c><00:09:03.420><c> the</c><00:09:03.839><c> succinct</c><00:09:04.320><c> checks</c>

00:09:05.410 --> 00:09:05.420 align:start position:0%
we only perform the succinct checks
 

00:09:05.420 --> 00:09:10.009 align:start position:0%
we only perform the succinct checks
and<00:09:06.420><c> we</c><00:09:07.260><c> accumulate</c><00:09:08.120><c> the</c><00:09:09.120><c> expensive</c><00:09:09.720><c> check</c>

00:09:10.009 --> 00:09:10.019 align:start position:0%
and we accumulate the expensive check
 

00:09:10.019 --> 00:09:14.030 align:start position:0%
and we accumulate the expensive check
and<00:09:10.680><c> delay</c><00:09:11.339><c> checking</c><00:09:12.060><c> it</c><00:09:12.240><c> until</c><00:09:12.839><c> the</c><00:09:13.320><c> end</c><00:09:13.560><c> of</c><00:09:13.800><c> a</c>

00:09:14.030 --> 00:09:14.040 align:start position:0%
and delay checking it until the end of a
 

00:09:14.040 --> 00:09:16.970 align:start position:0%
and delay checking it until the end of a
long<00:09:14.459><c> batch</c><00:09:14.820><c> of</c><00:09:15.060><c> proofs</c><00:09:15.420><c> and</c><00:09:16.380><c> doing</c><00:09:16.680><c> this</c>

00:09:16.970 --> 00:09:16.980 align:start position:0%
long batch of proofs and doing this
 

00:09:16.980 --> 00:09:20.269 align:start position:0%
long batch of proofs and doing this
gives<00:09:17.399><c> us</c><00:09:18.140><c> amortization</c><00:09:19.140><c> of</c><00:09:19.680><c> the</c><00:09:19.800><c> expensive</c>

00:09:20.269 --> 00:09:20.279 align:start position:0%
gives us amortization of the expensive
 

00:09:20.279 --> 00:09:25.070 align:start position:0%
gives us amortization of the expensive
check<00:09:20.779><c> and</c><00:09:21.779><c> finally</c><00:09:22.260><c> if</c><00:09:22.740><c> we</c><00:09:22.920><c> relax</c><00:09:23.339><c> even</c><00:09:24.060><c> more</c>

00:09:25.070 --> 00:09:25.080 align:start position:0%
check and finally if we relax even more
 

00:09:25.080 --> 00:09:28.310 align:start position:0%
check and finally if we relax even more
um<00:09:25.200><c> we</c><00:09:25.920><c> don't</c><00:09:26.040><c> even</c><00:09:26.339><c> require</c><00:09:26.839><c> a</c><00:09:27.839><c> succinct</c>

00:09:28.310 --> 00:09:28.320 align:start position:0%
um we don't even require a succinct
 

00:09:28.320 --> 00:09:30.410 align:start position:0%
um we don't even require a succinct
accumulator<00:09:28.800><c> well</c><00:09:29.339><c> now</c><00:09:29.700><c> we're</c><00:09:29.940><c> just</c><00:09:30.120><c> happy</c>

00:09:30.410 --> 00:09:30.420 align:start position:0%
accumulator well now we're just happy
 

00:09:30.420 --> 00:09:34.190 align:start position:0%
accumulator well now we're just happy
with<00:09:30.959><c> a</c><00:09:31.500><c> succinct</c><00:09:31.920><c> public</c><00:09:32.279><c> accumulator</c><00:09:33.200><c> and</c>

00:09:34.190 --> 00:09:34.200 align:start position:0%
with a succinct public accumulator and
 

00:09:34.200 --> 00:09:37.210 align:start position:0%
with a succinct public accumulator and
the<00:09:34.740><c> idea</c><00:09:35.040><c> behind</c><00:09:35.580><c> this</c><00:09:35.940><c> split</c><00:09:36.480><c> accumulation</c>

00:09:37.210 --> 00:09:37.220 align:start position:0%
the idea behind this split accumulation
 

00:09:37.220 --> 00:09:40.190 align:start position:0%
the idea behind this split accumulation
is<00:09:38.220><c> simply</c><00:09:38.519><c> that</c><00:09:39.000><c> you</c><00:09:39.600><c> split</c><00:09:40.019><c> your</c>

00:09:40.190 --> 00:09:40.200 align:start position:0%
is simply that you split your
 

00:09:40.200 --> 00:09:42.110 align:start position:0%
is simply that you split your
accumulator<00:09:40.620><c> into</c><00:09:41.040><c> a</c><00:09:41.339><c> public</c><00:09:41.459><c> and</c><00:09:41.760><c> private</c>

00:09:42.110 --> 00:09:42.120 align:start position:0%
accumulator into a public and private
 

00:09:42.120 --> 00:09:46.009 align:start position:0%
accumulator into a public and private
part<00:09:42.380><c> and</c><00:09:43.380><c> the</c><00:09:43.560><c> public</c><00:09:43.680><c> part</c><00:09:44.100><c> is</c><00:09:44.519><c> short</c><00:09:45.060><c> and</c>

00:09:46.009 --> 00:09:46.019 align:start position:0%
part and the public part is short and
 

00:09:46.019 --> 00:09:48.230 align:start position:0%
part and the public part is short and
this<00:09:46.320><c> is</c><00:09:46.440><c> what</c><00:09:46.800><c> we</c><00:09:46.980><c> accumulate</c><00:09:47.640><c> at</c><00:09:48.000><c> each</c>

00:09:48.230 --> 00:09:48.240 align:start position:0%
this is what we accumulate at each
 

00:09:48.240 --> 00:09:50.150 align:start position:0%
this is what we accumulate at each
recursive<00:09:48.779><c> step</c>

00:09:50.150 --> 00:09:50.160 align:start position:0%
recursive step
 

00:09:50.160 --> 00:09:52.310 align:start position:0%
recursive step
um<00:09:50.220><c> where</c><00:09:50.880><c> whereas</c><00:09:51.420><c> we</c><00:09:51.660><c> delay</c><00:09:52.019><c> the</c>

00:09:52.310 --> 00:09:52.320 align:start position:0%
um where whereas we delay the
 

00:09:52.320 --> 00:09:54.590 align:start position:0%
um where whereas we delay the
verification<00:09:52.860><c> of</c><00:09:53.279><c> the</c><00:09:53.519><c> private</c><00:09:53.880><c> part</c><00:09:54.180><c> of</c><00:09:54.480><c> the</c>

00:09:54.590 --> 00:09:54.600 align:start position:0%
verification of the private part of the
 

00:09:54.600 --> 00:09:58.670 align:start position:0%
verification of the private part of the
accumulator<00:09:55.220><c> until</c><00:09:56.220><c> the</c><00:09:56.459><c> very</c><00:09:56.640><c> end</c><00:09:56.899><c> so</c><00:09:57.899><c> let's</c>

00:09:58.670 --> 00:09:58.680 align:start position:0%
accumulator until the very end so let's
 

00:09:58.680 --> 00:10:02.150 align:start position:0%
accumulator until the very end so let's
go<00:09:59.040><c> through</c><00:09:59.779><c> these</c><00:10:00.779><c> constructions</c><00:10:01.560><c> at</c><00:10:01.920><c> a</c><00:10:02.040><c> high</c>

00:10:02.150 --> 00:10:02.160 align:start position:0%
go through these constructions at a high
 

00:10:02.160 --> 00:10:04.970 align:start position:0%
go through these constructions at a high
level<00:10:02.339><c> one</c><00:10:03.180><c> by</c><00:10:03.360><c> one</c><00:10:03.540><c> just</c><00:10:04.080><c> so</c><00:10:04.260><c> you</c><00:10:04.500><c> can</c><00:10:04.620><c> see</c><00:10:04.800><c> the</c>

00:10:04.970 --> 00:10:04.980 align:start position:0%
level one by one just so you can see the
 

00:10:04.980 --> 00:10:08.930 align:start position:0%
level one by one just so you can see the
shape<00:10:05.399><c> of</c><00:10:05.880><c> it</c><00:10:06.120><c> so</c><00:10:07.019><c> probably</c><00:10:07.500><c> the</c><00:10:08.339><c> cleanest</c>

00:10:08.930 --> 00:10:08.940 align:start position:0%
shape of it so probably the cleanest
 

00:10:08.940 --> 00:10:12.650 align:start position:0%
shape of it so probably the cleanest
shape<00:10:09.600><c> is</c><00:10:10.380><c> the</c><00:10:11.220><c> the</c><00:10:11.459><c> cleanest</c><00:10:11.940><c> shape</c><00:10:12.180><c> would</c><00:10:12.480><c> be</c>

00:10:12.650 --> 00:10:12.660 align:start position:0%
shape is the the cleanest shape would be
 

00:10:12.660 --> 00:10:14.690 align:start position:0%
shape is the the cleanest shape would be
full<00:10:13.019><c> recursion</c><00:10:13.680><c> so</c>

00:10:14.690 --> 00:10:14.700 align:start position:0%
full recursion so
 

00:10:14.700 --> 00:10:17.449 align:start position:0%
full recursion so
over<00:10:15.240><c> here</c><00:10:15.480><c> we</c><00:10:15.839><c> start</c><00:10:16.080><c> with</c><00:10:16.560><c> our</c><00:10:16.920><c> application</c>

00:10:17.449 --> 00:10:17.459 align:start position:0%
over here we start with our application
 

00:10:17.459 --> 00:10:21.350 align:start position:0%
over here we start with our application
circuit<00:10:18.260><c> and</c><00:10:19.260><c> it's</c><00:10:19.620><c> f</c>

00:10:21.350 --> 00:10:21.360 align:start position:0%
circuit and it's f
 

00:10:21.360 --> 00:10:22.070 align:start position:0%
circuit and it's f
um

00:10:22.070 --> 00:10:22.080 align:start position:0%
um
 

00:10:22.080 --> 00:10:26.449 align:start position:0%
um
F<00:10:22.620><c> of</c><00:10:23.240><c> w-i-z-i</c><00:10:24.240><c> gives</c><00:10:25.140><c> you</c><00:10:25.380><c> z</c><00:10:25.680><c> i</c><00:10:25.920><c> plus</c><00:10:26.100><c> one</c>

00:10:26.449 --> 00:10:26.459 align:start position:0%
F of w-i-z-i gives you z i plus one
 

00:10:26.459 --> 00:10:29.389 align:start position:0%
F of w-i-z-i gives you z i plus one
right<00:10:27.240><c> it's</c><00:10:27.540><c> a</c><00:10:27.779><c> normal</c><00:10:28.019><c> relation</c>

00:10:29.389 --> 00:10:29.399 align:start position:0%
right it's a normal relation
 

00:10:29.399 --> 00:10:32.870 align:start position:0%
right it's a normal relation
now<00:10:29.880><c> we</c><00:10:30.360><c> bundle</c><00:10:30.779><c> that</c><00:10:31.019><c> together</c><00:10:31.440><c> with</c><00:10:32.279><c> a</c>

00:10:32.870 --> 00:10:32.880 align:start position:0%
now we bundle that together with a
 

00:10:32.880 --> 00:10:34.550 align:start position:0%
now we bundle that together with a
recursive<00:10:33.420><c> verifier</c>

00:10:34.550 --> 00:10:34.560 align:start position:0%
recursive verifier
 

00:10:34.560 --> 00:10:35.930 align:start position:0%
recursive verifier
and

00:10:35.930 --> 00:10:35.940 align:start position:0%
and
 

00:10:35.940 --> 00:10:38.870 align:start position:0%
and
um<00:10:36.300><c> basically</c><00:10:37.260><c> this</c><00:10:37.680><c> recursive</c><00:10:38.220><c> verifier</c>

00:10:38.870 --> 00:10:38.880 align:start position:0%
um basically this recursive verifier
 

00:10:38.880 --> 00:10:41.930 align:start position:0%
um basically this recursive verifier
takes<00:10:39.420><c> in</c><00:10:39.720><c> a</c><00:10:40.680><c> proof</c><00:10:41.040><c> instance</c><00:10:41.459><c> that</c><00:10:41.760><c> was</c>

00:10:41.930 --> 00:10:41.940 align:start position:0%
takes in a proof instance that was
 

00:10:41.940 --> 00:10:44.750 align:start position:0%
takes in a proof instance that was
produced<00:10:42.480><c> by</c><00:10:42.899><c> the</c><00:10:43.200><c> previous</c><00:10:43.320><c> instance</c><00:10:44.040><c> of</c><00:10:44.579><c> the</c>

00:10:44.750 --> 00:10:44.760 align:start position:0%
produced by the previous instance of the
 

00:10:44.760 --> 00:10:47.690 align:start position:0%
produced by the previous instance of the
recursive<00:10:45.300><c> circuit</c><00:10:45.779><c> and</c><00:10:46.620><c> so</c><00:10:46.800><c> if</c><00:10:47.100><c> if</c><00:10:47.220><c> we</c><00:10:47.459><c> look</c>

00:10:47.690 --> 00:10:47.700 align:start position:0%
recursive circuit and so if if we look
 

00:10:47.700 --> 00:10:50.870 align:start position:0%
recursive circuit and so if if we look
forward<00:10:48.200><c> we</c><00:10:49.200><c> we</c><00:10:49.440><c> need</c><00:10:49.680><c> to</c><00:10:49.860><c> generate</c><00:10:50.339><c> a</c><00:10:50.579><c> proof</c>

00:10:50.870 --> 00:10:50.880 align:start position:0%
forward we we need to generate a proof
 

00:10:50.880 --> 00:10:53.870 align:start position:0%
forward we we need to generate a proof
of<00:10:51.060><c> the</c><00:10:51.360><c> whole</c><00:10:51.660><c> recursive</c><00:10:52.320><c> circuit</c><00:10:52.800><c> in</c><00:10:53.760><c> order</c>

00:10:53.870 --> 00:10:53.880 align:start position:0%
of the whole recursive circuit in order
 

00:10:53.880 --> 00:10:57.110 align:start position:0%
of the whole recursive circuit in order
to<00:10:54.240><c> input</c><00:10:54.600><c> to</c><00:10:54.899><c> the</c><00:10:55.079><c> next</c><00:10:55.200><c> recursive</c><00:10:55.860><c> instance</c>

00:10:57.110 --> 00:10:57.120 align:start position:0%
to input to the next recursive instance
 

00:10:57.120 --> 00:10:59.569 align:start position:0%
to input to the next recursive instance
so<00:10:57.660><c> in</c><00:10:57.779><c> this</c><00:10:58.019><c> way</c><00:10:58.200><c> we're</c><00:10:58.500><c> chaining</c><00:10:59.040><c> recursive</c>

00:10:59.569 --> 00:10:59.579 align:start position:0%
so in this way we're chaining recursive
 

00:10:59.579 --> 00:11:01.970 align:start position:0%
so in this way we're chaining recursive
circuits<00:11:00.060><c> and</c><00:11:00.480><c> at</c><00:11:00.660><c> each</c><00:11:00.779><c> step</c><00:11:00.959><c> we</c><00:11:01.320><c> are</c><00:11:01.500><c> fully</c>

00:11:01.970 --> 00:11:01.980 align:start position:0%
circuits and at each step we are fully
 

00:11:01.980 --> 00:11:05.690 align:start position:0%
circuits and at each step we are fully
verifying<00:11:02.700><c> the</c><00:11:03.480><c> previous</c><00:11:03.600><c> instance</c><00:11:04.399><c> and</c><00:11:05.399><c> when</c>

00:11:05.690 --> 00:11:05.700 align:start position:0%
verifying the previous instance and when
 

00:11:05.700 --> 00:11:09.470 align:start position:0%
verifying the previous instance and when
we<00:11:05.820><c> get</c><00:11:06.060><c> to</c><00:11:06.360><c> the</c><00:11:06.720><c> final</c><00:11:07.100><c> verifier</c><00:11:08.240><c> we</c><00:11:09.240><c> no</c>

00:11:09.470 --> 00:11:09.480 align:start position:0%
we get to the final verifier we no
 

00:11:09.480 --> 00:11:11.870 align:start position:0%
we get to the final verifier we no
longer<00:11:09.720><c> need</c><00:11:10.079><c> to</c><00:11:10.380><c> bundle</c><00:11:11.220><c> it</c><00:11:11.399><c> with</c><00:11:11.700><c> the</c>

00:11:11.870 --> 00:11:11.880 align:start position:0%
longer need to bundle it with the
 

00:11:11.880 --> 00:11:14.150 align:start position:0%
longer need to bundle it with the
applications<00:11:12.300><c> are</c><00:11:12.720><c> getting</c><00:11:12.899><c> here</c><00:11:13.380><c> we</c><00:11:14.040><c> can</c>

00:11:14.150 --> 00:11:14.160 align:start position:0%
applications are getting here we can
 

00:11:14.160 --> 00:11:17.210 align:start position:0%
applications are getting here we can
just<00:11:14.399><c> perform</c><00:11:14.760><c> a</c><00:11:15.720><c> final</c><00:11:15.959><c> verification</c><00:11:16.740><c> of</c><00:11:17.100><c> the</c>

00:11:17.210 --> 00:11:17.220 align:start position:0%
just perform a final verification of the
 

00:11:17.220 --> 00:11:19.730 align:start position:0%
just perform a final verification of the
proof<00:11:17.640><c> outside</c><00:11:18.120><c> the</c><00:11:18.420><c> circuit</c><00:11:18.839><c> so</c><00:11:19.380><c> this</c><00:11:19.620><c> is</c>

00:11:19.730 --> 00:11:19.740 align:start position:0%
proof outside the circuit so this is
 

00:11:19.740 --> 00:11:24.050 align:start position:0%
proof outside the circuit so this is
full<00:11:19.920><c> recursion</c><00:11:21.000><c> is</c><00:11:21.660><c> is</c><00:11:22.019><c> the</c><00:11:22.260><c> cleanest</c><00:11:22.560><c> API</c>

00:11:24.050 --> 00:11:24.060 align:start position:0%
full recursion is is the cleanest API
 

00:11:24.060 --> 00:11:24.650 align:start position:0%
full recursion is is the cleanest API
um

00:11:24.650 --> 00:11:24.660 align:start position:0%
um
 

00:11:24.660 --> 00:11:27.769 align:start position:0%
um
now<00:11:25.320><c> we're</c><00:11:25.620><c> gonna</c><00:11:25.800><c> get</c><00:11:26.100><c> slightly</c><00:11:26.700><c> more</c><00:11:27.360><c> messy</c>

00:11:27.769 --> 00:11:27.779 align:start position:0%
now we're gonna get slightly more messy
 

00:11:27.779 --> 00:11:31.610 align:start position:0%
now we're gonna get slightly more messy
and<00:11:28.140><c> we're</c><00:11:28.320><c> gonna</c><00:11:28.500><c> relax</c><00:11:28.980><c> our</c><00:11:29.880><c> requirements</c>

00:11:31.610 --> 00:11:31.620 align:start position:0%
and we're gonna relax our requirements
 

00:11:31.620 --> 00:11:34.730 align:start position:0%
and we're gonna relax our requirements
um<00:11:31.740><c> to</c><00:11:31.980><c> get</c><00:11:32.160><c> an</c><00:11:32.519><c> atomic</c><00:11:33.000><c> accumulation</c><00:11:33.660><c> scheme</c>

00:11:34.730 --> 00:11:34.740 align:start position:0%
um to get an atomic accumulation scheme
 

00:11:34.740 --> 00:11:38.750 align:start position:0%
um to get an atomic accumulation scheme
so<00:11:35.339><c> now</c><00:11:36.060><c> if</c><00:11:36.420><c> you</c><00:11:36.600><c> recall</c><00:11:37.140><c> here</c><00:11:37.620><c> an</c><00:11:38.100><c> atomic</c>

00:11:38.750 --> 00:11:38.760 align:start position:0%
so now if you recall here an atomic
 

00:11:38.760 --> 00:11:42.290 align:start position:0%
so now if you recall here an atomic
accumulation<00:11:39.480><c> scheme</c><00:11:40.079><c> our</c><00:11:40.860><c> verifier</c><00:11:41.519><c> is</c><00:11:42.060><c> not</c>

00:11:42.290 --> 00:11:42.300 align:start position:0%
accumulation scheme our verifier is not
 

00:11:42.300 --> 00:11:46.670 align:start position:0%
accumulation scheme our verifier is not
sublinear<00:11:43.079><c> so</c><00:11:43.920><c> in</c><00:11:44.339><c> fact</c><00:11:44.519><c> the</c><00:11:45.420><c> verifier</c><00:11:46.019><c> inside</c>

00:11:46.670 --> 00:11:46.680 align:start position:0%
sublinear so in fact the verifier inside
 

00:11:46.680 --> 00:11:49.790 align:start position:0%
sublinear so in fact the verifier inside
the<00:11:47.220><c> recursive</c><00:11:47.700><c> circuit</c><00:11:48.120><c> is</c><00:11:49.079><c> just</c><00:11:49.440><c> the</c>

00:11:49.790 --> 00:11:49.800 align:start position:0%
the recursive circuit is just the
 

00:11:49.800 --> 00:11:52.550 align:start position:0%
the recursive circuit is just the
accumulation<00:11:50.459><c> verifier</c><00:11:51.120><c> and</c><00:11:51.779><c> it</c><00:11:52.380><c> only</c>

00:11:52.550 --> 00:11:52.560 align:start position:0%
accumulation verifier and it only
 

00:11:52.560 --> 00:11:55.550 align:start position:0%
accumulation verifier and it only
concerns<00:11:53.160><c> itself</c><00:11:53.459><c> with</c><00:11:53.760><c> the</c><00:11:54.060><c> succinct</c><00:11:54.720><c> checks</c>

00:11:55.550 --> 00:11:55.560 align:start position:0%
concerns itself with the succinct checks
 

00:11:55.560 --> 00:11:58.490 align:start position:0%
concerns itself with the succinct checks
of<00:11:56.100><c> the</c><00:11:56.279><c> verifier</c>

00:11:58.490 --> 00:11:58.500 align:start position:0%
of the verifier
 

00:11:58.500 --> 00:12:00.530 align:start position:0%
of the verifier
um and<00:11:59.160><c> the</c><00:11:59.339><c> expensive</c><00:11:59.880><c> check</c><00:12:00.180><c> is</c>

00:12:00.530 --> 00:12:00.540 align:start position:0%
um and the expensive check is
 

00:12:00.540 --> 00:12:04.690 align:start position:0%
um and the expensive check is
accumulated<00:12:01.140><c> and</c><00:12:01.740><c> deferred</c><00:12:02.940><c> um</c><00:12:03.000><c> at</c><00:12:03.959><c> each</c><00:12:04.200><c> step</c>

00:12:04.690 --> 00:12:04.700 align:start position:0%
accumulated and deferred um at each step
 

00:12:04.700 --> 00:12:08.210 align:start position:0%
accumulated and deferred um at each step
so<00:12:05.700><c> here</c><00:12:06.600><c> we</c><00:12:06.839><c> are</c><00:12:06.959><c> chaining</c><00:12:07.500><c> basically</c>

00:12:08.210 --> 00:12:08.220 align:start position:0%
so here we are chaining basically
 

00:12:08.220 --> 00:12:12.230 align:start position:0%
so here we are chaining basically
instances<00:12:08.940><c> of</c><00:12:09.540><c> proofs</c><00:12:10.019><c> and</c><00:12:10.380><c> accumulators</c>

00:12:12.230 --> 00:12:12.240 align:start position:0%
instances of proofs and accumulators
 

00:12:12.240 --> 00:12:14.170 align:start position:0%
instances of proofs and accumulators
um<00:12:12.360><c> and</c><00:12:12.600><c> at</c><00:12:12.779><c> each</c><00:12:12.959><c> step</c><00:12:13.200><c> we're</c><00:12:13.560><c> just</c>

00:12:14.170 --> 00:12:14.180 align:start position:0%
um and at each step we're just
 

00:12:14.180 --> 00:12:16.910 align:start position:0%
um and at each step we're just
procrastinating<00:12:15.180><c> on</c><00:12:16.140><c> performing</c><00:12:16.800><c> the</c>

00:12:16.910 --> 00:12:16.920 align:start position:0%
procrastinating on performing the
 

00:12:16.920 --> 00:12:19.610 align:start position:0%
procrastinating on performing the
expensive<00:12:17.459><c> check</c><00:12:17.700><c> well</c><00:12:18.360><c> until</c><00:12:18.720><c> we're</c><00:12:19.200><c> finally</c>

00:12:19.610 --> 00:12:19.620 align:start position:0%
expensive check well until we're finally
 

00:12:19.620 --> 00:12:22.430 align:start position:0%
expensive check well until we're finally
satisfied<00:12:20.220><c> at</c><00:12:20.700><c> the</c><00:12:20.880><c> end</c><00:12:21.120><c> of</c><00:12:21.480><c> a</c><00:12:21.720><c> long</c><00:12:21.899><c> chain</c><00:12:22.200><c> of</c>

00:12:22.430 --> 00:12:22.440 align:start position:0%
satisfied at the end of a long chain of
 

00:12:22.440 --> 00:12:23.410 align:start position:0%
satisfied at the end of a long chain of
proofs

00:12:23.410 --> 00:12:23.420 align:start position:0%
proofs
 

00:12:23.420 --> 00:12:27.310 align:start position:0%
proofs
we<00:12:24.420><c> perform</c><00:12:24.660><c> the</c><00:12:25.200><c> final</c><00:12:25.640><c> decider</c>

00:12:27.310 --> 00:12:27.320 align:start position:0%
we perform the final decider
 

00:12:27.320 --> 00:12:31.069 align:start position:0%
we perform the final decider
sub-particle<00:12:28.320><c> that</c><00:12:29.399><c> finally</c><00:12:30.300><c> bites</c><00:12:30.899><c> the</c>

00:12:31.069 --> 00:12:31.079 align:start position:0%
sub-particle that finally bites the
 

00:12:31.079 --> 00:12:34.150 align:start position:0%
sub-particle that finally bites the
bullet<00:12:31.440><c> and</c><00:12:31.740><c> does</c><00:12:31.920><c> the</c><00:12:32.160><c> linear</c><00:12:32.519><c> time</c><00:12:32.640><c> check</c>

00:12:34.150 --> 00:12:34.160 align:start position:0%
bullet and does the linear time check
 

00:12:34.160 --> 00:12:37.370 align:start position:0%
bullet and does the linear time check
but<00:12:35.160><c> at</c><00:12:36.060><c> this</c><00:12:36.180><c> point</c><00:12:36.360><c> we</c><00:12:36.600><c> can</c><00:12:36.720><c> do</c><00:12:36.899><c> it</c><00:12:37.019><c> outside</c>

00:12:37.370 --> 00:12:37.380 align:start position:0%
but at this point we can do it outside
 

00:12:37.380 --> 00:12:40.610 align:start position:0%
but at this point we can do it outside
the<00:12:37.860><c> circuit</c><00:12:38.279><c> and</c><00:12:38.940><c> at</c><00:12:39.240><c> this</c><00:12:39.360><c> point</c><00:12:39.660><c> the</c><00:12:40.440><c> cost</c>

00:12:40.610 --> 00:12:40.620 align:start position:0%
the circuit and at this point the cost
 

00:12:40.620 --> 00:12:42.889 align:start position:0%
the circuit and at this point the cost
of<00:12:40.860><c> the</c><00:12:41.040><c> linear</c><00:12:41.339><c> time</c><00:12:41.579><c> check</c><00:12:41.820><c> is</c><00:12:42.240><c> amortized</c>

00:12:42.889 --> 00:12:42.899 align:start position:0%
of the linear time check is amortized
 

00:12:42.899 --> 00:12:46.069 align:start position:0%
of the linear time check is amortized
across<00:12:43.500><c> a</c><00:12:43.980><c> big</c><00:12:44.100><c> batch</c><00:12:44.279><c> of</c><00:12:44.519><c> proofs</c><00:12:44.940><c> now</c><00:12:45.660><c> from</c>

00:12:46.069 --> 00:12:46.079 align:start position:0%
across a big batch of proofs now from
 

00:12:46.079 --> 00:12:49.910 align:start position:0%
across a big batch of proofs now from
here<00:12:46.380><c> to</c><00:12:46.740><c> Atomic</c><00:12:47.339><c> accumulation</c><00:12:48.000><c> is</c><00:12:48.620><c> just</c><00:12:49.620><c> a</c>

00:12:49.910 --> 00:12:49.920 align:start position:0%
here to Atomic accumulation is just a
 

00:12:49.920 --> 00:12:52.970 align:start position:0%
here to Atomic accumulation is just a
small<00:12:50.100><c> step</c><00:12:50.459><c> so</c><00:12:51.300><c> it's</c><00:12:51.839><c> just</c><00:12:52.139><c> splitting</c><00:12:52.800><c> up</c>

00:12:52.970 --> 00:12:52.980 align:start position:0%
small step so it's just splitting up
 

00:12:52.980 --> 00:12:55.629 align:start position:0%
small step so it's just splitting up
your<00:12:53.339><c> accumulator</c><00:12:53.820><c> and</c><00:12:54.720><c> your</c><00:12:54.899><c> proof</c><00:12:55.200><c> instance</c>

00:12:55.629 --> 00:12:55.639 align:start position:0%
your accumulator and your proof instance
 

00:12:55.639 --> 00:12:59.389 align:start position:0%
your accumulator and your proof instance
into<00:12:56.639><c> a</c><00:12:57.180><c> public</c><00:12:57.300><c> and</c><00:12:57.540><c> private</c><00:12:57.839><c> part</c><00:12:58.160><c> and</c><00:12:59.160><c> now</c>

00:12:59.389 --> 00:12:59.399 align:start position:0%
into a public and private part and now
 

00:12:59.399 --> 00:13:02.150 align:start position:0%
into a public and private part and now
the<00:12:59.820><c> verifier</c><00:13:00.480><c> the</c><00:13:00.839><c> recursive</c><00:13:01.200><c> verifier</c><00:13:01.740><c> gets</c>

00:13:02.150 --> 00:13:02.160 align:start position:0%
the verifier the recursive verifier gets
 

00:13:02.160 --> 00:13:05.030 align:start position:0%
the verifier the recursive verifier gets
even<00:13:02.399><c> smaller</c><00:13:03.000><c> and</c><00:13:03.600><c> it</c><00:13:03.779><c> concerns</c><00:13:04.200><c> itself</c><00:13:04.500><c> only</c>

00:13:05.030 --> 00:13:05.040 align:start position:0%
even smaller and it concerns itself only
 

00:13:05.040 --> 00:13:07.370 align:start position:0%
even smaller and it concerns itself only
with<00:13:05.399><c> accumulating</c><00:13:06.000><c> the</c><00:13:06.300><c> instances</c><00:13:06.839><c> the</c>

00:13:07.370 --> 00:13:07.380 align:start position:0%
with accumulating the instances the
 

00:13:07.380 --> 00:13:11.269 align:start position:0%
with accumulating the instances the
public<00:13:07.620><c> parts</c><00:13:08.300><c> and</c><00:13:09.300><c> it</c><00:13:09.480><c> does</c><00:13:09.720><c> not</c><00:13:09.959><c> perform</c><00:13:10.279><c> it</c>

00:13:11.269 --> 00:13:11.279 align:start position:0%
public parts and it does not perform it
 

00:13:11.279 --> 00:13:13.190 align:start position:0%
public parts and it does not perform it
does<00:13:11.399><c> not</c><00:13:11.579><c> have</c><00:13:11.760><c> access</c><00:13:12.060><c> to</c><00:13:12.600><c> the</c><00:13:12.839><c> private</c>

00:13:13.190 --> 00:13:13.200 align:start position:0%
does not have access to the private
 

00:13:13.200 --> 00:13:16.370 align:start position:0%
does not have access to the private
parts<00:13:13.440><c> of</c><00:13:14.040><c> the</c><00:13:14.220><c> accumulator</c><00:13:14.720><c> and</c><00:13:15.720><c> rather</c><00:13:15.959><c> it</c>

00:13:16.370 --> 00:13:16.380 align:start position:0%
parts of the accumulator and rather it
 

00:13:16.380 --> 00:13:18.530 align:start position:0%
parts of the accumulator and rather it
relies<00:13:16.740><c> on</c><00:13:16.920><c> the</c><00:13:17.100><c> Pervert</c><00:13:17.579><c> to</c><00:13:17.760><c> provide</c><00:13:18.120><c> some</c>

00:13:18.530 --> 00:13:18.540 align:start position:0%
relies on the Pervert to provide some
 

00:13:18.540 --> 00:13:21.190 align:start position:0%
relies on the Pervert to provide some
commitments<00:13:19.260><c> to</c><00:13:19.500><c> the</c><00:13:19.620><c> private</c><00:13:19.980><c> parts</c>

00:13:21.190 --> 00:13:21.200 align:start position:0%
commitments to the private parts
 

00:13:21.200 --> 00:13:23.990 align:start position:0%
commitments to the private parts
which<00:13:22.200><c> it</c><00:13:22.380><c> then</c><00:13:22.560><c> performs</c><00:13:23.160><c> accumulator</c>

00:13:23.990 --> 00:13:24.000 align:start position:0%
which it then performs accumulator
 

00:13:24.000 --> 00:13:25.790 align:start position:0%
which it then performs accumulator
checks<00:13:24.660><c> on</c>

00:13:25.790 --> 00:13:25.800 align:start position:0%
checks on
 

00:13:25.800 --> 00:13:29.449 align:start position:0%
checks on
so<00:13:26.700><c> a</c><00:13:27.360><c> lot</c><00:13:27.540><c> of</c><00:13:27.720><c> these</c><00:13:28.500><c> constructions</c><00:13:29.160><c> I've</c>

00:13:29.449 --> 00:13:29.459 align:start position:0%
so a lot of these constructions I've
 

00:13:29.459 --> 00:13:33.530 align:start position:0%
so a lot of these constructions I've
described<00:13:30.060><c> are</c><00:13:31.139><c> really</c><00:13:31.740><c> cutting</c><00:13:32.220><c> edge</c><00:13:32.540><c> and</c>

00:13:33.530 --> 00:13:33.540 align:start position:0%
described are really cutting edge and
 

00:13:33.540 --> 00:13:35.930 align:start position:0%
described are really cutting edge and
they<00:13:34.260><c> come</c><00:13:34.440><c> from</c><00:13:34.620><c> a</c><00:13:34.800><c> feature</c><00:13:35.220><c> of</c><00:13:35.579><c> our</c><00:13:35.760><c> modern</c>

00:13:35.930 --> 00:13:35.940 align:start position:0%
they come from a feature of our modern
 

00:13:35.940 --> 00:13:39.230 align:start position:0%
they come from a feature of our modern
proof<00:13:36.360><c> systems</c><00:13:36.839><c> that</c><00:13:37.200><c> are</c><00:13:37.920><c> very</c><00:13:38.279><c> modular</c><00:13:38.760><c> in</c>

00:13:39.230 --> 00:13:39.240 align:start position:0%
proof systems that are very modular in
 

00:13:39.240 --> 00:13:41.629 align:start position:0%
proof systems that are very modular in
design<00:13:39.420><c> and</c><00:13:40.320><c> as</c><00:13:40.560><c> we</c><00:13:40.740><c> get</c><00:13:41.040><c> a</c><00:13:41.459><c> better</c>

00:13:41.629 --> 00:13:41.639 align:start position:0%
design and as we get a better
 

00:13:41.639 --> 00:13:44.990 align:start position:0%
design and as we get a better
understanding<00:13:42.480><c> of</c><00:13:42.899><c> the</c><00:13:43.200><c> building</c><00:13:43.440><c> blocks</c><00:13:44.040><c> and</c>

00:13:44.990 --> 00:13:45.000 align:start position:0%
understanding of the building blocks and
 

00:13:45.000 --> 00:13:47.329 align:start position:0%
understanding of the building blocks and
the<00:13:45.180><c> components</c><00:13:45.660><c> of</c><00:13:45.839><c> our</c><00:13:45.959><c> proof</c><00:13:46.260><c> systems</c><00:13:46.680><c> this</c>

00:13:47.329 --> 00:13:47.339 align:start position:0%
the components of our proof systems this
 

00:13:47.339 --> 00:13:49.870 align:start position:0%
the components of our proof systems this
lets<00:13:47.760><c> us</c><00:13:47.880><c> customize</c><00:13:48.540><c> our</c><00:13:48.899><c> proving</c><00:13:49.320><c> Stacks</c>

00:13:49.870 --> 00:13:49.880 align:start position:0%
lets us customize our proving Stacks
 

00:13:49.880 --> 00:13:53.509 align:start position:0%
lets us customize our proving Stacks
with<00:13:50.880><c> a</c><00:13:51.180><c> lot</c><00:13:51.300><c> finer</c><00:13:51.839><c> granularity</c><00:13:52.620><c> and</c>

00:13:53.509 --> 00:13:53.519 align:start position:0%
with a lot finer granularity and
 

00:13:53.519 --> 00:13:57.290 align:start position:0%
with a lot finer granularity and
recursion<00:13:54.360><c> as</c><00:13:54.779><c> we</c><00:13:55.079><c> saw</c><00:13:55.380><c> also</c><00:13:56.220><c> allows</c><00:13:56.700><c> us</c><00:13:56.820><c> to</c>

00:13:57.290 --> 00:13:57.300 align:start position:0%
recursion as we saw also allows us to
 

00:13:57.300 --> 00:13:59.810 align:start position:0%
recursion as we saw also allows us to
compose<00:13:57.779><c> proof</c><00:13:58.260><c> systems</c><00:13:58.740><c> and</c><00:13:59.339><c> to</c><00:13:59.519><c> get</c><00:13:59.639><c> the</c>

00:13:59.810 --> 00:13:59.820 align:start position:0%
compose proof systems and to get the
 

00:13:59.820 --> 00:14:03.889 align:start position:0%
compose proof systems and to get the
best<00:14:00.000><c> of</c><00:14:00.240><c> both</c><00:14:00.420><c> worlds</c><00:14:00.959><c> in</c><00:14:01.440><c> many</c><00:14:01.620><c> cases</c><00:14:01.980><c> so</c>

00:14:03.889 --> 00:14:03.899 align:start position:0%
best of both worlds in many cases so
 

00:14:03.899 --> 00:14:07.310 align:start position:0%
best of both worlds in many cases so
here's<00:14:04.680><c> an</c><00:14:04.800><c> example</c><00:14:05.220><c> of</c><00:14:05.940><c> a</c><00:14:06.899><c> modular</c>

00:14:07.310 --> 00:14:07.320 align:start position:0%
here's an example of a modular
 

00:14:07.320 --> 00:14:10.370 align:start position:0%
here's an example of a modular
conception<00:14:08.160><c> of</c><00:14:08.700><c> a</c><00:14:08.820><c> proof</c><00:14:09.180><c> system</c><00:14:09.300><c> so</c><00:14:09.839><c> I</c><00:14:10.139><c> work</c>

00:14:10.370 --> 00:14:10.380 align:start position:0%
conception of a proof system so I work
 

00:14:10.380 --> 00:14:14.750 align:start position:0%
conception of a proof system so I work
on<00:14:10.940><c> the</c><00:14:11.940><c> proof</c><00:14:12.240><c> system</c><00:14:12.360><c> Halo</c><00:14:12.899><c> 2.</c><00:14:13.320><c> and</c><00:14:14.160><c> I</c><00:14:14.519><c> think</c>

00:14:14.750 --> 00:14:14.760 align:start position:0%
on the proof system Halo 2. and I think
 

00:14:14.760 --> 00:14:17.810 align:start position:0%
on the proof system Halo 2. and I think
of<00:14:14.880><c> Halo</c><00:14:15.300><c> 2</c><00:14:15.620><c> in</c><00:14:16.620><c> terms</c><00:14:16.860><c> of</c><00:14:16.980><c> these</c><00:14:17.579><c> four</c>

00:14:17.810 --> 00:14:17.820 align:start position:0%
of Halo 2 in terms of these four
 

00:14:17.820 --> 00:14:21.170 align:start position:0%
of Halo 2 in terms of these four
components<00:14:18.480><c> so</c><00:14:19.260><c> at</c><00:14:19.680><c> the</c><00:14:19.860><c> very</c><00:14:20.100><c> front</c><00:14:20.399><c> end</c><00:14:20.639><c> is</c>

00:14:21.170 --> 00:14:21.180 align:start position:0%
components so at the very front end is
 

00:14:21.180 --> 00:14:23.750 align:start position:0%
components so at the very front end is
where<00:14:21.600><c> you're</c><00:14:22.500><c> interfacing</c><00:14:23.160><c> with</c><00:14:23.519><c> your</c>

00:14:23.750 --> 00:14:23.760 align:start position:0%
where you're interfacing with your
 

00:14:23.760 --> 00:14:25.910 align:start position:0%
where you're interfacing with your
business<00:14:24.000><c> logic</c><00:14:24.540><c> so</c><00:14:24.839><c> you</c><00:14:25.079><c> take</c><00:14:25.260><c> a</c><00:14:25.560><c> relation</c>

00:14:25.910 --> 00:14:25.920 align:start position:0%
business logic so you take a relation
 

00:14:25.920 --> 00:14:29.449 align:start position:0%
business logic so you take a relation
and<00:14:26.820><c> you</c><00:14:27.000><c> arithmetize</c><00:14:27.600><c> it</c><00:14:27.839><c> into</c>

00:14:29.449 --> 00:14:29.459 align:start position:0%
and you arithmetize it into
 

00:14:29.459 --> 00:14:29.990 align:start position:0%
and you arithmetize it into
um

00:14:29.990 --> 00:14:30.000 align:start position:0%
um
 

00:14:30.000 --> 00:14:32.930 align:start position:0%
um
so<00:14:30.660><c> in</c><00:14:30.839><c> in</c><00:14:31.019><c> Halo</c><00:14:31.440><c> 2's</c><00:14:31.800><c> case</c><00:14:31.920><c> we</c><00:14:32.220><c> encode</c><00:14:32.579><c> our</c>

00:14:32.930 --> 00:14:32.940 align:start position:0%
so in in Halo 2's case we encode our
 

00:14:32.940 --> 00:14:35.629 align:start position:0%
so in in Halo 2's case we encode our
values<00:14:33.360><c> in</c><00:14:33.720><c> the</c><00:14:33.839><c> LaGrange</c><00:14:34.260><c> basis</c><00:14:34.680><c> and</c><00:14:35.399><c> we</c>

00:14:35.629 --> 00:14:35.639 align:start position:0%
values in the LaGrange basis and we
 

00:14:35.639 --> 00:14:38.389 align:start position:0%
values in the LaGrange basis and we
encode<00:14:36.000><c> constraints</c><00:14:36.660><c> on</c><00:14:36.959><c> these</c><00:14:37.200><c> values</c><00:14:37.620><c> as</c>

00:14:38.389 --> 00:14:38.399 align:start position:0%
encode constraints on these values as
 

00:14:38.399 --> 00:14:40.670 align:start position:0%
encode constraints on these values as
polynomial<00:14:39.060><c> identities</c>

00:14:40.670 --> 00:14:40.680 align:start position:0%
polynomial identities
 

00:14:40.680 --> 00:14:43.550 align:start position:0%
polynomial identities
we<00:14:41.399><c> then</c><00:14:41.639><c> input</c><00:14:42.060><c> these</c><00:14:42.420><c> polynomials</c><00:14:43.079><c> into</c>

00:14:43.550 --> 00:14:43.560 align:start position:0%
we then input these polynomials into
 

00:14:43.560 --> 00:14:47.269 align:start position:0%
we then input these polynomials into
this<00:14:44.279><c> information</c><00:14:44.779><c> theoretic</c><00:14:46.279><c> polynomial</c>

00:14:47.269 --> 00:14:47.279 align:start position:0%
this information theoretic polynomial
 

00:14:47.279 --> 00:14:48.490 align:start position:0%
this information theoretic polynomial
IOP

00:14:48.490 --> 00:14:48.500 align:start position:0%
IOP
 

00:14:48.500 --> 00:14:51.650 align:start position:0%
IOP
that<00:14:49.500><c> basically</c><00:14:49.980><c> checks</c><00:14:50.940><c> the</c><00:14:51.180><c> correctness</c>

00:14:51.650 --> 00:14:51.660 align:start position:0%
that basically checks the correctness
 

00:14:51.660 --> 00:14:55.189 align:start position:0%
that basically checks the correctness
and<00:14:52.019><c> the</c><00:14:52.199><c> consistency</c><00:14:52.880><c> of</c><00:14:53.880><c> the</c><00:14:54.660><c> polynomials</c>

00:14:55.189 --> 00:14:55.199 align:start position:0%
and the consistency of the polynomials
 

00:14:55.199 --> 00:14:57.889 align:start position:0%
and the consistency of the polynomials
encoding<00:14:55.620><c> our</c><00:14:55.800><c> circuit</c><00:14:56.220><c> and</c><00:14:56.820><c> then</c><00:14:56.940><c> we</c><00:14:57.360><c> realize</c>

00:14:57.889 --> 00:14:57.899 align:start position:0%
encoding our circuit and then we realize
 

00:14:57.899 --> 00:15:01.670 align:start position:0%
encoding our circuit and then we realize
this<00:14:58.940><c> polynomial</c><00:14:59.940><c> IOP</c><00:15:00.420><c> using</c><00:15:01.139><c> a</c>

00:15:01.670 --> 00:15:01.680 align:start position:0%
this polynomial IOP using a
 

00:15:01.680 --> 00:15:04.430 align:start position:0%
this polynomial IOP using a
cryptographic<00:15:02.399><c> compiler</c><00:15:03.060><c> so</c><00:15:03.839><c> in</c><00:15:04.079><c> this</c><00:15:04.260><c> case</c>

00:15:04.430 --> 00:15:04.440 align:start position:0%
cryptographic compiler so in this case
 

00:15:04.440 --> 00:15:07.069 align:start position:0%
cryptographic compiler so in this case
it's<00:15:04.740><c> the</c><00:15:04.980><c> inner</c><00:15:05.279><c> product</c><00:15:05.399><c> argument</c><00:15:05.940><c> that</c><00:15:06.839><c> and</c>

00:15:07.069 --> 00:15:07.079 align:start position:0%
it's the inner product argument that and
 

00:15:07.079 --> 00:15:09.230 align:start position:0%
it's the inner product argument that and
the<00:15:07.260><c> Fiat</c><00:15:07.560><c> Shamir</c><00:15:07.980><c> transform</c><00:15:08.519><c> that</c><00:15:08.880><c> allows</c>

00:15:09.230 --> 00:15:09.240 align:start position:0%
the Fiat Shamir transform that allows
 

00:15:09.240 --> 00:15:12.530 align:start position:0%
the Fiat Shamir transform that allows
the<00:15:09.420><c> proverb</c><00:15:10.040><c> to</c><00:15:11.040><c> Define</c><00:15:11.459><c> their</c><00:15:12.000><c> interaction</c>

00:15:12.530 --> 00:15:12.540 align:start position:0%
the proverb to Define their interaction
 

00:15:12.540 --> 00:15:15.710 align:start position:0%
the proverb to Define their interaction
with<00:15:13.320><c> the</c><00:15:13.500><c> verifier</c><00:15:14.040><c> and</c><00:15:14.760><c> at</c><00:15:14.940><c> the</c><00:15:15.120><c> very</c><00:15:15.300><c> end</c><00:15:15.540><c> of</c>

00:15:15.710 --> 00:15:15.720 align:start position:0%
with the verifier and at the very end of
 

00:15:15.720 --> 00:15:18.350 align:start position:0%
with the verifier and at the very end of
it<00:15:15.899><c> Halo</c><00:15:16.680><c> 2</c><00:15:16.800><c> is</c><00:15:17.160><c> a</c><00:15:17.459><c> recursive</c><00:15:17.880><c> group</c><00:15:18.060><c> system</c>

00:15:18.350 --> 00:15:18.360 align:start position:0%
it Halo 2 is a recursive group system
 

00:15:18.360 --> 00:15:22.430 align:start position:0%
it Halo 2 is a recursive group system
and<00:15:18.899><c> we</c><00:15:19.560><c> can</c><00:15:19.800><c> in</c><00:15:20.040><c> fact</c><00:15:20.300><c> instantiate</c><00:15:21.300><c> an</c><00:15:21.959><c> atomic</c>

00:15:22.430 --> 00:15:22.440 align:start position:0%
and we can in fact instantiate an atomic
 

00:15:22.440 --> 00:15:24.590 align:start position:0%
and we can in fact instantiate an atomic
accumulator<00:15:22.980><c> over</c><00:15:23.880><c> the</c><00:15:24.180><c> inner</c><00:15:24.480><c> product</c>

00:15:24.590 --> 00:15:24.600 align:start position:0%
accumulator over the inner product
 

00:15:24.600 --> 00:15:28.189 align:start position:0%
accumulator over the inner product
argument<00:15:25.560><c> so</c><00:15:26.160><c> these</c><00:15:26.579><c> are</c><00:15:26.699><c> the</c><00:15:27.000><c> four</c>

00:15:28.189 --> 00:15:28.199 align:start position:0%
argument so these are the four
 

00:15:28.199 --> 00:15:31.730 align:start position:0%
argument so these are the four
sort<00:15:28.860><c> of</c><00:15:28.920><c> modular</c><00:15:29.519><c> pieces</c><00:15:30.480><c> of</c><00:15:30.899><c> modern</c><00:15:31.079><c> proof</c>

00:15:31.730 --> 00:15:31.740 align:start position:0%
sort of modular pieces of modern proof
 

00:15:31.740 --> 00:15:35.689 align:start position:0%
sort of modular pieces of modern proof
systems<00:15:32.160><c> that</c><00:15:32.760><c> I</c><00:15:32.940><c> think</c><00:15:33.120><c> of</c><00:15:33.560><c> now</c><00:15:34.560><c> we</c><00:15:35.339><c> can</c><00:15:35.519><c> do</c>

00:15:35.689 --> 00:15:35.699 align:start position:0%
systems that I think of now we can do
 

00:15:35.699 --> 00:15:37.250 align:start position:0%
systems that I think of now we can do
pretty<00:15:36.000><c> funny</c><00:15:36.300><c> things</c>

00:15:37.250 --> 00:15:37.260 align:start position:0%
pretty funny things
 

00:15:37.260 --> 00:15:40.790 align:start position:0%
pretty funny things
um composing<00:15:38.040><c> these</c><00:15:38.579><c> pieces</c><00:15:38.940><c> so</c><00:15:39.600><c> I've</c><00:15:40.320><c> set</c><00:15:40.560><c> up</c>

00:15:40.790 --> 00:15:40.800 align:start position:0%
um composing these pieces so I've set up
 

00:15:40.800 --> 00:15:43.189 align:start position:0%
um composing these pieces so I've set up
three<00:15:41.459><c> cases</c>

00:15:43.189 --> 00:15:43.199 align:start position:0%
three cases
 

00:15:43.199 --> 00:15:43.790 align:start position:0%
three cases
um

00:15:43.790 --> 00:15:43.800 align:start position:0%
um
 

00:15:43.800 --> 00:15:46.069 align:start position:0%
um
so<00:15:44.279><c> the</c><00:15:44.519><c> first</c><00:15:44.760><c> one</c><00:15:45.000><c> is</c><00:15:45.420><c> information</c>

00:15:46.069 --> 00:15:46.079 align:start position:0%
so the first one is information
 

00:15:46.079 --> 00:15:48.189 align:start position:0%
so the first one is information
theoretic<00:15:46.860><c> compilers</c>

00:15:48.189 --> 00:15:48.199 align:start position:0%
theoretic compilers
 

00:15:48.199 --> 00:15:51.889 align:start position:0%
theoretic compilers
and<00:15:49.199><c> an</c><00:15:49.380><c> example</c><00:15:49.740><c> of</c><00:15:49.980><c> this</c><00:15:50.279><c> is</c><00:15:50.699><c> MPC</c><00:15:51.480><c> in</c><00:15:51.720><c> the</c>

00:15:51.889 --> 00:15:51.899 align:start position:0%
and an example of this is MPC in the
 

00:15:51.899 --> 00:15:52.730 align:start position:0%
and an example of this is MPC in the
head

00:15:52.730 --> 00:15:52.740 align:start position:0%
head
 

00:15:52.740 --> 00:15:56.629 align:start position:0%
head
um<00:15:53.279><c> what</c><00:15:54.060><c> this</c><00:15:54.240><c> does</c><00:15:54.480><c> is</c><00:15:54.899><c> it</c><00:15:55.680><c> converts</c><00:15:56.220><c> one</c>

00:15:56.629 --> 00:15:56.639 align:start position:0%
um what this does is it converts one
 

00:15:56.639 --> 00:15:59.090 align:start position:0%
um what this does is it converts one
information<00:15:56.940><c> theoretic</c><00:15:57.839><c> protocol</c><00:15:58.500><c> to</c>

00:15:59.090 --> 00:15:59.100 align:start position:0%
information theoretic protocol to
 

00:15:59.100 --> 00:16:01.629 align:start position:0%
information theoretic protocol to
another<00:15:59.339><c> one</c><00:15:59.639><c> and</c><00:16:00.060><c> in</c><00:16:00.360><c> this</c><00:16:00.540><c> case</c>

00:16:01.629 --> 00:16:01.639 align:start position:0%
another one and in this case
 

00:16:01.639 --> 00:16:05.629 align:start position:0%
another one and in this case
it's<00:16:02.639><c> the</c><00:16:02.880><c> proverb</c><00:16:03.480><c> sort</c><00:16:04.380><c> of</c><00:16:04.500><c> pretending</c><00:16:05.160><c> to</c>

00:16:05.629 --> 00:16:05.639 align:start position:0%
it's the proverb sort of pretending to
 

00:16:05.639 --> 00:16:08.329 align:start position:0%
it's the proverb sort of pretending to
run<00:16:05.940><c> a</c><00:16:06.600><c> multi-party</c><00:16:07.079><c> computation</c>

00:16:08.329 --> 00:16:08.339 align:start position:0%
run a multi-party computation
 

00:16:08.339 --> 00:16:10.670 align:start position:0%
run a multi-party computation
in<00:16:09.000><c> in</c><00:16:09.240><c> her</c><00:16:09.480><c> head</c>

00:16:10.670 --> 00:16:10.680 align:start position:0%
in in her head
 

00:16:10.680 --> 00:16:13.009 align:start position:0%
in in her head
um<00:16:10.800><c> so</c><00:16:11.339><c> she's</c><00:16:11.820><c> really</c><00:16:12.180><c> simulating</c><00:16:12.660><c> the</c>

00:16:13.009 --> 00:16:13.019 align:start position:0%
um so she's really simulating the
 

00:16:13.019 --> 00:16:16.550 align:start position:0%
um so she's really simulating the
multiple<00:16:13.440><c> views</c><00:16:13.920><c> in</c><00:16:14.579><c> an</c><00:16:14.760><c> NPC</c><00:16:15.240><c> and</c><00:16:16.139><c> committing</c>

00:16:16.550 --> 00:16:16.560 align:start position:0%
multiple views in an NPC and committing
 

00:16:16.560 --> 00:16:19.910 align:start position:0%
multiple views in an NPC and committing
to<00:16:16.740><c> those</c><00:16:16.920><c> views</c><00:16:17.339><c> and</c><00:16:17.519><c> now</c><00:16:18.180><c> the</c><00:16:18.420><c> verifier</c><00:16:19.079><c> is</c>

00:16:19.910 --> 00:16:19.920 align:start position:0%
to those views and now the verifier is
 

00:16:19.920 --> 00:16:22.610 align:start position:0%
to those views and now the verifier is
only<00:16:20.160><c> checking</c><00:16:20.760><c> the</c><00:16:21.360><c> outer</c><00:16:21.660><c> protocol</c><00:16:22.019><c> being</c>

00:16:22.610 --> 00:16:22.620 align:start position:0%
only checking the outer protocol being
 

00:16:22.620 --> 00:16:25.189 align:start position:0%
only checking the outer protocol being
the<00:16:22.920><c> NPC</c><00:16:23.339><c> instead</c><00:16:24.180><c> of</c><00:16:24.300><c> checking</c><00:16:24.720><c> the</c><00:16:24.899><c> inner</c>

00:16:25.189 --> 00:16:25.199 align:start position:0%
the NPC instead of checking the inner
 

00:16:25.199 --> 00:16:28.250 align:start position:0%
the NPC instead of checking the inner
protocol<00:16:25.560><c> which</c><00:16:26.100><c> is</c><00:16:26.220><c> the</c><00:16:26.399><c> ZK</c><00:16:26.699><c> proof</c><00:16:27.060><c> so</c><00:16:27.839><c> this</c>

00:16:28.250 --> 00:16:28.260 align:start position:0%
protocol which is the ZK proof so this
 

00:16:28.260 --> 00:16:31.670 align:start position:0%
protocol which is the ZK proof so this
is<00:16:28.440><c> one</c><00:16:28.800><c> very</c><00:16:29.279><c> interesting</c><00:16:29.699><c> way</c><00:16:30.380><c> to</c><00:16:31.380><c> compose</c>

00:16:31.670 --> 00:16:31.680 align:start position:0%
is one very interesting way to compose
 

00:16:31.680 --> 00:16:34.970 align:start position:0%
is one very interesting way to compose
proof<00:16:32.160><c> systems</c><00:16:32.779><c> another</c><00:16:33.779><c> way</c><00:16:34.079><c> that</c><00:16:34.440><c> we've</c>

00:16:34.970 --> 00:16:34.980 align:start position:0%
proof systems another way that we've
 

00:16:34.980 --> 00:16:38.569 align:start position:0%
proof systems another way that we've
seen<00:16:35.339><c> before</c><00:16:35.820><c> in</c><00:16:36.540><c> this</c><00:16:36.720><c> presentation</c><00:16:37.079><c> is</c><00:16:37.740><c> more</c>

00:16:38.569 --> 00:16:38.579 align:start position:0%
seen before in this presentation is more
 

00:16:38.579 --> 00:16:42.290 align:start position:0%
seen before in this presentation is more
or<00:16:38.699><c> less</c><00:16:38.820><c> just</c><00:16:39.300><c> implementing</c><00:16:40.160><c> verifier</c><00:16:41.160><c> X</c><00:16:41.820><c> and</c>

00:16:42.290 --> 00:16:42.300 align:start position:0%
or less just implementing verifier X and
 

00:16:42.300 --> 00:16:45.889 align:start position:0%
or less just implementing verifier X and
prover<00:16:42.660><c> Y</c><00:16:43.079><c> and</c><00:16:43.980><c> you</c><00:16:44.160><c> would</c><00:16:44.339><c> do</c><00:16:44.579><c> this</c><00:16:44.699><c> also</c><00:16:45.240><c> for</c>

00:16:45.889 --> 00:16:45.899 align:start position:0%
prover Y and you would do this also for
 

00:16:45.899 --> 00:16:49.490 align:start position:0%
prover Y and you would do this also for
efficiency<00:16:46.440><c> gains</c><00:16:47.360><c> and</c><00:16:48.779><c> um</c>

00:16:49.490 --> 00:16:49.500 align:start position:0%
efficiency gains and um
 

00:16:49.500 --> 00:16:52.850 align:start position:0%
efficiency gains and um
sort<00:16:50.040><c> of</c><00:16:50.220><c> the</c><00:16:50.579><c> last</c><00:16:50.759><c> Clause</c><00:16:51.240><c> of</c><00:16:52.079><c> composition</c>

00:16:52.850 --> 00:16:52.860 align:start position:0%
sort of the last Clause of composition
 

00:16:52.860 --> 00:16:55.550 align:start position:0%
sort of the last Clause of composition
that<00:16:53.220><c> I</c><00:16:53.399><c> came</c><00:16:53.519><c> up</c><00:16:53.699><c> with</c><00:16:53.940><c> was</c>

00:16:55.550 --> 00:16:55.560 align:start position:0%
that I came up with was
 

00:16:55.560 --> 00:16:57.730 align:start position:0%
that I came up with was
really<00:16:56.339><c> just</c><00:16:56.639><c> thinking</c><00:16:57.000><c> up</c><00:16:57.180><c> better</c>

00:16:57.730 --> 00:16:57.740 align:start position:0%
really just thinking up better
 

00:16:57.740 --> 00:17:00.710 align:start position:0%
really just thinking up better
cryptographic<00:16:58.740><c> compilers</c><00:16:59.399><c> so</c>

00:17:00.710 --> 00:17:00.720 align:start position:0%
cryptographic compilers so
 

00:17:00.720 --> 00:17:03.650 align:start position:0%
cryptographic compilers so
there's<00:17:01.259><c> this</c><00:17:01.560><c> recent</c><00:17:01.920><c> paper</c><00:17:02.160><c> by</c><00:17:02.759><c> a</c><00:17:03.300><c> group</c><00:17:03.420><c> at</c>

00:17:03.650 --> 00:17:03.660 align:start position:0%
there's this recent paper by a group at
 

00:17:03.660 --> 00:17:05.510 align:start position:0%
there's this recent paper by a group at
consensus

00:17:05.510 --> 00:17:05.520 align:start position:0%
consensus
 

00:17:05.520 --> 00:17:09.069 align:start position:0%
consensus
um<00:17:05.579><c> and</c><00:17:06.120><c> they</c><00:17:06.419><c> they</c><00:17:06.780><c> took</c><00:17:07.199><c> this</c><00:17:07.439><c> protocol</c><00:17:07.880><c> gkr</c>

00:17:09.069 --> 00:17:09.079 align:start position:0%
um and they they took this protocol gkr
 

00:17:09.079 --> 00:17:13.189 align:start position:0%
um and they they took this protocol gkr
that's<00:17:10.079><c> highly</c><00:17:10.919><c> optimized</c><00:17:11.520><c> for</c><00:17:12.199><c> repetitive</c>

00:17:13.189 --> 00:17:13.199 align:start position:0%
that's highly optimized for repetitive
 

00:17:13.199 --> 00:17:15.470 align:start position:0%
that's highly optimized for repetitive
computations<00:17:13.679><c> like</c><00:17:13.980><c> hash</c><00:17:14.280><c> functions</c>

00:17:15.470 --> 00:17:15.480 align:start position:0%
computations like hash functions
 

00:17:15.480 --> 00:17:18.890 align:start position:0%
computations like hash functions
now<00:17:16.020><c> but</c><00:17:16.380><c> the</c><00:17:16.559><c> problem</c><00:17:16.740><c> of</c><00:17:16.980><c> gkr</c><00:17:17.579><c> is</c><00:17:18.480><c> that</c><00:17:18.720><c> it</c>

00:17:18.890 --> 00:17:18.900 align:start position:0%
now but the problem of gkr is that it
 

00:17:18.900 --> 00:17:21.710 align:start position:0%
now but the problem of gkr is that it
has<00:17:19.079><c> a</c><00:17:19.260><c> slow</c><00:17:19.439><c> verifier</c><00:17:20.040><c> and</c>

00:17:21.710 --> 00:17:21.720 align:start position:0%
has a slow verifier and
 

00:17:21.720 --> 00:17:22.730 align:start position:0%
has a slow verifier and
um

00:17:22.730 --> 00:17:22.740 align:start position:0%
um
 

00:17:22.740 --> 00:17:26.329 align:start position:0%
um
so<00:17:23.640><c> and</c><00:17:24.120><c> it</c><00:17:24.299><c> also</c><00:17:24.540><c> uses</c><00:17:24.900><c> the</c><00:17:25.079><c> Fiat</c><00:17:25.439><c> Shamir</c><00:17:25.919><c> hash</c>

00:17:26.329 --> 00:17:26.339 align:start position:0%
so and it also uses the Fiat Shamir hash
 

00:17:26.339 --> 00:17:28.789 align:start position:0%
so and it also uses the Fiat Shamir hash
as<00:17:26.640><c> a</c><00:17:26.819><c> cryptographic</c><00:17:27.419><c> compiler</c><00:17:27.959><c> and</c><00:17:28.679><c> this</c>

00:17:28.789 --> 00:17:28.799 align:start position:0%
as a cryptographic compiler and this
 

00:17:28.799 --> 00:17:31.490 align:start position:0%
as a cryptographic compiler and this
makes<00:17:29.040><c> it</c><00:17:29.280><c> very</c><00:17:29.520><c> inefficient</c><00:17:30.240><c> in</c><00:17:31.080><c> the</c><00:17:31.200><c> context</c>

00:17:31.490 --> 00:17:31.500 align:start position:0%
makes it very inefficient in the context
 

00:17:31.500 --> 00:17:33.169 align:start position:0%
makes it very inefficient in the context
of<00:17:31.860><c> recursion</c>

00:17:33.169 --> 00:17:33.179 align:start position:0%
of recursion
 

00:17:33.179 --> 00:17:35.930 align:start position:0%
of recursion
so<00:17:33.660><c> what</c><00:17:33.900><c> the</c><00:17:34.080><c> team</c><00:17:34.260><c> at</c><00:17:34.440><c> consensus</c><00:17:34.980><c> did</c><00:17:35.280><c> was</c>

00:17:35.930 --> 00:17:35.940 align:start position:0%
so what the team at consensus did was
 

00:17:35.940 --> 00:17:38.049 align:start position:0%
so what the team at consensus did was
they<00:17:36.179><c> came</c><00:17:36.419><c> up</c><00:17:36.539><c> with</c><00:17:36.840><c> their</c><00:17:37.200><c> own</c>

00:17:38.049 --> 00:17:38.059 align:start position:0%
they came up with their own
 

00:17:38.059 --> 00:17:41.270 align:start position:0%
they came up with their own
cryptographic<00:17:39.059><c> compiler</c><00:17:39.720><c> that</c><00:17:40.620><c> was</c><00:17:40.860><c> custom</c>

00:17:41.270 --> 00:17:41.280 align:start position:0%
cryptographic compiler that was custom
 

00:17:41.280 --> 00:17:44.930 align:start position:0%
cryptographic compiler that was custom
made<00:17:41.640><c> for</c><00:17:42.240><c> their</c><00:17:43.140><c> target</c><00:17:43.380><c> proof</c><00:17:43.919><c> system</c><00:17:44.100><c> and</c>

00:17:44.930 --> 00:17:44.940 align:start position:0%
made for their target proof system and
 

00:17:44.940 --> 00:17:47.270 align:start position:0%
made for their target proof system and
the<00:17:45.179><c> target</c><00:17:45.360><c> proof</c><00:17:45.840><c> system</c><00:17:46.020><c> here</c><00:17:46.320><c> is</c><00:17:46.679><c> like</c><00:17:46.980><c> a</c>

00:17:47.270 --> 00:17:47.280 align:start position:0%
the target proof system here is like a
 

00:17:47.280 --> 00:17:48.490 align:start position:0%
the target proof system here is like a
growth<00:17:47.580><c> 16</c>

00:17:48.490 --> 00:17:48.500 align:start position:0%
growth 16
 

00:17:48.500 --> 00:17:50.289 align:start position:0%
growth 16
r1cs

00:17:50.289 --> 00:17:50.299 align:start position:0%
r1cs
 

00:17:50.299 --> 00:17:52.669 align:start position:0%
r1cs
per<00:17:51.299><c> system</c>

00:17:52.669 --> 00:17:52.679 align:start position:0%
per system
 

00:17:52.679 --> 00:17:56.450 align:start position:0%
per system
and<00:17:53.580><c> so</c><00:17:53.820><c> really</c><00:17:54.419><c> like</c><00:17:55.020><c> that's</c><00:17:55.440><c> going</c><00:17:55.799><c> in</c><00:17:56.340><c> the</c>

00:17:56.450 --> 00:17:56.460 align:start position:0%
and so really like that's going in the
 

00:17:56.460 --> 00:17:58.610 align:start position:0%
and so really like that's going in the
middle<00:17:56.580><c> and</c><00:17:57.179><c> making</c><00:17:57.480><c> changes</c><00:17:58.080><c> like</c>

00:17:58.610 --> 00:17:58.620 align:start position:0%
middle and making changes like
 

00:17:58.620 --> 00:18:00.650 align:start position:0%
middle and making changes like
customizing<00:17:59.220><c> proof</c><00:17:59.580><c> systems</c><00:17:59.880><c> at</c><00:18:00.240><c> a</c><00:18:00.360><c> very</c><00:18:00.480><c> low</c>

00:18:00.650 --> 00:18:00.660 align:start position:0%
customizing proof systems at a very low
 

00:18:00.660 --> 00:18:02.210 align:start position:0%
customizing proof systems at a very low
level

00:18:02.210 --> 00:18:02.220 align:start position:0%
level
 

00:18:02.220 --> 00:18:07.130 align:start position:0%
level
um<00:18:02.340><c> for</c><00:18:02.580><c> efficiency</c><00:18:03.200><c> and</c><00:18:04.200><c> yeah</c><00:18:05.039><c> I</c><00:18:05.700><c> think</c><00:18:06.140><c> this</c>

00:18:07.130 --> 00:18:07.140 align:start position:0%
um for efficiency and yeah I think this
 

00:18:07.140 --> 00:18:09.409 align:start position:0%
um for efficiency and yeah I think this
this<00:18:07.440><c> leads</c><00:18:07.980><c> me</c><00:18:08.100><c> to</c><00:18:08.280><c> ask</c>

00:18:09.409 --> 00:18:09.419 align:start position:0%
this leads me to ask
 

00:18:09.419 --> 00:18:12.409 align:start position:0%
this leads me to ask
um<00:18:09.539><c> whether</c><00:18:10.320><c> or</c><00:18:10.500><c> not</c><00:18:10.620><c> we</c><00:18:11.520><c> can</c><00:18:11.700><c> systematize</c>

00:18:12.409 --> 00:18:12.419 align:start position:0%
um whether or not we can systematize
 

00:18:12.419 --> 00:18:15.350 align:start position:0%
um whether or not we can systematize
this<00:18:13.080><c> process</c><00:18:13.380><c> and</c>

00:18:15.350 --> 00:18:15.360 align:start position:0%
this process and
 

00:18:15.360 --> 00:18:17.750 align:start position:0%
this process and
um whether<00:18:16.020><c> or</c><00:18:16.200><c> not</c><00:18:16.200><c> we</c><00:18:16.740><c> can</c>

00:18:17.750 --> 00:18:17.760 align:start position:0%
um whether or not we can
 

00:18:17.760 --> 00:18:19.610 align:start position:0%
um whether or not we can
I<00:18:18.419><c> don't</c><00:18:18.539><c> know</c>

00:18:19.610 --> 00:18:19.620 align:start position:0%
I don't know
 

00:18:19.620 --> 00:18:23.930 align:start position:0%
I don't know
um<00:18:19.740><c> explore</c><00:18:20.640><c> this</c><00:18:21.240><c> optimization</c><00:18:21.960><c> space</c><00:18:22.460><c> in</c><00:18:23.460><c> a</c>

00:18:23.930 --> 00:18:23.940 align:start position:0%
um explore this optimization space in a
 

00:18:23.940 --> 00:18:25.850 align:start position:0%
um explore this optimization space in a
well-defined<00:18:24.720><c> way</c>

00:18:25.850 --> 00:18:25.860 align:start position:0%
well-defined way
 

00:18:25.860 --> 00:18:27.409 align:start position:0%
well-defined way
so

00:18:27.409 --> 00:18:27.419 align:start position:0%
so
 

00:18:27.419 --> 00:18:30.049 align:start position:0%
so
you<00:18:28.020><c> can</c><00:18:28.080><c> think</c><00:18:28.260><c> of</c><00:18:28.500><c> this</c><00:18:28.919><c> as</c><00:18:29.160><c> kind</c><00:18:29.460><c> of</c><00:18:29.580><c> a</c><00:18:29.820><c> call</c>

00:18:30.049 --> 00:18:30.059 align:start position:0%
you can think of this as kind of a call
 

00:18:30.059 --> 00:18:31.270 align:start position:0%
you can think of this as kind of a call
to<00:18:30.299><c> action</c>

00:18:31.270 --> 00:18:31.280 align:start position:0%
to action
 

00:18:31.280 --> 00:18:35.029 align:start position:0%
to action
so<00:18:32.280><c> I</c><00:18:32.700><c> think</c><00:18:32.820><c> there's</c><00:18:33.600><c> certain</c>

00:18:35.029 --> 00:18:35.039 align:start position:0%
so I think there's certain
 

00:18:35.039 --> 00:18:38.930 align:start position:0%
so I think there's certain
nice<00:18:35.880><c> to</c><00:18:36.179><c> have</c><00:18:36.360><c> certain</c><00:18:36.660><c> to</c><00:18:37.020><c> Do's</c><00:18:37.440><c> that</c><00:18:38.160><c> all</c>

00:18:38.930 --> 00:18:38.940 align:start position:0%
nice to have certain to Do's that all
 

00:18:38.940 --> 00:18:40.730 align:start position:0%
nice to have certain to Do's that all
proof<00:18:39.360><c> system</c><00:18:39.480><c> implementers</c><00:18:40.140><c> would</c><00:18:40.500><c> really</c>

00:18:40.730 --> 00:18:40.740 align:start position:0%
proof system implementers would really
 

00:18:40.740 --> 00:18:44.210 align:start position:0%
proof system implementers would really
like<00:18:40.980><c> the</c><00:18:41.880><c> first</c><00:18:42.120><c> being</c><00:18:42.480><c> good</c><00:18:43.380><c> benchmarks</c>

00:18:44.210 --> 00:18:44.220 align:start position:0%
like the first being good benchmarks
 

00:18:44.220 --> 00:18:47.270 align:start position:0%
like the first being good benchmarks
Fair<00:18:44.880><c> benchmarks</c><00:18:45.720><c> of</c><00:18:46.559><c> heavily</c><00:18:47.100><c> used</c>

00:18:47.270 --> 00:18:47.280 align:start position:0%
Fair benchmarks of heavily used
 

00:18:47.280 --> 00:18:51.289 align:start position:0%
Fair benchmarks of heavily used
Primitives<00:18:47.940><c> like</c><00:18:48.419><c> hash</c><00:18:48.900><c> functions</c><00:18:49.700><c> like</c><00:18:50.700><c> big</c>

00:18:51.289 --> 00:18:51.299 align:start position:0%
Primitives like hash functions like big
 

00:18:51.299 --> 00:18:54.110 align:start position:0%
Primitives like hash functions like big
and<00:18:51.539><c> arithmetic</c><00:18:52.320><c> so</c><00:18:52.980><c> benchmarks</c><00:18:53.640><c> of</c><00:18:53.820><c> these</c>

00:18:54.110 --> 00:18:54.120 align:start position:0%
and arithmetic so benchmarks of these
 

00:18:54.120 --> 00:18:56.210 align:start position:0%
and arithmetic so benchmarks of these
Primitives<00:18:54.620><c> across</c><00:18:55.620><c> different</c><00:18:55.740><c> proving</c>

00:18:56.210 --> 00:18:56.220 align:start position:0%
Primitives across different proving
 

00:18:56.220 --> 00:18:59.930 align:start position:0%
Primitives across different proving
stacks<00:18:56.640><c> and</c><00:18:57.299><c> the</c><00:18:58.200><c> second</c><00:18:58.320><c> would</c><00:18:58.799><c> be</c><00:18:59.039><c> it's</c><00:18:59.760><c> a</c>

00:18:59.930 --> 00:18:59.940 align:start position:0%
stacks and the second would be it's a
 

00:18:59.940 --> 00:19:03.350 align:start position:0%
stacks and the second would be it's a
kind<00:19:00.120><c> of</c><00:19:00.240><c> a</c><00:19:00.480><c> meta</c><00:19:00.960><c> requirement</c><00:19:01.820><c> is</c><00:19:02.820><c> to</c><00:19:03.120><c> think</c>

00:19:03.350 --> 00:19:03.360 align:start position:0%
kind of a meta requirement is to think
 

00:19:03.360 --> 00:19:06.350 align:start position:0%
kind of a meta requirement is to think
of<00:19:03.660><c> like</c><00:19:04.080><c> what</c><00:19:04.620><c> metrics</c><00:19:05.340><c> we're</c><00:19:05.640><c> interested</c><00:19:06.179><c> in</c>

00:19:06.350 --> 00:19:06.360 align:start position:0%
of like what metrics we're interested in
 

00:19:06.360 --> 00:19:09.110 align:start position:0%
of like what metrics we're interested in
for<00:19:07.140><c> example</c><00:19:07.380><c> efficiency</c><00:19:08.039><c> for</c><00:19:08.400><c> example</c><00:19:08.700><c> proof</c>

00:19:09.110 --> 00:19:09.120 align:start position:0%
for example efficiency for example proof
 

00:19:09.120 --> 00:19:10.150 align:start position:0%
for example efficiency for example proof
size

00:19:10.150 --> 00:19:10.160 align:start position:0%
size
 

00:19:10.160 --> 00:19:13.610 align:start position:0%
size
and<00:19:11.160><c> basically</c><00:19:11.760><c> how</c><00:19:12.059><c> to</c><00:19:12.240><c> optimize</c><00:19:12.720><c> towards</c>

00:19:13.610 --> 00:19:13.620 align:start position:0%
and basically how to optimize towards
 

00:19:13.620 --> 00:19:16.430 align:start position:0%
and basically how to optimize towards
these<00:19:13.919><c> Magics</c><00:19:14.220><c> so</c><00:19:14.520><c> on</c><00:19:14.760><c> what</c><00:19:14.940><c> basis</c><00:19:15.419><c> are</c><00:19:16.260><c> we</c>

00:19:16.430 --> 00:19:16.440 align:start position:0%
these Magics so on what basis are we
 

00:19:16.440 --> 00:19:19.070 align:start position:0%
these Magics so on what basis are we
comparing<00:19:17.220><c> different</c><00:19:17.940><c> compositions</c><00:19:18.840><c> and</c>

00:19:19.070 --> 00:19:19.080 align:start position:0%
comparing different compositions and
 

00:19:19.080 --> 00:19:23.029 align:start position:0%
comparing different compositions and
configurations<00:19:19.820><c> and</c><00:19:20.820><c> the</c><00:19:21.000><c> last</c><00:19:21.780><c> sort</c><00:19:22.559><c> of</c><00:19:22.679><c> call</c>

00:19:23.029 --> 00:19:23.039 align:start position:0%
configurations and the last sort of call
 

00:19:23.039 --> 00:19:25.370 align:start position:0%
configurations and the last sort of call
to<00:19:23.220><c> action</c><00:19:23.520><c> would</c><00:19:23.880><c> be</c><00:19:24.120><c> to</c><00:19:24.539><c> think</c><00:19:24.840><c> carefully</c>

00:19:25.370 --> 00:19:25.380 align:start position:0%
to action would be to think carefully
 

00:19:25.380 --> 00:19:28.909 align:start position:0%
to action would be to think carefully
about<00:19:26.000><c> how</c><00:19:27.000><c> security</c><00:19:27.299><c> properties</c><00:19:28.200><c> also</c>

00:19:28.909 --> 00:19:28.919 align:start position:0%
about how security properties also
 

00:19:28.919 --> 00:19:32.210 align:start position:0%
about how security properties also
compose<00:19:29.340><c> like</c><00:19:29.760><c> excuse</c><00:19:30.660><c> me</c><00:19:30.780><c> like</c><00:19:31.380><c> is</c><00:19:31.679><c> it</c><00:19:31.919><c> the</c>

00:19:32.210 --> 00:19:32.220 align:start position:0%
compose like excuse me like is it the
 

00:19:32.220 --> 00:19:34.130 align:start position:0%
compose like excuse me like is it the
least<00:19:32.340><c> secure</c><00:19:32.760><c> approved</c><00:19:33.120><c> system</c><00:19:33.299><c> the</c><00:19:33.900><c> the</c>

00:19:34.130 --> 00:19:34.140 align:start position:0%
least secure approved system the the
 

00:19:34.140 --> 00:19:36.890 align:start position:0%
least secure approved system the the
fewest<00:19:34.500><c> bits</c><00:19:34.740><c> of</c><00:19:34.799><c> secure</c><00:19:34.980><c> 30</c><00:19:35.400><c> or</c><00:19:35.940><c> like</c><00:19:36.360><c> some</c>

00:19:36.890 --> 00:19:36.900 align:start position:0%
fewest bits of secure 30 or like some
 

00:19:36.900 --> 00:19:38.570 align:start position:0%
fewest bits of secure 30 or like some
weird<00:19:37.200><c> composition</c>

00:19:38.570 --> 00:19:38.580 align:start position:0%
weird composition
 

00:19:38.580 --> 00:19:41.150 align:start position:0%
weird composition
when<00:19:39.120><c> we</c><00:19:39.240><c> mix</c><00:19:39.360><c> and</c><00:19:39.539><c> match</c><00:19:39.720><c> proof</c><00:19:40.140><c> systems</c><00:19:40.559><c> so</c>

00:19:41.150 --> 00:19:41.160 align:start position:0%
when we mix and match proof systems so
 

00:19:41.160 --> 00:19:44.029 align:start position:0%
when we mix and match proof systems so
all<00:19:41.460><c> these</c><00:19:41.760><c> are</c><00:19:42.000><c> questions</c><00:19:42.360><c> that</c><00:19:43.020><c> it</c><00:19:43.679><c> would</c><00:19:43.860><c> be</c>

00:19:44.029 --> 00:19:44.039 align:start position:0%
all these are questions that it would be
 

00:19:44.039 --> 00:19:47.510 align:start position:0%
all these are questions that it would be
great<00:19:44.460><c> to</c><00:19:45.059><c> have</c><00:19:45.360><c> everyone's</c><00:19:46.020><c> input</c><00:19:46.380><c> on</c>

00:19:47.510 --> 00:19:47.520 align:start position:0%
great to have everyone's input on
 

00:19:47.520 --> 00:19:50.990 align:start position:0%
great to have everyone's input on
like<00:19:48.059><c> even</c><00:19:48.360><c> this</c><00:19:49.100><c> taxonomy</c><00:19:50.100><c> that</c><00:19:50.520><c> I</c><00:19:50.700><c> came</c><00:19:50.820><c> up</c>

00:19:50.990 --> 00:19:51.000 align:start position:0%
like even this taxonomy that I came up
 

00:19:51.000 --> 00:19:54.590 align:start position:0%
like even this taxonomy that I came up
with<00:19:51.120><c> I'm</c><00:19:51.539><c> not</c><00:19:51.780><c> sure</c><00:19:52.080><c> that</c><00:19:52.559><c> it</c><00:19:52.740><c> captures</c>

00:19:54.590 --> 00:19:54.600 align:start position:0%
with I'm not sure that it captures
 

00:19:54.600 --> 00:19:56.930 align:start position:0%
with I'm not sure that it captures
um all<00:19:54.960><c> features</c><00:19:55.320><c> of</c><00:19:55.440><c> proof</c><00:19:55.740><c> systems</c><00:19:56.160><c> in</c><00:19:56.820><c> the</c>

00:19:56.930 --> 00:19:56.940 align:start position:0%
um all features of proof systems in the
 

00:19:56.940 --> 00:19:59.810 align:start position:0%
um all features of proof systems in the
best<00:19:57.120><c> way</c><00:19:57.360><c> so</c>

00:19:59.810 --> 00:19:59.820 align:start position:0%
best way so
 

00:19:59.820 --> 00:20:04.250 align:start position:0%
best way so
Nolan<00:20:00.539><c> and</c><00:20:00.840><c> I</c><00:20:01.020><c> actually</c><00:20:01.799><c> help</c><00:20:02.160><c> out</c><00:20:02.400><c> at</c><00:20:03.080><c> a</c><00:20:04.080><c> group</c>

00:20:04.250 --> 00:20:04.260 align:start position:0%
Nolan and I actually help out at a group
 

00:20:04.260 --> 00:20:07.130 align:start position:0%
Nolan and I actually help out at a group
called<00:20:04.679><c> Xerox</c><00:20:05.160><c> Park</c><00:20:05.700><c> oh</c><00:20:06.360><c> we</c><00:20:06.600><c> didn't</c><00:20:06.720><c> put</c><00:20:07.020><c> the</c>

00:20:07.130 --> 00:20:07.140 align:start position:0%
called Xerox Park oh we didn't put the
 

00:20:07.140 --> 00:20:11.510 align:start position:0%
called Xerox Park oh we didn't put the
name<00:20:07.260><c> on</c><00:20:07.500><c> the</c><00:20:07.620><c> slide</c><00:20:07.919><c> it's</c><00:20:08.580><c> 0x</c><00:20:09.480><c> Park</c>

00:20:11.510 --> 00:20:11.520 align:start position:0%
name on the slide it's 0x Park
 

00:20:11.520 --> 00:20:14.690 align:start position:0%
name on the slide it's 0x Park
um<00:20:11.640><c> and</c><00:20:12.299><c> there</c><00:20:12.780><c> we're</c><00:20:13.260><c> setting</c><00:20:13.679><c> up</c><00:20:13.799><c> this</c><00:20:14.280><c> task</c>

00:20:14.690 --> 00:20:14.700 align:start position:0%
um and there we're setting up this task
 

00:20:14.700 --> 00:20:18.909 align:start position:0%
um and there we're setting up this task
force<00:20:15.299><c> to</c><00:20:16.080><c> look</c><00:20:16.320><c> into</c><00:20:16.880><c> this</c><00:20:17.880><c> area</c><00:20:18.059><c> of</c>

00:20:18.909 --> 00:20:18.919 align:start position:0%
force to look into this area of
 

00:20:18.919 --> 00:20:23.029 align:start position:0%
force to look into this area of
recursion<00:20:19.919><c> aggregation</c><00:20:20.520><c> and</c><00:20:20.820><c> composition</c>

00:20:23.029 --> 00:20:23.039 align:start position:0%
recursion aggregation and composition
 

00:20:23.039 --> 00:20:26.029 align:start position:0%
recursion aggregation and composition
um<00:20:23.100><c> yeah</c><00:20:23.520><c> and</c><00:20:24.240><c> I</c><00:20:24.360><c> think</c><00:20:24.539><c> like</c><00:20:24.900><c> I</c><00:20:25.500><c> might</c><00:20:25.679><c> as</c><00:20:25.860><c> well</c>

00:20:26.029 --> 00:20:26.039 align:start position:0%
um yeah and I think like I might as well
 

00:20:26.039 --> 00:20:28.490 align:start position:0%
um yeah and I think like I might as well
take<00:20:26.400><c> this</c><00:20:26.580><c> opportunity</c><00:20:27.179><c> to</c><00:20:27.539><c> shout</c><00:20:27.780><c> out</c><00:20:27.960><c> Xerox</c>

00:20:28.490 --> 00:20:28.500 align:start position:0%
take this opportunity to shout out Xerox
 

00:20:28.500 --> 00:20:31.250 align:start position:0%
take this opportunity to shout out Xerox
Park<00:20:28.860><c> and</c><00:20:29.280><c> they</c><00:20:29.640><c> supported</c><00:20:30.120><c> a</c><00:20:30.600><c> lot</c><00:20:30.720><c> of</c><00:20:30.900><c> our</c>

00:20:31.250 --> 00:20:31.260 align:start position:0%
Park and they supported a lot of our
 

00:20:31.260 --> 00:20:34.490 align:start position:0%
Park and they supported a lot of our
work<00:20:31.559><c> a</c><00:20:32.280><c> lot</c><00:20:32.400><c> of</c><00:20:32.460><c> those</c><00:20:32.700><c> fun</c><00:20:33.059><c> apps</c><00:20:33.660><c> and</c><00:20:34.140><c> a</c><00:20:34.380><c> lot</c>

00:20:34.490 --> 00:20:34.500 align:start position:0%
work a lot of those fun apps and a lot
 

00:20:34.500 --> 00:20:37.010 align:start position:0%
work a lot of those fun apps and a lot
of<00:20:34.679><c> these</c><00:20:35.100><c> Community</c><00:20:35.280><c> efforts</c>

00:20:37.010 --> 00:20:37.020 align:start position:0%
of these Community efforts
 

00:20:37.020 --> 00:20:41.210 align:start position:0%
of these Community efforts
yeah<00:20:37.580><c> I</c><00:20:38.580><c> think</c><00:20:38.700><c> that</c><00:20:39.000><c> is</c><00:20:39.179><c> all</c><00:20:39.419><c> I</c><00:20:39.600><c> have</c><00:20:39.780><c> so</c><00:20:40.380><c> thank</c>

00:20:41.210 --> 00:20:41.220 align:start position:0%
yeah I think that is all I have so thank
 

00:20:41.220 --> 00:20:44.029 align:start position:0%
yeah I think that is all I have so thank
you<00:20:41.400><c> awesome</c><00:20:42.360><c> well</c><00:20:43.260><c> thank</c><00:20:43.440><c> you</c><00:20:43.559><c> so</c><00:20:43.679><c> much</c><00:20:43.799><c> we</c>

00:20:44.029 --> 00:20:44.039 align:start position:0%
you awesome well thank you so much we
 

00:20:44.039 --> 00:20:45.529 align:start position:0%
you awesome well thank you so much we
have<00:20:44.220><c> time</c><00:20:44.400><c> for</c><00:20:44.580><c> one</c><00:20:44.760><c> or</c><00:20:44.880><c> two</c><00:20:45.000><c> questions</c><00:20:45.179><c> if</c>

00:20:45.529 --> 00:20:45.539 align:start position:0%
have time for one or two questions if
 

00:20:45.539 --> 00:20:46.669 align:start position:0%
have time for one or two questions if
you<00:20:45.660><c> have</c><00:20:45.720><c> any</c><00:20:45.840><c> questions</c><00:20:46.020><c> please</c><00:20:46.260><c> raise</c><00:20:46.440><c> your</c>

00:20:46.669 --> 00:20:46.679 align:start position:0%
you have any questions please raise your
 

00:20:46.679 --> 00:20:48.169 align:start position:0%
you have any questions please raise your
hand<00:20:46.860><c> we've</c><00:20:47.160><c> got</c><00:20:47.220><c> a</c><00:20:47.400><c> question</c><00:20:47.520><c> here</c><00:20:47.820><c> on</c><00:20:48.000><c> this</c>

00:20:48.169 --> 00:20:48.179 align:start position:0%
hand we've got a question here on this
 

00:20:48.179 --> 00:20:51.350 align:start position:0%
hand we've got a question here on this
side<00:20:48.380><c> hi</c><00:20:49.460><c> I</c><00:20:50.460><c> didn't</c><00:20:50.520><c> think</c><00:20:50.700><c> this</c><00:20:50.880><c> would</c><00:20:51.059><c> work</c>

00:20:51.350 --> 00:20:51.360 align:start position:0%
side hi I didn't think this would work
 

00:20:51.360 --> 00:20:54.169 align:start position:0%
side hi I didn't think this would work
for<00:20:51.600><c> years</c><00:20:51.780><c> and</c><00:20:52.020><c> years</c><00:20:52.200><c> and</c><00:20:52.320><c> years</c>

00:20:54.169 --> 00:20:54.179 align:start position:0%
for years and years and years
 

00:20:54.179 --> 00:20:56.270 align:start position:0%
for years and years and years
um and<00:20:54.780><c> I</c><00:20:54.840><c> also</c><00:20:55.080><c> I'm</c><00:20:55.380><c> not</c><00:20:55.559><c> I'm</c><00:20:55.740><c> not</c><00:20:55.919><c> even</c><00:20:56.039><c> sure</c>

00:20:56.270 --> 00:20:56.280 align:start position:0%
um and I also I'm not I'm not even sure
 

00:20:56.280 --> 00:20:57.830 align:start position:0%
um and I also I'm not I'm not even sure
that<00:20:56.400><c> does</c><00:20:56.640><c> work</c><00:20:56.760><c> it</c><00:20:56.940><c> does</c><00:20:57.120><c> seem</c><00:20:57.299><c> way</c><00:20:57.480><c> too</c><00:20:57.660><c> good</c>

00:20:57.830 --> 00:20:57.840 align:start position:0%
that does work it does seem way too good
 

00:20:57.840 --> 00:21:01.010 align:start position:0%
that does work it does seem way too good
to<00:20:57.960><c> be</c><00:20:58.080><c> true</c><00:20:58.260><c> so</c><00:20:58.980><c> can</c><00:20:59.400><c> you</c><00:20:59.580><c> prove</c><00:21:00.120><c> and</c><00:21:00.660><c> how</c><00:21:00.900><c> do</c>

00:21:01.010 --> 00:21:01.020 align:start position:0%
to be true so can you prove and how do
 

00:21:01.020 --> 00:21:03.049 align:start position:0%
to be true so can you prove and how do
you<00:21:01.140><c> prove</c><00:21:01.559><c> that</c><00:21:01.980><c> that</c><00:21:02.220><c> it's</c><00:21:02.400><c> secure</c><00:21:02.700><c> to</c><00:21:02.880><c> do</c>

00:21:03.049 --> 00:21:03.059 align:start position:0%
you prove that that it's secure to do
 

00:21:03.059 --> 00:21:04.850 align:start position:0%
you prove that that it's secure to do
recursive<00:21:03.600><c> like</c><00:21:03.900><c> proofs</c><00:21:04.440><c> like</c><00:21:04.559><c> this</c><00:21:04.679><c> like</c>

00:21:04.850 --> 00:21:04.860 align:start position:0%
recursive like proofs like this like
 

00:21:04.860 --> 00:21:07.610 align:start position:0%
recursive like proofs like this like
where<00:21:05.700><c> where</c><00:21:06.000><c> is</c><00:21:06.240><c> the</c><00:21:06.360><c> security</c><00:21:06.480><c> proof</c>

00:21:07.610 --> 00:21:07.620 align:start position:0%
where where is the security proof
 

00:21:07.620 --> 00:21:09.770 align:start position:0%
where where is the security proof
you<00:21:07.980><c> know</c><00:21:08.100><c> I</c><00:21:08.340><c> don't</c><00:21:08.460><c> know</c><00:21:08.580><c> how</c><00:21:09.120><c> to</c><00:21:09.299><c> convince</c>

00:21:09.770 --> 00:21:09.780 align:start position:0%
you know I don't know how to convince
 

00:21:09.780 --> 00:21:11.750 align:start position:0%
you know I don't know how to convince
myself<00:21:09.900><c> that</c><00:21:10.260><c> this</c><00:21:10.440><c> works</c><00:21:10.679><c> actually</c>

00:21:11.750 --> 00:21:11.760 align:start position:0%
myself that this works actually
 

00:21:11.760 --> 00:21:14.510 align:start position:0%
myself that this works actually
yeah I<00:21:12.240><c> mean</c><00:21:12.360><c> that</c><00:21:12.840><c> is</c><00:21:12.960><c> a</c><00:21:13.140><c> good</c><00:21:13.320><c> question</c><00:21:13.679><c> it</c>

00:21:14.510 --> 00:21:14.520 align:start position:0%
yeah I mean that is a good question it
 

00:21:14.520 --> 00:21:16.850 align:start position:0%
yeah I mean that is a good question it
seems<00:21:14.820><c> very</c><00:21:15.059><c> unreasonable</c><00:21:15.900><c> that</c><00:21:16.500><c> you</c><00:21:16.679><c> can</c>

00:21:16.850 --> 00:21:16.860 align:start position:0%
seems very unreasonable that you can
 

00:21:16.860 --> 00:21:19.130 align:start position:0%
seems very unreasonable that you can
prove<00:21:17.220><c> like</c><00:21:17.520><c> an</c><00:21:17.760><c> arbitrarily</c><00:21:18.539><c> long</c><00:21:18.840><c> history</c>

00:21:19.130 --> 00:21:19.140 align:start position:0%
prove like an arbitrarily long history
 

00:21:19.140 --> 00:21:21.590 align:start position:0%
prove like an arbitrarily long history
of<00:21:19.440><c> computation</c><00:21:20.039><c> with</c><00:21:20.760><c> a</c><00:21:20.940><c> constant</c><00:21:21.299><c> size</c>

00:21:21.590 --> 00:21:21.600 align:start position:0%
of computation with a constant size
 

00:21:21.600 --> 00:21:23.210 align:start position:0%
of computation with a constant size
proof

00:21:23.210 --> 00:21:23.220 align:start position:0%
proof
 

00:21:23.220 --> 00:21:25.909 align:start position:0%
proof
um<00:21:23.280><c> it</c><00:21:23.640><c> does</c><00:21:23.760><c> seem</c><00:21:24.000><c> unreasonable</c><00:21:24.600><c> so</c>

00:21:25.909 --> 00:21:25.919 align:start position:0%
um it does seem unreasonable so
 

00:21:25.919 --> 00:21:28.610 align:start position:0%
um it does seem unreasonable so
I<00:21:26.580><c> will</c><00:21:26.700><c> say</c><00:21:26.880><c> that</c><00:21:27.179><c> security</c><00:21:27.419><c> proves</c><00:21:28.080><c> exist</c>

00:21:28.610 --> 00:21:28.620 align:start position:0%
I will say that security proves exist
 

00:21:28.620 --> 00:21:30.890 align:start position:0%
I will say that security proves exist
there<00:21:29.460><c> in</c><00:21:29.700><c> papers</c>

00:21:30.890 --> 00:21:30.900 align:start position:0%
there in papers
 

00:21:30.900 --> 00:21:32.630 align:start position:0%
there in papers
um<00:21:30.960><c> but</c><00:21:31.320><c> now</c><00:21:31.440><c> and</c><00:21:31.740><c> do</c><00:21:31.860><c> you</c><00:21:31.980><c> have</c><00:21:32.100><c> like</c><00:21:32.280><c> some</c>

00:21:32.630 --> 00:21:32.640 align:start position:0%
um but now and do you have like some
 

00:21:32.640 --> 00:21:35.930 align:start position:0%
um but now and do you have like some
intuition<00:21:33.299><c> as</c><00:21:33.659><c> to</c><00:21:33.900><c> why</c><00:21:34.500><c> the</c><00:21:35.340><c> security</c><00:21:35.460><c> should</c>

00:21:35.930 --> 00:21:35.940 align:start position:0%
intuition as to why the security should
 

00:21:35.940 --> 00:21:39.529 align:start position:0%
intuition as to why the security should
hold<00:21:36.380><c> uh</c><00:21:37.380><c> yeah</c><00:21:37.500><c> for</c><00:21:37.740><c> sure</c><00:21:37.860><c> I</c><00:21:38.159><c> I</c><00:21:38.340><c> think</c><00:21:38.700><c> one</c><00:21:39.120><c> sort</c>

00:21:39.529 --> 00:21:39.539 align:start position:0%
hold uh yeah for sure I I think one sort
 

00:21:39.539 --> 00:21:41.149 align:start position:0%
hold uh yeah for sure I I think one sort
of<00:21:39.659><c> physics-based</c><00:21:40.320><c> view</c><00:21:40.440><c> that</c><00:21:40.740><c> we've</c><00:21:40.980><c> seen</c>

00:21:41.149 --> 00:21:41.159 align:start position:0%
of physics-based view that we've seen
 

00:21:41.159 --> 00:21:43.250 align:start position:0%
of physics-based view that we've seen
before<00:21:41.400><c> is</c><00:21:41.640><c> like</c><00:21:41.820><c> it's</c><00:21:42.000><c> like</c><00:21:42.299><c> oh</c><00:21:42.600><c> you're</c><00:21:42.840><c> 3D</c>

00:21:43.250 --> 00:21:43.260 align:start position:0%
before is like it's like oh you're 3D
 

00:21:43.260 --> 00:21:44.930 align:start position:0%
before is like it's like oh you're 3D
space<00:21:43.679><c> and</c><00:21:43.919><c> you're</c><00:21:44.039><c> collapsing</c><00:21:44.400><c> into</c><00:21:44.580><c> like</c><00:21:44.820><c> a</c>

00:21:44.930 --> 00:21:44.940 align:start position:0%
space and you're collapsing into like a
 

00:21:44.940 --> 00:21:46.190 align:start position:0%
space and you're collapsing into like a
2d<00:21:45.120><c> surface</c>

00:21:46.190 --> 00:21:46.200 align:start position:0%
2d surface
 

00:21:46.200 --> 00:21:47.690 align:start position:0%
2d surface
um<00:21:46.260><c> I</c><00:21:46.440><c> forget</c><00:21:46.559><c> the</c><00:21:46.799><c> exact</c><00:21:47.039><c> name</c><00:21:47.220><c> of</c><00:21:47.400><c> this</c><00:21:47.520><c> but</c>

00:21:47.690 --> 00:21:47.700 align:start position:0%
um I forget the exact name of this but
 

00:21:47.700 --> 00:21:49.789 align:start position:0%
um I forget the exact name of this but
the<00:21:48.059><c> holographic</c><00:21:48.720><c> principle</c>

00:21:49.789 --> 00:21:49.799 align:start position:0%
the holographic principle
 

00:21:49.799 --> 00:21:52.610 align:start position:0%
the holographic principle
uh<00:21:50.520><c> so</c><00:21:51.000><c> I</c><00:21:51.179><c> I</c><00:21:51.299><c> think</c><00:21:51.840><c> there</c><00:21:51.960><c> is</c><00:21:52.140><c> like</c><00:21:52.260><c> some</c><00:21:52.440><c> sort</c>

00:21:52.610 --> 00:21:52.620 align:start position:0%
uh so I I think there is like some sort
 

00:21:52.620 --> 00:21:53.990 align:start position:0%
uh so I I think there is like some sort
of<00:21:52.740><c> meta</c><00:21:53.039><c> justification</c><00:21:53.460><c> you</c><00:21:53.640><c> can</c><00:21:53.760><c> come</c><00:21:53.880><c> up</c>

00:21:53.990 --> 00:21:54.000 align:start position:0%
of meta justification you can come up
 

00:21:54.000 --> 00:21:55.549 align:start position:0%
of meta justification you can come up
with<00:21:54.120><c> to</c><00:21:54.360><c> convince</c><00:21:54.659><c> yourself</c><00:21:54.780><c> if</c><00:21:55.200><c> that's</c><00:21:55.380><c> like</c>

00:21:55.549 --> 00:21:55.559 align:start position:0%
with to convince yourself if that's like
 

00:21:55.559 --> 00:21:57.770 align:start position:0%
with to convince yourself if that's like
this<00:21:55.860><c> sort</c><00:21:55.980><c> of</c><00:21:56.039><c> thing</c><00:21:56.159><c> but</c><00:21:56.400><c> there</c><00:21:57.240><c> is</c><00:21:57.419><c> fruits</c>

00:21:57.770 --> 00:21:57.780 align:start position:0%
this sort of thing but there is fruits
 

00:21:57.780 --> 00:21:59.210 align:start position:0%
this sort of thing but there is fruits
of<00:21:57.840><c> all</c><00:21:57.960><c> kind</c><00:21:58.200><c> that</c><00:21:58.919><c> are</c><00:21:59.100><c> actually</c>

00:21:59.210 --> 00:21:59.220 align:start position:0%
of all kind that are actually
 

00:21:59.220 --> 00:22:02.270 align:start position:0%
of all kind that are actually
substantial<00:22:00.000><c> it's</c><00:22:00.480><c> a</c><00:22:00.780><c> good</c><00:22:00.900><c> question</c>

00:22:02.270 --> 00:22:02.280 align:start position:0%
substantial it's a good question
 

00:22:02.280 --> 00:22:04.250 align:start position:0%
substantial it's a good question
any<00:22:02.700><c> last</c><00:22:03.059><c> minute</c><00:22:03.240><c> questions</c>

00:22:04.250 --> 00:22:04.260 align:start position:0%
any last minute questions
 

00:22:04.260 --> 00:22:05.870 align:start position:0%
any last minute questions
we<00:22:04.679><c> have</c><00:22:04.799><c> one</c><00:22:04.980><c> at</c><00:22:05.100><c> the</c><00:22:05.280><c> back</c><00:22:05.340><c> all</c><00:22:05.640><c> the</c><00:22:05.700><c> way</c><00:22:05.760><c> over</c>

00:22:05.870 --> 00:22:05.880 align:start position:0%
we have one at the back all the way over
 

00:22:05.880 --> 00:22:06.890 align:start position:0%
we have one at the back all the way over
there

00:22:06.890 --> 00:22:06.900 align:start position:0%
there
 

00:22:06.900 --> 00:22:09.110 align:start position:0%
there
so<00:22:07.320><c> recursive</c><00:22:07.740><c> proofs</c><00:22:08.100><c> are</c><00:22:08.280><c> real</c><00:22:08.400><c> fun</c><00:22:08.700><c> but</c><00:22:08.940><c> if</c>

00:22:09.110 --> 00:22:09.120 align:start position:0%
so recursive proofs are real fun but if
 

00:22:09.120 --> 00:22:12.110 align:start position:0%
so recursive proofs are real fun but if
you<00:22:09.240><c> do</c><00:22:09.360><c> it</c><00:22:09.480><c> at</c><00:22:09.659><c> scale</c><00:22:10.080><c> then</c><00:22:10.919><c> you're</c><00:22:11.640><c> you</c><00:22:12.000><c> know</c>

00:22:12.110 --> 00:22:12.120 align:start position:0%
you do it at scale then you're you know
 

00:22:12.120 --> 00:22:14.630 align:start position:0%
you do it at scale then you're you know
it's<00:22:12.299><c> like</c><00:22:12.480><c> you</c><00:22:12.659><c> you</c><00:22:12.900><c> you</c><00:22:13.039><c> have</c><00:22:14.039><c> skill</c><00:22:14.460><c> and</c>

00:22:14.630 --> 00:22:14.640 align:start position:0%
it's like you you you have skill and
 

00:22:14.640 --> 00:22:17.390 align:start position:0%
it's like you you you have skill and
corruptus<00:22:15.360><c> snapping</c><00:22:15.900><c> at</c><00:22:16.080><c> your</c><00:22:16.200><c> heels</c><00:22:16.559><c> uh</c>

00:22:17.390 --> 00:22:17.400 align:start position:0%
corruptus snapping at your heels uh
 

00:22:17.400 --> 00:22:19.310 align:start position:0%
corruptus snapping at your heels uh
because<00:22:17.520><c> of</c><00:22:17.760><c> the</c><00:22:17.880><c> proof</c><00:22:18.120><c> carrying</c><00:22:18.480><c> data</c><00:22:18.900><c> right</c>

00:22:19.310 --> 00:22:19.320 align:start position:0%
because of the proof carrying data right
 

00:22:19.320 --> 00:22:23.090 align:start position:0%
because of the proof carrying data right
if<00:22:19.860><c> you</c><00:22:20.220><c> want</c><00:22:21.000><c> to</c><00:22:21.120><c> build</c><00:22:21.419><c> on</c><00:22:21.960><c> recursive</c><00:22:22.740><c> proofs</c>

00:22:23.090 --> 00:22:23.100 align:start position:0%
if you want to build on recursive proofs
 

00:22:23.100 --> 00:22:25.669 align:start position:0%
if you want to build on recursive proofs
and<00:22:23.280><c> it</c><00:22:23.460><c> doesn't</c><00:22:23.580><c> happen</c><00:22:24.059><c> at</c><00:22:24.659><c> the</c><00:22:25.200><c> same</c><00:22:25.440><c> time</c>

00:22:25.669 --> 00:22:25.679 align:start position:0%
and it doesn't happen at the same time
 

00:22:25.679 --> 00:22:28.310 align:start position:0%
and it doesn't happen at the same time
so<00:22:25.980><c> let's</c><00:22:26.159><c> say</c><00:22:26.280><c> you</c><00:22:26.520><c> do</c><00:22:26.700><c> a</c><00:22:26.940><c> proof</c><00:22:27.780><c> and</c><00:22:28.080><c> you</c><00:22:28.260><c> do</c>

00:22:28.310 --> 00:22:28.320 align:start position:0%
so let's say you do a proof and you do
 

00:22:28.320 --> 00:22:30.049 align:start position:0%
so let's say you do a proof and you do
recursive<00:22:28.799><c> proof</c><00:22:29.159><c> and</c><00:22:29.580><c> then</c><00:22:29.700><c> you</c><00:22:29.820><c> have</c><00:22:29.940><c> to</c>

00:22:30.049 --> 00:22:30.059 align:start position:0%
recursive proof and then you have to
 

00:22:30.059 --> 00:22:31.610 align:start position:0%
recursive proof and then you have to
wait<00:22:30.240><c> for</c><00:22:30.480><c> a</c><00:22:30.600><c> state</c><00:22:30.780><c> change</c><00:22:31.020><c> for</c><00:22:31.380><c> something</c>

00:22:31.610 --> 00:22:31.620 align:start position:0%
wait for a state change for something
 

00:22:31.620 --> 00:22:33.890 align:start position:0%
wait for a state change for something
else<00:22:31.860><c> it</c><00:22:32.039><c> might</c><00:22:32.280><c> happen</c><00:22:32.460><c> much</c><00:22:32.880><c> later</c><00:22:33.059><c> you</c><00:22:33.720><c> need</c>

00:22:33.890 --> 00:22:33.900 align:start position:0%
else it might happen much later you need
 

00:22:33.900 --> 00:22:35.510 align:start position:0%
else it might happen much later you need
to<00:22:34.020><c> keep</c><00:22:34.200><c> the</c><00:22:34.380><c> proof</c><00:22:34.620><c> carrying</c><00:22:35.039><c> data</c><00:22:35.340><c> around</c>

00:22:35.510 --> 00:22:35.520 align:start position:0%
to keep the proof carrying data around
 

00:22:35.520 --> 00:22:39.110 align:start position:0%
to keep the proof carrying data around
and<00:22:36.059><c> as</c><00:22:36.539><c> you</c><00:22:36.840><c> know</c><00:22:36.900><c> if</c><00:22:37.260><c> as</c><00:22:37.740><c> you</c><00:22:37.980><c> know</c><00:22:38.159><c> but</c><00:22:38.640><c> most</c>

00:22:39.110 --> 00:22:39.120 align:start position:0%
and as you know if as you know but most
 

00:22:39.120 --> 00:22:42.049 align:start position:0%
and as you know if as you know but most
here<00:22:39.659><c> that</c><00:22:40.559><c> is</c><00:22:40.860><c> typically</c><00:22:41.220><c> a</c><00:22:41.580><c> very</c><00:22:41.760><c> large</c>

00:22:42.049 --> 00:22:42.059 align:start position:0%
here that is typically a very large
 

00:22:42.059 --> 00:22:44.090 align:start position:0%
here that is typically a very large
amount<00:22:42.480><c> of</c><00:22:42.600><c> data</c>

00:22:44.090 --> 00:22:44.100 align:start position:0%
amount of data
 

00:22:44.100 --> 00:22:46.250 align:start position:0%
amount of data
um<00:22:44.159><c> so</c><00:22:44.640><c> it's</c><00:22:45.059><c> like</c><00:22:45.179><c> if</c><00:22:45.480><c> you're</c><00:22:45.600><c> doing</c><00:22:45.840><c> it</c><00:22:46.020><c> at</c>

00:22:46.250 --> 00:22:46.260 align:start position:0%
um so it's like if you're doing it at
 

00:22:46.260 --> 00:22:48.830 align:start position:0%
um so it's like if you're doing it at
scale<00:22:46.559><c> you're</c><00:22:47.220><c> really</c><00:22:47.580><c> running</c><00:22:47.820><c> into</c><00:22:48.299><c> the</c>

00:22:48.830 --> 00:22:48.840 align:start position:0%
scale you're really running into the
 

00:22:48.840 --> 00:22:52.549 align:start position:0%
scale you're really running into the
issues<00:22:49.260><c> of</c><00:22:49.740><c> data</c><00:22:50.159><c> provisioning</c><00:22:50.840><c> and</c><00:22:51.840><c> all</c><00:22:52.440><c> the</c>

00:22:52.549 --> 00:22:52.559 align:start position:0%
issues of data provisioning and all the
 

00:22:52.559 --> 00:22:55.669 align:start position:0%
issues of data provisioning and all the
fun<00:22:52.740><c> part</c><00:22:53.039><c> can</c><00:22:53.760><c> get</c><00:22:54.000><c> really</c><00:22:54.299><c> expensive</c><00:22:54.900><c> really</c>

00:22:55.669 --> 00:22:55.679 align:start position:0%
fun part can get really expensive really
 

00:22:55.679 --> 00:22:57.350 align:start position:0%
fun part can get really expensive really
really<00:22:55.860><c> quickly</c><00:22:56.280><c> not</c><00:22:56.580><c> even</c><00:22:56.700><c> talking</c><00:22:57.000><c> about</c>

00:22:57.350 --> 00:22:57.360 align:start position:0%
really quickly not even talking about
 

00:22:57.360 --> 00:22:59.390 align:start position:0%
really quickly not even talking about
like<00:22:58.200><c> the</c><00:22:58.500><c> the</c>

00:22:59.390 --> 00:22:59.400 align:start position:0%
like the the
 

00:22:59.400 --> 00:23:01.549 align:start position:0%
like the the
um<00:22:59.520><c> you</c><00:22:59.940><c> know</c><00:23:00.059><c> the</c><00:23:00.299><c> the</c><00:23:00.559><c> computational</c>

00:23:01.549 --> 00:23:01.559 align:start position:0%
um you know the the computational
 

00:23:01.559 --> 00:23:03.590 align:start position:0%
um you know the the computational
overhead<00:23:02.100><c> that</c><00:23:02.400><c> you</c><00:23:02.460><c> have</c>

00:23:03.590 --> 00:23:03.600 align:start position:0%
overhead that you have
 

00:23:03.600 --> 00:23:06.710 align:start position:0%
overhead that you have
yeah<00:23:04.260><c> yeah</c><00:23:04.500><c> for</c><00:23:05.039><c> sure</c><00:23:05.220><c> I</c><00:23:05.880><c> think</c><00:23:06.000><c> I</c><00:23:06.419><c> don't</c><00:23:06.539><c> think</c>

00:23:06.710 --> 00:23:06.720 align:start position:0%
yeah yeah for sure I think I don't think
 

00:23:06.720 --> 00:23:09.590 align:start position:0%
yeah yeah for sure I think I don't think
recursive<00:23:07.380><c> proofs</c><00:23:07.799><c> are</c><00:23:08.039><c> a</c><00:23:08.220><c> silver</c><00:23:08.400><c> bullet</c><00:23:09.059><c> and</c>

00:23:09.590 --> 00:23:09.600 align:start position:0%
recursive proofs are a silver bullet and
 

00:23:09.600 --> 00:23:11.570 align:start position:0%
recursive proofs are a silver bullet and
I<00:23:10.020><c> think</c><00:23:10.140><c> they're</c><00:23:10.380><c> better</c><00:23:10.620><c> suited</c><00:23:11.039><c> for</c><00:23:11.280><c> some</c>

00:23:11.570 --> 00:23:11.580 align:start position:0%
I think they're better suited for some
 

00:23:11.580 --> 00:23:14.210 align:start position:0%
I think they're better suited for some
shapes<00:23:12.120><c> of</c><00:23:12.299><c> applications</c><00:23:12.840><c> so</c><00:23:13.679><c> recursive</c>

00:23:14.210 --> 00:23:14.220 align:start position:0%
shapes of applications so recursive
 

00:23:14.220 --> 00:23:16.850 align:start position:0%
shapes of applications so recursive
proofs<00:23:14.640><c> are</c><00:23:14.880><c> very</c><00:23:15.179><c> commonly</c><00:23:15.539><c> used</c><00:23:15.780><c> to</c><00:23:16.200><c> reduce</c>

00:23:16.850 --> 00:23:16.860 align:start position:0%
proofs are very commonly used to reduce
 

00:23:16.860 --> 00:23:19.730 align:start position:0%
proofs are very commonly used to reduce
proverb<00:23:17.700><c> space</c><00:23:17.760><c> complexity</c><00:23:18.419><c> so</c><00:23:19.140><c> breaking</c><00:23:19.620><c> up</c>

00:23:19.730 --> 00:23:19.740 align:start position:0%
proverb space complexity so breaking up
 

00:23:19.740 --> 00:23:22.010 align:start position:0%
proverb space complexity so breaking up
a<00:23:19.919><c> large</c><00:23:20.100><c> circuit</c><00:23:20.640><c> into</c><00:23:21.000><c> many</c><00:23:21.539><c> smaller</c>

00:23:22.010 --> 00:23:22.020 align:start position:0%
a large circuit into many smaller
 

00:23:22.020 --> 00:23:26.330 align:start position:0%
a large circuit into many smaller
parallelizable<00:23:23.000><c> circuits</c><00:23:24.020><c> so</c><00:23:25.020><c> yeah</c><00:23:25.500><c> but</c><00:23:25.860><c> I</c><00:23:26.100><c> I</c>

00:23:26.330 --> 00:23:26.340 align:start position:0%
parallelizable circuits so yeah but I I
 

00:23:26.340 --> 00:23:28.909 align:start position:0%
parallelizable circuits so yeah but I I
agree<00:23:26.640><c> like</c><00:23:27.000><c> in</c><00:23:27.360><c> context</c><00:23:27.720><c> of</c><00:23:28.020><c> applications</c>

00:23:28.909 --> 00:23:28.919 align:start position:0%
agree like in context of applications
 

00:23:28.919 --> 00:23:32.149 align:start position:0%
agree like in context of applications
with<00:23:29.280><c> more</c><00:23:29.720><c> complicated</c><00:23:30.720><c> and</c><00:23:31.320><c> like</c><00:23:31.559><c> timely</c>

00:23:32.149 --> 00:23:32.159 align:start position:0%
with more complicated and like timely
 

00:23:32.159 --> 00:23:36.110 align:start position:0%
with more complicated and like timely
data<00:23:33.000><c> flows</c><00:23:33.360><c> it's</c><00:23:34.080><c> it's</c><00:23:34.500><c> we</c><00:23:35.280><c> have</c><00:23:35.400><c> to</c><00:23:35.520><c> put</c><00:23:35.820><c> some</c>

00:23:36.110 --> 00:23:36.120 align:start position:0%
data flows it's it's we have to put some
 

00:23:36.120 --> 00:23:39.950 align:start position:0%
data flows it's it's we have to put some
care<00:23:36.360><c> into</c><00:23:36.960><c> how</c><00:23:37.860><c> and</c><00:23:38.159><c> where</c><00:23:38.460><c> we</c><00:23:39.179><c> are</c><00:23:39.360><c> inserting</c>

00:23:39.950 --> 00:23:39.960 align:start position:0%
care into how and where we are inserting
 

00:23:39.960 --> 00:23:43.310 align:start position:0%
care into how and where we are inserting
this<00:23:40.500><c> proof</c><00:23:40.860><c> carrying</c><00:23:41.159><c> data</c><00:23:42.000><c> yeah</c>

00:23:43.310 --> 00:23:43.320 align:start position:0%
this proof carrying data yeah
 

00:23:43.320 --> 00:23:45.770 align:start position:0%
this proof carrying data yeah
right<00:23:43.860><c> and</c><00:23:44.039><c> also</c><00:23:44.280><c> just</c><00:23:44.460><c> to</c><00:23:44.640><c> add</c><00:23:44.880><c> uh</c><00:23:45.360><c> I</c><00:23:45.480><c> think</c>

00:23:45.770 --> 00:23:45.780 align:start position:0%
right and also just to add uh I think
 

00:23:45.780 --> 00:23:47.210 align:start position:0%
right and also just to add uh I think
there's<00:23:46.020><c> also</c><00:23:46.260><c> some</c><00:23:46.440><c> interesting</c><00:23:46.799><c> like</c><00:23:46.980><c> sort</c>

00:23:47.210 --> 00:23:47.220 align:start position:0%
there's also some interesting like sort
 

00:23:47.220 --> 00:23:49.310 align:start position:0%
there's also some interesting like sort
of<00:23:47.280><c> clean</c><00:23:47.460><c> separation</c><00:23:47.940><c> here</c><00:23:48.240><c> of</c><00:23:48.480><c> like</c><00:23:48.720><c> rules</c>

00:23:49.310 --> 00:23:49.320 align:start position:0%
of clean separation here of like rules
 

00:23:49.320 --> 00:23:51.169 align:start position:0%
of clean separation here of like rules
versus<00:23:49.559><c> data</c><00:23:50.159><c> availability</c><00:23:50.520><c> sort</c><00:23:51.000><c> of</c>

00:23:51.169 --> 00:23:51.179 align:start position:0%
versus data availability sort of
 

00:23:51.179 --> 00:23:53.090 align:start position:0%
versus data availability sort of
problems<00:23:52.020><c> um</c><00:23:52.080><c> and</c><00:23:52.320><c> if</c><00:23:52.500><c> you</c><00:23:52.620><c> just</c><00:23:52.740><c> look</c><00:23:52.799><c> at</c><00:23:52.919><c> you</c>

00:23:53.090 --> 00:23:53.100 align:start position:0%
problems um and if you just look at you
 

00:23:53.100 --> 00:23:54.710 align:start position:0%
problems um and if you just look at you
know<00:23:53.159><c> data</c><00:23:53.400><c> availability</c><00:23:53.640><c> as</c><00:23:54.059><c> a</c><00:23:54.299><c> sort</c><00:23:54.600><c> of</c>

00:23:54.710 --> 00:23:54.720 align:start position:0%
know data availability as a sort of
 

00:23:54.720 --> 00:23:56.210 align:start position:0%
know data availability as a sort of
Black<00:23:54.900><c> Box</c><00:23:55.080><c> problem</c><00:23:55.380><c> you</c><00:23:55.620><c> know</c><00:23:55.740><c> you</c><00:23:55.860><c> have</c><00:23:55.980><c> lots</c>

00:23:56.210 --> 00:23:56.220 align:start position:0%
Black Box problem you know you have lots
 

00:23:56.220 --> 00:23:57.770 align:start position:0%
Black Box problem you know you have lots
of blockchain<00:23:56.580><c> kinds</c><00:23:57.000><c> of</c><00:23:57.059><c> solutions</c><00:23:57.360><c> for</c><00:23:57.659><c> it</c>

00:23:57.770 --> 00:23:57.780 align:start position:0%
of blockchain kinds of solutions for it
 

00:23:57.780 --> 00:24:00.409 align:start position:0%
of blockchain kinds of solutions for it
and<00:23:58.140><c> for</c><00:23:58.440><c> instance</c><00:23:58.559><c> isocratia</c><00:23:59.280><c> explorers</c>

00:24:00.409 --> 00:24:00.419 align:start position:0%
and for instance isocratia explorers
 

00:24:00.419 --> 00:24:02.990 align:start position:0%
and for instance isocratia explorers
um one<00:24:00.960><c> sort</c><00:24:01.140><c> of</c><00:24:01.260><c> solution</c><00:24:01.679><c> that</c><00:24:02.400><c> um</c>

00:24:02.990 --> 00:24:03.000 align:start position:0%
um one sort of solution that um
 

00:24:03.000 --> 00:24:05.570 align:start position:0%
um one sort of solution that um
maybe<00:24:03.419><c> you</c><00:24:03.600><c> can</c><00:24:03.720><c> check</c><00:24:03.840><c> out</c><00:24:03.960><c> The</c><00:24:04.080><c> Blog</c><00:24:04.320><c> on</c>

00:24:05.570 --> 00:24:05.580 align:start position:0%
maybe you can check out The Blog on
 

00:24:05.580 --> 00:24:10.010 align:start position:0%
maybe you can check out The Blog on
yeah<00:24:05.780><c> also</c><00:24:06.780><c> to</c><00:24:07.320><c> add</c><00:24:07.500><c> on</c><00:24:07.679><c> to</c><00:24:07.860><c> that</c><00:24:08.220><c> like</c><00:24:08.940><c> I</c><00:24:09.720><c> I</c>

00:24:10.010 --> 00:24:10.020 align:start position:0%
yeah also to add on to that like I I
 

00:24:10.020 --> 00:24:12.430 align:start position:0%
yeah also to add on to that like I I
really<00:24:10.260><c> like</c><00:24:10.500><c> knowledge</c><00:24:11.159><c> thing</c><00:24:11.580><c> about</c>

00:24:12.430 --> 00:24:12.440 align:start position:0%
really like knowledge thing about
 

00:24:12.440 --> 00:24:15.830 align:start position:0%
really like knowledge thing about
composability<00:24:13.440><c> the</c><00:24:14.039><c> fact</c><00:24:14.340><c> that</c><00:24:15.240><c> um</c>

00:24:15.830 --> 00:24:15.840 align:start position:0%
composability the fact that um
 

00:24:15.840 --> 00:24:18.590 align:start position:0%
composability the fact that um
you<00:24:16.500><c> know</c><00:24:16.620><c> you</c><00:24:17.100><c> you</c><00:24:17.340><c> can</c><00:24:17.880><c> play</c><00:24:18.000><c> incomplete</c>

00:24:18.590 --> 00:24:18.600 align:start position:0%
you know you you can play incomplete
 

00:24:18.600 --> 00:24:21.230 align:start position:0%
you know you you can play incomplete
information<00:24:18.720><c> games</c><00:24:19.260><c> so</c><00:24:19.679><c> I</c><00:24:19.919><c> think</c><00:24:20.100><c> sort</c><00:24:20.760><c> of</c><00:24:21.000><c> fun</c>

00:24:21.230 --> 00:24:21.240 align:start position:0%
information games so I think sort of fun
 

00:24:21.240 --> 00:24:23.330 align:start position:0%
information games so I think sort of fun
applications<00:24:21.840><c> like</c><00:24:22.140><c> that</c><00:24:22.320><c> that</c><00:24:22.620><c> are</c><00:24:22.919><c> unique</c>

00:24:23.330 --> 00:24:23.340 align:start position:0%
applications like that that are unique
 

00:24:23.340 --> 00:24:26.930 align:start position:0%
applications like that that are unique
to<00:24:23.760><c> PCD</c><00:24:24.299><c> are</c><00:24:25.080><c> also</c><00:24:25.500><c> very</c><00:24:26.039><c> interesting</c><00:24:26.580><c> to</c>

00:24:26.930 --> 00:24:26.940 align:start position:0%
to PCD are also very interesting to
 

00:24:26.940 --> 00:24:27.950 align:start position:0%
to PCD are also very interesting to
explore

00:24:27.950 --> 00:24:27.960 align:start position:0%
explore
 

00:24:27.960 --> 00:24:29.570 align:start position:0%
explore
amazing<00:24:28.440><c> that's</c><00:24:28.679><c> all</c><00:24:28.860><c> the</c><00:24:29.039><c> time</c><00:24:29.159><c> we</c><00:24:29.280><c> have</c><00:24:29.400><c> for</c>

00:24:29.570 --> 00:24:29.580 align:start position:0%
amazing that's all the time we have for
 

00:24:29.580 --> 00:24:31.430 align:start position:0%
amazing that's all the time we have for
today<00:24:29.700><c> please</c><00:24:30.059><c> give</c><00:24:30.299><c> Ian</c><00:24:30.659><c> and</c><00:24:30.780><c> Elaine</c><00:24:31.200><c> a</c><00:24:31.260><c> big</c>

00:24:31.430 --> 00:24:31.440 align:start position:0%
today please give Ian and Elaine a big
 

00:24:31.440 --> 00:24:32.110 align:start position:0%
today please give Ian and Elaine a big
round<00:24:31.559><c> of</c><00:24:31.740><c> applause</c>

00:24:32.110 --> 00:24:32.120 align:start position:0%
round of applause
 

00:24:32.120 --> 00:24:36.560 align:start position:0%
round of applause
[Applause]

