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:20.470 align:start position:0%
 
[Music]

00:00:20.470 --> 00:00:20.480 align:start position:0%
 
 

00:00:20.480 --> 00:00:23.210 align:start position:0%
 
proof<00:00:21.480><c> right</c><00:00:21.600><c> now</c><00:00:21.840><c> you</c><00:00:22.500><c> perform</c><00:00:22.740><c> setup</c>

00:00:23.210 --> 00:00:23.220 align:start position:0%
proof right now you perform setup
 

00:00:23.220 --> 00:00:25.250 align:start position:0%
proof right now you perform setup
ceremony<00:00:23.580><c> and</c><00:00:24.300><c> then</c><00:00:24.480><c> you</c><00:00:24.600><c> set</c><00:00:24.779><c> it</c><00:00:24.960><c> for</c><00:00:25.080><c> a</c>

00:00:25.250 --> 00:00:25.260 align:start position:0%
ceremony and then you set it for a
 

00:00:25.260 --> 00:00:27.349 align:start position:0%
ceremony and then you set it for a
circuit<00:00:25.619><c> and</c><00:00:26.220><c> then</c><00:00:26.340><c> you</c><00:00:26.519><c> prove</c><00:00:26.880><c> a</c><00:00:27.060><c> specific</c>

00:00:27.349 --> 00:00:27.359 align:start position:0%
circuit and then you prove a specific
 

00:00:27.359 --> 00:00:29.570 align:start position:0%
circuit and then you prove a specific
input<00:00:27.779><c> on</c><00:00:27.960><c> the</c><00:00:28.080><c> circuit</c><00:00:28.439><c> and</c><00:00:28.859><c> then</c><00:00:28.980><c> you</c><00:00:29.160><c> verify</c>

00:00:29.570 --> 00:00:29.580 align:start position:0%
input on the circuit and then you verify
 

00:00:29.580 --> 00:00:31.189 align:start position:0%
input on the circuit and then you verify
it<00:00:29.760><c> or</c><00:00:30.119><c> you</c><00:00:30.240><c> generate</c><00:00:30.539><c> is</c><00:00:30.720><c> already</c><00:00:30.900><c> called</c>

00:00:31.189 --> 00:00:31.199 align:start position:0%
it or you generate is already called
 

00:00:31.199 --> 00:00:32.389 align:start position:0%
it or you generate is already called
Data

00:00:32.389 --> 00:00:32.399 align:start position:0%
Data
 

00:00:32.399 --> 00:00:34.370 align:start position:0%
Data
and<00:00:32.940><c> what</c><00:00:33.120><c> does</c><00:00:33.239><c> auction</c><00:00:33.600><c> verification</c><00:00:34.079><c> look</c>

00:00:34.370 --> 00:00:34.380 align:start position:0%
and what does auction verification look
 

00:00:34.380 --> 00:00:36.950 align:start position:0%
and what does auction verification look
like<00:00:34.579><c> basically</c><00:00:35.579><c> you</c><00:00:36.059><c> have</c><00:00:36.239><c> a</c><00:00:36.480><c> verifier</c>

00:00:36.950 --> 00:00:36.960 align:start position:0%
like basically you have a verifier
 

00:00:36.960 --> 00:00:40.010 align:start position:0%
like basically you have a verifier
contract<00:00:37.440><c> that</c><00:00:38.100><c> verifies</c><00:00:38.520><c> the</c><00:00:38.700><c> proofs</c><00:00:39.420><c> so</c><00:00:39.899><c> on</c>

00:00:40.010 --> 00:00:40.020 align:start position:0%
contract that verifies the proofs so on
 

00:00:40.020 --> 00:00:43.369 align:start position:0%
contract that verifies the proofs so on
L1<00:00:40.500><c> the</c><00:00:41.340><c> cost</c><00:00:41.460><c> comprises</c><00:00:42.059><c> of</c><00:00:42.360><c> execution</c><00:00:43.079><c> cost</c>

00:00:43.369 --> 00:00:43.379 align:start position:0%
L1 the cost comprises of execution cost
 

00:00:43.379 --> 00:00:46.069 align:start position:0%
L1 the cost comprises of execution cost
as<00:00:43.980><c> well</c><00:00:44.160><c> as</c><00:00:44.280><c> called</c><00:00:44.460><c> at</c><00:00:44.700><c> a</c><00:00:44.879><c> cost</c><00:00:45.000><c> but</c><00:00:45.540><c> on</c><00:00:45.719><c> L2</c>

00:00:46.069 --> 00:00:46.079 align:start position:0%
as well as called at a cost but on L2
 

00:00:46.079 --> 00:00:48.229 align:start position:0%
as well as called at a cost but on L2
the<00:00:46.620><c> majority</c><00:00:46.980><c> of</c><00:00:47.219><c> the</c><00:00:47.399><c> cost</c><00:00:47.520><c> is</c><00:00:47.879><c> the</c><00:00:48.059><c> call</c>

00:00:48.229 --> 00:00:48.239 align:start position:0%
the majority of the cost is the call
 

00:00:48.239 --> 00:00:49.369 align:start position:0%
the majority of the cost is the call
data<00:00:48.660><c> cost</c>

00:00:49.369 --> 00:00:49.379 align:start position:0%
data cost
 

00:00:49.379 --> 00:00:51.889 align:start position:0%
data cost
so<00:00:49.680><c> for</c><00:00:49.860><c> a</c><00:00:49.980><c> growth</c><00:00:50.219><c> 16</c><00:00:50.399><c> proof</c><00:00:50.940><c> the</c><00:00:51.539><c> execution</c>

00:00:51.889 --> 00:00:51.899 align:start position:0%
so for a growth 16 proof the execution
 

00:00:51.899 --> 00:00:55.310 align:start position:0%
so for a growth 16 proof the execution
cost<00:00:52.260><c> is</c><00:00:52.620><c> 210</c><00:00:53.460><c> 000</c><00:00:53.520><c> units</c><00:00:54.000><c> called</c><00:00:54.719><c> in</c><00:00:55.020><c> a</c><00:00:55.140><c> cost</c>

00:00:55.310 --> 00:00:55.320 align:start position:0%
cost is 210 000 units called in a cost
 

00:00:55.320 --> 00:00:58.549 align:start position:0%
cost is 210 000 units called in a cost
is<00:00:55.500><c> 128</c><00:00:56.039><c> bytes</c><00:00:56.520><c> for</c><00:00:57.239><c> a</c><00:00:57.420><c> long</c><00:00:57.660><c> proof</c><00:00:58.079><c> the</c>

00:00:58.549 --> 00:00:58.559 align:start position:0%
is 128 bytes for a long proof the
 

00:00:58.559 --> 00:01:02.209 align:start position:0%
is 128 bytes for a long proof the
exhibition<00:00:58.980><c> cost</c><00:00:59.340><c> is</c><00:00:59.820><c> 300</c><00:01:01.140><c> 000</c><00:01:01.260><c> units</c><00:01:01.680><c> and</c><00:01:02.100><c> we</c>

00:01:02.209 --> 00:01:02.219 align:start position:0%
exhibition cost is 300 000 units and we
 

00:01:02.219 --> 00:01:05.210 align:start position:0%
exhibition cost is 300 000 units and we
called<00:01:02.399><c> it</c><00:01:02.640><c> a</c><00:01:02.760><c> cost</c><00:01:02.879><c> is</c><00:01:03.059><c> around</c><00:01:03.239><c> 400</c><00:01:03.719><c> bytes</c>

00:01:05.210 --> 00:01:05.220 align:start position:0%
called it a cost is around 400 bytes
 

00:01:05.220 --> 00:01:10.130 align:start position:0%
called it a cost is around 400 bytes
but<00:01:06.119><c> what</c><00:01:06.840><c> if</c><00:01:07.020><c> we</c><00:01:07.560><c> want</c><00:01:07.799><c> to</c><00:01:08.159><c> verify</c><00:01:09.119><c> 50</c><00:01:09.479><c> got</c><00:01:09.840><c> 60</c>

00:01:10.130 --> 00:01:10.140 align:start position:0%
but what if we want to verify 50 got 60
 

00:01:10.140 --> 00:01:11.750 align:start position:0%
but what if we want to verify 50 got 60
proofs<00:01:10.619><c> on</c><00:01:10.920><c> chain</c>

00:01:11.750 --> 00:01:11.760 align:start position:0%
proofs on chain
 

00:01:11.760 --> 00:01:13.850 align:start position:0%
proofs on chain
it<00:01:12.240><c> will</c><00:01:12.299><c> all</c><00:01:12.479><c> obviously</c><00:01:12.900><c> take</c><00:01:13.200><c> times</c><00:01:13.500><c> 50</c>

00:01:13.850 --> 00:01:13.860 align:start position:0%
it will all obviously take times 50
 

00:01:13.860 --> 00:01:16.070 align:start position:0%
it will all obviously take times 50
right<00:01:14.280><c> that</c><00:01:14.640><c> will</c><00:01:14.760><c> be</c><00:01:14.880><c> around</c><00:01:15.060><c> 10.6</c><00:01:15.780><c> million</c>

00:01:16.070 --> 00:01:16.080 align:start position:0%
right that will be around 10.6 million
 

00:01:16.080 --> 00:01:19.550 align:start position:0%
right that will be around 10.6 million
gas<00:01:16.260><c> units</c><00:01:16.799><c> and</c><00:01:17.280><c> 6400</c><00:01:17.939><c> bytes</c>

00:01:19.550 --> 00:01:19.560 align:start position:0%
gas units and 6400 bytes
 

00:01:19.560 --> 00:01:22.190 align:start position:0%
gas units and 6400 bytes
but<00:01:20.100><c> what</c><00:01:20.640><c> if</c><00:01:20.820><c> I</c><00:01:21.000><c> told</c><00:01:21.180><c> you</c><00:01:21.420><c> that</c><00:01:21.900><c> you</c><00:01:22.020><c> didn't</c>

00:01:22.190 --> 00:01:22.200 align:start position:0%
but what if I told you that you didn't
 

00:01:22.200 --> 00:01:24.649 align:start position:0%
but what if I told you that you didn't
have<00:01:22.439><c> to</c><00:01:22.680><c> live</c><00:01:22.799><c> in</c><00:01:23.040><c> that</c><00:01:23.220><c> world</c><00:01:23.400><c> anymore</c><00:01:23.700><c> what</c>

00:01:24.649 --> 00:01:24.659 align:start position:0%
have to live in that world anymore what
 

00:01:24.659 --> 00:01:27.230 align:start position:0%
have to live in that world anymore what
if<00:01:24.840><c> we</c><00:01:25.020><c> could</c><00:01:25.200><c> prove</c><00:01:25.619><c> 50</c><00:01:26.220><c> proofs</c><00:01:26.820><c> at</c><00:01:27.000><c> the</c><00:01:27.119><c> cost</c>

00:01:27.230 --> 00:01:27.240 align:start position:0%
if we could prove 50 proofs at the cost
 

00:01:27.240 --> 00:01:29.870 align:start position:0%
if we could prove 50 proofs at the cost
of<00:01:27.479><c> one</c><00:01:27.659><c> and</c><00:01:28.380><c> yes</c><00:01:28.560><c> we</c><00:01:28.799><c> can</c><00:01:28.920><c> do</c><00:01:29.100><c> that</c><00:01:29.280><c> and</c><00:01:29.580><c> we</c><00:01:29.759><c> can</c>

00:01:29.870 --> 00:01:29.880 align:start position:0%
of one and yes we can do that and we can
 

00:01:29.880 --> 00:01:32.270 align:start position:0%
of one and yes we can do that and we can
do<00:01:30.000><c> that</c><00:01:30.119><c> using</c><00:01:30.600><c> aggregation</c>

00:01:32.270 --> 00:01:32.280 align:start position:0%
do that using aggregation
 

00:01:32.280 --> 00:01:35.749 align:start position:0%
do that using aggregation
what<00:01:33.000><c> is</c><00:01:33.240><c> proof</c><00:01:33.600><c> aggregation</c><00:01:34.080><c> now</c><00:01:34.860><c> basically</c>

00:01:35.749 --> 00:01:35.759 align:start position:0%
what is proof aggregation now basically
 

00:01:35.759 --> 00:01:39.050 align:start position:0%
what is proof aggregation now basically
you<00:01:36.479><c> can</c><00:01:36.600><c> get</c><00:01:37.140><c> several</c><00:01:37.619><c> proofs</c><00:01:38.159><c> into</c><00:01:38.460><c> a</c><00:01:38.759><c> single</c>

00:01:39.050 --> 00:01:39.060 align:start position:0%
you can get several proofs into a single
 

00:01:39.060 --> 00:01:41.030 align:start position:0%
you can get several proofs into a single
proof<00:01:39.479><c> and</c><00:01:40.020><c> that</c><00:01:40.140><c> is</c><00:01:40.320><c> it</c><00:01:40.439><c> and</c><00:01:40.680><c> that</c><00:01:40.799><c> is</c><00:01:40.860><c> what</c>

00:01:41.030 --> 00:01:41.040 align:start position:0%
proof and that is it and that is what
 

00:01:41.040 --> 00:01:44.929 align:start position:0%
proof and that is it and that is what
True<00:01:41.220><c> Value</c><00:01:41.460><c> radiation</c><00:01:41.820><c> allows</c><00:01:42.180><c> you</c><00:01:42.240><c> to</c><00:01:42.360><c> do</c>

00:01:44.929 --> 00:01:44.939 align:start position:0%
 
 

00:01:44.939 --> 00:01:46.910 align:start position:0%
 
and<00:01:45.299><c> how</c><00:01:45.479><c> do</c><00:01:45.600><c> you</c><00:01:45.659><c> do</c><00:01:45.840><c> it</c><00:01:45.960><c> you</c><00:01:46.500><c> can</c><00:01:46.619><c> do</c><00:01:46.799><c> that</c>

00:01:46.910 --> 00:01:46.920 align:start position:0%
and how do you do it you can do that
 

00:01:46.920 --> 00:01:50.090 align:start position:0%
and how do you do it you can do that
using<00:01:47.280><c> maze</c><00:01:47.700><c> it's</c><00:01:48.299><c> a</c><00:01:48.479><c> tool</c><00:01:48.840><c> that</c><00:01:49.560><c> helps</c><00:01:49.979><c> you</c>

00:01:50.090 --> 00:01:50.100 align:start position:0%
using maze it's a tool that helps you
 

00:01:50.100 --> 00:01:52.550 align:start position:0%
using maze it's a tool that helps you
irrigate<00:01:50.579><c> individual</c><00:01:51.119><c> flock</c><00:01:51.600><c> proofs</c><00:01:52.020><c> that</c>

00:01:52.550 --> 00:01:52.560 align:start position:0%
irrigate individual flock proofs that
 

00:01:52.560 --> 00:01:54.950 align:start position:0%
irrigate individual flock proofs that
you<00:01:52.740><c> can</c><00:01:52.860><c> generate</c><00:01:53.100><c> using</c><00:01:53.399><c> smart</c><00:01:53.700><c> JS</c><00:01:54.180><c> into</c><00:01:54.600><c> a</c>

00:01:54.950 --> 00:01:54.960 align:start position:0%
you can generate using smart JS into a
 

00:01:54.960 --> 00:01:58.010 align:start position:0%
you can generate using smart JS into a
single<00:01:55.259><c> aggregated</c><00:01:55.799><c> proof</c>

00:01:58.010 --> 00:01:58.020 align:start position:0%
single aggregated proof
 

00:01:58.020 --> 00:02:00.830 align:start position:0%
single aggregated proof
and<00:01:58.439><c> why</c><00:01:58.560><c> should</c><00:01:58.799><c> we</c><00:01:58.920><c> use</c><00:01:59.100><c> it</c><00:01:59.360><c> basically</c><00:02:00.360><c> you</c>

00:02:00.830 --> 00:02:00.840 align:start position:0%
and why should we use it basically you
 

00:02:00.840 --> 00:02:03.050 align:start position:0%
and why should we use it basically you
will<00:02:01.020><c> get</c><00:02:01.200><c> constant</c><00:02:01.799><c> proof</c><00:02:02.159><c> size</c><00:02:02.340><c> that</c><00:02:02.820><c> means</c>

00:02:03.050 --> 00:02:03.060 align:start position:0%
will get constant proof size that means
 

00:02:03.060 --> 00:02:05.450 align:start position:0%
will get constant proof size that means
constant<00:02:03.479><c> call</c><00:02:03.659><c> data</c><00:02:04.140><c> of</c><00:02:04.740><c> four</c><00:02:05.040><c> three</c><00:02:05.280><c> two</c>

00:02:05.450 --> 00:02:05.460 align:start position:0%
constant call data of four three two
 

00:02:05.460 --> 00:02:07.609 align:start position:0%
constant call data of four three two
zero<00:02:05.820><c> bytes</c><00:02:06.180><c> so</c><00:02:06.479><c> it</c><00:02:06.600><c> doesn't</c><00:02:06.780><c> matter</c><00:02:06.960><c> whether</c>

00:02:07.609 --> 00:02:07.619 align:start position:0%
zero bytes so it doesn't matter whether
 

00:02:07.619 --> 00:02:09.830 align:start position:0%
zero bytes so it doesn't matter whether
you're<00:02:07.799><c> aggregating</c><00:02:08.220><c> 20</c><00:02:08.580><c> proofs</c><00:02:09.119><c> 40</c><00:02:09.360><c> proofs</c>

00:02:09.830 --> 00:02:09.840 align:start position:0%
you're aggregating 20 proofs 40 proofs
 

00:02:09.840 --> 00:02:12.589 align:start position:0%
you're aggregating 20 proofs 40 proofs
50<00:02:10.020><c> proofs</c><00:02:10.619><c> the</c><00:02:11.340><c> call</c><00:02:11.459><c> data</c><00:02:11.879><c> cost</c><00:02:12.000><c> will</c><00:02:12.360><c> always</c>

00:02:12.589 --> 00:02:12.599 align:start position:0%
50 proofs the call data cost will always
 

00:02:12.599 --> 00:02:14.930 align:start position:0%
50 proofs the call data cost will always
remain<00:02:12.959><c> the</c><00:02:13.140><c> same</c><00:02:13.800><c> and</c><00:02:14.340><c> the</c><00:02:14.520><c> same</c><00:02:14.640><c> goes</c>

00:02:14.930 --> 00:02:14.940 align:start position:0%
remain the same and the same goes
 

00:02:14.940 --> 00:02:17.750 align:start position:0%
remain the same and the same goes
foreign<00:02:15.739><c> the</c><00:02:16.739><c> same</c><00:02:16.800><c> goes</c><00:02:17.160><c> for</c><00:02:17.280><c> the</c><00:02:17.400><c> execution</c>

00:02:17.750 --> 00:02:17.760 align:start position:0%
foreign the same goes for the execution
 

00:02:17.760 --> 00:02:20.150 align:start position:0%
foreign the same goes for the execution
cost<00:02:18.060><c> that</c><00:02:18.959><c> would</c><00:02:19.080><c> be</c><00:02:19.260><c> approximately</c><00:02:19.800><c> around</c>

00:02:20.150 --> 00:02:20.160 align:start position:0%
cost that would be approximately around
 

00:02:20.160 --> 00:02:23.390 align:start position:0%
cost that would be approximately around
600<00:02:21.000><c> 000</c><00:02:21.120><c> gas</c><00:02:21.360><c> units</c>

00:02:23.390 --> 00:02:23.400 align:start position:0%
600 000 gas units
 

00:02:23.400 --> 00:02:25.670 align:start position:0%
600 000 gas units
so<00:02:23.940><c> let's</c><00:02:24.180><c> try</c><00:02:24.420><c> it</c><00:02:24.599><c> out</c>

00:02:25.670 --> 00:02:25.680 align:start position:0%
so let's try it out
 

00:02:25.680 --> 00:02:28.070 align:start position:0%
so let's try it out
to<00:02:26.160><c> build</c><00:02:26.280><c> an</c><00:02:26.459><c> aggregation</c><00:02:26.940><c> circuit</c><00:02:27.420><c> you</c><00:02:27.959><c> need</c>

00:02:28.070 --> 00:02:28.080 align:start position:0%
to build an aggregation circuit you need
 

00:02:28.080 --> 00:02:30.350 align:start position:0%
to build an aggregation circuit you need
a<00:02:28.319><c> bunch</c><00:02:28.500><c> of</c><00:02:28.620><c> prompt</c><00:02:29.099><c> proofs</c><00:02:29.459><c> for</c><00:02:30.120><c> which</c>

00:02:30.350 --> 00:02:30.360 align:start position:0%
a bunch of prompt proofs for which
 

00:02:30.360 --> 00:02:32.690 align:start position:0%
a bunch of prompt proofs for which
you'll<00:02:30.900><c> build</c><00:02:31.020><c> the</c><00:02:31.260><c> aggression</c><00:02:31.620><c> circuit</c><00:02:32.099><c> so</c>

00:02:32.690 --> 00:02:32.700 align:start position:0%
you'll build the aggression circuit so
 

00:02:32.700 --> 00:02:34.850 align:start position:0%
you'll build the aggression circuit so
we<00:02:32.879><c> generate</c><00:02:33.239><c> the</c><00:02:33.360><c> plan</c><00:02:33.599><c> proofs</c><00:02:34.140><c> using</c><00:02:34.440><c> snog</c>

00:02:34.850 --> 00:02:34.860 align:start position:0%
we generate the plan proofs using snog
 

00:02:34.860 --> 00:02:37.130 align:start position:0%
we generate the plan proofs using snog
JS<00:02:35.280><c> and</c><00:02:36.000><c> then</c><00:02:36.120><c> we</c><00:02:36.360><c> build</c><00:02:36.599><c> the</c><00:02:36.780><c> aviation</c>

00:02:37.130 --> 00:02:37.140 align:start position:0%
JS and then we build the aviation
 

00:02:37.140 --> 00:02:39.290 align:start position:0%
JS and then we build the aviation
circuit<00:02:37.500><c> using</c><00:02:37.739><c> maze</c>

00:02:39.290 --> 00:02:39.300 align:start position:0%
circuit using maze
 

00:02:39.300 --> 00:02:41.390 align:start position:0%
circuit using maze
so<00:02:39.780><c> I've</c><00:02:39.900><c> already</c><00:02:40.080><c> done</c><00:02:40.440><c> the</c><00:02:40.560><c> necessary</c><00:02:40.980><c> setup</c>

00:02:41.390 --> 00:02:41.400 align:start position:0%
so I've already done the necessary setup
 

00:02:41.400 --> 00:02:44.030 align:start position:0%
so I've already done the necessary setup
for<00:02:41.879><c> generating</c><00:02:42.239><c> plan</c><00:02:42.540><c> proofs</c><00:02:43.080><c> using</c><00:02:43.379><c> snapjs</c>

00:02:44.030 --> 00:02:44.040 align:start position:0%
for generating plan proofs using snapjs
 

00:02:44.040 --> 00:02:46.309 align:start position:0%
for generating plan proofs using snapjs
you<00:02:44.400><c> can</c><00:02:44.580><c> see</c><00:02:44.700><c> the</c><00:02:44.879><c> circuit</c><00:02:45.239><c> is</c><00:02:45.360><c> here</c><00:02:45.599><c> and</c><00:02:46.140><c> we</c>

00:02:46.309 --> 00:02:46.319 align:start position:0%
you can see the circuit is here and we
 

00:02:46.319 --> 00:02:48.589 align:start position:0%
you can see the circuit is here and we
have<00:02:46.440><c> the</c><00:02:46.560><c> proven</c><00:02:46.800><c> key</c><00:02:47.040><c> file</c><00:02:47.280><c> over</c><00:02:47.400><c> here</c>

00:02:48.589 --> 00:02:48.599 align:start position:0%
have the proven key file over here
 

00:02:48.599 --> 00:02:51.110 align:start position:0%
have the proven key file over here
now<00:02:49.440><c> we'll</c><00:02:49.739><c> use</c><00:02:49.980><c> the</c><00:02:50.340><c> circuit</c><00:02:50.640><c> Files</c><00:02:50.940><c> The</c>

00:02:51.110 --> 00:02:51.120 align:start position:0%
now we'll use the circuit Files The
 

00:02:51.120 --> 00:02:53.630 align:start position:0%
now we'll use the circuit Files The
Proven<00:02:51.480><c> key</c><00:02:51.660><c> file</c><00:02:52.019><c> to</c><00:02:52.560><c> generate</c><00:02:52.980><c> a</c><00:02:53.280><c> bunch</c><00:02:53.459><c> of</c>

00:02:53.630 --> 00:02:53.640 align:start position:0%
Proven key file to generate a bunch of
 

00:02:53.640 --> 00:02:56.330 align:start position:0%
Proven key file to generate a bunch of
proofs<00:02:54.120><c> for</c><00:02:54.599><c> which</c><00:02:54.780><c> we'll</c><00:02:55.019><c> generate</c><00:02:55.440><c> the</c><00:02:55.680><c> for</c>

00:02:56.330 --> 00:02:56.340 align:start position:0%
proofs for which we'll generate the for
 

00:02:56.340 --> 00:02:59.270 align:start position:0%
proofs for which we'll generate the for
which<00:02:56.519><c> we</c><00:02:56.700><c> will</c><00:02:56.879><c> build</c><00:02:57.120><c> the</c><00:02:57.300><c> ignition</c><00:02:57.660><c> circuit</c>

00:02:59.270 --> 00:02:59.280 align:start position:0%
which we will build the ignition circuit
 

00:02:59.280 --> 00:03:01.490 align:start position:0%
which we will build the ignition circuit
so<00:02:59.760><c> for</c><00:02:59.940><c> that</c><00:03:00.120><c> first</c><00:03:00.480><c> we</c><00:03:00.720><c> need</c><00:03:00.840><c> to</c><00:03:00.959><c> install</c><00:03:01.140><c> a</c>

00:03:01.490 --> 00:03:01.500 align:start position:0%
so for that first we need to install a
 

00:03:01.500 --> 00:03:05.150 align:start position:0%
so for that first we need to install a
focus<00:03:01.800><c> log.js</c><00:03:02.599><c> that</c><00:03:03.599><c> adds</c><00:03:04.260><c> this</c><00:03:04.500><c> new</c><00:03:04.739><c> command</c>

00:03:05.150 --> 00:03:05.160 align:start position:0%
focus log.js that adds this new command
 

00:03:05.160 --> 00:03:08.390 align:start position:0%
focus log.js that adds this new command
called<00:03:05.760><c> snatches</c><00:03:06.540><c> Planck</c><00:03:07.080><c> setup</c><00:03:07.319><c> mails</c>

00:03:08.390 --> 00:03:08.400 align:start position:0%
called snatches Planck setup mails
 

00:03:08.400 --> 00:03:12.290 align:start position:0%
called snatches Planck setup mails
which<00:03:09.120><c> helps</c><00:03:09.599><c> you</c><00:03:10.040><c> output</c><00:03:11.040><c> necessary</c><00:03:11.879><c> files</c>

00:03:12.290 --> 00:03:12.300 align:start position:0%
which helps you output necessary files
 

00:03:12.300 --> 00:03:14.750 align:start position:0%
which helps you output necessary files
for<00:03:12.420><c> building</c><00:03:12.659><c> the</c><00:03:12.900><c> ignition</c><00:03:13.200><c> circuit</c><00:03:13.680><c> so</c><00:03:14.340><c> it</c>

00:03:14.750 --> 00:03:14.760 align:start position:0%
for building the ignition circuit so it
 

00:03:14.760 --> 00:03:19.009 align:start position:0%
for building the ignition circuit so it
takes<00:03:15.319><c> inputs.json</c><00:03:16.400><c> which</c><00:03:17.400><c> contains</c>

00:03:19.009 --> 00:03:19.019 align:start position:0%
takes inputs.json which contains
 

00:03:19.019 --> 00:03:21.530 align:start position:0%
takes inputs.json which contains
several<00:03:19.860><c> inputs</c><00:03:20.459><c> for</c><00:03:20.940><c> which</c><00:03:21.120><c> you</c><00:03:21.300><c> need</c><00:03:21.480><c> to</c>

00:03:21.530 --> 00:03:21.540 align:start position:0%
several inputs for which you need to
 

00:03:21.540 --> 00:03:23.330 align:start position:0%
several inputs for which you need to
generate<00:03:21.840><c> the</c><00:03:22.019><c> proof</c><00:03:22.319><c> so</c><00:03:22.500><c> over</c><00:03:22.680><c> here</c><00:03:22.920><c> we</c><00:03:23.220><c> have</c>

00:03:23.330 --> 00:03:23.340 align:start position:0%
generate the proof so over here we have
 

00:03:23.340 --> 00:03:26.750 align:start position:0%
generate the proof so over here we have
two<00:03:23.459><c> inputs</c><00:03:24.420><c> this</c><00:03:25.200><c> and</c><00:03:25.500><c> this</c>

00:03:26.750 --> 00:03:26.760 align:start position:0%
two inputs this and this
 

00:03:26.760 --> 00:03:29.509 align:start position:0%
two inputs this and this
and<00:03:27.239><c> then</c><00:03:27.420><c> it</c><00:03:27.780><c> takes</c><00:03:27.959><c> the</c><00:03:28.319><c> circuit</c><00:03:28.680><c> file</c>

00:03:29.509 --> 00:03:29.519 align:start position:0%
and then it takes the circuit file
 

00:03:29.519 --> 00:03:32.630 align:start position:0%
and then it takes the circuit file
and<00:03:30.180><c> the</c><00:03:30.720><c> circuit.zk</c><00:03:31.680><c> file</c><00:03:32.040><c> which</c><00:03:32.220><c> is</c><00:03:32.340><c> the</c>

00:03:32.630 --> 00:03:32.640 align:start position:0%
and the circuit.zk file which is the
 

00:03:32.640 --> 00:03:35.210 align:start position:0%
and the circuit.zk file which is the
proving<00:03:33.000><c> key</c><00:03:33.180><c> for</c><00:03:33.360><c> a</c><00:03:33.540><c> single</c><00:03:33.780><c> prong</c><00:03:34.140><c> proof</c><00:03:34.560><c> and</c>

00:03:35.210 --> 00:03:35.220 align:start position:0%
proving key for a single prong proof and
 

00:03:35.220 --> 00:03:37.130 align:start position:0%
proving key for a single prong proof and
will<00:03:35.400><c> generate</c><00:03:35.760><c> proofs</c><00:03:36.239><c> or</c><00:03:36.420><c> Json</c><00:03:36.780><c> public</c>

00:03:37.130 --> 00:03:37.140 align:start position:0%
will generate proofs or Json public
 

00:03:37.140 --> 00:03:39.470 align:start position:0%
will generate proofs or Json public
signals<00:03:37.739><c> and</c><00:03:37.860><c> the</c><00:03:38.040><c> verification</c><00:03:38.459><c> key</c><00:03:38.819><c> so</c>

00:03:39.470 --> 00:03:39.480 align:start position:0%
signals and the verification key so
 

00:03:39.480 --> 00:03:43.130 align:start position:0%
signals and the verification key so
let's<00:03:39.659><c> run</c><00:03:39.959><c> this</c><00:03:40.200><c> command</c>

00:03:43.130 --> 00:03:43.140 align:start position:0%
 
 

00:03:43.140 --> 00:03:45.229 align:start position:0%
 
and<00:03:43.680><c> it</c><00:03:43.920><c> will</c><00:03:43.980><c> generate</c><00:03:44.340><c> the</c><00:03:44.519><c> necessary</c><00:03:44.819><c> files</c>

00:03:45.229 --> 00:03:45.239 align:start position:0%
and it will generate the necessary files
 

00:03:45.239 --> 00:03:48.470 align:start position:0%
and it will generate the necessary files
so<00:03:45.420><c> we</c><00:03:45.659><c> have</c><00:03:45.840><c> got</c><00:03:46.019><c> two</c><00:03:46.680><c> proofs</c><00:03:47.220><c> public</c><00:03:47.879><c> signals</c>

00:03:48.470 --> 00:03:48.480 align:start position:0%
so we have got two proofs public signals
 

00:03:48.480 --> 00:03:50.270 align:start position:0%
so we have got two proofs public signals
and<00:03:48.659><c> the</c><00:03:48.840><c> verification</c><00:03:49.260><c> key</c>

00:03:50.270 --> 00:03:50.280 align:start position:0%
and the verification key
 

00:03:50.280 --> 00:03:53.630 align:start position:0%
and the verification key
so<00:03:50.879><c> now</c><00:03:51.180><c> we'll</c><00:03:51.840><c> use</c><00:03:52.080><c> the</c><00:03:52.440><c> mace</c><00:03:52.799><c> tool</c><00:03:53.280><c> to</c><00:03:53.519><c> build</c>

00:03:53.630 --> 00:03:53.640 align:start position:0%
so now we'll use the mace tool to build
 

00:03:53.640 --> 00:03:55.309 align:start position:0%
so now we'll use the mace tool to build
an<00:03:53.879><c> aviation</c><00:03:54.120><c> circuit</c><00:03:54.599><c> so</c><00:03:54.780><c> let's</c><00:03:54.959><c> check</c><00:03:55.140><c> it</c>

00:03:55.309 --> 00:03:55.319 align:start position:0%
an aviation circuit so let's check it
 

00:03:55.319 --> 00:03:58.250 align:start position:0%
an aviation circuit so let's check it
out

00:03:58.250 --> 00:03:58.260 align:start position:0%
 
 

00:03:58.260 --> 00:04:00.589 align:start position:0%
 
so<00:03:58.620><c> maze</c><00:03:58.980><c> tool</c><00:03:59.220><c> has</c><00:03:59.340><c> a</c><00:03:59.519><c> bunch</c><00:03:59.640><c> of</c><00:03:59.760><c> commands</c><00:04:00.299><c> the</c>

00:04:00.589 --> 00:04:00.599 align:start position:0%
so maze tool has a bunch of commands the
 

00:04:00.599 --> 00:04:03.229 align:start position:0%
so maze tool has a bunch of commands the
first<00:04:00.720><c> one</c><00:04:00.840><c> is</c><00:04:01.019><c> mock</c><00:04:01.379><c> setup</c><00:04:01.799><c> mock</c><00:04:02.519><c> setup</c>

00:04:03.229 --> 00:04:03.239 align:start position:0%
first one is mock setup mock setup
 

00:04:03.239 --> 00:04:05.509 align:start position:0%
first one is mock setup mock setup
builds<00:04:04.019><c> the</c><00:04:04.140><c> aggregation</c><00:04:04.560><c> circuit</c><00:04:04.980><c> and</c><00:04:05.220><c> runs</c>

00:04:05.509 --> 00:04:05.519 align:start position:0%
builds the aggregation circuit and runs
 

00:04:05.519 --> 00:04:07.670 align:start position:0%
builds the aggregation circuit and runs
a<00:04:05.580><c> mock</c><00:04:05.819><c> prover</c><00:04:06.120><c> on</c><00:04:06.299><c> it</c>

00:04:07.670 --> 00:04:07.680 align:start position:0%
a mock prover on it
 

00:04:07.680 --> 00:04:09.830 align:start position:0%
a mock prover on it
and<00:04:07.860><c> then</c><00:04:08.099><c> we</c><00:04:08.340><c> can</c><00:04:08.519><c> also</c><00:04:08.819><c> generate</c><00:04:09.299><c> a</c><00:04:09.599><c> email</c>

00:04:09.830 --> 00:04:09.840 align:start position:0%
and then we can also generate a email
 

00:04:09.840 --> 00:04:12.830 align:start position:0%
and then we can also generate a email
verify<00:04:10.379><c> for</c><00:04:10.560><c> the</c><00:04:10.799><c> execution</c><00:04:11.640><c> circuit</c><00:04:12.120><c> and</c><00:04:12.659><c> we</c>

00:04:12.830 --> 00:04:12.840 align:start position:0%
verify for the execution circuit and we
 

00:04:12.840 --> 00:04:15.350 align:start position:0%
verify for the execution circuit and we
can<00:04:12.959><c> create</c><00:04:13.200><c> a</c><00:04:13.439><c> proof</c><00:04:13.799><c> verify</c><00:04:14.459><c> the</c><00:04:14.640><c> proof</c><00:04:14.939><c> and</c>

00:04:15.350 --> 00:04:15.360 align:start position:0%
can create a proof verify the proof and
 

00:04:15.360 --> 00:04:17.150 align:start position:0%
can create a proof verify the proof and
we<00:04:15.480><c> can</c><00:04:15.659><c> also</c><00:04:15.900><c> simulate</c><00:04:16.320><c> even</c><00:04:16.500><c> verification</c>

00:04:17.150 --> 00:04:17.160 align:start position:0%
we can also simulate even verification
 

00:04:17.160 --> 00:04:19.129 align:start position:0%
we can also simulate even verification
of<00:04:17.459><c> the</c><00:04:17.579><c> proof</c>

00:04:19.129 --> 00:04:19.139 align:start position:0%
of the proof
 

00:04:19.139 --> 00:04:21.349 align:start position:0%
of the proof
so<00:04:19.680><c> for</c><00:04:19.859><c> the</c><00:04:19.979><c> demo</c><00:04:20.280><c> purposes</c><00:04:20.639><c> I'll</c><00:04:20.940><c> stick</c><00:04:21.180><c> to</c>

00:04:21.349 --> 00:04:21.359 align:start position:0%
so for the demo purposes I'll stick to
 

00:04:21.359 --> 00:04:23.810 align:start position:0%
so for the demo purposes I'll stick to
mock<00:04:21.660><c> setup</c><00:04:22.019><c> because</c><00:04:22.800><c> rest</c><00:04:23.160><c> of</c><00:04:23.340><c> the</c><00:04:23.460><c> commands</c>

00:04:23.810 --> 00:04:23.820 align:start position:0%
mock setup because rest of the commands
 

00:04:23.820 --> 00:04:25.730 align:start position:0%
mock setup because rest of the commands
are<00:04:23.880><c> pretty</c><00:04:24.060><c> computationally</c><00:04:24.660><c> expensive</c>

00:04:25.730 --> 00:04:25.740 align:start position:0%
are pretty computationally expensive
 

00:04:25.740 --> 00:04:30.050 align:start position:0%
are pretty computationally expensive
so<00:04:26.400><c> let's</c><00:04:26.639><c> just</c><00:04:26.880><c> run</c><00:04:27.419><c> the</c><00:04:27.660><c> command</c><00:04:28.160><c> maze</c><00:04:29.160><c> mock</c>

00:04:30.050 --> 00:04:30.060 align:start position:0%
so let's just run the command maze mock
 

00:04:30.060 --> 00:04:33.950 align:start position:0%
so let's just run the command maze mock
setup<00:04:30.840><c> on</c><00:04:31.620><c> the</c><00:04:31.919><c> files</c><00:04:32.220><c> over</c><00:04:32.340><c> here</c>

00:04:33.950 --> 00:04:33.960 align:start position:0%
setup on the files over here
 

00:04:33.960 --> 00:04:36.230 align:start position:0%
setup on the files over here
so<00:04:34.440><c> we</c><00:04:34.680><c> have</c><00:04:34.800><c> the</c><00:04:34.919><c> verification</c><00:04:35.340><c> key</c>

00:04:36.230 --> 00:04:36.240 align:start position:0%
so we have the verification key
 

00:04:36.240 --> 00:04:38.210 align:start position:0%
so we have the verification key
we've<00:04:36.900><c> got</c><00:04:37.020><c> the</c><00:04:37.199><c> proofs</c><00:04:37.560><c> which</c><00:04:37.740><c> we</c><00:04:37.919><c> need</c><00:04:38.040><c> to</c>

00:04:38.210 --> 00:04:38.220 align:start position:0%
we've got the proofs which we need to
 

00:04:38.220 --> 00:04:43.370 align:start position:0%
we've got the proofs which we need to
Aggregate<00:04:38.639><c> and</c><00:04:39.540><c> the</c><00:04:39.780><c> public</c><00:04:39.960><c> signals</c>

00:04:43.370 --> 00:04:43.380 align:start position:0%
 
 

00:04:43.380 --> 00:04:45.890 align:start position:0%
 
and<00:04:44.100><c> there</c><00:04:44.280><c> you</c><00:04:44.460><c> go</c><00:04:44.520><c> so</c><00:04:44.940><c> we</c><00:04:45.540><c> build</c><00:04:45.720><c> the</c>

00:04:45.890 --> 00:04:45.900 align:start position:0%
and there you go so we build the
 

00:04:45.900 --> 00:04:47.749 align:start position:0%
and there you go so we build the
existing<00:04:46.380><c> circuit</c><00:04:46.620><c> for</c><00:04:46.800><c> two</c><00:04:46.979><c> proofs</c><00:04:47.460><c> and</c><00:04:47.639><c> now</c>

00:04:47.749 --> 00:04:47.759 align:start position:0%
existing circuit for two proofs and now
 

00:04:47.759 --> 00:04:49.909 align:start position:0%
existing circuit for two proofs and now
it<00:04:47.940><c> is</c><00:04:48.000><c> running</c><00:04:48.180><c> them</c><00:04:48.419><c> off</c><00:04:48.600><c> proof</c><00:04:49.380><c> so</c><00:04:49.680><c> it</c><00:04:49.800><c> will</c>

00:04:49.909 --> 00:04:49.919 align:start position:0%
it is running them off proof so it will
 

00:04:49.919 --> 00:04:52.189 align:start position:0%
it is running them off proof so it will
take<00:04:50.100><c> a</c><00:04:50.220><c> while</c><00:04:50.340><c> until</c><00:04:51.120><c> then</c><00:04:51.479><c> let's</c><00:04:51.720><c> just</c><00:04:51.960><c> try</c>

00:04:52.189 --> 00:04:52.199 align:start position:0%
take a while until then let's just try
 

00:04:52.199 --> 00:04:55.490 align:start position:0%
take a while until then let's just try
to<00:04:52.380><c> understand</c><00:04:53.000><c> how</c><00:04:54.000><c> does</c><00:04:54.360><c> it</c><00:04:54.540><c> all</c><00:04:54.720><c> work</c>

00:04:55.490 --> 00:04:55.500 align:start position:0%
to understand how does it all work
 

00:04:55.500 --> 00:04:57.350 align:start position:0%
to understand how does it all work
so<00:04:56.040><c> basically</c>

00:04:57.350 --> 00:04:57.360 align:start position:0%
so basically
 

00:04:57.360 --> 00:05:00.710 align:start position:0%
so basically
in<00:04:57.900><c> the</c><00:04:58.080><c> verification</c><00:04:58.500><c> of</c><00:04:58.860><c> a</c><00:04:58.979><c> plant</c><00:04:59.220><c> proof</c><00:04:59.820><c> you</c>

00:05:00.710 --> 00:05:00.720 align:start position:0%
in the verification of a plant proof you
 

00:05:00.720 --> 00:05:02.930 align:start position:0%
in the verification of a plant proof you
have<00:05:00.900><c> two</c><00:05:01.139><c> parts</c><00:05:01.380><c> the</c><00:05:01.800><c> first</c><00:05:01.979><c> part</c><00:05:02.220><c> is</c><00:05:02.580><c> the</c><00:05:02.759><c> G</c>

00:05:02.930 --> 00:05:02.940 align:start position:0%
have two parts the first part is the G
 

00:05:02.940 --> 00:05:05.450 align:start position:0%
have two parts the first part is the G
part<00:05:03.259><c> that</c><00:05:04.259><c> performs</c><00:05:04.919><c> the</c><00:05:05.040><c> computation</c>

00:05:05.450 --> 00:05:05.460 align:start position:0%
part that performs the computation
 

00:05:05.460 --> 00:05:07.430 align:start position:0%
part that performs the computation
required<00:05:06.000><c> for</c><00:05:06.060><c> pairing</c><00:05:06.479><c> check</c><00:05:06.600><c> and</c><00:05:07.259><c> the</c>

00:05:07.430 --> 00:05:07.440 align:start position:0%
required for pairing check and the
 

00:05:07.440 --> 00:05:09.710 align:start position:0%
required for pairing check and the
second<00:05:07.620><c> part</c><00:05:07.860><c> is</c><00:05:08.040><c> the</c><00:05:08.220><c> expensive</c><00:05:08.639><c> part</c><00:05:08.880><c> that</c>

00:05:09.710 --> 00:05:09.720 align:start position:0%
second part is the expensive part that
 

00:05:09.720 --> 00:05:11.749 align:start position:0%
second part is the expensive part that
is<00:05:09.840><c> the</c><00:05:10.020><c> pairing</c><00:05:10.380><c> check</c>

00:05:11.749 --> 00:05:11.759 align:start position:0%
is the pairing check
 

00:05:11.759 --> 00:05:14.450 align:start position:0%
is the pairing check
so<00:05:12.180><c> the</c><00:05:12.360><c> trick</c><00:05:12.600><c> is</c><00:05:12.780><c> that</c><00:05:13.620><c> in</c><00:05:13.860><c> the</c><00:05:13.979><c> aggregation</c>

00:05:14.450 --> 00:05:14.460 align:start position:0%
so the trick is that in the aggregation
 

00:05:14.460 --> 00:05:17.330 align:start position:0%
so the trick is that in the aggregation
circuit<00:05:15.000><c> we</c><00:05:15.660><c> verify</c><00:05:16.139><c> the</c><00:05:16.440><c> cheap</c><00:05:16.680><c> part</c><00:05:16.979><c> of</c><00:05:17.160><c> each</c>

00:05:17.330 --> 00:05:17.340 align:start position:0%
circuit we verify the cheap part of each
 

00:05:17.340 --> 00:05:19.370 align:start position:0%
circuit we verify the cheap part of each
block<00:05:17.580><c> proof</c><00:05:18.060><c> and</c><00:05:18.600><c> within</c><00:05:18.960><c> the</c><00:05:19.080><c> aviation</c>

00:05:19.370 --> 00:05:19.380 align:start position:0%
block proof and within the aviation
 

00:05:19.380 --> 00:05:22.670 align:start position:0%
block proof and within the aviation
circuit<00:05:19.919><c> we</c><00:05:20.520><c> accumulate</c><00:05:21.240><c> the</c><00:05:21.960><c> expensive</c><00:05:22.440><c> part</c>

00:05:22.670 --> 00:05:22.680 align:start position:0%
circuit we accumulate the expensive part
 

00:05:22.680 --> 00:05:24.409 align:start position:0%
circuit we accumulate the expensive part
of<00:05:22.860><c> each</c><00:05:23.039><c> block</c><00:05:23.220><c> proof</c><00:05:23.699><c> into</c><00:05:23.880><c> a</c><00:05:24.180><c> single</c>

00:05:24.409 --> 00:05:24.419 align:start position:0%
of each block proof into a single
 

00:05:24.419 --> 00:05:26.689 align:start position:0%
of each block proof into a single
accumulator<00:05:24.900><c> single</c><00:05:25.860><c> pairing</c><00:05:26.160><c> check</c><00:05:26.340><c> and</c>

00:05:26.689 --> 00:05:26.699 align:start position:0%
accumulator single pairing check and
 

00:05:26.699 --> 00:05:28.790 align:start position:0%
accumulator single pairing check and
that<00:05:26.820><c> is</c><00:05:26.940><c> the</c><00:05:27.060><c> final</c><00:05:27.180><c> accumulator</c><00:05:27.780><c> and</c><00:05:28.620><c> we</c>

00:05:28.790 --> 00:05:28.800 align:start position:0%
that is the final accumulator and we
 

00:05:28.800 --> 00:05:30.710 align:start position:0%
that is the final accumulator and we
expose<00:05:29.160><c> the</c><00:05:29.340><c> final</c><00:05:29.520><c> accumulator</c><00:05:30.000><c> as</c><00:05:30.539><c> the</c>

00:05:30.710 --> 00:05:30.720 align:start position:0%
expose the final accumulator as the
 

00:05:30.720 --> 00:05:32.629 align:start position:0%
expose the final accumulator as the
public<00:05:30.900><c> input</c><00:05:31.320><c> of</c><00:05:31.500><c> the</c><00:05:31.680><c> proof</c>

00:05:32.629 --> 00:05:32.639 align:start position:0%
public input of the proof
 

00:05:32.639 --> 00:05:36.350 align:start position:0%
public input of the proof
now<00:05:33.180><c> the</c><00:05:33.360><c> verifier</c><00:05:33.840><c> would</c><00:05:34.740><c> will</c><00:05:35.220><c> first</c><00:05:35.580><c> verify</c>

00:05:36.350 --> 00:05:36.360 align:start position:0%
now the verifier would will first verify
 

00:05:36.360 --> 00:05:39.650 align:start position:0%
now the verifier would will first verify
the<00:05:36.840><c> proof</c><00:05:37.259><c> of</c><00:05:37.560><c> the</c><00:05:37.680><c> aggregation</c><00:05:38.160><c> circuit</c><00:05:38.699><c> and</c>

00:05:39.650 --> 00:05:39.660 align:start position:0%
the proof of the aggregation circuit and
 

00:05:39.660 --> 00:05:41.749 align:start position:0%
the proof of the aggregation circuit and
then<00:05:39.840><c> we'll</c><00:05:40.199><c> perform</c><00:05:40.500><c> a</c><00:05:40.979><c> single</c><00:05:41.220><c> parent</c><00:05:41.400><c> check</c>

00:05:41.749 --> 00:05:41.759 align:start position:0%
then we'll perform a single parent check
 

00:05:41.759 --> 00:05:44.629 align:start position:0%
then we'll perform a single parent check
on<00:05:42.060><c> the</c><00:05:42.180><c> final</c><00:05:42.360><c> accumulator</c><00:05:43.259><c> and</c><00:05:44.100><c> after</c><00:05:44.340><c> this</c>

00:05:44.629 --> 00:05:44.639 align:start position:0%
on the final accumulator and after this
 

00:05:44.639 --> 00:05:47.090 align:start position:0%
on the final accumulator and after this
the<00:05:44.940><c> verify</c><00:05:45.360><c> would</c><00:05:45.539><c> be</c><00:05:45.720><c> satisfied</c><00:05:46.199><c> of</c><00:05:46.919><c> the</c>

00:05:47.090 --> 00:05:47.100 align:start position:0%
the verify would be satisfied of the
 

00:05:47.100 --> 00:05:49.370 align:start position:0%
the verify would be satisfied of the
proof<00:05:47.520><c> of</c><00:05:47.820><c> the</c><00:05:47.940><c> aggregation</c><00:05:48.479><c> aggregated</c>

00:05:49.370 --> 00:05:49.380 align:start position:0%
proof of the aggregation aggregated
 

00:05:49.380 --> 00:05:51.409 align:start position:0%
proof of the aggregation aggregated
proofs

00:05:51.409 --> 00:05:51.419 align:start position:0%
proofs
 

00:05:51.419 --> 00:05:54.110 align:start position:0%
proofs
and<00:05:51.840><c> that</c><00:05:52.020><c> is</c><00:05:52.199><c> it</c>

00:05:54.110 --> 00:05:54.120 align:start position:0%
and that is it
 

00:05:54.120 --> 00:05:56.810 align:start position:0%
and that is it
so<00:05:54.660><c> now</c><00:05:55.020><c> let's</c><00:05:55.320><c> go</c><00:05:55.680><c> back</c><00:05:55.860><c> and</c><00:05:56.100><c> check</c><00:05:56.340><c> whether</c>

00:05:56.810 --> 00:05:56.820 align:start position:0%
so now let's go back and check whether
 

00:05:56.820 --> 00:05:58.909 align:start position:0%
so now let's go back and check whether
the<00:05:57.240><c> equation</c><00:05:57.539><c> Securus</c><00:05:58.139><c> was</c><00:05:58.320><c> successful</c><00:05:58.680><c> or</c>

00:05:58.909 --> 00:05:58.919 align:start position:0%
the equation Securus was successful or
 

00:05:58.919 --> 00:06:00.890 align:start position:0%
the equation Securus was successful or
not<00:05:59.039><c> and</c><00:05:59.759><c> you</c><00:05:59.880><c> can</c><00:06:00.000><c> see</c><00:06:00.120><c> over</c><00:06:00.300><c> here</c><00:06:00.479><c> it</c><00:06:00.660><c> was</c><00:06:00.780><c> a</c>

00:06:00.890 --> 00:06:00.900 align:start position:0%
not and you can see over here it was a
 

00:06:00.900 --> 00:06:03.650 align:start position:0%
not and you can see over here it was a
success<00:06:01.199><c> and</c><00:06:01.440><c> it</c><00:06:01.560><c> took</c><00:06:01.740><c> 22</c><00:06:02.160><c> seconds</c><00:06:02.419><c> so</c><00:06:03.419><c> that</c>

00:06:03.650 --> 00:06:03.660 align:start position:0%
success and it took 22 seconds so that
 

00:06:03.660 --> 00:06:07.070 align:start position:0%
success and it took 22 seconds so that
means<00:06:03.960><c> our</c><00:06:04.259><c> aggregation</c><00:06:04.860><c> Circuit</c><00:06:05.400><c> of</c><00:06:06.060><c> this</c>

00:06:07.070 --> 00:06:07.080 align:start position:0%
means our aggregation Circuit of this
 

00:06:07.080 --> 00:06:10.070 align:start position:0%
means our aggregation Circuit of this
of<00:06:07.740><c> these</c><00:06:08.039><c> two</c><00:06:08.160><c> proofs</c>

00:06:10.070 --> 00:06:10.080 align:start position:0%
of these two proofs
 

00:06:10.080 --> 00:06:13.249 align:start position:0%
of these two proofs
is<00:06:10.680><c> satisfied</c>

00:06:13.249 --> 00:06:13.259 align:start position:0%
 
 

00:06:13.259 --> 00:06:14.749 align:start position:0%
 
so<00:06:13.740><c> now</c>

00:06:14.749 --> 00:06:14.759 align:start position:0%
so now
 

00:06:14.759 --> 00:06:16.490 align:start position:0%
so now
you<00:06:15.300><c> might</c><00:06:15.360><c> be</c><00:06:15.479><c> wondering</c><00:06:15.780><c> okay</c><00:06:15.960><c> fine</c><00:06:16.259><c> we're</c>

00:06:16.490 --> 00:06:16.500 align:start position:0%
you might be wondering okay fine we're
 

00:06:16.500 --> 00:06:18.469 align:start position:0%
you might be wondering okay fine we're
able<00:06:16.680><c> to</c><00:06:16.800><c> aggregate</c><00:06:17.280><c> a</c><00:06:17.460><c> lot</c><00:06:17.580><c> of</c><00:06:17.699><c> proofs</c><00:06:18.120><c> into</c><00:06:18.240><c> a</c>

00:06:18.469 --> 00:06:18.479 align:start position:0%
able to aggregate a lot of proofs into a
 

00:06:18.479 --> 00:06:20.749 align:start position:0%
able to aggregate a lot of proofs into a
single<00:06:18.780><c> proof</c><00:06:19.139><c> and</c><00:06:19.740><c> we're</c><00:06:19.860><c> able</c><00:06:20.160><c> to</c><00:06:20.220><c> save</c><00:06:20.520><c> a</c>

00:06:20.749 --> 00:06:20.759 align:start position:0%
single proof and we're able to save a
 

00:06:20.759 --> 00:06:23.450 align:start position:0%
single proof and we're able to save a
lot<00:06:20.880><c> of</c><00:06:21.060><c> lot</c><00:06:21.419><c> and</c><00:06:21.660><c> call</c><00:06:21.840><c> data</c><00:06:22.380><c> and</c><00:06:23.220><c> the</c>

00:06:23.450 --> 00:06:23.460 align:start position:0%
lot of lot and call data and the
 

00:06:23.460 --> 00:06:25.969 align:start position:0%
lot of lot and call data and the
execution<00:06:23.940><c> but</c><00:06:24.539><c> what</c><00:06:24.900><c> are</c><00:06:25.080><c> we</c><00:06:25.259><c> increasing</c><00:06:25.800><c> in</c>

00:06:25.969 --> 00:06:25.979 align:start position:0%
execution but what are we increasing in
 

00:06:25.979 --> 00:06:27.890 align:start position:0%
execution but what are we increasing in
exchange<00:06:26.400><c> the</c><00:06:27.060><c> thing</c><00:06:27.240><c> that</c><00:06:27.360><c> we</c><00:06:27.479><c> incur</c><00:06:27.780><c> in</c>

00:06:27.890 --> 00:06:27.900 align:start position:0%
exchange the thing that we incur in
 

00:06:27.900 --> 00:06:30.050 align:start position:0%
exchange the thing that we incur in
exchange<00:06:28.259><c> is</c><00:06:28.440><c> the</c><00:06:28.620><c> approval</c><00:06:28.979><c> cost</c><00:06:29.160><c> it</c><00:06:29.639><c> is</c><00:06:29.819><c> very</c>

00:06:30.050 --> 00:06:30.060 align:start position:0%
exchange is the approval cost it is very
 

00:06:30.060 --> 00:06:32.330 align:start position:0%
exchange is the approval cost it is very
computationally<00:06:30.720><c> expensive</c><00:06:31.259><c> to</c><00:06:31.919><c> generate</c>

00:06:32.330 --> 00:06:32.340 align:start position:0%
computationally expensive to generate
 

00:06:32.340 --> 00:06:36.469 align:start position:0%
computationally expensive to generate
aggregated<00:06:33.300><c> truths</c><00:06:33.960><c> so</c><00:06:34.319><c> for</c><00:06:34.560><c> 25</c><00:06:34.800><c> proofs</c><00:06:35.580><c> it</c>

00:06:36.469 --> 00:06:36.479 align:start position:0%
aggregated truths so for 25 proofs it
 

00:06:36.479 --> 00:06:39.350 align:start position:0%
aggregated truths so for 25 proofs it
takes<00:06:36.660><c> 27</c><00:06:37.199><c> minutes</c><00:06:37.500><c> and</c><00:06:37.919><c> for</c><00:06:38.100><c> 50</c><00:06:38.340><c> proofs</c><00:06:38.940><c> it</c>

00:06:39.350 --> 00:06:39.360 align:start position:0%
takes 27 minutes and for 50 proofs it
 

00:06:39.360 --> 00:06:42.050 align:start position:0%
takes 27 minutes and for 50 proofs it
takes<00:06:39.479><c> 58</c><00:06:39.900><c> minutes</c><00:06:40.139><c> on</c><00:06:40.620><c> a</c><00:06:41.039><c> pretty</c><00:06:41.280><c> beefy</c>

00:06:42.050 --> 00:06:42.060 align:start position:0%
takes 58 minutes on a pretty beefy
 

00:06:42.060 --> 00:06:43.309 align:start position:0%
takes 58 minutes on a pretty beefy
machine

00:06:43.309 --> 00:06:43.319 align:start position:0%
machine
 

00:06:43.319 --> 00:06:46.610 align:start position:0%
machine
so<00:06:43.860><c> that</c><00:06:44.100><c> is</c><00:06:44.280><c> it</c>

00:06:46.610 --> 00:06:46.620 align:start position:0%
 
 

00:06:46.620 --> 00:06:48.950 align:start position:0%
 
and<00:06:47.220><c> that</c><00:06:47.400><c> is</c><00:06:47.580><c> it</c><00:06:47.699><c> from</c><00:06:48.000><c> my</c><00:06:48.180><c> side</c><00:06:48.360><c> thank</c><00:06:48.840><c> you</c>

00:06:48.950 --> 00:06:48.960 align:start position:0%
and that is it from my side thank you
 

00:06:48.960 --> 00:06:51.440 align:start position:0%
and that is it from my side thank you
for<00:06:49.080><c> listening</c>