ELFU@@8 @@@@888d d p pppm +++TTTDDPtd ((QtdRtdp ppSS/lib/ld-linux-aarch64.so.1GNUGNU]o$U+d+ _C0]]!c hF2o l"*/X8|9{D#' #d])VPA="v)*26 He v{i 4libm.so.6_ITM_deregisterTMCloneTable__gmon_start___ITM_registerTMCloneTablelog2libpthread.so.0__errno_locationwaitfmodfpowffrexpftanfsqrtflog10flogflog2fatan2fasinfacosflibc.so.6fflushstrcpyexitsrandfopenstrncmpoptindftellstrncpyputsforkputcharreallocabortstdinvsprintfmemchrstrpbrkstrspn__assert_failstrtofstrtolfeoffgetsstrlenprctlmemsetlocaleconvstrstrfseekmemcmpgetoptlongjmpvsnprintf_setjmpstdoutstrnlenmemcpyfclosemallocstrcasecmp__ctype_b_locoptargstderrstrncasecmpstrncatfwritefreadclock_gettimestrchr__ctype_toupper_loc__ctype_tolower_loc__cxa_finalizesyscallmemmovestrcmpstrerror__libc_start_mainferrorvfprintfstrcollfreeGLIBC_2.17GLIBC_2.27U 0pVxU            ( 0 8 @ H X ` (h 0p 8x @ H P X ` h p x               ( 0 8 @ H P X ` (h 0p 8x @ H P X ` h p x               0 8 @ H P X ` h (p 0x 8 @ H P X ` h p x             ( 0 8 @ H P X ` h p (x 0 8 @ H P X ` h p x            ( 0 @ H P X ` h p x  ( 0 8 @ H P X ` h p x           ( ( 0 8 @ H P X ` h p x ( 0 8 @ H P X ` h p x            ( 0 8 @ H P X ` h p x ( 0 8 @ H P X ` h p x           ( 0 8 @ H P X ` h p x  ( 0 8 @ H P X ` h p x         ( 0 8 @ H P X ` h p x   ( 0 8 @ H P X ` h p x        ( 0 8 @ H P X ` h p x    ( 0 8 @ H P X ` h p x       ( 0 8 @ H X ` h p x      ( 0 8 @ H P X ` h p x      ( 0 8 @ H P X ` h p x      ( 0 8 @ H P X ` h p x    ( 0 8 @ H P X ` h p x        ( 0 8 @ H P X ` h p x     ( 0 8 @ H P X ` h p x        ( 0 8 @ H P X ` h p x  ( 0 8 @ H P X h p x           ( 0 8 @ H P X ` h  p( x8 @ H P X ` h p x              ( 0 8 @ H P( X0 `8 h@ pP xX h p x                   ( 0  8( @0 H8 P@ XH `P hX p` xh p x                    ( 0  8( @0 H8 P@ XH `P hX ph xp x                     ( (0 08 8@ @H HP PX X` `h hp px x                    ( 0 8 (@ 0H 8P @` Hh Pp Xx ` h p x                  ( 0 8 @ H (P 0X 8` @h Hp Px X ` h p x               ( 0 8 @ H P X ` (h 0p 8x @ H P X ` h p x               ( 0 8 `@ H P X (` 0h 8p @x H P X ` h p x               ( 0 8 @ H P X ` (h 0p 8x @ H P X ` h p x               ( 0 8 @ H P X ` (h 0p 8x @ H P X ` h p x               ( 0 8 @ H P X ` (h 0p 8x @ H P X ` h p x               ( 0 8 @ H P X ` (h 0p 8 @ H P X ` h p x              ( 0 8 @ H P ` h p (x 0 8 @ H P X ` h p x            ( 0 8 @ H P X ` h p x ( 0 8 @ H P X ` h p x        ( 0 8 @ H P X ` h x     ( 0 8 @ H P X ` h p x       ( 0 8 @ H P X ` h x      ( 0 8 @ H P X ` h p x ! ! ! !  ! (! 0! 8! @! H! X!  `! h! p! x! ! ! ! ! ! (! 0! 8! @! H! P! X! `! h! p! x! " " " "  " (" 0" 8" @" H" P" X" `" h" p" x" " " " " " (" 0" 8" @" H" P" X" `" h" p" x" # # # #  # (# 0# 8# @# H# P# X# `# h# p# x# # # # # # (# 0# 8# @# H# P# X# `# h# p# x# $ $ $ $  $ 0$ 8$ @$ H$ P$ X`$ h$ p$ x$ $ $ $ $ $ $ ($ 0$ 8$ @$ H$ P$ X$ `$ h$ p% x% % %  % (% 0% 8% H% P% X% `% h% p% x% % % % % % % % % (% 0% 8% @% H% P% X% `% h& p& x& &  & (& 8& @& H& P& `& h& p& x& & & & & & & & & & & (& 0& 8& @& H' P' X' `' h ' p(' x0' 8'  @' H' P' X' `' h' p' x' ' ' ' ' ' ' ' ' ' ' ' (' 0' 8' @' H' P( X( `( hXh p( x ( (( 0( 8( @( H( P( X( `( h( p( x( ( ( ( ( ( ( ( ( ( ( (( 0( 8( @( H( P( X) `) h) p) xȅ  ) () 0) 8) @) P) X) `) p) x) ) ) ) ) ) ) ) ) ) ) ) () 0) 8) @) H) P* X* `* h* p * x(* 0* 8* @* H* P* X* `* h* p* x* * * * * * * * * * * * (* 0* 8* @* H* P+ X+ `+ h+ p + x(+ 0+ 8+ H+ P+ X+ `+ h+ p+ x+ + + + + + + + + + + + + (+ 0+ 8+ @+ H, P, X, `, h , p(, x0, 8, @, H, P, X, `, p, , , , , , , , , , , , , , , (, 0- 8- @- H- P(- X0- `8- h@- pH- xP- X- `- h- p- x- - - - - - - - - - - - - - - - . (. 0. 8 . @(. H0. P8. X@. `H. hP. pX. xh. p. x. . . . . . . . . . . . . . @ P  .  .  . / ( / 0 / 8 / @  / H (/ P 0/ X 8/ ` @/ h H/ p P/ x X/ `/ h/ p/ x/ / / / / / / / / / / / / /  /  /  0 0 ( 0 0 0 8  0 @ (0 H 00 P HX 80 ` @0 h P0 p X0 x h0 x0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0  1    1 1 ( 1 0  1 8 (1 @ 01 H 81 P @1 X H1 ` P1 h X1 p `1 x h1 p1 x1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1  1  2  2 2 ( 2 0  2 8 (2 @ 02 H 82 P @2 X H2 ` P2 h X2 p `2 x h2 p2 x2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3  3  3  3  3 ( (3 0 03 8 83 @ @3 H P3 P X3 X `3 ` h3 h p3 p x3 x 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4  4 (4 04 (84 0@4 8H4 @ HP4 P`4 Xh4 `p4 hx4 p4 x4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5  5 (5 05 (85 0@5 8H5 @P5 HX5 P`5 Xh5 `p5 hx5 p5 x5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6  6 (6 06 (86 0@6 8H6 @P6 H`6 Ph6 Xp6 `x6 h6 p6 x6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7  7 (7 07 87 (@7 0H7 8P7 @X7 H`7 Ph7 Xp7 `x7 h7 p7 x7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8  8 (8 08 88 @8 (H8 0P8 8X8 @`8 Hp8 Px8 X8 `8 h8 p8 x8 8 8 8 8 8 8 8 8 8 8 9 9 9 9  9 (9 09 89 @9 H9 P9 (X9 0h9 8x9 @9 H9 P9 X9 `9 h9 p9 x9 9 9 9 9 9 9 9 9 : P: : :  : (: 0: 8: @: H: P: X: (`: 0h: 8p: @x: H: P: X: `: h: p: x: : : :  : : : : : : ; ; ; ;  ; (; 0; 8; @; H; P; (X; 0`; 8h; @p; Hx; P; X; `; h; p; x; ; ; ; ; ; ; ; ; < < < <  < (< 0< @< H< P< X< `< h< (p< 0x< 8< @< H< P< X< `< h< p< x< < < < < < < = = = =  = (= 0= 8= @= H= P=  X= `= h= (p= 0x= 8= @= H= P= X= `= h= p= x= = = = = = = > > > >  > (> 0> 8> @> H> P> `> h> p> x> (> 0> 8> @> H> P> X> `> h> p> xP> > > > > > ? ? ? ?  ? (? 0? 8? @? H? P? X? `? h? p? (x? 0? 8h @? H? P? X? `? h? p? x? ? ? ? ? ? ? ? @ @ @ @  @ (@ 0@ 8@ @@ H@ P@ X@ `@ h@ (p@ 0x@ 8@ @@ H@ P@ X@ `@ h@ p@ x@ @ @ @ @ @ @ @ A A A A  A (A 0A 8A @A HA PA XA ` `A (hA 0pA 8xA @A HA PA XA `A hA pA xA A A A A A A A A B B B B  B (B 0B 8B @B HB PB XB `B (hB 0p8pB @xB HB PB XB `B hB pB xB B B - HHI pXI hI  h `p(@J 08PJ @HH= PXX`J `phhJ p l h0l @l Pl hXl hl @ xl  y (y 0y 8y @y Hy Py Xz `z h z p0z x@z Pz Xz `z hz pz xz z z z z z z z z z z z z z z z (z 0{ 8{ @{ H{ P({ X0{ `8{ h@{ pP{ x`{ h{ p{ x{ ` X p X X ^ ^ ^ Xi k `i x      X  (  0  8  @ hi H  P X X  `  h  p  x  Xh  P      `E  `G  0E  PF PB !H! !C!( !C@! H!0 P! X! `! p!0 x!HJ! !I! !U!Ȇ !O!І !PW! !H! !I! !L! !N" " M"0 "XI "@ ("Y0"H 8"T@"X H"HP"h X"L`"x h"M" "Hd" "Hb" "b" "a" "@f"( "a"0 "\"8 "Ha#@ #c#( #e #P (#d0#X 8#a@#` H#`P#@X X#P_`#h h#^p#p x#c#x #[#@ #0]# #]# #\# #\# #H\#= #b#؇ $ $ $ @$ H$XpP$ X$m`$ȏ h$np$x x$$؍ $$Џ $8m$؏ $$Y $g$ $j$H$ $$ $Pi$W $h%W %ho%> %h % (%؜0% 8%@% H%`%X h%p% x%p% %Ю% %%/ %%h& %%6 %% %% %x& &&Y & & (&H0&Б P& X&| `&n h& p& x& &H & & &( &0 &&" & &8 &@ & 0 &0 & &0= &p> &H 'P 'X ''` 'h ('p 0'x 8' @' H' P' X' `' h' p'Ȗ ' '( 'p ' '8 '0 '@ 'P '` '3'h 'X/' '.( (1(x (+ (" (( -0( 8( -@(' H(+P( X(2`( h(3p( x(H+( (*( (*( (8*(h3 (H'(X (1(Ș (((H ('(= (&)ؘ )P0) ) @)@ H)6P)H X)@:`)P h)h6p)X x)p9)` )8)h )X8)p ):)x )9) )5)(0 )`7) )6) ) 5*8* *H(*@*8H*P*HX*p*x*4*@w *xH*P**@I ** **X*f*`**0 *h[* *;-@ -أ (- 0- 8- @-0 P-PX-$`-h- p-3-p- -`-Т -b-X- -3-3-`-p2.0y.P'. .%(. 0.X 8.&@.hwH.t P.p `.h.0p.C . .3.-. *.3.w. . ..y. .. . . ./B / //H /(9(/K0/`8/` H/P/p X/O`/ h/h p/.x//ء /4/>/`4//3/ܡ / / /x 22383@3H3P3X3`3h3@w 3xH4P44 4 4X(4f04`84@40 H4h[`4 h4( p40 x48 4 4 4 4~ 4~ 4 4t 4t 4 4q 4 q 4 4g 4g 4( 4p^ 5x^ 58 58K 5@K 5H (57 057 85X @5 H5 P5h X5 `5 h5x p5 x5 5 5 5 5 5 5 5 5ԏ 5؏ 55lz 5pz 5 5j 5j 5 6D 6D 6 6h6 6p6 (6 06T% 86X% @6 H6 P6 X6 `6 h6 p6 x6 6 60 6D 6H 6@ 6 6 6P 6` 6h 6` 6 6 6x 6̆ 6І 7 7Ti 7Xi 7 74! (78! 07 87h@7pH7X P7xX7`7 h7p7x7 777 7X7`7 7b7b7 7R7R70 7<7<7@ 7 8(8P 8h8p 8` (80888p @8H8P8 X8`8h8 p8x88 8P8Q8 888 888 888 888 9h9p09X 89=@9B H9@P9X X90"`9X h9!p9W x9H<9W 9X99X 98 9Y 9 9Y 9 9 Y 9 9(Y 9 90Y 99@Y 9:PY :@:`Y : :pY (:P0:Y 8:p@:Y H:pP:Y X:``:Y h:@p:Y x::Y ::X ::X ::X :P: :p: X :p:W :@:(X :;Y ; ;Y ;6 ;Y (;50;Z 8;4@;Z H;3P;(Z X;3`;0Z h;p2p;@Z x;;;PZ ;1;XZ ;p$;@ ; ;HX ;-;PX ;p,;`X ;8+;hX ;P(;hZ ;x%<xZ < <W (<H<0<W 8<X9@<W H<x8P<W X<7`<W h< p<X x<6<X <5<X <4<X <84< <3<pT <;< X <3< <p2<(X <1=0X =0=8X =`/ =@X (=.0=HX 8=-@=PX H=p,P=`X X=8+`=hX h=P(p=X x=x%=X =p$=X =#=X =0"=X =!=X =0=X = =X =6>X >B> ^ > B >(^ (> B0>] 8>hF@>8) H>?P>8^ X>8A`>@^ h>@p>P^ x>@> >XI>W >HH>^ >PG>X^ >x?>h^ >?>] >K> >K? ?hJ?] ?hF ?] (?hF0?pT 8?(O@? H?XIP?] X?M`?w h?Lp?^ x?XI?W ?HH?^ ?HH?^ ?PG?^ ?PG?0X ?E?X ?E?X ?@E?X ?N@X @R @@^ (@`R0@P^ 8@`R@@8^ H@QP@ ^ X@(Q`@(^ h@(Qp@* x@[@# @[@` @[@u @[@] @`a@ @`@] @[@] @[ApT AZA` AZ A` (A@Y0A` 8AX@A` HAWPA` XAW`A` hA@VpA xA_A^ A_AW A^A^ A^A0X ApUAX ApUA^ A]A^ A]AX ASBX BHT BX (B0B@Z 8B@Bi HBfPB0X XB{`B hBpBW xBB^ Bh|Bj BBj BxBi BBxi ByBHi BPyBi BhwBi BuCi CtCi Cs Ci (CPq0Cj 8C8@C@ HCpfPCi XCXp`Ci hChmpCi xC8lCi CkCj CcC@X CeCpT CCW ChCPi C~C^ CD^ DD^ Dh| DXi (D0D`i 8Dx@DX HD{PDhi XDz`Dpi hD0zpDX xD@Dxi DyDHi DPyDi DD DDX DPyDi DDi DhwDi DuEi EtEi Es Ei (EPq0Ei 8EXp@Ei HE@nPEi XEhm`Ei hE8lpEi xEkEX E@kEX EhEi EEX EpEpT EpE0X E8E^ EFi F(Fk F`0F0X 8F8@F^ HFPFi XF(`Fk hF`pFpT xFpFk FPF^ FFX F8FX FFk FPFX FFpT FGn GGn Gت Gn (Gت0Gn 8Gx@Gn HGxPGn XG`pGpT xGGH- GG GGn GGn GGn GGn GتGn GتGn GxHn HxHX H0HXr 8H@H`r HHPHhr XH`Hxr hHpHr xHHr HHr HHr HH3 HHr HHr HHX^ HH4 HIh IػIr I@ Ir (I`0Is 8I0@Is HI0PI XIpIX xI(Is IIs IIt IIt IH-x- -----.X.(x.+@/E/K/Q0000 0(0 00 80 @0 H0 P0X0`0h0p0x0000000000 0!0"0#0$0%0&0'1)1*1+1, 1-(1.01/810@11H12P13X14`15h16p17x18191:1;1<1=1>1?1@1A1B1C1D1F1G1H1I2J2K2L2M 2N(2O02P82R@2SH2TP2UX2V`2Wh2Xp2Yx2Z2[2\{{_{G?    @ @"  @B @b @ @ @ @ "@ &@" *@B .@b 2@ 6@ :@ >@ B@ F@" J@B N@b R@ V@ Z@ ^@ b@ f@" j@B n@b r@ v@ z@ ~@ @ @" @B @b @ @ @ @ @ @" @B @b @ @ @ @ @ @" @B @b @ @ @ @ @ @" @B @b @ @ @ @ A A"  AB Ab A A A A "A &A" *AB .Ab 2A 6A :A >A BA FA" {SД7[c*ksc'D R#@R9R9R$ @_9#B9$$@9# @_9"(@9!@9_9?9Eҡ!@?Aҡ!@=ҡ!@9ҡ! 5ҡ!`1F@kmT |@!*7 'z` @KT'@@@9@5'@@@9 5D@955! д' RF& DD@9$@9qC@9q!qB F'*@@@95 @@@95'@@@9`4ҡ! @@!55F'@@ 5F@ F RF}҄@H@!c@c ҄˂ qT#F'c@(@3R;R!4)3R*SA[BcCkDsE{Ǩ_B!Ҡc GR4c@fs#F'c@@#F'c@@'@@a!@.zp'?q D$@9C@9q!qB3 FB!F@@VB!GPB!GJҡ!Z @0,*`5+@ 'ҡ!F@&@!{,ҡ!9@"@!nҡ! ,@!,G!@I! "G 41To@raTx!T! <! 5F'@@ 43R[ @! @Й@!4@@< ҡ! @*@B)%X@ҢB?@@@5@RR@l4F!`@@N @B)!@H @@nd!= F@F@r ! 1 3RRRR!RR5ARB2R*5ҡ!  F'@@z4 4@AqT! F3R@@@! \ `4wF3R@@@! K@#GclGFb RSA{¨_ց!=[ R?D@@AT_{SRWSA{¨Z  DM{S[CR>:?F`@@`@!>@`W`@!@fR`@A@Z`@R@߫`@RarB>@B`@@uXqaTF!@@Q@!@Q@"R@Q@R@{@SA[B@ _`@!@kQ`@RarBR@9Y`@R@`@!?@F`@@R`@A@Z {!`JR{_{!RslT@@48R!F"{¨_ {S*q@TqT q@T*SA@{è_ЁB?!@*SA@{è_ЁB?!*SA@{è_ЁB?!*SA@{è_{Sc@"@a @@4T!c@B?B@!F@RSA{¨_"RR\b@!M RSA{¨_ւB?B@!  {[ !RT SF@A`5@#RASA R[B{Ĩ_sG`@ `A`75SA[B{Ĩ_a!+`4a!& 4!!@ 4a!4a!4a!@ 4a!+ ` 4a!1 5#RB|G#RBG! RSA[B{Ĩ_R[B{Ĩ_ւB?B! H#RBG۪#RBGԪ#RBGͪ#RBFƪ#RBF#RBG!RSAq{S*!sV4R!@(M!P RSA{¨_R!@(!A!O RSA{¨_ {!ShsG`@B`A@~5SA@{èRAR\!`RSA@{è_  @@? @__{#RBFARCc{Rar 'SĪRRWR4Д'!!@(eP!B> YRBީ!O RSA{¨_{ C@[{¨_ #@9C4$!ф(" %@9*c!xe h"8B#_85_R_ BB%Х( $@8c |Sf8d8d8f8Th"8_Rr|!!` |KtS_  | _`@9 4#c(c``8qhT!bb8_qTha8*!B5_R_((C@8c8qTFQ_q TQ(BG}S)%@9c $@9!Ee8Dd8|S*d8%_8$_8Ee8Dd8|S*d8$_8%_8? Dd8Ee8*d8!TQB K_q#T%@9($@9_qe8d8|S*$9T# @9_q"@9c8b8c|Sb*"9T" @9#$ @9! b8d8*"8`?9Q_"# ! HQq-T$Є(Re@9 c k|Se88f_8e_8SE*e88f_8e_8 SE*e88e_8e88 T_k T$g8#c(BQc_k|S|@dd89TB%g8 $hb8SD*dd88!hb8! Saa889_!g8!Saa889_R C|B _q@c|Zc ` _q TLQ mR)Ќ}S)(-R.R) ˂rR]r @9 @9 *||p`ӃK`ӆKC F c|Sg<dJc |&f8c<8`K#c88D c|Sc c<#c88 TyS c #_ k`T9_""-RƂrR%Х(G_8hc|F`KB A|S"<! b8!<a89#(89R,R "@94$@9d4&@94/(!  CRR+RR)R$@9D4&@9! &4b8*d8f8 B _ kD|Si#8i#8Љc"@955_ (RRb8d8<A<k"Hz! TB_qT9_9G4_R_RR/ @94%Х(!ѥ*R *!b8ha8qc0B5aURAUr|!a"xSA KqT@ qZ_R_ {S[*3qMTQu a@83T%3SA[B{ڨ_{SSr$T[A@Qs*?@qRTSA[BsE{˨_#*c7Rxk:Y3#B9~@58 R|Q d~`g 3*|fd8DK|!`8" K?j|e"g8?jK|g! "f8j|f"K?j e8K|e! "jg8|g""Kj! Kf8f&| "e8?j3*e*"|! g8j$K| f8"j"@Kj e8 "jB2 s.af$fBRk 8k<T@kTsR;R:Y~x c~`f 3*|ec8CK|!c`8a# K?j|dc#f8jK|fc `#e8j|Kec# jd8cK|dc `#jf8|f"c#Kj Ke8e&|c `#d8jd*3*c#| f8j#cK|c e8`#jc#@Kj d8 `#jB2 s.haffk 8@<_kT R3@SA[BcCkDsE{˨_RSA{˨_ ` @9RR* 4{k c_qT**Hc85_3qDRzDXz! TSB2[Rc#79RsR?y 9߀q`TK`89#xc4` 9RK`8?jT`9K`8?jT`9K`8?jT`9K`8?jT`9K`8?jT`9K`8?j`T`#9K`8?j T{'9K{8?jTSA[BcCsERkD{˨_R_*R ?qJ 8{3@zw*@5P6a~S3*Ka8 #*K!8UH6a K!|S #Ka8*K!8U@6a @K!|S #Ka8*K!8U86a`K!|S #Ka8*K!8U06aK!|S #Ka8*K!8U(6aK!|S #Ka8*K!8U 6aK!|S #Ka8*K!8U6aK!|S #Ka8*K!8U6a"K!|S #Ka8*K!8U6a& K!|S #Ka8*K!86a*@KK{8!|Ss. #Ka8*K!85`R@kT7@*B9HI 9SA[BcCsElK{8s.5*9p* Rj*@Rg*`Rd*Ra*R^*R[*RX RV {[#9*qRdAz!Rd@z@TS3]RsѥrĪRs|3rsas~KtvS~$`Ӕ|K~@o*t8z2q@TJqTbqTSAR[B{Ǩ_#A9[BJrSA{Ǩ_#A9[BJrSA{Ǩ_#A9kSA Հ@2_ {k+[@[vyrS~<c|7sSc B! 7C L1 @LVR L~x@9%?qTAh`8?qT*(T|@5iT8TD` d =<<RAzr@==_ {|R@)kCr9J @%@)9JG!*c@@) 9@03R J9 @[PPr @9W @S$R1X@HJ@`9 @J ! @ @sr:1*ZJ+X @IZ " J   BJZ { @B Z_Z 9[A)BDB J @+*JJo! JJ   Y JQJ SJ Xs J] E&*s J TX snBJs   YJZ[9 T%@ :*@JYJ9c9 a J + H !J ! YO sZ-*!d! {JG)"Jg FJ  {  !@X9[F\-@{G{ %*'JkJJ   z Z !XJUB [JZGZ * Js+*sJ s  S X)@L QJY {[1Jsn5@s 1 Y;*9JBX%  9 1J1 J Z[J9g9 ~:* s@JX G1@ !J !J e 1Z% sZ=@g h &3*JJ !J !  9[[ 9*[{c{ !dBJ! Z {@JXJB    ['JB\B ZWZ  Jg>*J1  '  !X1b1 {[\JsJs G;* JJ    G  BXZ[d 9K9 'J|:* JJ o@     sZ<3*1ZS h JJc   Jc    chc XJ9[s@!`! J{  {JJz   z ' X Z_Z [;JBLB gJ{  {JJq  G !X   [J1V1 sN{ s {JcXGJf   f so@J [X \B  9JZ[9 D9J %  fJ%  1ZJd  \J   JYX do@ JsZ @B  BJJC G  C ! !JX; cPb a ; J! X!J{g{ J:  c : cJXc Zc Z # AJ! [!JcPc ~Jw@3   J3 1  {[9 a^! BXSJ9G9 qJs 1 sJ1Jg S  s % cX sVs Z['J\ 1J 1 {@J1J <     9[Wd 1X JaJ ! J!J "    " XJ{g{ Ad! sZJ JB BJ  Z   Z [{cLc ~J ZSZ X'JJ   J  g "X R o@#*{[!J1f1 .tR.ۭr%  GJ%  J  T 3 0*cX!Jsjs < A Z[N)< !JZ! O!J & ! & %*J1Z D  aJ ! X!J{k{ ! " y<*A 9J#  # !L' sZJadB ! BJ[w@Z #;* cJ " p P U X'*J cJbއR{[r!*q  9Jq %  % 1^# Xq/*\ 1J !X3 0*1J3 1   sfs Yq#*O 1J%*Z& 1 9J& ; 9 ; D yX#3*{Gf XcJo@g <* cJc   sZ! T [1*!H# Ja&* !J 0   1Z! a X !`% '*!J{9 @#* !J{X:  ! 9k9 X'/*!L! J#%* cJY| s@sRg c  c w@drsjg chc 9*ZJXe!*Q J  Q  :X 1J1 9[wl &'*J%#* J    e XҩRR P 1*{JpX!*o cJ s o  1Zc M ;X&*cdc sJa%*y !Js ! n y  X9o9 m 3/*sJXaJg !  !Jg 0 ! 0 H Y9*V !JS cX1 Jq ! !J9[! 1N 1 a 3'*sJYf !P!  f Js XsJL e  Ze 1*sJ1Zo H  o 3Js  sJe c &*S ZJc Y XB cDs ;XJBlB Jc 9 cJ9Jn !ݎR Mr' c  X' cHc YNJD gJ  JJ s@ BX    .JsZ1n1 F  JpJ   J  p 9[ ` 0J {_f J cXJ:  O J1Z   U Jo@` { {JXJb   J{    YJ{K{ s^B g BJXY J  Y J Y 9K9 bJ B BJXB cHf  J"  {[JBhB #J  c  cJ n l  JX9[c I NJcJ z  Jc    chc BXJXJi  oJ{@1 1J  ;  q ; Za {_{ XJqJs 1 sJ1Jy '   y ' Yh 9S9 sJJcXs  sJJb  b  s@{[B\ B  'J YsJlp w@ 9[s :Js Z ZJGJ sRs E   J1Z   P 1*JBXr*rm   dJ  JG  X&*c\c  *J sZD {G{  J* XJE g%*  J9    YaJ9c9 cX!Jb w@1n1 #*" J {[ B`G !J !J Y3 T !.*!J9[ sns % JO E "JB 1Z1*h XJBPB aJk   !Jc ! XsZc`c !\! &*KJJkJ9  y  BX 9S9 X/JM d%*J J  D  !X0Jl cX J #*P s J  9[F sJs J VJ YlM) .*XBJj ) E bJ % IJX) P $*sZBJ)a) JC ! Jb  B 9 XZBLB 9O9 &*!JcJ!J n  '  )Yh X! JI C%*!J cJ3 d  c 9[Jsns JXV "JV cTc **!JX& F  bJ! BJi I Yb(*!`! sZBJ)M) E J B JZY $J   9W9 cXJ"#* m@ B JV s A)J  )Y  @B  s  @BhB ) B !X!  )P)SA[BcCkDsE{Ȩ_{'RS*BSB[B* r`Tk@83T`QK! @8|SS? dzfJ`z&T*qaz`"Jbz TF3vrSW )}_qT_q`3T_q@8T:7>V}@$7>6}@R?@2_qT_q@T_qT9,7.6}@R27>6}@RY&7>V}1@.TqEz@zЅ(@944  *bh`85 kP6@9KR4kMTkTITj!8!?ha85_qFzjTBKKR ITj!8!_+ @Cz,T?2_qT_qT_qT#7.6}@DR_q@T_qTy7>6}@DR!7.6}DR7.V}iT@j!8!?W297.6}@riTRj!8!2_qT_qT_qT]`@94cQD$qTq`@8Ơ F `4qATY 7.}`@9`4@c`@94QwLqtT"B @X`xb@ ֹ7>V}@y"R:"R"R2`@9 4cbR`@9qT@4QwLqthT"B@X`xb@ Y7.}`@9@ 4c@@942B@@942B@@9@42B`@94QwLqt T7@@X`xb@ >ZC_q}$#q-T.*}$#qT.*}!#?q- T>*V}@!#?q T.*V}@qR@zRT ITj!8BQ_q!Fz T?@95`9*`9*d"#_qT>*v}"#_q T.*v}!!#?q- T>*V}@ $`9*@!#?qm T.*V}@!#?qM T.*V}@!#?q T.*V} 7>V}@?@K`9*@j`9*@9 4  *bh`85qkЅ`9*!#?qT>*V}@h7>V}@#"#_q T>*v}`9*@"#_qT>*v})qG6KRt`9*@<`9*`9*@"#_q T>*v}`9*@/`9*"#_qT>*v}`9*`9*`9*R2BRBRRBRRRLR{C/## )/C/'D'===#='=+=/=3= C{Ш_{R{_{S[Fc@D@ @! &@CAC'`@?*F 7k@T @3 4*SA[BcC{Ǩ_C#9F@ @A**SA[BcC#@{Ǩ_* @!! 1@"@6&@A#C F@* 5@@`#@@R!!*SA[BcC{Ǩ_#@#@@@!!*F {S[Fc@D@@! &@CAA'˄`@?*F 7k@T @3 4*SA[BcC{Ǩ_C#9G@ @AS**SA[BcC#@{Ǩ_* @!!`"@" @6&@A#C G@3* 5@@`#@@R!! !*SA[BcC{Ǩ_#@#@@%@!!!~*F {CC/## )/C/'D'===#='=+=/=3= C{Ѩ_ {SF[@ @ C?T/;*!!`#A!@R!$Bqm TcJ<!RG<"R*cZGV?!!#/@@R$[!_f;qTk9:9$Z#TR <*<"R*1G-?"@R!75C;kTcCkDa"!$@RRSA[B{ƨ_/@@R[!_);kaTcCo"aB! @~;!*!`#zAq Tc;!R;"R*cF>BR !!#DBR `$/!:q T67еւ$#TR"!:k`T;*;"R*F>BRBR!:kTRSA[BcC{ƨ_ {SF[@ @ C?T/:*!!`#A!@R!$Rqm TcZ;!RW;"R*cjFf>!!#Ύ/@@R4[!_v:qTk9:9$Z#TR0;*-;"R*AF=>"@R!75S:kTcCkDa"!$@RRSA[B{ƨ_/@@R[!_9:kaTcC"aB! -@~:!*!`#@q Tc:!R:"R*cE=BR !!#TBR `$?!9q T67еւ$#TR2!9k`T:*:"R*E=BR$BR!9kTRSA[BcC{ƨ_ {SF[@! @ C?cT/9*!!`#@q Tco:!Rl:"R*cE{=!!#/@@RI[!_9qTk9:9$Z#TR D:*A:"R*UEQ="@R#!75g9kTcCkDa"!$@RRSA[B{ƨ_/@@R [!_M9kaTcC"aB! A@39!*!`#?q Tc9!R9"R*cE=BR !!#hBR `$S!9q T67ւ$#TRF!9k`T9*9"R*D<BR8BR#!8kTRSA[BcC{ƨ_ {CC/## )/C/'D'===#='=+=/=3= C|{Ѩ_ {SF@ @ A?T!Rs ` R@]@SA?k{Ũ_"BBa! "BB`a! @[8!*!`#>q TcG9!RD9"R*#WDS<R !!#R `$!c8q T68ւ$#TR!U8k`T9*9"R*'D#<RR^!38kTcCRSA[B{Ũ_{SF[@! @ A?T/8*!!`#}>q Tc8!R8"R*cC;!!#I/@ R[!_7qTk9:9$Z#TR 8*8"R*C;"*!757kTcCkDa"!$*{RSA[B{ƨ_/@ R q[!_7kaTcC"BB`a! @7!*!`#>qTc[8!RX8"R*ckCg;BR !!#͋BR `$!w7q T67ւ$#TR!i7k`T*8*'8"R*;C7;BRBRr!G7kTRSA[BcC{ƨ_{a!S=RДb2z!/7!!%=Ro!SA{¨"7 {!RS[@d@ Հ@9q h`x@zTsB< RSA[B{Ĩ_5 @9_qB"hbxB@@zTT{!RS[]@dS@ss@9 x`x@o75B_TC@9@#xcxo7BB^< RSA[B{Ĩ_{!RS.@@scb@9@Ӏh`x o7@xlqTd`ds#RcsTb@9BxB_lqT_tqTcqaTbB#<@aB<@RSA@{Ĩ_@< RSA{Ĩ_!!`&pRSA@{Ĩ_!!'; RSA@{Ĩ_ {!RcS[ckю /@5 *@s4<T`Tjs8t>@x`xo7qSi Tjs8*@@h`xh7s>@@*js8!@X@B!hbxh7@a>?qcSBxx78*(T?q'*4; RSA[BcCkD{ƨ_ ՠ@*78CTK@*! 4B|@; RSA[BcCkD{ƨ_"aB%! RR*q*'*{!RS[c` #ARZ`#@hT'@h T#@'@{#@R@a<"<@ Tjb8#x`x@o7"<@!i T<@jb8 B<@<j#8T<@9#'@R@a<"<@Tjb8#x`x@o7"<@!T<@jb8 B<@<j#8T<@9'#@T"4R;., RSA[BcC{Ũ_!R;ҿ!!`(h!!'c"B%B`a! ["B%B`a! Sq {a! ;R!4! @{¨>5 {SүRNj#8: RSA{¨_ { G@+R{_ {!R @_@T RR @{è_!!*R @{è_ {q )   RR j 8 @{¨_{S^^*5RR*SA@{è_4R*SA@{è_   _@R&R`@9qbAT *\q`TcqRbAbT(qMze@9@T*cqbATF)_`@9c {S@Ta@9"$Q?qB@AzT"0QB_qhTsT R*SA{è_?q@T?q T T?q(T?qT?qT `N!@s"R<*SA{è_a@9?(q$Mz@TsAT?xqT?q@T"x?|qBQB@Yz T e! @(X  @&ѣ'_kT(@ha8Ch&8cja8bxdQBQB_dqT|qJzHT!T?qhTBR@C "R !ѓ&?qT?qT"QB_qT"x?|qBQB@YzT"QB_q)T?7(@fc "Rh!8?q"A@z Td! "R  {[c1_qRT{@[BcC _S+"@Rk`3G9UC:9#/_9 94O@ TT T[@q4!!`+l4!1g5@R5 R{@SA[BcCkD+@ _֠@qTqa T@TT"!B*!/ZSARkD+@{@[BcC _ RW@@5!!++ 4!@4&5R`RR_"!B*!**RSAkD+@@ qTq!T!!@-`4!!`-5ARGG{!!. RSAkD+@WqT!!`,65c3Gl9`!!-5!RGV!! ._RSAkD+@1!!,RSAkD+@(BR!R!+ RSAkD+@!!-RSAkD+@ {"!RB8{@@R{_ {!RS6q T!R59 RSA{¨_R.9!!@9` RSA{¨_"!RB9O {S@94ѢҧR@adzqCdGzhax! @z@Thc85_@@SA{¨_R_RSA{¨_րR{!RS6 q T!R8 RSA{¨_R8!!9 RSA{¨_"!RB9 { @SxS|@,ba@ 38SA@{è$ @94{!8G81T7!8_1 T7ha8*!C5{_!!:R{_!!:R{_R_{!RS 64!R8 RSA{¨_R{8!!`; RSA{¨_"!RB9{@S@94!@hb8S4s"hsxCg7SAR{¨_?@ SA{¨_"!B@0!<R {!RS54!R:8 RSA{¨_R38!!@|@&``R)SA@{è_*!> !@>iSA@{è_!=!@>\!@?W*!?P{!R[&5@3ScC#c@4S@+@҂@#@8Ch 8+@_HTO@6@RSA[B@{Ȩ_#ci5B@0B@!! RV7 RSA[B@{Ȩ_RB@0B@!!RD7 R[B{Ȩ_ {!R3S4 `T^&W&!F!@!$@ R@SA{Ũ_B@0BA! ??@^&<B@0BA!  {!RS4R%B@J4 RSA{¨_B@0B!!XR6 RSA{¨_B@0B!!JR6 RSA{¨_{!RSg4 Gq*@z`T9q TSQRBRb?qT@9!!29@9!S9sTa@9@#Ӄhcx#o7qTR?qT@9!!29@s@99#&8aT|@@ R?h"8SA@{Ĩ_*!!!!>RSA@{Ĩ_"!RB`R {!RS4`*4*!!@OqLTa~@@` RSA{è_!!RO6 RSA@{è_bzS!!RB6 RSA@{è_B@0B !!R36 RSA{è_{!R#S[3ARC3G@4"8*>! -Tcj`8@ "Ch 8 ($T@5R*SA[B@{Ũ_!!@*SA[B{Ũ_!RB9"B@0B`A! {!RSz3OqlT*b@9b4҃@%bh!8!bja8b5 RSA{¨_B@0*B!!.!!xRSA{¨_!RB9R {!RS[A3 *4 |@c~@#'8*4K@'@@_TAn'@3R@*SA[B{Ũ_!!`4*SA[B@{Ũ_!!**SA[B{Ũ_֡L"!RB@{!RS2*4*w@3R*SA@{è_!!*SA@{è_"!RB f{!RS2 7*M@*7 RSA@{è_!! RSA{è_"!RB@ <!!` RSA@{è_ {!RS2 *4 3R*SA@{è_!! *SA@{è_"!RB  {!RS1'@s4"R3R9@R@ ? *SA{è_!! t*SA{è_ {AOR '!RS^8q T*!! * Ձ@?h 8kT RSA@{è_!! HRSA@{è_B@0BA! <{S[*,/*[/*B8 @OqlTSA[B{Ĩ_QT 74 `!`5*@ @ A? TAn!-"*B h !-SA[B{Ĩ_*!! !!SA[B{Ĩ_"*B`F @!<8@ !-!!o!!!!f!!"*B `@!< C *.4*.1TR B@0BA! B@0BA! B@0BA! xz*!$*f.*.B@0B!@c=B@0BA! [ {!RS`@4 RSA{¨_2 RSA{¨_B@0B A! ; {!RS[ AR @@_kA { RSA[B{è_B@0B@A! AR@ B@0B@A! @@_kAl@ B@0B@A! {!RS8[6@!R8AR,AR @@! Cl RSA[B{Ũ_!R0`8AR3@AR0C*@'! B@0B`A! B@0B`A! ARB!RBB@0B`A! @} {!RSAa@ 2 RSA{¨_B@0BA! ka@1 RSA{¨_ {!RS#``@`4qTb@a@@5B@0B!R2 RSA@{è_1!R{2RSA{è_1 RSA{è_B@0BA! "{!RS[@@43AR{/O@'4aRR/!^! d T&!  T@@Qq T@94QB!_`q 0#9 R@94 Q \qI T@R'9# 8@@95B!] 4B!W`4!@R5R2*@SA[B@{Ũ_! @*SA[B{Ũ_v5$e8@4i15R\@@"! 6RU@@QqT6R!L5R1*SA[B{Ũ_!B@0BA! pB@06RB!1yB@0B!)5RR1!@@R{!RS*@AR% @@@_kBЀ@B|_q T@QqTA|S@Oe@O!{dOOOchd@qMTf@ҥ@R hc8hc8kJT |S! 5ckT0 RSA@{è_B@0BA! tB@0BA! lR/ RSA@{è_{!RS[!@R`@c@qmT bh`8jb8!j"8a@?k,T5RKRR2  "/a@8 #/A\3T RSA[B@{Ĩ_B@0B`A! ! {!RS[c'm ҾRҸR@@qMTbh`8jb8!j"8@?k,T R ՠjs84@#4!^! ("z3A`)" %@)AbsTc)A!@b (h/A e/ A b/`RSA[BcC'Dm{Ũ_B@0BA! {!RSa@P/ RSA{¨_B@0BA! a@B/ RSA{¨_ {!RS[f@AR҂**-*: RSA[B{è_B@0BA! B@0BA! z{!RS8AR3``@@kT!RqTe@҆@!R գh`8h`8k!kLT/ RSA@{è_R/ RSA@{è_B@0B A! BB@0B A! :{!RS`@4pS|@a@?qMT R*Ra@!hb8#$A%B& C'D(E)Fc) 99Ak 99999@T 8Ba@?klT"pS"8. RSA@{è_ 8Ba@?kLTy. RSA@{è_B@0B@A!  {!RS[@@ 4@RR1@4Q a "W.@!hs8 #R.A1`!T RSA[B{è_>. RSA[B{è_B@0B`A! !RSA[B{è_ {!RS^`@4|@=bj"8b%.5 RSA@{è_. RSA@{è_B@0BA! r{!RS0b@a@|@b@a@. RSA@{è_B@0BA! M {!RS[ t@4v@6 qTzSs~@~@#'E-@ RSA[B{Ũ_!"RSA[B{Ũ_- RSA[B{Ũ_B@0B A! !  R {!RS`@4a@!|@b@a@- RSA@{è_o- RSA{è_B@0B`A! !RSA{è_{!RS@`@@4a@Rr|!!` |KtS<|@iq-e RSA@{è_6- RSA{è_B@0BA! !@RSA{è_ {!RSX`ARS`a@?qT҂@@c@ !a8ah 8a@?kT@aRSA{è_B@0BA! oAR2 B@0BA! b{!RS `a@`a@?qT!|@%d@˃@h`8dh"8a@?k T@ RSA{è_B@0B A! 7a@ B@0B A! *{!RS[c AR8qmTaR 8kLT@kTK*w`Qk TKs~@ ՠ@"@_8`h!8T RSA[BcC{Ĩ_*!RSA[BcC{Ĩ_*!RSA[BcC{Ĩ_B@0B@A! **!RSA[BcC{Ĩ_B@0B@A!  {S@!GSA@{è_B@0B`A! @! B@0B`A! ,SA@{è_{!RSK RSA{¨_B@0BA! u RSA{¨_ {!RS[,@ARX8@_k T7@!K*@RSA[B{è_*!BRSA[B{è_*!8RSA[B{è_B@0BA! ,B@0BA! $B@0BA! {!RSV RSA{¨_B@0BA! H RSA{¨_ {S[*bSR҂@!j`8Ch 8*CT[BSA{è_B@0B A! ^{SC$ < R{@SA@_{S`  3a`@!\G RSA{¨_AB *! a`@!\G RSA{¨_{!RSa` *!|S+ RSA{¨_B *B@A! {S( `P a`@!G~ RSA{¨_B *BA! o {S+3@ RB`aR` arC,!|0SA{¨_B *B!/M {S`2& RSA{¨_B *BA! 7`2 RSA{¨_{!RS@b@_qaT@b@! 12 RSA@{è_!/!`0 RSA{è_B *B A! B *B A!  {S`2D RSA{¨_B *B`A! `27 RSA{¨_{!RB S[Jze`!R @2R44R*SA[B{è_!R L @qT @kT* 72*`5!$!54R!1*SA[B{è_B *BA! B *BA! @"@9_qT!@9?qT24R!u$@ @!@2R"!2l*SA[B{è_B *BA! `B *BA! X!R$R*!3! 4J{B`S*|SA@{è_*B5xSA@{è_{!R R @{¨_B *BA! R @{¨_{!RSARs22*G* RSA@{è_B *B@A! AR B *B@A! {!RS@`2* * RSA{¨_B *B`A!  {SX 2`2SA@{è_B *BA! 2`2SA@{è_{!RS\AR `Ry5@a@2c RSA@{è_!6RSA@{è_B *BA! ~B *BA! vB *BA! n{!RS`AR`@22 RSA@{è_B *BA! KAR B *BA! >qB *BA! 222 RSA@{è_ {!RS`AR`N@22 RSA@{è_B *BA! AR B *BA! -B *BA! 22 RSA@{è_ {!RS``2 RSA{¨_B *B A! B *B A! `2 RSA{¨_{!RSk``2 RSA{¨_B *B`A! B *B`A! `2 RSA{¨_{!RS?``2 RSA{¨_B *BA! sB *BA! g`2q RSA{¨_{ @[ R{_ {!RS `2[a" RSA{¨_B *BA! = {!RSs2< RSA{¨_B *B A! {S404b@RAR@9b@@9`@ 9 RaSA{¨_"R RSA{¨_ {!RS``25a @!<] !!Z RSA@{è_aRJb@RAR@9b@@9`@ 9 RaSA{è_B *B`A! B *B`A! B *B`A! {!RSfa @!< RSA@{è_B *BA! a @!<B *BA! k RSA@{è_  {SC[uе8&ҙB7! 7 R{@SA[B _ {!@ R{_ {/S/ BR=ar`=,(!e,SA{¨_B9!?7 {S`B RSA{¨_B9B@!! !`B RSA{¨_{!RSb@_qTB RSA@{è_!/!@RSA{è_B9B!! B9B!! {S`BN RSA{¨_B9B!! `BA RSA{¨_{!RSn``B4 RSA@{è_! RSA@{è_B9B !! B9B !!  {BS*xSA@{è_*BtSA@{è_{!R R @{¨_B9B`!! qR @{¨_{!RS``B-5a@!< !V  RSA@{è_aRb@RAR@9b@@9`@ 9 RaSA{è_B9B!! 4B9B!! ,B9B!! ${!RSAR{sBB+)*Q& RSA@{è_B9B!! AR^ B9B!! {!RSLta_@ RSA@{Ǩ_B9B!! pB9B!! {!RSZta/@ RSA@{Ǩ_B9B@!! @jB9B@!! {!RS*Tta@v RSA@{Ǩ_B9B!! l:B9B!! `{!RS$ta"u@F RSA@{Ǩ_B9B!! < B9B!! 0{!RSta2E@ RSA@{Ǩ_B9B!!  B9B!! {!RS\taBo@ RSA@{Ǩ_B9B@!! B9B@!! {!RS,!R1Bl RSA@{è_B9B!! !RB9B!! BQ RSA@{è_ {!RS@`B]*$ RSA{¨_B9B!!  {S[1!RAR+`B2wsbj RSA[B{è_B9B!! X!RB9B!! LARB9B!! @{S B`B SA@{è_B9B@!! 'B`BSA@{è_{!RS|`AR#`@@B RSA@{è_B9B!! AR  B9B!! B9B!! @B RSA@{è_ {!RS8`AR3`@BB RSA@{è_B9B!! AR B9B!! kB9B!! BB RSA@{è_ {!RS`AR`H@BB RSA@{è_B9B!! uAR B9B!! h'B9B!! \BB RSA@{è_ {!RS ``B RSA{¨_B9B@!! 9B9B@!! -`B RSA{¨_{!RS``B2 RSA{¨_B9B!!  B9B!! `B RSA{¨_ {SuеB, R{@SA@ _{S! @!`@RybRy44@4s@SA@{Ѩ_֢5@n`@la@@SA@{Ѩ_`@! @! a@! RybRy5@b4bRy!  {RR $R"B !R&R"B !R%R "B !R%R"B!R%R!!RB@% R @{¨_ {S*B Rar5#!n'RaRy@0@a`2SA{¨_B!6Pya4@˺ @}{  @`Ry 4!R* @{¨_`@`Ry5Rb`RRy* @{¨_! !R* @{¨_ {S``@qMTc@ bx a@?kT RSA{¨_BB !!  {Sba`@BF!GB@B$@ RSA{¨_BB`!! {!RS[ ``@@94#`@@84a@`@BR"@9Q*$q TBB!H!RSA[B@{Ȩ_`@: RSA[B@{Ȩ_BB!! }!RB9o { @ `Ry5`@  R`Ry` RRb* @{¨_`@``Ry 5 R`Ry`a@b`@`@ Ra`@@! !@!R* @{¨_{SA@?q-T!Q?qT@e@q-T@ R@b@#hs8s@! @?kT*SA@{è_! R*SA@{è_@@@qT@RM@b@#hs8s@! @?kT*SA@{è_{B S*^p @SA@{è_`@@!B*Ho* q@!SA@{è_!BB!!  {!RSPy4`@@S`@!@RSA{¨_`@@F`@!RSA{¨_ {!RS``@gq RSA{¨_BB !! r{!RS{`Ry`4AR[sRy@5-b@BG@B@c@ RSA[B{è_!JRSA[B{è_!ARSA{è_BB`!! 6BB`!! .BB`!! &{!RS.AR) `Ry`5Ry@4!`RSA@{è_֡@`@* RSA@{è_BB!! BB!! {!RS[c# AR aR@C۳{` @#@!R!@ʳ qTS@@6@ !R߷qT RSA[BcC#@{Ө_K!RhBB!! AR6"aRz@Cz BB!! j{!RS[rARm'`@@@e RSA[B{è_BB !! EARR BB !! 8 BB !! ,{!RS[3` AR.@ aR) Ry4Ry@4@H@7b@@ RSA[B@{ݨ_ցRy@a 4Ry`5@'6A#@@@. RSA[B@{ݨ_BB`!! oBB`!! BB`!! ARBB`!! @۶ 7@@@@@@@@z@@{!RS[AR`Ry`5Ry@4! }RSA[B{Ǩ_ց@x@@@@ RSA[B{Ǩ_BB!! \BB!! TBB!! L{!RS[TARO`Ry`5Ry@4!5RSA[B{Ǩ_ց@0@@@е RSA[B{Ǩ_BB!! BB!!  BB!! {!RS[ @AR aRRy5Ry`5Ry@4!RSA[B{Ȩ_ց@#@@@@ RSA[B@{Ȩ_BB !! BB !! AR BB !! BB !! {!RS[ARaRB mRy5Ry`5Ry@4!`RSA[B{˨_ց@c@| D@@ŷ@ RSA[BcC{˨_BB`!! ^ARk`BB`!! R@cO@L CcG@BB`!! 5BB`!! - {!RS5*_qA!!| RSA{¨_BB!!  {!RS@* RSA{¨_BB!!  {!RS`AR`qǟ% RSA@{è_BB !! AR BB !! {!RS@AR |S RSA@{è_BB@!! AR BB@!! {!RS`AR`q RSA@{è_BB`!! sAR BB`!! f{!RSo@ARB`k aRy5[a@2[B RSA{è_! CRSA{è_AR[K`Ry5Ry@5C@cG@a@@׳ R[BBB!! ! RSA[B{è_BB!!  BB!! BB!! {!RS[ck@C#R@!RӳARγ ޯBRS@qMT|@u5R`y|p RSA[BcCkD{ڨ_@!aj48*49Q?qT Q@q~Sd@]zIT|Sc@c=A=`hT"@9 qS@* T! @9q3`*T!@$* RSA{¨_3@9* RSA{¨_!# BB! BB!  {!RS[ARx!q!@@A <e RSA[B{è_BB ! ARBB ! BB ! {!RS4! RSA{¨_BB`! {!RS RSA{¨_BB! q RSA{¨_ C4{SCU@҂@ R{@SA@C_{]S B+Rar'!`c,ZR! ,d@c0@dEdc2` SA{¨_B(!@+${!RS`b RSA@{è_B(B@! B(B@! `b RSA@{è_ {B+S*6hc@P q!Tc@qTSA@{è_*B,Ndc@P q TB(BZ!,̼SA@{è_B(BR!-SA@{è_{!R R @{¨_B(B! R @{¨_{!RSZRb( RSA@{è_B(B! ZRB(B! zb RSA@{è_ {!RSx ARs bb* RSA@{è_B(B@! QAR\@ B(B@! D{Sab`ASA{¨_B(B`! - {!RS2`AR/`@@b RSA@{è_B(B!  AR B(B! B(B! @b RSA@{è_ {!RSabb RSA@{è_B(B! ʻB(B! abb RSA@{è_ {!RSgabbx RSA@{è_B(B ! SB(B ! abb] RSA@{è_ {!RS`AR`0@bb RSA@{è_B(B`! aARl B(B`! TB(B`! Hbb RSA@{è_ Cc{af@Ch$A'fBh$C'fDh$E fF'P+Y R @{Ԩ_{SSsF[`@$@*`@$@*`@$@<Sb@ *@$@b** RSA[B{è_{SSsF`@$@*`@$@S*!< RSA@{è_{A!F  @$@o R @{¨_{RRUSG3ҵ`"Tjs8sXAT RSA@{è_ {S&@@@5ғB Zh&AfBRdC.E/'SA@{Ǩ_!/`EºB.!.{!STR!! 6gS!s sGFu Հ@$@D`8aTSA@{è_{!RS[c#;AR5  !Rϩ͍b~@~@#m"?w2hs"3a~@/;XR_ )RRc*3@Ra;@ RSA[BcC#@{ب_!RB9aAR ARB9za{S@[q`TmT2qT6qTq TSA[B{è_ q Tq TqT @qT ա@`@!hv8B@k,TSA[B{è_ @qMT@`"@!hv8@k,TSA[B{è_ @qMT@`@!hv8@k,TSA[B{è_ @qMT@`@!hv8@k,TSA[B{è_"@@[B`&@SA{è0 @qmT ա@`@!hv8@k,TSA[B{è_ @qMT@`@!hv8@k,TSA[B{è_{S [;@B`6RarW!t 6N 4!6H`4!6B 4!7<4!@76` 4"!70@ 4"!7* 5qF` `& eF[` `SA[B{Ĩ_UF-` `\SA[B{Ĩ_6D?F` a@`52F[` `SA[B{Ĩ_B@2!5F` a@`F` {a@`"!8Ÿ {B6!RSPd8@!8. RSA{¨_B@2B@!  RSA{¨_{B`6S*cSA@{è_*B8`SA@{è_{!RS`@qTq`TRSA{¨_`@$RSA{¨_B@2B! i`@RSA{¨_ {!RS[c#AR aRF qTaR qRR{d@R*vd*@!@@]@*@@** RSA[BcC#@{ƨ_aRBaRB@9B@aRA`qR!?d@*:d*@!kB@2B! B@2B! B@2B! //@B@2B! ڷB@2B! ҷB@2B! ʷ{!RS"ARa@!<%c@*P RSA@{Ĩ_B@2B! ARgB@2B! a@!< B@2B! @{!RS[`ARA` aR<@ @qTq!T!R R*4 RSA[B{Ĩ_!:[RSA[B{Ĩ_!R R*5RR!9!? R RB@2B@! 5AR B@2B@! (aRB@2B@! B@2B@! @B@2B@!  @{!RS`a@i`@qTT2qT6qTq Ta@ R@SA{è_ q Tq TqT@`@Ua@ R@SA{è_B@2B! Ѷa@< B@2B! Ķ`@qT@`"@a@ R@SA{è_ց@`@Pa@ R@SA{è_ց@`@Fa@ R@SA{è_ց@`&@Xa@ R@SA{è_ց@`@a@ R@SA{è_ց@`@a@ R@SA{è_{!RSAR?b"qRSA@{è_B@2B! gAR* B@2B! Z{!RS[ARa@"@`@qTT2q T6q Tq Ta@ RSA[B{è_ q TqTqT@`@a@ RSA[B{è_B@2B! AR`B@2B! a@yB@2B! "`@qT@`"@a@ RSA[B{è_֡@`@a@ RSA[B{è_֡@`@a@ RSA[B{è_֡@`@va@ RSA[B{è_֡@`&@a@ RSA[B{è_֡@`@a@ RSA[B{è_{!RSa@!`@qTT2qT6qTq Ta@ R@SA{è_ q Tq TqT@`@ a@ R@SA{è_B@2B@! a@ B@2B@! |`@qT@`"@pa@ R@SA{è_ց@`@a@ R@SA{è_ց@`@a@ R@SA{è_ց@`&@a@ R@SA{è_ց@`@a@ R@SA{è_ց@`@Ra@ R@SA{è_{SU[BW1` RSA@{ب_)('&%$#"!)FG G4GFGcGBLG!HG(!@<;{!RS[3avG!@ ?5ARsvGa@ ?ր5@X#aRo RSA[B@{ը_!<ϴSA[B{ը_B*{_!#@! @! ?q@-TC@@B#a!?A @XqTqaT @ @_#Rcr?k*TRcr?kT@@@_XqT@cK@(@9k,TR`rKA!! @_!#@! @! ?q@mTC@@B#a!?A @ qTq@T_ @_#Rcr?k*TRcr?kT@@@_XqT@cK@(@9k,TR`rKA!! @_!#@! @! ?q@TC@@B#a!?A "@_ qAT @_#Rcr?kTRcr?kT@@@_XqT@cK@(@9kTR`rKA!!!#@! @!?q@TC@@B#a!?A @qT-TXqTq@T qT_qTTqKT @_#Rcr?kTRcr?kT@@@_XqT@cK@(@9kTR`rKA!!!# @qT @_@! @!@"@?_ @cR"@ #_ @dRC@AD_ {S!5I8` AB @@"@9_!2c mT bSA{¨_ַ7{S/8`a @ @92 `@!@ @a mTSA{¨_@?{d@dASn#`@ @mTSA{Ĩ_{C/+# )/DS'E/'==#='=+=/=3=7=G#`@ @mTSA{Ѩ_ {SB5@R@ SA{è_**ffQs~| @fR&bBsc@  dD_T@ R`aBc @ @ TSA@{è_SA@{èk?q#R@"@$#_ @DRC@AD_  RADd@@"_ {S @ @AR 9{7 @qTe @@"@92g x?` @SA_@ {è_ր@"9@4` @ @ ` _SA @{è_{?qS@@T@#s! ` @c@q`TJ? @SA_{¨ _"Rs!br?kTRbr?kT@@XqT@BK(@9_k TRsrsK3s`@9@ 4 @ @ ?_SA {¨_փ @c@s#@s{?qS*@mT@ @#33 6` @q`T @@"@92 > @SA_@ {è_!RarkTRarkT@@XqT@!K`(@9?kTR`rKs3s`@8@ 4 @ @ _SA @{è_s# @33@s {?qS@*T@ @#s! ` @q@T @`R@ > @SA_@ {è_"Rbr?kTRbr?kT@@XqT@BK(@9_kTRsrsK3s`@*7@@4 @ @ _SA @{è_s# @s!@s{?qS@@MT@#A!? @BB8a @ @? _SA {¨_"Rbr?kTRbr?kT@@XqT@BK`(@9_kTR`rKa!!!#!a@!{?qS*t @a@T!@c# ` @*7a @ @"@ @b SA{¨_#RcrkTRcrkT!@$@XqT$@cK(@9kTRar K # `@ {?qS@@T@c#!` BR@+7a @ @"@ @b SA{è_#Rcr?kTRcr?kT@@XqT@cK(@9kTR`rK #!`@ {S**6d @Rq@@za T`@ @TSA@{è_SA@{èI**9?q@T@b@#!? "@B _q@T_qT @@Ra@R R$@"%d_` @"B@"Rbr?kJTRbr?k T@@XqT@BK(@9_kLTR`rK!! @@!#`@!a @!?q@@ T@#!? @A@@D(@9@ a_$Rdr?kTRdr?kT@@XqT@K(@9kTR`rK!!!#A!a @! {S @[AR @64 @qTe @@@ѵ"@92g I=` @[B` SA{è_ր@6@4` @_a06@"$@96_B$@9_@Tj` @ ` SA[B{è_ {?qS@@T@#s! ` @bq`Tc@= @р SA{è_"Rs!br?kTRbr?k@T@@Xq`T@BK(@9_kTRsrsK3s`@6@4 @_06a@"$@9B6_B$@9_@T @@ A SA{è_փ @bs#@s{?qS*@mT@ @#33 X4` @q`T @@@ѵ"@92 < @@р SA{Ĩ_!RarkjTRark@T@@XqT@!K`(@9?klTR`rKs3s`@5@ 4 @_06a@"$@9B6_B$@9_@T @@ SA@{Ĩ_s# @33@s {?qS@*T@ @#s! ` @q@T @fR@@ F< @@р SA{Ĩ_"Rbr?kjTRbr?k@T@@XqT@BK(@9_klTRsrsK3s`@*M5@@4 @_06a@"$@9B6_B$@9_@TO @@ SA@{Ĩ_s# @s!@s{?qS@@T@#s! a@B7 @"  `@(9 @_06a@"$@96_B$@9_@Tр SA{¨_#RS!cr?kTRcr?kT@@XqT@cK(@9klTRsrsK3s @s#@s{?qS@@MT@#s! a@c@7 @_06a@"$@96_B$@9_@T@р SA{¨_$Rs!dr?k*TRdr?kT@@XqT@K(@9klTRsrsK3s @s#@s {?qS@ T@ @#s! CRa@+p7 @D@_06a@ $@96@_$@9@TB@т SA{è_#Rcr?kjTRcr?k@T@@XqT@cK(@9klTRsrsK3sr @s# @s!@s{?qS@@MTS@B#s!S _a @! ?q5 T?qaT`@@ @@р RSA{è__ T?qT`@a@ $@96&@9@ATs @@@р RSA{è_#R!cr?k*TRcr?k@TB@D@XqTB@cKD(@9kLTRsrsKS3s@@A!5@ RSA{è_`@u Հ @@@ RSA{è_a@s#`@ @@s {?q @b@ TC@B#a!?A !@__"(9#06"$@96_C$@9@T@` @{¨_#Rcr?kjTRcr?k TB@D@XqTD@cK(@9klTRbrAK!!` @!#!a@!{!@S*dAyE4*2 1TSA{¨_`@a @@_"TSA{¨_@ {qS*@Tb@ TF@B##F c@c@A!e`Ay4#!;- 1`TSA{Ĩ_&RfrkTRfrkTB@G@XqTG@K(@9kLTRbrFK&ƀa@b @#@BT"SA{Ĩ_`Z@u@#*@yd2C9cxfZc*c2y @y@xyR@aZ#ƀ#f@ {S#F@= *5 @_*@95*SA@{Ǩ_֠@AR @2@ @ @ @B76"@T @_q`T R_֥_* @k0@9_{?qS @ T*T?q TkT?qT?$qT^A9SA{Ĩ_?q@T-T?qT? q!TAJ5R^9SA{Ĩ_րA $@ R^A9^95+-@^9VA9@qR_qB@-^9RR!R@RSL!-@` @ @T^9RT@{ {?q@ @T@#a!? !@B@1a @5!@a @{¨_!@a @{¨_#Rcr?kTRcr?kT@@XqT@cK(@9kTR`rK!!!#A!a@! {?qS,T!4`@ @,TSA{¨_6;`@ @-TSA{¨L@!50a @ @9!@2 a {*?q@ @T@#b"_ ;` @@` @{¨_#Rcr_kTRcr_k`T@@XqT@cK(@9kTR`rK"BB#;` @@` @{¨_"";` @@` @{¨_b@B @B@" @@@_  @_ {SX0R` A@@ @a mTSA{¨_ ?q@ Te@@c#!?a #@$@a?q`T?qT_qT(@9_kLTBQ!5"B@D@d_$Rdr?kTRdr?kTc@e@XqTe@K(@9k,TRcraK!!_q @-Ta@_kTAQc,@"!ahb@B@!`aT!#!@a! @! {?q@ Te@@c#!?a #@!@cq`TqT_qT#(@9_kLTBQ@""d@dDb_06"$@9b6b_s5C$@9@A T @{¨_s5 @{¨_$Rdr?kTRdr?kTc@e@Xq Te@K(@9kTRcraK!!_q$ @-T@_kTCQ,@"!#hb!@"@SsbT@d@dDC@76#@_T!#@a!һ @!@sd@dD?q@Td@@c#!?a @q@Tq`T_@Q!@|@ _$Rdr?kTRdr?k`T`@@Xq T@K`(@9kTR`rKa!! @BQ"@@_֡!#@! @! {?qS@ T@@ƀ#!? q4@T@@!### u@"$@@?T@"@AB"T R @ @@06"@TSA@{è_`@`76SA@{èe!Rark*TRark`T@@XqT@!K(@9?k,TRar#K#c&Rfr?kTRfr?kT@@YqT@K(@9kTRfrK!!!#c#@##@! @c @!{S*&[c**a qTRR?2@ xqa T!9A ! ?kAzAzk Tc*yc$q"4FӨTqTqaTk+TA\A kT տk,T*kLT1T~@yc"_q` T(Tb 4_qhT!|S_qTcyc!|S@!||bB@B _qTaha!`SA[BcC{Ĩ_kTqTAkTJd8?z`Bz!T_q)T_0qAT!|SA@6@!|@@ q T!SA[BcC{Ĩ_" *z @9qT3|S!4F*k+T!|S.@!|BahaSA?!`A[BcC{Ĩ_4|S!|ST.@! |ӳsha`st@6@| @ q`TS! q! SA[BcC{Ĩ_ւ"*1@9qT kTI!*!  ht`Aha!`m j {@@y6 @@(@94@B@_T"xbBc@?Tk*,T@@""PCcT @ 5{è_R @||Т!B,@he`!@!@ @ @BD@d@!!B!Q @?D@zBaTR@@ye6@T)_ T@_@_@_?qKT@T!qc@TTR_֟T RC<_{S*0@9q@TA[5<@@y@`76@`@@ T@@˟q~@DAT4Ba @@[B" a a2@9?q!Ta@b@#@$@c#B"SA{è_`@b@@@cB` @_?qT @ @47 Bc@*BBBBQV _*R @O @b(@9D@KkTB@T44[B` @ {S*[0@9q!T@@@@cB5<@@y@ 6 @ @7 Bc@*BBBBQ 3sBс @" b 2@9?q!T@@#@$@c#B"SA[B{è_֠@b(@9D@KkTB@S336@@T@@qa~@DAkT @{S[cks0@9q!T@@@@B!@9qTv>@@a @!?qT4к95Zc8R qTq@ Tq TR@84q TTLqTqT0q@85 R3 @b@ 2@9q!T@@@@B! R "@9qT @@ *SA[BcCkDsE{Ǩ_@y6@!@" @A$@@B@BQ ``*t"@9qT@!Ѐc 4@(@_B`!q@```nt*@9`9"@9qT@,@9a9(@9`9@y@7`(7 @@y6a 7@@@@ @@!!B!QBaCdQq T Rv A9`9y@Bbc9 R`Rxlt@58Ru!#a` a @{Cѻ @9F@7$@,R @!R@c@k@ qMT zss/@@kT*SA[BcCkDsE{Ǩ_֥Hd8e$֡!a` &R@#L#ap@` !`az` B4Fc"` `RRRRRcRCRcQ#R{SBA`//@@! eSA{Ǩ_R! cyZSA{Ǩ_{X@ AR @"R@e@ffa@ц@f?.{=#= @'=+=/=3=7=;= @S_@T@3 )EF8@y6@!@$ @$@4@@@ccBcQ#c{S`0' B!`{#@c c QqA{S @ qT @O3-2q@{S @LqaT @?! R?2q {S0@ 0K5!a!`[{@S!Q@@a5U6@y@07aRu7@a`2@9q`TSA@{è_֕6@yR07@@@ @@$@ B Cb`4`@?)TBc e__kTAR@a`2@9q!TU5c @!т@yc@уB2y!R !xySA@{è_ R`5R{*,@S@ C@!R<a29 @f@D,@$C@d@Db @Ddb@!q@ TqTB`@@u _BT ?֢!N)b@ @92 n@ @92  {S @[@"@"6@9u*@R *d.@cA@U%SA[B{èi>*B*!@aR {  b,@a,aAy{·5B @@? @@ ,;@yy{A{ب_{c@#@[*5||~@fS|JkTQa"BKBB` ??T @Bт"@~f @@~fAB@B@AN N  =f"@n$@yCNB" =!@aSA[BcC#@{Ũ_{hR rS@[k,T`zSk @#@~fuD! 5TkT||*v@cfx~@|kT3*"! `!s __T @"@~f !  @~f"!@A@ NN  =f"@n$@yCNB" =!@aSA[BcC#@{Ũ_ֿkTfv~@|Ӄc R" rBKBB`??T @҂"@R~ rf @@~fAB@B@!N N =f"@n$@yCNB" =!@a!kT~|cv@zv*򃘠csRc# {S@ @ @?! @hR@ r3_ksDsT\%`gR rkTqa!@s a*?k!Ѐ_kTSA{¨__%SA{¨ {@ @B_@T!@a @{¨_!Ra @!@a @{¨_{[T@S0C94@C@@@@k_b_7˭T!29@yB2y?`@!Ra29@y@` xySA[B{̨_SA[B{̨_ցRa @ {S4y[@?rT @@T4qT1@TkLTqMTQccDT44 RSA[B{Ĩ_7 @@qmT`Q` F_T4# RSA[B{Ĩ_q#b@" q-TfQf D_TQ"#K `#B  __T@!R?se@?@SqTR{S[*@c @b@XqBˠTq Tq`T_@MTR-@ qTu @"TD"|ӡ˪B@a  @b@XqBˡT@;@k! @5DQ3@9@Ta@`@! @?lT*!`@/@9+@9?k 49Ӏ?qz @T#QU5cC!@B@a $?? !T?kTQ``$Kb P$_Tcc ;@ @_Ta@`@! @? TR`@`@ @ ` @ua@yy7?b @*B# RSA[BcC{Ũ_RTb @K@`P!@ T @` B`@ @|a@@uW^@Ryw y 7SA[BcCkD{Ũ_a@`@! @?mT!R`@Jt# @BR@y6@_q@Ty@RkD!ѡSA[BcC{Ũ_#@RRyRgbB@$k {S@`@y!@ 6x`y`@Z`y1Tc@b@`?* @B#z@TCx 6cyb@Zby_1`Tc@b@`?* @B#d@`Tb@y!R"6j22@TSA@{è_c@ @bTbb@ @_T`{S#@0@9@B#4@09@@@y!$7@@!R?*b @B +SA{¨2SA{¨A@4SA{¨_SA{¨2{,@a, aAy'{P5@@n@@ ,K@yy{A{ب_d {Ay cc<yqHTW4`AyQ`y @{¨_ qTqTRR2`AyQ`y @{¨_֡!@{AyAyc c<yqyT04aAy`Ay!QayQ`y @{¨_ qTq)TR(2!@ {Sso0@95@TkyAy Ay<`yq Tb @o!@[RTt %a @kD!@ @92 a *SAsE{Ȩ__qTo!@@ R`yy!*1TqMT[hRcwgR r r3`@ @y 6A@yA 7Z @{29qt @TqTBt [BcCyy`AykDQ`y*SAsE{Ȩ_|@X@Rq`TqT` @B A9BBa zyb29@?! t@`@4kD T"klTq!`@ !(?k!ЕkT@@`Z*q,T"`@l@k8 @92 3@{$k8 @92 o@!Tt [R$ @9a @2 *!@a SAsE{Ȩ_[Ra@!l@! @9!2 !Q$@ @9`@!2 | Ayq_{Ay4 @!d@?T!@ R09@@@yˠ6R{_֡!C@!B!R{S[ckAyX@X0C9@* 5*[BkDwZSAcC{ƨ_+{@tqTq!T!#`k8 @92 Ba uzyy29 ՠ@?! t@hRb@ r4_kDmTT!`gR rkTqhR rb@ *kҁ_kT*[BkD+@wZSAcC{ƨ_` @+@H!`@l@`k8 @92  {[AySc>ky0C9KS @@@X@*57@zZ?@R 7C@⏀?B @K@B|4 @S@B|4 aAy*[B!QaySAcCkD{̨_+{@tqTqAT!`#`k9 @92 Ba vuyx29 @?! t@hRb@ r4_kDT `gR rkTqhR rb@ *kҁ_kT+@` @:+@ `@l@`k9 @92 {S @"@9?q`T @A?hT94_@zT`@bc @?`SA{è_ւ.@9A?T95`@"c @?`5`@c @?`@B95`@c @"Ҁ?`SA{è_"`@ {S@@[c!56@!T`@*@O@"5`@3c @Ҁ?ց.@`O!5`@c @Ҁ?`*@9395`@c @"Ҁ?`.@9395`@c @"Ҁ?`2@9395`@c @"Ҁ?`@O5`@c @?`B~_@zT@O5`@c @Ҁ?`qTQ3ҵ|`@c @"Ҁ? @`!?qTT?q T? qAT@O5`@d@?`BT@ @!394?qT T?Lq`T?Pq!T@B5`@T Ֆ@O@5`@3c @Ҁ?`qTQ3҃.@|d" @939`5`@c @?փ.@`"d$@9395`@Bc @?`T.@"d @9394BT"@qTQҵ} Հ"@6@hv"1!T`@a@5@OU|~ 5`@c @3?`q @z T`@c @&@?`a@a5&@O`4q TQ3҃*@| `hu*@`@d@O5`@c @?փ*@d @`O@5`@Bc @?`T*@`@395`@3c @"Ҁ?`*@O4@q,T@ qT?LqT@O4D@39 5"`@:`@c @@?`"@O5`@c @Ҁ?`}BTa@5@O4qTQҵ| Հ.@hvBbATSA[BcC{Ũ_`5RO`@c @3?` 5`@Oc @3?`a@45RO`@c @3?`paC){S!@+ )?_a R9 5D+@"Ҁ?9_ 5D"+@?_ 5D+@!`R?9_ 5D+@"Ҁ?_R95D"+@?9_5D"+@?9_5D"+@?9_5D+@"Ҁ?_ϊR?`5D+@Ҁ?_R!wr? 5D+@Ҁ?_@95D+@"Ҁ?_@ _@SA{ƨ_@ { *RbnSBB|@(9 @{¨_ {*SQRbrSBB|@(9 u4*`~@"R` B}ӀSA@{è_"(@94{S[67 @Xz3s*@9_kTSA[B@{Ĩ__ {S @@?(T T@@@_BT @!R*@?TSA@{è_֡@SA"T@*5T@{è_{S @a#@T$@`"d@D#@"07#@bTSA{¨_ a"@ja"@ {!RxyO09O ======{_ {"S!@B~Ӎ a"@b"B}Ӈ a@bB|Ӂ a&@bB~{ a*@b&B|u a.@bB|o SA{¨h  $@qmT(@@_kTQ@k,T @kmT!qT@T_@`_{S* @[cN@`.@a@aN`c.`$@9x`$9aVA9!Q!? qTaRA9p! *`$9d @9BR2#K%@ qTSA[B{Ũ_v^A9!72C929^9 @$@g@h$'Dh$ń@y @2ńyc˃q@b@yBxby29v^95SA[B@{Ũ_qT* @ _ q TB!G R"_B` @R!){S"$@9B`"@9b&9qTT$qTcTPqTqT:@` :SA{¨_qTTq!TB2b&9a.@9@dSA{¨_a @ $@9@aTB2b&9cA@`*@976"$@9_@T:@`::SA{¨_ր:@`&:SA{¨_B2b&9a @@dSA{¨_ր:@`:SA{¨_b&@9 {S" @9_q T T_$qTT_PqT_qaT"(@9SA{èBlSBB|@l_qT[T_qaTb.@9SABd[B{è[[BSA{è_SA{è SA{è" @BNSA{èSA{èSA{è"@BdB (@9@46 ztA @ @AT`*@9*kLT"pSBSA[BB|@{è$ R )RHR ,@9 @%!|{Tb 5T@@!4"4@ q $@9T@4 $@9@TT@_4{@ 4T@@4"4@ q $@9T@4 $@9@TT @,@9 @%!|{T@@a5 B4@@4_{_ւ@B4? T{*RKR ,@9 @ @E!|{h4R@4kbT@||C`@ 76Ahaq $@9!T@4 @kT @T Հ@ 4 06@_q $@9@T 4@06@$@9@@TT@?T{_4 _{!R,@9 @ @% |{ 4RRkBT@||ӄ"B@"76!h` $@9@T(Ro @k#T  @ T R RJR 4@$@9@`T Մ T@@A`44@B _q"$@9BT4)R4@$@9@`T *HTTA9@5<@<*{_B54@ $@9@T(R14D@D*{_'@4H@H*{_RhT TA94 {S8@b&@9a"@9C2c&9? q@T T?$qT?q!T` @:b*@9+4dR@k* T@@76@ $@9@Tb*@9@k*kT lS|@@ SA{è_?qT?qATbA8"$@9_@)Tc*@9e&RC5\VA9 qT&*k TxdAA_aT@@76A@ $@9@ Tc*@9aB8"(@96"$@9_@%T`@f.@9e@%4RkTb @||ӄCc@#76Aha"$@9_@T`@kCTd@!R! !|{ITFR 4@$@9@`T Մ)T@@b44@ $@9@AT76@ $@9@TxR pS|@`&@Bxd@:>@`&>b&9b @T@T@76@ $@9@TYb @@TVA9 q@TZA9qATa`@y R!4|a`2@a:@:$@9@@T2a6@ $@9@ATc@qTk Ta@|ӄ"B@"76!h` $@9@T(c@kLTb@_qT_kTa.@|ӄ!h`A $@9@Tb@_kTb"@_qT_kT`"@xda $@9@Tb"@_kT`&@qmTkTb*@|ӄAhaA"$@9_@T`&@kTb"@dBicCi! cb"Bx@tS|@@\~@aR[C"a@ $@9@`T@ qaT@a Rb{R{a&@9!xa&96 J@[B``@Jb@Ңb.@9!R! !|{@P `@ UR`@aT ՟@T`*@T`"@V@`*VA[BM Ҝ`.@9%Rd@ `@|{qTGR 4@$@9@`T Մ)T@@a44@ $@9@T5@@76@ q $@9`TqS`@VA95>@[Ba>`@[BF4B@[BaB 4;[B {S @[cVA9? qT T?qTT?q T?q! TO>f@J}Ӏ="= $@9@!GTJ@06"@ $@9@!HT@ $@9@!NT@ $@9@ANT@ $@9@AMT@ $@9@NT@ $@9@MT@ $@9@LT@ $@9@KT@ $@9@FT@ $@9@ETN@ Հ$@9@AT@@V9SA[BcC{ƨ_?qThT:@ >@SA[BcC{ƨ_@2@8k@@+RA9R6   $@9#@pRB*_jT"$9!5sT@wJҀ@9+@2SA[BcCkD{ƨ_@2@bx1k@@+RA9R/ $@9 #@pRB*_jT "$9-s@T $@9#@pRB*_jT@f@RA9a$@9B!p!*a$9ZA9?q`TG)?q" Bk+0T@RV9SA[BcC{ƨ_֕2@'k@@RA9R% $@9#@pRB*jT"$9!$sT@wJҀ@9˕2kDR@N@ZA9q&TRҀV9D:@k:@@R`V9u>@&@9@a(T`J@06a"@ $@9@A'Ta@ $@9@+Ta@ $@9@*Ta@ $@9@A+Ta@ $@9@A*Ta@ $@9@A)Ta@ $@9@A(Ta@ $@9@&Ta@ $@9@%Ta@ $@9@$T`V@e Հ$@9 @?@(@TD!@`:@u:w@ `:@ uF@FU R@-@5u5 aB@aJ@aN@e`@a' @a6@yB@xJ@$$@9 @@@ T@@ A@dN@ R`$@9@T@D$@9@T@ k`:@,Re`:@ uF@FU R@5u5uF@(aJ@%aB@aJ@`RA9a@R`R9@R@a.@`V9bRA9CRa $@9RjTpB* $9@AkDu2[BSAcC{ƨ_!`:@,R( Հ@ 4@@06@ $@9@T@@C@9ˀ@kD ՠRҀV921@9ˀ@+@kDRҀV92%@9ˀ@+@kD`RҀV92@4R@k T!R|sN@s~@Rw} RV9@!|A @!|&@z(@ @`.ub|s~@xSw}ˀ@bbxS  @TA9q T"$@9PA9BpB*"$9_n  @ $@9x $9@<@ A<_ @TA9_qIT_!@!@"$@9_@`TZ "$@9 @Bt"$9#@,P@"P_{S*@ @$bRA9 9B$9b.@`.SA{¨_ #@c#CA@T_ #$@9}D@`TC(@9C6_{S[AR@z@VA9!Q!? qT`&@9RA9p!*`&92@T@.@Tb `@ 6@`6`&@92`&9SA[B{Ĩ_ @T@B*"$9AAT@PA9ecR"$@9 @DRjBpT:@@2 {S @[cN@am @6@`@6"@ 6@ N@ RLN@`@aRR9Z96@PA9R  $@9#@pRB*jT"$9aT`@b.@PA9R!  $@9#@pRB*jT"$9aT`@R@PA9R  $@9#@pRB*jT"$9aTSA[BcC{Ĩ_@@@6@b`RR9Z9{S @VA9 (7*VA9`*6SA@{è_ { @SҠ@@ TaB|@aGcšz|A!!G |^A95DqTsˠVA9~%*TqTsaa!}@N@@@4R@kT!RsN@RSA@{è_xSSA@{è_֢@fQ򤶀BBӦAB|ƛSABB!@ešB|{èB!˷᷋SA@{è{S[ @a4 RZ9VA9qiTRB(B"5R`VA9*6@`VA9*7`VA9*6@`VA9R*7`VA9*6@`VA9R* (7 u`VA9*6@`QZ9BBӠAB|SABB![BešB|{èB!c.@@RRA9V9CR $@9RjTpB*R@R#$9@?24 @.@Rb`VA9B(B2{cA@S[*|D k?k T?kT@4|@~@@~s~?d @Tj@@!Ri@? @cCssSA5[BkD{Ũ_5xSRkR(*!@%{!  {?S @[cX@?d @Tj@`!R/@?@@[BsscCSA{Ĩ_R*?qT-T?(qTT?0qTT?4qZ_? q@*TDJ?$q_?qT T? qT?qAT**"@ 4DK?q_R_**"@ _**"K_K*"@|_ { q (@ T@ Tq@TTqT@!0q ! @{¨_q@TT 5@(! @{¨_Ku 8 %T((! @{¨_ @{¨u! @{¨@%_8! @{¨_! @{¨_ q TqRhT*<A|SqhTB<qhT*"|S<qhT" Q *_"RR qT|! Q _QRqT|S! qTB@H`8 _ {?,qS*[cW@T?qT QqHTqT@K @ qT35dSA[BcC{Ũ_?4qATNq!T@K @LqTR34O@K@*$aR SA[BcC{Ũ_NqT @LqT#@4 @ qaT@OK@*A`R SA[BcC{Ũ_R#4O@@O@*@  B 2!\QQBc8_ _{SЄ @9bb86C@8ee87q`TqR RaTC@9Bq`Tf dQRf86jRRrr E@8c  Qf86 k T kaTkT[!#4}@҂B$r|@{ @a! @9!2a ( յ \ Rzs{ @a! @9!2a B@9_q TT_qTIT_qT_qaT7>4}@<r{ @a! @9!2a _qT` @7.T}"@aRa @!@;_$qT_TqT7>4}@T"?9{ @_qT!$` @ 7>T} @aR@b"!${ @ 7.4}@#9B7@@ `8@6"{ @"_qm T.*t}R"Rc|S!`28F*BTRK#*B|@!*%8?@e`@@- TrMa! @9!2a z4h` @SA_[B`cCkDsE{˨_"?qT>*T}+"C_qT>*t}"?qmT.*T}"?qT>*T}@<<@$H"?qT>*T}f;@!6*O;@6*;@6*Z;@6*+;@6*u @!9*b!RF{ @ {S[q`@9qTqATTaSA[B{èqAR^r>a!%&U"@! @9"9#Tzq.bA @y@9dh4x@9`%@y@9"y 9SA[B{è_aT_qj58SA[B{è_ց!.$@y#@9ay 9SA[B{èKqGq{S@S`a!@/Bh{*dS/@@@"(@"5a! 0,` @ha!/?$?@{S@[cry@,@w&@#ka*@T~|9h `&@96 '@9@T @6@`ryK? qT@@k*TSAcC#@ 5#x[B{Ũ_@eR0bI`&@a*kmTQ~@K" _Try@2Ce01 @`SAcC#@ 5#x[B{Ũ_@rybRB0 {S@[@9u@c?qTk`.@T"|@ qd 9@d$9h"`&@96&@9@aT"9*SA[BcC{Ĩ_ւ @eR0@@b`.b@kTCQ~@cKcc _T@9 @@@9"9*SA[BcC{Ĩ_bB0/ @9 @Q$4 @4@H)@ )-@)@%٥x|ie?@TQ''|@xxѥ|ie?T1*T{SB-@@94@@?TB@#a|Aha Tk*c,T@R@@4n"R)SA@{è_RD)A4___ @@@9?kT@@@9?kT!RD9_R {SR,@3|3[ @@@@9#kT*@T@QkjTKabBQB @BB}oSA[B{è_@a4@! 1@ `,@G(@@ @hsإx@B`|he`Qg{c`@S3K*[*4Q?q@IT5qTkT@@9s 9SA[BcC{Ĩ_@9*U**QkJTx1DT*tVqmT*UkTVq TRcVk T {ScPA[@aF@9 5J@9 5` @@,@`@9 @dB@9K_k!K jTa@Qh"@f6@@%(@* Q_k!أxh T`9`9/@ZA)(@kTRk ~5 @B@9C@9kTF@95C9y @ @#/@ @g@b(@%@_k T|5|@c@hzxahd? TAQ`!Kd`!b! CA T_aT@kKTkDSA[BcC{ƨ_ @OTB@9JS*B@9*GT*SJ@9`4@a!`3ks/@@5E); @k T @R~7h5_ @9@@9! @5 @[#+@@kJT@B @~7Aha?`TkKTkDsEgC@9@@9?kT@*TC@9 @*@?k TRk~!s@hv# @@ @9qTa!2@B`DfB@9 @*@@k+T!@e@3R"/@@ V@D(@9`a2q!2! {RS@[R@'S a@b"B~c~4a&@"@bc`c|~B~+"@a@.bd`&c|B|!.@a"@2b"d`c}B}2@a*@ryb&d"`"c|B| rya&`*a.@b@9B|c|@@`.@9`@ @TSA[B{è_SA[B{è{S[*@c?(q@ Tf`@a!`3t.@ C) @kTRg@~$(h%w @9`@9v @(@b@k TD|$I|@@%hetahd?T"*`B ``B aB  AT_aTSA[BcC{Ĩ_ւB@9A@9kT @/S*B@9 @SA[BcC{Ĩ`@eR3҂rMf.@ @e`@qTx@e$R{[@S?q T @e@S `@9f@Q 4b @a6@(@d B,@B@Dؤx|Ӥhd`TQB!|@Axx!|ӡha? T1*Td@9,@4@@TB@!!#|ChcTk*,T`@R:@4"R)SA[B{Ĩ_R)SA[B{Ĩ_6@#R@SR)YSA[B{Ĩ_R$R){SC[@AAy!!<Ay? qHT@?(qT T?Dq`T T?Xq T?q 4T?Hq CTVc`@RqAz\T@4qT@⧀@ xbX 2 x"`@@99a@[B AySAQ y{˨_? q%TmT? q +T?$qTc eL`@qTkcRt@Ud`@qqTa@7d`@7@%S)SWY`@qTkDcRqoT*`@]W`@*[`@cC@9?,qT?4qTd`@$q@RTqRkTa@7d7@`@qiTcq nTcR**` `@@9@ c94e@B,@@4@!5B@! @G)@BA$x&TcC{?qTd`@@9u?qTP*e`@@9kcQ@9 RC9c* @,@@(@ x@C)O)9 xrd`@TqYTLTQ?q(TTq@XT`@kk+DT"Rt@[!"R7aq`THqJT s`@qT `@q`Tq@NTqRT`@ckk+@ T Rt@k[a!R7:cck2d(Q*R@qaT`R`@/W@@9 RC9b@ @_ q!,@"@!(@ x@ChTdv@@99 @,@@(@ x@O`@TqTlTQ?qHTGP**Q`@q NT`@kAT+ Rct@c@99 @!,@"@!(@ x@O`@TqTTQ?qTg`@qCT`@ckkT Rt@+Z7a RqTHq6Tm@9 R9c @B,@C@B(@ x@Oc`@cqk+aGTw@cv@q T2qT߲q`Ta! 6;cc`@qDTcw@cv@t.@@*@@D@?kTR|@|"hbPT!Q`!KB`!!a ANT?aT`@kqRTkcaP*E)k 1T@R$R9b@h9@@9C9`@ *qAzaT*`@qUz`T@b@qTq,Tq`,T@ @v.@ @@kjT@R @~5@h` TkKT`@cC@9kDC@9* @D@kT@ @qTHq"Tcb@u@_Tq@TT_qRRT*O`@qT c@QqTRR Rt@+1Z7"R-Z7@*a!4bx@a!`5@9bba!5ba!5bR`@qT0q>TbR{@9R`@q@T*aR`aRPQ**R`@q%T`@k`T Rt@Y!R7x@ba!4@9Hbba!4@bBa! 58b`@q!8TbR`@R`@q!6TxbR`@Q`@q`'T@9!RP**\P!RP$R***E_qTccR`@q'T@4Qq)%T4RIR*cC4"RO "R;b`@t@qATa@73b7@6e@Rc@9@cc9@cQ,@4@(@d @c@ @ؤxX @6@@,@! @@c(@Aءx`@a"@"@93`@a`@9QRO`@qaTa`@qTa@7a7@`@qT@@@9C9@e`@3R҂Vqav@c@99 @!,@"@!(@ x@O`@TqT TQ?qTQ`@uq`THqTeas@N`@@9aRs@qaT`Rs`@T@B9 5***N$`@cC@9ka`@cC@9kD+@a~a*uN`@cC@9kDUra`@*qTck+$RBt@Qba`@qaTa@7cZa`@7@OR)SU"RicJa6RR`@q!T@a`@PR`@qT2aR`@PB9*xNP@4q`T@9cC4Ra`@PRg`@qT@4QqTP@9cCO @bc @a!6k@+ @_`0@Rៀ@!~@had*@h!bRB3ck+!R$R+a! 7ck+q`a R+R* {ck*hCS[*@3@"@k T3@"@36 &@9 6&@9@AT`CaE=f@*9+=%@``6O)6@$@9rTBR297#@!(@)9`@xOqT`95w@@/9R`@qTdq TqTa@/p`/@s/@95`@qTb@@@9 @9E@@A4QD@c,@!6E @c @(@A!@$xET@9+9jN`@qTE``@TqTTQ?qTC@q`@ , Tk@ T Ru@eW!!R/`W/@*a!4M_qTHq` T&@9r` R/9b@@@9 @94"@e"@"kT"Q6BKRBB}shFa!`7_w@@9 @96@Q!,@ @#@+@`ؠx"@@a R_`@RR@2@cQMR)TOa@`GSA[BcCkD{̨_`@.IB9!,@+_`@>f`@ua!7R_R!R{k*@cSAAy@!!<Ay? qH&T@?q TT?qT?<qSRT[@__R_@@*\T@qTLTqTM Tq`T Tq TqsRR*`TR@*[BAAycC!QkDAySA{Ǩ_hq`TTtqTmTxqT|qaTR*uR ?kjTxC.@_N_@*T*_@*@*UVqT~k`8k-T3@9*lq TpqsRR*Txq@ TqRR*T@q T-T\qT`qR RRTqTTqTqSRR*@T?qsRT?PqTT[?qTmT?$q`T?8qT! ^yqSRuR*TqsRuR* T~sRUR*sRR*sRR*RRRsRUR*RUR*3R[ERR*y3RR*u?qTD?q`T T[?qT?qAT@LR)R[%?dqT@!,@9[a 4RRR#RLR)sRR*IsR5R*E**sRR*?SR5R*;R5R*7[R@/[R@}w^@Raq[AlbRB3[Ka!8^{S@[c@@9?q`TQ^CR`@O`@tqaTD^@`@q!T<^CO*RO@B@CO*C@ARO@K9SA[BcC{Ǩ_ @#^`@#@LLR )/R R{RR[R@SaRc@rK|@`@RZ)?CM`@qT]`@q T'(B#bk@!4mMk@q T`@lq`TqT]qTR*CH`@qC@TqTqT`@k TRt@TaR/T/@*a!4V]P`@qT]`@qT #@'@]@c4k@4Q?q)T5?@@!@}T@@!@3xv@sZs^* @x6sZ @ S@*cC @x6SA[B{ɨ_RU?@@!@^T`@cL?@@!@QT@QL@aR#'5{S[@*?q@@T?q@T?qTa!8\C6S@@4Q?qiT` 5@9ScKDRRJR)*T9SA[B{ƨ_,]`@qTS&]a@TKR )/]S@@4Q?qTSRCRf`@qTK`@qT`@k@T!Rt@/TR'*T'@*a!4\CKtLK@!R\`@jL@{S[@cqk@@@ TqTR`@q TTq Tq Tlq TSM\R`@M`@tqT\Q`@qAT \`@q Ta@/\`@/@J )7_O*7qTqTz@M\`@qTa@/\`@/@J )7PSA[BcCkD{Ǩ_K*f\R`@q@T`@kT!Rt@S*/S/@*a!4r[!R D\`@}Kta!@9[$R R {S!@[! Q?qT@*?q T?q!T%\#Rx`@5Rq T"kT**`hc@Rc@9+cQ )NSA[B@{ƨ_\`@KRR`@qT"kT`@K`@mNSA[B@{ƨ_[#"'S@u@(qT`@Ay  qT"R q@9TR@@?(qT<@9k!T8@9W@kT$R89<9<@9? qT8@9W@kT$R89W@ykaT$Ry@@?(qT$4RW@RI!RIu@4Ra! 7:[RnbRB3w{S[@[R`@Lqa T}[`@xq`@`TNG@@9c9#@' @x!,@"@!(@ )`@TqTTQ?qT`@QqiT*UHSA[B{ƨ_O@9#c9C@A'xc,@d@c(@ )`@q TqTqmTq TG*qTHqTG*0F)[`@qTSA[B{ƨ_a"R {S*@[*k**a@9b @! !a9e@$ QF,@#Qb6@!Q(@ @c ! b"@@ؤxأx qءxb"cTZ 5@``> @`@yQ`ya@bB|a"Ҥ@€SA@{èAA_B _{  c@a@y` !|ay @{¨_ {S@ @ s s@@yQySA{¨_ {@@S3 @ @ @y!Qyu a@ASA@{è_{[ @S@?MT RA9R Ra"9`&9%R&R҄ @P.@.@҈ 29Ve29y@@V@vs~gVZ)fyyedf@_# RabT `6$@#@Vyd ?:[BbSA{è_{S[6 !@a@t>@``>  @O`@yQ`ya@bB|ESA[B{è={€S[c?  ` R!R!R9u"s~Vy`29B 29ay&@Z *&@*&@<S&@8 *b*A O*!=RR~ҁ@kkTqmT@Q`zez%@  @@ cza`z!"kLTkT@~}~}iSA@>[B{Ĩ_#|}~}@^>@kTQRBK4BB}`q T"@B$@9_@`Tl@""@B$@9_@`Tl@"!@AT_{R[S @@ RR@>@BJdQ@hSB BJ@@hSB J@hSB J|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|SB BJ|S ֺJ |@7 !x` ҄M!@ ,@9DqT @!T @T @9qaT $@9RA9RBRjT $9:@kЁkTBҁR@: R"y @"@@9 9?9@6 :@:anq`n@`sN<TSA[B@{Ĩ_axS >@@Q 7 {"d @SRtP@\(9 _`9SA{¨_  @" @`<@d@Q |@x` _aT@@T@@!@`8@Q`8_ {_S[cIT_(T @BdRuP@(`*9u`9t ^SA[BcC{Ũ_ @BEkBR@JT ՠ~Sha8 ! _J)T>@@ Q |@: 3x`3:@kЁ?k TfR`*9u`9l^t.9@@` :@SkD:SA[BcC{Ũ_ab^4s @3`.@9T`&@9RA9R!RjT`&9kD!{Sc>@@ZQZ :kDk{RSaR!r[~c@a`ӓK3S s~Sss|sjsb^ 4#@!c^ 4#^[#@j3SA[BcC{Ũ_#@{ TbR~LBC#BpDc@(9 @{¨_֙C@cqT{S TqT Tq!T@9B@SAc cQc {èb|{ _Pq TXq`TLq T@9 RB@ Q2A `SA{è_@@@9!R! !Q! !|{`SA{è_@9 RA@ Q |{`SA{è_C@"R@9c @@ Q |{ _@@^ee! "kT !TR@9 R Q2" @|{`SA{è_^/@& !|J {"@S4@5@`:.9SA{è_[**xqT3Rs"u~{qMTaQ !|{!___T.9[BSA{è_A!:  {[@@S 4Lq@ T@.T`@ 4|{saB `5`@(qT @`76@a @?T Հ@@sˀsE kIT @c~|a@5a"||@_5!k*!T.@9sK#Rc kMT@a~{Ӂ @4#a~{Ӂ"@5skLTSA[B{è_S@Rqb@zhT$ @kTsaR R SAb @[B{è_R$ @" A R" @SA[B{è_RA! ;{ҡRV RBB`:y|{_{S!@d.@9"Ra@B B|{ka @b@B|eSA{¨^  @#QkT,@9"R @B BQB B|{@C|{"4@_LqAT@?kT_@#_@A!_,@9"R# @ @B BQB B|{@C|{"4@_qAT@_T_@#_$ @9 @qT,@9 R# @ Q |{@@C|{4@_qAT@?T_{2S,+c`@|{4saB4SA{è_@#_@#SA{è_ {S!@!? qTT?qT?LqT@ @aQ?kc Tb.@9!R`@3 sQs s~{@"|{4@?LqAT@kT@#!5SA{è_R5a@`.`@|{`4saB4SA{è_@#SA{è_փ@!R,@9 @b @! !Q! !|{@"|{4@?qAT@T/@`@aQ?kT` @##b.@9!R`@! !Q! !|{@"|{4@?LqAT@kT{SA@a"4c? q3gT[.@@@4A?T_ѓ53BaT?T!E@`>A`?@4`_!E `@ @07SA[BcC3@{Ш_`_uѕ4?CT@ Rk*Rs     kbTkT* @R QB@_q!k"T @cxSA DAT.@96R" Qy49@|{;C RRR{{{ւT@@A4@?Lq TւT @9  Lq TRR RR e@4 kBcsxST|S?kTfKrA!#@ TSA[BcCkDsE3@{Ш_ր@@ @76&@9@6@$@9@TfSr@qBzTS|@9RA{`!A{ k*TRRh4@`R[s{!@[ TfA!;ks@RqAzT*|@9A{`!A{ @4|{E`EfkDsE,R|A!;[cks3i{k: @3g @S*[Rc* ,@94R"_k@cTf!C5_kTqT~@QR!{X3#sT` @4zB- Tb@ sTqTSA[BcCkD3@{ʨ_s~|[{#CdR#R @C_k*T9 @ 4@k(T.@9@b BQB @B4B|{@_LqAT@kTT&@C_k*ATfB|sE f"{SA[BcCkD3@{ʨ_fV 3@fB| @~|ӷ @kTQcK!P"b@"@`??Tqf?5#RdR @?@f@ @C|B|s @_kTCQcKBP!a@! `_TfR $@R$,@9#Rc . {SA!#?@TSA{è_SA{èDQ*" @kcT&,@9$R" @ Q |{BD@|{4BD@LqATD@kTD#_ T`@@_"@%B{dR#+@`@@{è_ @4@Q!@4@a H"Q#*)RkT,@9 @#!cQc c|{BC@d|{4BC@LqATC@?kTB@4?kT*!xS"QkT@C!BB@5"KI(R)#_q)T $ |SQkT,@9 @!cQc c|{BC@g|{4BC@LqATC@kTB@_q "K_qHT*_ B@_q@CQ$BB@_q#RGR*#khT բ,@9 @!BQB B|{!"@D|{b4!"@_LqAT"@kT!@!4*ck T@"#!*R!|S#Qc@q"CK qT_{S[ւ>zs@a~@s!p@z!AxaAbaTSA[B{è_{S*.@4SA{¨_b*@9!R! !*a*9SA{¨_ #@c qTqT @##a@ @bL"Ap@@#_!@!@!@!@{"@S_q`T_q TB @> @d@SA{¨_#@t@A! @` "  {S @[ *q Tq@ Ta@ @ a@!L6!p@@4a @@"`@c@$@y@$@$b "R7 c@ Ra @u@"@b " SA[B{Ĩ_E#@5 @ qTqTa@ @d@L6r@c@`5SA[B@{Ĩ_ @@ @@@@E#@@ {S @[ *q Tq Ta@ @a@!L5!p@3@4a @@"`@u@$@y@$@$b "R7c@` @u@@a SA[B{Ũ_t@#@5 @ qTqTa@ @a@!L5!p@@5NqTT6QqT @ qT@O @ qT3`4 @@ @@@@@#ZqAT{35Cc<{@@Cc =r@O{S @[ u @*q Tq Ta@ @a@!L6!p@@@4a @@"`@c@$@y@$@$b "R7`@a @ @" `  _4q T RSA[B@{Ĩ_D#@5 @ qTqTa@ @c@vL6r@m@5SA[B@{Ĩ_ @@ @@@@`D# _q@@{S ` @  qTLq`T_qT`@`a@" @9_q@T!@!TRSA@{Ĩ_!,@9!T` @  qaTa@ @% Te !Te !%T8 Ra@ RSA@{Ĩ_@_Lq`TB _q`TR_{S@`a@" @9_qT!@!TRSA{è_@ R!^ _!,@9!+@#@LqAT!^ R {S[*` @  qTLqT_qT`@`Oa@" @9_q@T!@!TRSA[B{Ĩ_!,@9!T` @  qaTa@ @% T4qmT.(!e !Te !T8 Ra@ RSA[B{Ĩ_ {[cSR@@(@9a7@RBp@T@ q T?q@TBqTR[@!4 q!T%RSA[BcC{Ĩ`@@!5BqTA! SA[BcC{Ĩ_@BB@ {[ckSR@@ (@97@!RBt@@ q T?q`TBq`T"R@ 4 q!TRSA[BcCkD{Ũ3`@b@@4 @06a@ $@96@$@9@T@ SA[BcCkD{Ũ_֔BqATA! L@#?T@ *9 @@76&@96@$@9@TSA[BcCkD{Ũ@ *9 @76BB@Z {S!@[  q`TqT@@ q`TR*7*SA[B{Ĩ_@@ _ q!T?Lq@@T q ' T RT R@ @Rk Te !Te3R !KT8_kן@@@4`" @9_q T7@` @9?qT@ U@T@T˵V* 4|S@?kLq T R @RA'kTe3R0 TeR0 mT 8?k7,@9,@9@3R@A' !WA" ! "0 ן{S!@[  qTqT@@ qTRe7SA[B{è_֥@R@y2yWq@ @yR yT@@ _ qT?Lq@a@T q ' T RaT RA @R?ki Te !jTe !MT8_kෟa@@3`" @9_qT6@` @9?qT@ xT T`Ts˔lUq TǟLqT R @RA'k)Te R0 *TeR0 T 8?kǟ6,@9 R,@9A' !A" !ǟ?kǟ "0 ෟ {SB@!@ J@T rT  q TR*SA@{Ĩ_!?q@ TT?q T T?qT? qaT@@ ?Lq TmT?Pq` T@@@?*SA{Ĩ_3R5*SA@{Ĩ_?qT@@`T@`(@9" (6 @ (@9/7b@RB@@d @%Rla @ @4qT3R?LqT@;_Lq!T@;@k@@?k 4 @`4?@ @43R@@*@@TS@`(@9c(6@@b@RB@@b@B@@{S*[c{@ks@B_@ qT qBCрTCєQR @qZ TA^  Qq)TBC=A^B__q`T?qT@^,@9 5@@> @QqZ TSA[BcCkDsE{ʨ_@_ @9?qT@qV3ҌT@?Ts{kBT @** qT qT@ @9?qT,@9@_,@95! Q? qTAS|@K9C7T@Q\CSҀ3 a@ @9qT<@!`sB S3@aTE7@V[k `#@92 ~<,@9!`sBR3@Tcc@\C@QSˀ3a@ @9qT<@b`!`R3@sB`Ta@ @9qAT<,@9b!``R3@sBaT*|Q˔KyBS|@7,@9i*7A!v {SA@[!?qT?Pq`T?qTR@!4%RSA[B{èA@`R[B!,@9 SA{è_A@`R[B!@ SA{è_V@@`(@9A 6aR SA[B{è_֢@RB@@BB@f CqTK4*_# @J6b_qcK*_{A! CqTR4*_# c4AJb ?qC*_{A! ա7?q _K?1$_{S@Bs_a?pqTT?qiT?qT?qaT@ SA@{è_?|q"T?tq!T@a~SCсaFF=!D?qTs6FB @b SA@{è_?qcT?qT!0Q?8qTs6FӠ @@ѡ `SA@{è_S @@"rAT@%R_4?k`TR!R@y@Ѡ 86*Rys6Fk TcSA@{è__?q {scw@?CST@y@[!2k3y@@9@!;!@8@ @a@?rT|6F`q|Ӷ)T@@a@?rT|6F@`|q(TZ`xa  @s~S @xs|Ei@k?q T*Qc#b P* C@|Ӡc@T!@B _T#@9 @95;@`x`C@@c@`T *@RS C ;@C x``x"B?k@!T@9@94|GCOG@O@@`x"B@!?kT`&@9@n7z2pc~SsZNӣ5c @ccDcQ5@@s~SsQ@R@s~@z kT#qT3ZQBkeT*] @76'@96@$@9@Th@@4a~SdAH!S @s~S @qkTk4cQ@y!l7w@4@` @8s~S4s"|`  k4B4|ZNs~SQ4s"|` *41 T@` B"`~S"r@mTAm4?qT@ @3@`6F 5 ?28S   @LqT@ qT@`R*@ qaT"@`R* @" qT@8(`R `~Sb@@H  @@Lq@"@`T8 (!-T "ᇟ@4a~ScbRaH!:2A.B.bZN@` @B3@ @a e6Fb"r @nT a4q`T@3@`6F`4@! A3@`~Ss~Sx| d@6s|k TB`~Ss~Sx| sb@6s|k!TB3@`6F 4 !@ Bs`~Ss~Sx| j@6s|k TBf5@?28S n`~Ss~Sx| sp@6 @s|Lq`pT qT` @@ qpT`@9 `R @T`~Ss~Sx| [@6 @s|Lq[T@` @LqTb@@aR J@G`~Ss~Sx| sV@6 @s|LqaVT@` @LqTb@@aR *@-`~Ss~Sx| sd@6 @s|LqadT@` @LqTb@@aR  @`~Ss~S {`@S@6 @s|q@ToB`~S B߂T@ Ra~S"r @@T`~Ss~Sx| j@6 @s|LqjT qaT` @@ q!jT`@ `R @@%`~S|ӳa @?LqAkTj` *-`~S|ӢA@?LqT? qT! ?qTDRyB`~Ss~Sx| I@6 @s|LqIT@` @LqavTa@@?qvTK?1 aR @`~Ss~Sx| SK@6 @s|LqAKT@` @LqnTa@@Ao7?q `~Ss~Sx| @6 @s|qT.B^`~S@!{` @ @B76"@Ta@O!<`~Ss~Sx|!@ 6@SG7 @s"|ӳqAT@@4` @06@ $@96`@$@9@!T`@@+|~Ss~SG7 @s"|ӳqT@@@4`~Ss~Sx| N@6 @s| qNT@` @ qZT`@ `R @`~Ss~Sx| s7@6 @s| qa7T@` @ qaZTa@kO`~Ss~Sx| D@6 @s|LqDT q`T` @@ qDTh@A N(8 eT(( `R @`~Ss~Sx| 5@6 @s|Lq5T q!bT` @@ q5T`@ `R @@ !@!|S" @a~S@" @a~S@" @@s~S!@iQD!(@9KqPSJ4 kӉ4@bQDˢBB  ,*,_T?k@MT"QBK!#C#b տ?Tub~SlBn`~S!R@4_kRT@q R @^cZNs~SaK#!c@c Gs"|e@G@a@@! @D? T_B@@ ` s@@` @>|~Ss~S3@6s|@a@ @qT@]@`4@@(R`~S sZN*Y5`@ @̈́TBe Fa~S!@!{a!@" @ `~Ss~Sx|  @6 @s|Lq T qAGT` @@ q T`@) `R @ts5c @ccDV@y!6SA[BcCkDsE3@{̨_z@"@Y@W @ @A@ @B @@_q(@98T@RA@?TDTb @ `@yYs!2@@s yw4?qT@R @A4@ @s"|ӳLqT` @LqYT@ q!^TLqqT q:T?@`@`*a@" @9_qvT!@!a9T@@LqT!^s"|Ӣs"|Ӣ @s"|ӳLqTC@>5R=@@{ @s"|ӳLq`TC@, 5R+@@i @s"|ӳLq@TC@5$R@@Ws"|ӳ4qAT@@4@1 @s"|ӳ qTLq[T q`BTDRB.s"|Ӣ @s"|ӳLqTC@5R@@& @s"|ӳLqT` @LqMT@ q!^`TLq`T q+T?@`@`a@" @9_q`dT!@!!*T@@LqT!^= @s"|ӳLqTC@5R@@ @s"|ӳLqT` @Lq @T@ q!^TLqUT q#T?@`@`ea@" @9_q`]T!@!!"T@@LqAT!^h @s"|ӳLqT` @LqTT@ q!^`TLqQT q!T?@`@`Aa@@" @9_qZT!@!aT@@LqT!^ @s"|ӳ q`TLq`GT q+TdRXB @s"|ӳLqAT` @LqKT@ q!^ TLq@NT qT?@`@` a@" @9_qVT!@!!T@@LqT!^?@*#4@ *@VLq`AT q@+T!!Lq?T q`,T!!Lq`>T q&T!!a @@`@J T@**s Lq@@T qT?@`@`a@" @9_q`HT!@!T@@LqAT!^Lq=T qT?@`@`a@@" @9_qET!@!T@@Lq!T!!^L3?@4@@6K?1$i?@ 4@?@`4@?@`4@?@ 4@@?qmT?q$K q$T$RB q TRB q*TRB q`#TR}B q$TRrB!&&?q! @& T?kǟ@B34b~SdcRH"2:*@LqaPT"@BC@SB=5@ q9T@ -<TR\7@"@bR !K@@@!`R @kj` K@e*4@@<!K[**W*@K@T. "ᷟhdR@@L?k⷟*GzG@?@@`@" @9_q&T!@!!T@@LqaT!^?@@`@" @9_q$T!@!aT@@Lq!T!^?@ @` @" @9_q!T!@!T@@Lq?T!^?@@`@" @9_qT!@!T@@LqA>T!^?@@`@" @9_q@T!@!aT@@Lq@*BR4-!b!H4*A4R?*SA[B{Ĩ_**6*SA[B{Ĩ_ց!>!' {S[c*57R@9R_q`!Ѭa4!!`@8qATRH !!4q@TASA[BcC{Ĩ_HuSA[BcC{Ĩ_֛ {S 4!!RK@q TA!5SA{ʨ_b!!SA{ʨ_ {CS!R +# )==#='=+=/=3=7=DEjARSA{Ѩ_ {[S*R<4!!`#@!LH5sq@ T!*!SA[B{˨_@"B`5*!!SA[B{˨_!!&{S[*#*@'@? @T@uRSA[B{Ũ_*!!k@uRSA[B{Ũ_ {Sɸ!R@@?`~RSA{è_{4!RF R{è_SHH@{*GA!#ְ*}`RSA@{è_֏G?1T{S*4\!*c`RSA{¨_!RR{SRar4RSA{¨_!BRRe"B<!*gRar" RSA{¨_ {Rar y! @{¨ {S[*_*5SA[B{è_RarZ"qAsgSA[B{è_ {S 5sSA!{¨! SA{¨_!SA!{¨{S4R[c**ks2**zS*@5kmT s~*`4wkT*`QTRKTqŸZA! <:7Z " AR!! ȯ *ź45!! x.Q*5KGSA[BcCkDsE{Ψ_k-T*rЯ@_qT!!@ ɯ!!` j@5;@@@95?@@9qT qT@!! _B9`5QK !! !!_B94!! `7@!! !!U!! P{S*1TSA{¨_*SA"{¨B {S@cT@SA{ƨ_[sc`@BTS_T!! B?TC7@+@? @zATN @cCNSA[B{ƨ_c#@/@ ?!!#@!! _|j@5!LCݶ@+@? @zAT@ @N=ER!&!!B#c#ۭ@/@ ?!!A#@B_{SfE @@B SA{è_ { E @@{è {SPA@e`BTx!@@Ҡ?`~!Ĩ!@SA{Ĩ_@A{[ @Sz`BT"R!@@!Q!SA[B{Ĩ_ " @d="" <_ {  @@{è{S*^ 4*IR**.«!*R5***@*SA{è_**R*Բ!7 B6_{S*R******SAR@{è{ FD @@{è|X {Su*@5*SA{è_!*5A*SA{è_!!*SA{è_ {S*"B<qT*̨qT#c !! *SA@{è:** {S[*#SA[B{è_*SA[B{è_{S**kTSA@{è_**SA@{è{S*\SA@{è_ցR*SA@{è_{S[*ZqTtC`SA[B{è_*SA[B{è {S[*"@szs@D`5*SA[B@{Ĩ_!!@ *SA[B@{Ĩ{S*D?@4SA{Ĩ_aR/;*+SA/@{Ĩ_{@ S*qTA @SA{è_*SA@{è {S*U*?@4*SA@{Ĩ_*|`4*"B P*SA@{Ĩ_aR**SA@{Ĩ_{S*//@qT*SA{è_*SA{è {S@**`4*j"R*~ RSA{è_ {S */@4!*SA{è_!!@!*SA{è_{S*[B #4A4SA[B{ĨE*\qT-T q`TqT* 5!!@?!!SA[B{Ĩ&"*B<9*qT*5*d*y@!!642**Ҡ4!*!` *Ʃq!4 !Ϋ;"!!*F@!!! ! {#RSRar*BB>ʬqaT!!SA@{èԥ!ѥRBRar*RA!?A@{c*S*"B[M@ 8KK ՟qR T s*ekaT@*@*A4*SA[BcC{Ĩ {S*mqT RSA@{è_!y*`*RR4*RSA@{è_{SRar[*"B>>4!`!I5SA[B{è_!ARS"R*A!=!&4SA[B{è  c0{S[cAA(+B ,Ԩ {@SA[BcCc0_{@ SƤT!! +ҽ T@SA!@!{èa@ (TSA@@{è_"SA!"@!@!{è {Rdr'S[*v`@R@B@T"R5**SA[B{è5*SA[B{èR{ *Ѫ R @{¨_{ v* @{¨{S**4`4*%*qhTU*`4**SA@{è_E5!@5*C!!"R!!`{ *s@R @{¨_{R!RS6!Rޤ"Rԣ RSA{¨_ {Rar @*7 @{è_qT @{è!R"R!AR<{!RS`T@4qT!! RSA{ʨ_!! RSA{ʨ_Rq-T! } RSA{ʨ_!!u RSA{ʨ_5!!j"!RB` {!RSQ!*7!Rܩ3*"R`SA{¨_Rѩ"R!@RSA{¨_"!RB`{R!RS!R2"R("R!y RSA{¨_{Rar ' jRRRa! R @{¨_{Rar R{_{AR 5qEzaTAR5!RX R @{¨_"ARB {R!R ARAR!R R @{¨_{!R {!R|4 R @{¨_ R @{¨_{!R qT R @{¨_!R R @{¨_{kz9S[6ւUFc7xs&?4??S 5RRRǮ4TF@!! <@@?R@b! C?@?/GARB@@RSA[BcCkDsE{֨_{"BSRar!,qTSA{¨_ւa!!xbA*@A7SA{¨RARY{ARSR*!R*!RD "R!t@RSA{¨_RSA{¨_ {aRSAR^*R!R*!R{"RQ RSA{¨_RSA{¨_{ARS?R*!R*!R*!Rհr RSA{¨_"ARB {!RS[ qTWR6R* *5* RSA[B@{Ĩ_*qT* RSA[B@{Ĩ_!RwRVR{ARSR*!R5*!RR*RaR(*aR`!R5aR5**cR!RRSA@{è_"B`!RaRԢ4"aRB`"RB"ARB{!RS[ q`T"BAR6RWR*rqT**,44RRa R]> 3@B!ު!B@֪o@!BΪs@ݦ!Bƪ/@!B  R1> k@ɦ!BR%> A9!B@A9!B`A9_!B R > '@Ŧ!B+@!BR= A9?!Bv R="R` T!B@g R="R T!BX"R*SA[B@{̨_!RޥBaRYTaRVRJwR5!*qAT!*l"Ra)5B***SA[B@{̨_"R*SA[B@{̨_!!VRwR {!RS[n q T!R*ARz**#!R 5BSA[B{̨_aRaRT"R* RSA[B{̨_!RTARJaR*E** 4RR)T!R`4@!k@!AR@ {!RS q T*` !-T!6C"*e R96*DRD9"6 RC9" _9*y`RSA@{Ĩ_#*RarBT!R]4&"R!_!ӟ!!RΤo*j9!{!RS[ q T5RAR***qT*J4T!R4*Q@"R;4"R!@RSA[B@{̨_ RSA[B@{̨_+*1 RSA[B@{̨_!RkURaR!* *BSA[B@{̨_ {!RS[c#, q TtRVR7R*#q-T*R*R*Ta R*<AR <24 R<24?qMT2-Rar 4T!R 4O"R*A9**RSA[BcC#@{Ũ_Rar- 5BRRRar!B=!D!ީ*ҳRR!RR£vRWR}!{Rar ' RRa!!R R @{¨_ {!R gFRr'! R @{¨_{!R W܅RLr'! R @{¨_{!R G: R @{¨_ {!R 9 !T @  R @{è_/:/@{!R %;У R @{¨_ {!R8];:R{_{S:bg(`*qTqT4@SA@! {èd*#*qTsKn`b(ahx! R@SA@{è_Ab R@SA@{è_!R*AR*kT6 kJT!RB\!RBV*BP{S[ɝq-T*qTSR4R**#RqskT* RSA[B{è_B !R*)*t RSA[B{è_{S[q-T*qTSR4R**#RRqskT*T RSA[B{è_B !R**F RSA[B{è_{!R 'mV@ ARjqTARM @   ! @T$ ! A AT9 R @'Bm{è_A 9 R @'Bm{è_9@  A 9 ۢ R @'Bm{è_A :Ң R @'Bm{è_{!RSG*ARCk'y RSA{¨_{!R h9 R @{¨_ {!R &: R @{¨_ {!R @ .AR@ A $: R@ @{¨_{!R 6: R @{¨_ {!R 9r R @{¨_ {!R ѝ q!RT@Z R @{¨_5 4! R @{¨_!` z R @{¨_ {!R `4!R<@R @{è_!R'm  @ T@%e! Te! $TA ' !(@T 9(!@R @'Bm{è_$8 {!R /@4* R @{è_!R R @{è_ {!R ϝ4!R̟*?q!Z R @{¨_!R6  R @{¨_{!RS4AR`5!R @ AR@ A 8š@ RSA{è_AR*qT4R!R !ARB  {!R w4!R R @{¨_!R@%e !Te !T R @{¨_8 R @{¨_ {!R Q4!R R @{¨_!R$e !Te !Tc R @{¨_8d R @{¨_ {Rar ' bRRRa! `R r'@!B`1R'7B 6!(7B! R/!B R @{¨_ {!R +@ R @{è_{R{_  c0!R{S@@ 8 Ճjb8@!xcaj"8B@_#T R {@SA@c0_  c0!R{S@@a "a!hc8h"8B@?(T R {@SA@c0_ c0!R{S3[ARs5)*#aRqT Da(T~@c{@Ě?TcC!@+O{@SA[Bc0_QCt~@~tP|q#@Tsq T7Dc 7sqDc!T7- R{@SA[BcCc0_ R{@SA[Bc0_ c0!R{S7@=@7 Ճjb8@!xcaj"8B@_#T R {@SA@c0_ {S** q Tk*SA@{è_6t~@@xtq TTq TLTqTqTX7@uxsxtxO7q*SA@{è_q@TqaTqE7@qTLTq TqT;7@uxsqTqT27@uxs-7@uxs(7@uxs#7@uxs7@uxs7@uxs7@uxs7@uxs{!RSARARHCRtTbRPa!@se8" RSA@{Ĩ_c0{[kC|@_qMTc+S3 ***^r@T\j38skJTSAcC3 R{@[BkDc0_j38skJT c0AR{SsR!R/(!R=/@!S 5 R {@SAc0_! , {@SAc0_{!RSAR*@6|@s ?7aR@6|@_BT!!5= RSA@{Ĩ_ qsƟkЂk TKs~@aB|@B RSA@{Ĩ_{!R#S[AR"R*'@6|@ ?7*aR'@6|@R_T*SA[B@{Ũ_ qRƟkЂkLTK~@B,*`4sa@8T*SA[B@{Ũ_ {?S[c@9 @@zT*B-64k+Z-9c-R 5*sBkT@9@?kmT{@T a@TsB*kTkD+@*SA[BcC{ƨ_*)@!!n a@@!R*B-k+h{S[*ck:RR @9xq T3~T  @94@9qTq TkT3T*SA[BcCkD{Ũ_35@*xxq TLTq TTq Tq Tn5@hvxxxx`H7q4**SA[BcCkD{Ũ_qTqATY5@hvxqTLTqTqTM5@hvxqTqTqB5@" _bTkT @9kjT45@hvx/5@hvx*5@hvx%5@hvxk45@hvx5@hvx5@hvx*!Ru {S @[ckQ+a" 49c01` @@4T@9qT TqTqTa@9#Q4t|@bB@_T |@`_?'TcQ1aT`@!.G|@t@Z˚&a"@[B!cCkD+@a"SA{ƨ_ֿqT{@*T_T@9RRqBzAz TqT`'T {@_T@9@@9qTnq! T4@9q$T Tq`TqTA nqAT@9 ?xqT@8?qTa @ 2@9?tq@T` @AT`@qaT_"Tw˙ҿq@kx8Tnq !TkqTA'4TUO_!T҇q T@94@9t@9qT~qLT|czt92a@9!Qa9k@9?qTT"QC$qT!Q?1T`@9?kJT!|@`@T`@˟T`@ 45ZT ?qaT @9 ?lq T@9?xq @8qT` @ 2@9tqT` @AT`@h`@!@.c{@_T3@@9k4I`@_"T@9[@9qTlqTkq T4ZZ`@!-9`@!/4 @9qT` @` Ta@R?@T@_85@@9 5lqT`@!`-|@`@}t|@ ~qLT|$U ?"T @9@@9k!T@9"Rc@ @BTA@9kTkBBqTZ TZ@9*`@ @9**5_ T`@*`@!-`@!/@9?xq T@9@9_qT?q`T_k@T*5 T_kT @9kMT9R5` @  {S[k*!RsARaR"Rg7@ 6|@?bTc4z5;@@9zqT;!Rs9zq C@sUTcC R{@SA[BkDsE _ qmT"_k T|@c34R;@@5Ҝ12Tj27@7@˟Tє`T@8 2 4 T*2 cC4a!QKNҔ{@SA[BcCkDsE _{@SA[BcCkDsE _ֳ/;@! +@RcC RK!RIbc0!R{'m gS[ck fAR faRo* f[@RB{Q@9 q#T f _{q_@T_[@Rob{@ qs-%TGc#RsKCOk@_ TAA T{Ab@8"h 8_{q`T{@k T9VT@s@q@TqA TfaR*f"RfĘ 5f!fj_{qT sEk@B5 f*@Rb{@SA[BcCkD'Fmc0_!qAf5f*ff!3.faRG@c@-S/AAT{A@9"h 8c@ITkv8_qT1k{8 @ h`xX7?qTf@!@2AAT{Ak{8"h 8c@(T f!CC@A?qTC9"Qs@_kKT4"Q!`-ff!f!C9 5ffaR]@T f{@Ty!AE|@K@|"he_TO@_!heTg@!! faRB1sE?g@!!ٙS@CWO@W@C@!hes@֙f!-s@{@͙R$ {RarS[`@@T b@9a @?AT`@TRSA[B{è_`` SA[B{è {S @"@9CQhqT@!4:R "Xcxd#`ցR@RaSA{¨_!RR R RaRRRaRRa@9RcQ$q(TeRRr B _8_8QcQ $q@EzT@Q<qT@R!3*RbARRaR@Ra@9BQ_$qTeRRr_kLT B _8@9QcQ $qTb_1`RaT@!@4`R!RRaR!RRa@9RcQ$qHTeRRr  B _8_8QcQ $q@EzT@Q<qT@R!3*RzR Rav@9RcQ$q(TeRRr B _8_8QcQ $q@EzT@Q<qT@R!3* RbVAR RaR!R*aNR K@9RcQ$qHTeRRr  B _8_8QcQ $q@EzT@Q<qT@R!3\*Rb*`}`Rb$ {!Rcky 7@9,4SsRҔ"7r[S3@!4R{@4 CT_qT/@@9a4/@9AQ?hqhTcp%aXaxca! րR*:W*o@?kjT*WQ_j! TV {@K  ~@7T!RB6-_qhT!R&/@@95*SA[B> RcCkD{Ǩ_RZ*W RR{@kW@9 4c q`TW@53@!RB`5zRRW@qT~@{@˘3@!RB6W@QzRR:R{@R:*WRz*WRz*W@9!Q?$qTR**zWo@kLTQ@Rz*W@9!Q?$qiT3@!@4T!RB6XzwOZRwKRZ*W^@9!Q?$qTR /  _8_8BQ!QW ?$qSzTQ<q(T*ZW@RZ*W@Zw$R{@k@9!Q?$q TR/  _8_8BQ!QW ?$qSzTQ<qT*RWi@9R!Q?$qTR /B _8_8cQ!Qb ?$q@SzT@Q<qT3@R!3*R{@oR{@R /  _8_8BQ!QW ?$qSzTQ<qT*zW/RR**WWRZ**WQR?kT/! _8@9cQBQa _$qT?1T!|@{@P*$ RcCkD{Ǩ_3@*R!3z*W3@*R!3Z*W3@*R!3R*W{[@@SA@9QhqiT@*!4R@O qLT*SA[B@{Ũ_P(Xcxd#`O@9`43= qTO@R5 @!RB`5RO@qTR*URO@k+TbQ_jaTS *sKs SA[B@{Ũ_@9!Q?$q)TR*R@kT*ObQ_jT@!RB6wO@bQ R R@OR5R*OR RRRR*ORR*O@RR*O@R5R*O R*@9Q$qTR5R*RUR*ORq RRm R@Of@9RcQ$qHTeRRr@! _8_8QcQ $q EzT Q<q T@*!3R*R@OC@9!Q?$q TRR*}@9!Q?$qHTeRRr?kT@! _8@9QcQ $qT?1uRaT@uR!@4R5R*O@eRRr @c _8_8Q!Q ?$q`EzT`Q<q T@*R!3*ROeRRr @c _8_8Q!Q ?$q`EzT`Q<q T@*R!3w*ROeRRr!Ac $_8 @9QQ $q`EzT`Q<q T@*R!3[*5ROuR{!R3gSsz_fARufaR"R,c@6|@?TfaRB7^g _@k@95<Rk |@s?T g_@k@9`4k@8R[#c?8C _q`TT_#q T_@᳀@93@4J*3ViTc@TfAR?@᷀fsb8AR=_q@T(T_qT@`@?q@T!%!d4Q @8B"8Tq`T qT@f **᳀_@3@95[BcCkDfa *3@SAsE{Ϩ_*5pS R!Q J'Kf* **@Re@kЂ@qTi4GQ`81Tg8@ Q1 *T`8 q *T@9 * q T*qT!*@R|A*q)5|@D|@)ѩ  *fC@%ie8kTKWs@@@K@W@kTf*fⳀa **V@Rh@kЀqT4Qb81Td8 Q1 *Td8 q *mT@9 *F|@bq, Tc@|@"_ Tfaa ***aGs+|@fG@G{G@ **KQ1Qb8TK Q1d8 *TK qf8 *mTg8 *K@Q1Qa8TKG Q1`8 *@TK qg8 *Th8 *jo@@b*4Qc ha8$?Bh!8ATfAR?@G᳀G@A5Q|@!K|@ !)   _8*fC@4# S#I@S@ AT@R3}|@ id8*fC@4G @IG@kLT@lD|@hd8*kC@TfGW@@@G@W@kTf* c0!R{'mgS Wf_cfW@@9 4[ck#s:4RO; *T) "Q?q LTs@{?h 8@QqMTNT!s@{@{?h 8@Qq TqTHTq T4 q@ TqATf*;@f[@ࣀc3T[@ᣀ[? T NBTs@{?h 8[@ᣀ[T *W@@9 5[BcCkDsE R {@SA'Fmc0_qTT'q2!1s@{@{?h 8[@ᣀ[?Tᣀ"f*@q@(T qQ@&T?q+T|@cє`4 ՃAk`8!a9ATᣀ{@*{f*;@@ gq[@ T@~@{@{@H5q!8mT Q4 c|S8T{@!f[@c{*f[@f*`*@ qT`pS!RQ K?k@zTf*B9@f|@~S@?@?@5aq!8MTeQ%~S48!?T@?qdDzTqaQ"Bԁׁ#R?)?@*{@{Hf**@*_ qM T@C|@?@@@?@f5Aq!8mTBQ"A Ք~S8?T{@*{ f*;@c)[@ TNbTs@{*?h 8[@NTs@{?h 89_q-TBQ" Ք~S8T{@*{@pSc#kTf*B9{&{@@9qmTeQ Ք~S48?T@?qdDzTqcQ"RBԃ?)?@*{@{9qT Q4 c|S8T#rS Tf*O@@[@f*B;[@{NT!{@"?qg@T|@є@b?qTBB #@8c_8ATf*B@:[@`!{@p5  c0{'mgS[ck%*f!RfS@S_T=4Rs NTs@{B@9"h 8iT@8qAT@@9qTNTs@{Z B_8"h 8TsE, R {@SA[BcCkD'Fmc0_!k{@ek gKTA@9sE_q T)T_q`T_q T_qATf* C94'[@Tf*B;RV( fҸ'*f!P~@{@{=_q`T_qTf*T*t'j 8@ f'{@ {(Z ?qAT`@9@x`xX6` @9c a@x`xX6`@9zg` `T!{@f*B?2ZYf* qTTqh Tf*Ҋ^{@{q Tf*َNW@Ts@{BR"h 8 `=GN Ts@{ R"h 8NbTs@{@9"h 8T@9 Rqd@zdJzT@ahax6@9xax X6O@A('f*; @ &@"j 8 f'{@;@ {f*B=!{@{[@iTQNT !{@!{@NBTs@{BR"h 8{@{xf**5f"B=&|@R'&@!@9'R9G@A&fɍ*Rk!B;BҶ&|@{@{?!{@!{@P {Rar ' J"RRRA!u"RRw!5!!E!!ߊB>!! R @{¨_{"RARS[?aR*qMTaR *kKTKw2k(T*4k-T *!Rs .kAT*!R(*SA[B{è_SA!@[B{è$!R;*k TR*SA[B{è_ {S"R** "R*Ήq T**!RsqaT*F!RB`/ RSA@{è_ {S*[* 4c#47YXR67R7t6!`"I*&`46**SA[BcC#@{Ũ!>7!5cC#@*RSA[B{Ũ!=&*4**yxRVWR6{!RS[PqTR!R!R**AR*kTqTkT!RB*!R}kTt!R*v*!R*kT*!R RSA[B{è_*!R`*c0!R{S[cqTR!Re!Rl*#ARB5"RaR2**RC,*pkT# C'@skT*!R"5ω**s&'@kT*!R4T R{@SA[BcCc0_*ԉ*! {!RSqTR!R!Rq@T qTAR[q*a@zTkMTuQ!R**!Rf*kT[B*!R^RSA{è_SA!{èARB*[B{ARS[RcdaR*`*R\*RBq8R˜*<qT***3qTBR*kLTq-TKKkTkWz+T* K*!Re *kT*ۈ RSA[BcC{Ĩ_qATK *!RM *kQTw2 kTaRBnЁRB hkWzTR*!R4{?kcWKT*S[**k9s*!R*!RARĈ5#R"*4*!R*!Rq`Tq@z&T ~S*!R*!RAR5#R!^*4*!R*!R q T*!R؎ T*!RЎ*!Rt**!R*n t!R*ARq 5#R"-*4_kT!*i#RA*k4T!\Q!R*ARNAR`4aA"RAR$*!=k5HT*!R$*!R*{wAR!a"RARŠ*!!*!R*K!RK` _k T****K_Wk#ZkCTSA[BkDsEcC{ƨ_A2AR!a"RAR*!Ն!ц*!RARć5#R"*4*!R*!R"AR|AyAv"RARS*!*****AR]!ZaW"RARk4*!Z5A~S zS   {!RSkqTR!R!R*q-TkTARYqTARZ*R!RqRSA{¨_RARB !RAR>qT{Rar ' LRRR!!w R @{¨_{!R R!@5!RR`R @{¨_{!RS[AR"R*`6@BaR;*@S6a~@TaRBm 4@9q TR 7qT@kj T`|@j`8*!?q`TqTat RSA[B{Ĩ_s sq-TsQkTu5qTs8`~@!?qATsQj`8B_qAT*!TaRB.4s8qTu6q T `Q|@j`8!?qT** 5AU4' RSA[B{Ĩ_!R1dJ@zT!`{!RS["RAR*@ 6@|@?b TaR 6@|@˿T RARB7;@k Tk TRs83_qT 06@9dqT$Rhd8fqaTcBxSe*|@77C qb B*BIzTyf_kT T!k* T̊ RSA[B{Ĩ_` aRcQ@6|@ ?"ZqmTsQ*?kTkTaRBa@RSA[B{Ĩ_QARB7{R;@RRc0{[*qTcCnqmTkZ+S3R*|@_kHTŊs0kATSAkD R{@[BcCc0_**;@RSA{è_R+@!SA{è_ {Rar ' RRԋR!!!!@!B@ R @{¨_ {"BGS3s)aA#R!bb@SA{¨_{[@cS(@@#@@LqT.@@bR@* kT4!@ @.06&@96@@$@9@AT*SA[BcC#@{Ũ_`ҢR@kT#Q3cKB c3c` _T.@.@@@k T" @#@cJ@AT*`4~?1`T@&IR?2@#|@%?qTA_!I8?qA @ _q|ST* * xc8@ 1`T?1T_ ?1T{pS@&?2OR@ kTZ? kT 4*18*Ey(T(|@%I Gyh9G 1@T ?qT!_+I8q7*qTq'|STkT!\!*Ek!TZ? kTAyh 1!4%8*Ey(*aT{_)! !*!*_@!@@!< {R @S*@*(@a"@`*@?kJT@b @!&@`"@@kTB@" @`"@a"SA{è_` @ҁ@b@ a"@b @!&@`"@@kT@@r ۨ`"@b @& EA)k`TR_{D@q TqTE@dRCKeA)kTS*[`@qTqTSA[BR{Ǩ_`@aRSq[T.qmT6qaTK@LqTC@c[@CLq`TR@5RSA[B`@`R[?qSLT?qjT?kT 4C@*@k@Lq Tc@  !TR R[Ba`SAqjTqT" @4D@eRCKR4c@R R[Bb)SAD)k-T@e#@hcqTBQ!dS!\*!2/4F& ?k\D T ?k T?kATk TQ Sk\Ơ*KX\*h#_?k!Ї{S[*"@_(q TT_ q@ T_$qTb@R!\*@"@`_@4QqT _4q@"@Ax`@T!X!2Ax `@Q_qTT_q TTd@cRCK*fSkL T!8*!2 _qTb4_qfS!\*!2 R`V)SA[B{Ũ__q T_0q!T@`@"@ R!@`kT! S!* y@7@9kT@9Q9`@9Rc@9 qTb y!8*!\*@"@`|@SCx`c\a*Ax *Xc@ERdRf|@;CK*fSk T!2R!*}!4FR`)v@fSk T@9RkT@9Q9c@9a@_1@T#@1T@?2%@a|@dxa8A 1Tc 1TBkCTZk TB !4!8*_"_{!@}{Sc*'@,qTA)k!TR^)SAcC{ƨ_[1 Tb@?2&E@xd9B  _1 T1 T|@qTC_cH8qC`@q@T@,qTb*@Rx*rO_O@s_@`"@fS`&aR**`"@aR`&r**`"@a`&*@x"@*x&** @***R[B^)SAcC{ƨ_**?1T`@?2&@xd9V  1`T1T~@qTC_cH8qC`@q@T@"Cq** {S!@?0q*@T?qA T@@ @6bRFS^*!*t*@`*Rr1`T1Tb@*?2D@ "|@#xb8B ?1T! ?1TkVZk T B4T8*SA@{Ũ_@"@BxcClqTb@9 0@9B_kLT@`9BBQA@)?qTG7 *SA@{Ũ__qlT@ 09@a@9?kT`@9Q`9@ @B|SFScQ!R!*BR !*2b*@`*Rr?*O?@3O@` @!Y` @!@ U{R @S*[(@@(*@a"@u*?kT@Rr!d @b"@@&@_k*T@1 "`"@a"@T1Tb@*?2E@#|@"xc8C ?1T! ?1TkETZkTB c4b8*SA[B{è_` @@ @҂ba"@@rҥ ݥb"@d @&*SA[B{è_!{!dSR @S@UR5\*(@**Ya"@`*@?kJT@b @!&@`"@@kTB@" @`"@`"SA{è_` @ҁ@b@ a"@b @!&@`"@@kT@@r ҏ`"@b @&  @ $_ @?1$@T(@_1T@?2e@C|@Dxc8C _1TB _1T!k$TZk T! c4a8*_(_{!@ @kT*R$*?1T(@1@T@?2$@ |@xa8A 1T 1TckbTZ_k,Tc !4#8*__֡(_{!@T ?1B@T@&|@DS?2@`xf\*`x&8@ 1AT "|@`xb\*`x"8@ 1T!! ?1T_ {!8* @S@u SR***(@a"@`*@?kJT@b @!&@`"@@kTB@" @`"@a"SA{è_` @ҁ@b@ a"@b @!&@`"@@kT@@r Ҥ`"@b @&{!8*R @S@5*(@*Za"@`*@?kJT@b @!&@`"@@kTB@" @`"@a"SA{è_` @ҁ@b@ a"@b @!&@`"@@kT@@r Ґ`"@b @&!dS_kT!8*!2n{!2S*fR*!*a*SA@{è_ @@9d0@9A kT?qlTa09_{!@ @@@9d0@9A ?kT?qTa099_{!@ @t {@S[c @9#a(@2x@K@@LqT.@@bR@* kT4!D K@.06&@96#@@$@9@!T*SA[BcC{Ũ_`ҢR@kT!Q3!KB 33sb _T.@.@@@k*T#K@"@BJ_@aT*a4{%|@DR[cR@Sc(@S@#K[@@LqT.@@bR@* kT4!E [@.06&@96+@@$@9@!T*SA[BcC{ƨ_`ҢR@kT!Q3!KB 33sb _T.@.@@@_k*T"[@#@cJ@aT*C4~#@4qT8qT_@B#B S@ xcX B*"x#_@B#@$xcX\*"x#B\@9B*"x#@90@9!?kT!9_?qT!099{!@ @"@_4qT_8q@T_@R#@@xcX2@x#$_@R"@xb4F#)_{ !@?(q`TT? q`T?$qTb@R!\*Ra) @{¨_ 4QqhT@@?4qb@ xb`TXR2 x"cR` @{¨_` y@7A@9kT@@9Q@9`@9Rd@9 qTc y!8*!\*Ra) @{¨_4FRa)@@9RkT@@9Q@9d@9{S!@?(q` THT? q T?$qAT@R!\*R)`@b@90@9B_kLTAa9SAB{¨BQ} 4QqHT`@?4q@Axc@T!XR!2Ax#b@9_qTA09a9BSABQ{¨a?qb@9`@T@AG7c@9?kTBQBb9@R`@b@9G7 y@7a@9kT`@9Q`9@9R@9 q`T y!8*!\*R!4Fӂ)b@9`@9RkhT`@9Q`9@9` @!@ {S!@?(q TT? q T?$qATb@R!\*ZR@a)@95 4QqT@?4qba@ xb TXR2 x"d@9%?qT!4Q?q T@Rba@ xbX2 x"d@9`0@9B_kT_q T@`09`@bA)_kT@9?kmT`@@9q@T`0@9B_kT@9BBQ`@SA{¨_`@G7kTBQB9R``@` y@7@9kT@9Q9`@9Rc@9 qTb y!8*!\*R@a)4FRa)*`@@9RkHT@9Q9c@9 @!@ @9@ {S!@?$q!TbA)_k@ Tb@R!\*Ra)@@90@9B_k, TAB9BQSA{¨s?(q T)T 4QqT@?4qc@Axc@T!XR!2Ax#d@9? qTR`aA)?k`T@9b@_kT`@@9q@!Ta@G7@9?kTBQB9?q@T?(qTT? q`T?$q! Tb@R!\*{Ra)@!4Q?qT@Rc@Axc!X!2Ax#d@90@9B_k-T_q,TA09SA{¨_` y@7@9kT@9Q9`@9Rc@9 q Tb y!8*!\*LRa)@a@R`@@9!G7@9RkT@9Q9c@9!4FR`) @!@ j@9@l#A)kT{S!@?(q TT? qT?$qATb@R!\*Ra)`@qT@9@B0@9_klTAB9BQSA{¨ 4QqT@?4qb@ xbTXR2 x"cR`@9b@_kT`@qT`@@9G7@9k+TBQB9?q`T_qTA09` y@7@9kT`@9Rc@9 q Tb y!8*!\*Ra)@9Q94FRa)@9RkT@9Q9c@9 @!@ {#A)SkT:`@ qTTq T# TqATc@ERdRf|@+3;`RaqTSA{Ĩ_qTqT#R3;Ra`qlT2SA{Ĩ_A`@ qT#R3;` @R(@+;`d@cR3;{``@{[Sc***@*@_q Tq`TFS^*!*/b@ca"@RSAB$@a!)[BWh!cC{Ĩ_@1+TD5b@9kT R`@9Q`9#5`@9kT`@9Q`95c@9_kTb@9BQb9D5b@9kT`@9Q`9@qCT75`@9_kKT@_kTd5d@9k T{S3@[&qT*qT"q T@qTSA[B{è_֠@`G7@9k T@9Q9@@qT@SA[B{è#@9Rkss:* y@9B SA*!*H@dSA\*!*@@G7@9kT@9Q9 {[S.@9Z@)q T@RN)` "0@9kT9sfSDS\*s2!*@q`TSA[B@{Ĩ_qT 09G7@9kTsQs9@G7@9kKT@9Q9 @!@ {S!@?(qTT? q@T?$qaTb@R!\*NRa)R) 4QqT@?4qb@ xbTXR2 x"c?qT?,q!T@`@!@q -TB&#_cBH8_q @A\_z"2A`@1Ta@?1T@?2D@"|@#xb8B ?1T! ?1TkTZkl T B4@8*?qbT?qT"@a @&?1`T*@1T@?2D@ |@xb8B 1T 1T!k#TZkT! B4A8*` SA{¨_`*` SA{¨_R`R+` y@7@9kT@9Q9`@9Rc@9 q Tb y!8*!\*Ra)R4FRa)d@9RkT@9Q9c@9 @!  {S!@?(q@T T? q T?$q! Tb@R!\*Ra) "R1@Ta @?1@ T@?2D@"|@#xb8B ?1T! ?1TkTZk T B4@8*"@a@&?1@T*@1T@?2D@|@xb8B 1T 1T!k#TZk T! B4A8*`SA{¨_ 4QqT@?4qb@ xbTXR2 x"c? qT?,qaT`@?qT` *`SA{¨_R`` y@7@9kT@9Q9`@9Rc@9 qTb y!8*!\*Ra)4FRa)@9Rk(T@9Q9c@9 @!<  {SB@!@9a@_kT`@ qTTq T TqATc@ERdRf|@;CK `Raq Tk@BR y?$q 9@SA{Ũ_qTqT#RCKRa`qLT2`@ qT#RCK` @R(@;K`d@cRCK``@ {?qS[T**#T? qaTfa@?q@T^*z@c"@B$@a!Rc)Vh!SA[B{è_!0c @4SA[B{è_4`@qIT,q`T0q`TqTbA)a )*a @SA[B{èqTqThTqT@R`a@G7@9?kkT@9!Q9@`@!@q -TB&#_cBH8_q @A\_z"2A`R`a@!@7@9kT@9Q9a@@@9 0@9B_kLT@9BBQ`@)qTbRA\*Ra)_qT@ 09 @!@ 3 {?0qST#T?LqT?PqT`@ q T,q`TqT"R>*a"vb@"@&p`SA{¨_AA)?kTSA{¨SA{¨g`@qT@9@B 0@9_kT@9BSABQ{¨o@@QqITb@`@ G7@9kT@9BQB9_qT@ 09 @!@ {?HqS*[T?4q T?,qTbA)O_kTO@@0q!T@b@Ax`@"_tqTOC@O@q`T@9@B0@9_k TA9BBQOO@RSA[B{ƨ_?Lq T?Pq!T! @"@SA[B{ƨ_O@B@@_q2W@@_q T?qTBq T# TJqTFSs>^*s2*(*@R*Or _O@s_@@`RSA[B{ƨ_@OQO@5a6@2@SA[B{ƨ__qL TA09@?qC`TB75@9_kKT@9!Q9DSaJ\*!2*DS!\*!2*@R*O@_k$T5@9?kT5@9?k,T@@9G7@9kKTBQB9V5@9_kT@9BQ95@9_klT@?1$ T5@9?kKT R@9!Q9 @)qT!XR!\*@)E"G7@9kT@9Q9c@@ax`` @!@ @c @B$@` Ah _ {BQ1SRs=r*D|3a S3a*db~KSqlT38*aRa*k9SA@{è_bR!*bR!*^9SA@{è_{ҡ[BS3! Er !_i*9s^TSA[B{è_?qT#QB@?qBcmT_@!@@*!  {S*@@[b2@^5`@aRQ qv@HTt&@@?Ts_T@Wb@ @!@_h 8b&@`@B@!*R!`{S@ @@"a@" @9`(qMzTzT`@`kTSA{¨_\(q`MzTz@T`"@@"@" @9`K`R!  {S$@[c@a@# T`@ch!8"@@"! @" @9q T*s# Փ&@a@#T`@ch!8"@@"@" @9qT#@ kSA[BcC{Ũ__(Ta@YӀ@ǚ`a@y #ch!8"@@"aq Ts_Ta@UӀ@`a@u #ch!8"@@"!qT#R!`{S[@1T$R$@@#Ts_hT@W@|@ @"h!8`"@@"@" @9``R!`{S$@[ca@ksp@)#T`@ch!8"@@"!@"3@9*qdMzTXRs *qTT6q@TvqAT(`T@*qT&@a@#HT`@ch!8"@@@"@"3@9*qdMzDSzAT@k`T&@1 T5&@A@#T@@Ch!8"@@"@"3@9_HTa@ZӀ@`a@z #ch!8"@@@"**qdMzDSzT"@@"@"3@9 *_(TA@[Ӏ@˙@A@[ #*&@@a@# T`@ch!8"@@" @" @9U&@@"@!@B!@c @*@b@b v"@92d$@5b@!R@ @ T` @@` SA[BcCkDsE{ƨ_s_Ta@XӀ@~`a@x #ch!8"@@"!**qdMzaT'@'s_Ta@XӀ@a`a@x #ch!8"@@"a@.@7*B!"$RR!`R!  {S$@s[@a@ck#T`@ch!8"@@"@q&@"4@9c@TRs RqT_ T`@ah#8"@@"a@"4@9&@c@kaT@9k T`8'6_ T`@ah#8"@@"*_cT`@ah#8"@@"@"4@9&@Qxrc@aT? T`@ah#8"@@" @"4@9&@c@a_Ta@TӠ@`c@t a_HTa@\Ӡ@`c@| aah#8"@@"*_Ta@\Ӡ@`c@| a_ T`@ah#8&@@ʙk@c@Lq TSA@$R[BcCkDasE{Ǩ__HTa@\Ӡ@q`c@| aah#8"@@"A*s_ Ta@TӠ@[`a@t #ch!8"@@"a*&@qc@Tz`qTR1s_hTa@TӠ@:`c@t ac@`$RSA[BcCkDasE{Ǩ_a?T`@ah#8"@@"!@"4@9&@ Rc@s_Ta@VӠ@ `c@v a;*R!`~B$R!y{S[u@`&@7qiT `8w6cs@h!8`"@@"!@"5@9u`8@hTt&@@#iT_hT@X`@ɗ@ #h!8`"@@"!*Z`xbA! t&@@#kT@Rh!8`"@@"A@" @9`q}T! `867@f**SA[B{ɨ_5$R`"@@"@" @9`qT`"@@"A@" @9$R``"@@"@" @9`qT`"@@"@" @9#R``"@@"!}@" @9`q xTqT`"@@"@" @9#R`8({T`$R! cks`"@@"!v@" @9`qqTqT`"@@"{@" @9#R``"@@"!s@" @9`qT`"@@"av@" @9U#R`q`"@@"ao@" @9`qT`"@@"!t@" @9"R`Y`"@@"am@"5@9uu@t&@@?OT@"h 8`"@@"j@"4@9tk Tc sks*qoT T6qoTrqTt&@@#&T@ Rh!8`"@@"'@"4@9tq.TmTq+T Tq *T5Tq-TqT`Da@@!aAZ@"4@9t`8@6 ՟*qMz@'T`"@@"!'@"4@9t`8 7kTcCkDsEt&@@#ET@A9h!8`"@@"a_@" @9b&@t@A@`!B @a*@b@ v"@92dܱ@P5@!R@ @mT% @$R@р 7@`"@@"W@" @9`qT`"@@"W@"5@9unq=T6qJzA:T`"@@"@"5@9u6qJzT@"F(q`Mz*A:!T1 Tv&@@#T@h!8`"@@"@"4@9tzqTqTqT`8X6RRv&@{   @{Q#T@h!8`"@@"(@"4@9tqT`87 q,TTv&@*@!< @#_CT@h#8t@Bq@TT*qT6qT1T"$R!.rqTqTR`"@@"@" @9v&@@` @#_T_IT@[`@@ aqT`"@@"A_HGT@V`@~@ R#h!8`"@@"a*_DT@[`@h@ #h!8`"@@"A*tRRTRtR t@*4R_?T@Z`@A@ #[v&@TR@oRt&@@#T_<T@V`@(@ #Rh!8`"@@"*@" @9`a8; 6M{@v&@lS@#h%T@h!8`"@@"!(@" @9`a88 65 a&@ @ Kt&@@#HT@Rh!8`"@@"$@" @9`q6Tt&@@# T@bRh!8`"@@"!"@" @9`a8A2 6R|@@h!8`"@@"@" @9`a8 6| .Tt&@z@@#T_+T@Y`@@ #h!8`"@@"a*b&@t@A@' @a*@b@ v"@92d @ 4@$R @@р 7@"@9q!T*@9cCq_$T@V`@h@ #u@>s_H"T@V`@Y @ys_ T@V`@M@ #s_(T@U`@@@ #+a&@? T`&@u@>`"@@"a@" @9`@!R@ @TqAT`"@@" @" @9c&@#b@`V6vqmTRKQZ$@h!8Tt&@[kv8@#T_T@E`@;@;@# _T@\`@ۓ@ #_hT@V`@ϓ@ #@*,`"@@" @" @9`q#RT`"@@"a @" @95#R` `"@@"A@" @9#R``"@@"@" @9u#R`Sk*uF**F cC7@$Ru@=Qc`,cksR!`$R!!ks!! !!!`{@{S@c @*@b@b t"@92d@A5b@!R@ @,Ta @@!@a SA{è_ؑa @@!@a SA{è_a @@!@@a SA{è_{%$RS! dfBe"b"c2rt&@ҁ@ @`6`@ђ`&@SA{¨_ {@  @_qT B $Rb`" @{¨_`` @{¨_{ `" @{¨_{!RSl*1`T*lq RSA{¨_֢!RB 3 {!R !!R5 R @{¨_{Sk*!RlqT!R{o@9qT!RktҀa q4qT`KSA@{è_!RBaQq RSA@{è_{AR[olq TARSck+|R*!R!RCo Qq T!Sj`8q`TqRaT@9.@s`ksx 7R7@@ TSAcCkD+@p R[B{Ǩ_֓@98Rs@`ksx 6R`QkT@8`{ax6@9_7@* x`Q!R!Rl q`T!Rn2n7@!T!qAZB`AR{!j`8qT!RjpSAcCkD+@{R!R NARSaRPaRj!R,u R @{¨_ {R!R 6AR;ARj!Rcr R @{¨_{!R kQqT!RB-!Ro*Gp R @{¨_{!R ARBR!Rl*p R @{¨_{!R R!:p!ROkRp`R @{¨_ {R!R ARwj!Rw4@R @{¨_o R @{¨_{ARSB`!R#k"RR7vNk4$l4Rj!HjSAR{¨"n!!:jSA{¨_{!R#S[ nBaRRk1vSAR'@@55 RSA[B{Ũ_*j"R!;x!jARBR!RZRi@!@1Vv4qo"R!i@RSA[B{Ũ_ {ARS*ko*!RqqSA{¨_{"RARS!R*i!RjqDzTSA{¨v*߽!RtjARvSA{¨v{!RcbB1SRcRARs`**=v*qT&q`Tq T*o RSA@{è_*o RSA@{è_RR"v"PR'"@n RSA@{è_ {S\iR*AR!Ro!RjBRaRiiDҁ Q* OuqTAiQSA{¨_Ro!j@RSA{¨_{ARS/jR*!RqEzT!RB `5AR$i!RGt RSA{¨_SA!{¨eARB{!R y!Rzq@4!RB R @{¨_n R @{¨_ {!R _B!R5R!/n!Rikn`R @{¨_!RibR!Rt`R @{¨_ {?qSThKSA{¨_R o!i@RSA{¨_ {!R !!Rn"R*hhQ RtqT @{¨hRn!\i@R @{¨_ {!RS7l4SA{¨~h!R!Rh!|h!4n!Ruh"RAR!R*mh!RdiqDzTSA{¨su*!R#iARu{RarBR %pR!!@iB!q! m!B@ q R @{¨_ {!RS?AR*;qlT1Ks"aŸm RSA{¨_qs&am RSA{¨_ {!RSAR*@7qs"am RSA{¨_1Ks&aŸm RSA{¨_{ARS!R*KK,m RSA{¨_ {!R  *rm R @{¨_ {!RSAR*q`@zTqlT1Ks"aŸXm RSA{¨_qs&aOm RSA{¨_q*s&!$s!*aBm RSA{¨_ {!RS[AR*aR*"R*R*W7qMT qLTQ"B "*a B " ! !*m RSA[B@{Ĩ_֡!`$»ЁRB$aRB#{[ZgqTS3R *sgk ATqSAm R[B{è_!Rm R[B{è_ {[6gqTSR3R *sCkJAT*SAl R[B{è_Rl R[B{è_{[gqTSR3R *s!k*AT*SAl R[B{è_Rl R[B{è_{ARS !R*K,l RSA{¨_{[fqTS4R *ks AT*SAnl R[B{è_gl R[B{è_{!RS[ԿAR*п*"RaR*7qT qTsQ!&! ! El RSA[B{è_֡!`$aRB$ARB#{Rar ' RRnR!% R @{¨_ @5T R_R_ "@!?5T@q_R_ T@4R_ R_ {[Sb&R aF@T6@SA&[B{èKhc$hcJ Jh#%hcJ$h#cT_ Khd#hdJc cJh$T_Khd#hdJc cJh$T_{[ղSb&Rh aF@XTn@SA&[B{èO #hbh"B_T_  #hbh"B_T_ #hbh"B_T$4@p4!4@!|8 _DT_ D_T#h`Ch T_ !#hbh"B_T_ DT_ DT_"RD DT_ $hcEhc h#cAT_ $hcEhcKh#cAT_ $hcEhcKh#cAT_ $hcEhc h#cAT_ $hc|h#caT_ #hdc"eph$c]e|@T*_ {S*Ҡjcej4pdj#]c|@T@`:SA{è_{SRe |@4q(Tzfzcx(px#]c8AT8TSA@{è_ (G# yc xcc<|&!T@ *q] @K} kT 'xc)heFheHxc KcKk&Tpx*J!_9]TK}5qT E~ӣҥ 'xc)heFheHxc KcKk&Tp]x* JK}oY5q˄Tpx*_iq]Tl_$@*). J! *|$bpEd]E@"@ E|%& px)|]"@qd@ *|" T "'xbBh_k'lT#o?-e#py)]@T#@e @ } Q|#I'FCD@xi#aT) k!- *K գyjH5"4@ *} kc|"-T% &xbB_k &lT)9bpy*)}c]"xj? k$4@|"MT%  &xbB_?k&lT%hcJ _5 %bpy+d]k aT#F)c|"bpdc]!4@# !apc] )_{Md@~E@f҅|@S|3@p+t~@>t3H|}' J qhx9 *}@,|Fu1T&xm}+@Qk|@&TQ ѰK*nyj@( gyfѪK@ /  K'aTo* ѓRpҨ}5q`ThK~ˁ %& cya!Gib\B@cKK#TNpy-yYmDt1ˀT}p4SA{ͨ_ "aR$|rRR?q%|"`% |KbKńbD 4T@! !p&  x!!kT_RcKK?lq#b_B(B*4lT|@  yc$ycB Bp(B*x#ckT@?pqB Bpx*lT_ F)RK c(*4 C) pc(*@!T@4@A !p|_ {SuRa@8@ TSA@{è_ {S*[qRuҕqTRjs8s@k TSA[B{è_"aR$|rRR? q%|"bR`% |KcKBK#ńbKc_B c(B*lT|@C yc$ycB Bp(B*x#ckT@?pqB Bpx*T x!!kT_@! !p&#aR$|rRR&|#`& |KBK*_q mT|@BQB)K  d@)B Bp(B*bh'cT?TqR!KT4@!H(h?4q!|@Tx!!?4qT_ D@)ҥS*D$@Kp| hcEhcS*Eh#&hcK ph#c|aTC4@c|C4!4@!K$ 4|S_  R QR@K d@b@(B BpB*bDT4@A(4_#aR$|rRbR%|#`% |KBK*_qƄmT|@BQCK  C@)! !pc(!*Ah'BTR!Kl@?lq!!|@F(fTx!!?lqT_ $aRRre|$ҥ`e ||KE4 Chd#h$TD4@#Rc cQc #4?@TCl@RKA`  Cxad(*x!!c ?0`pT_R_ Dhc$h#cT?TB Chah!!?T4@ap4`|_R C@! #pCD!|_AT4@! 4 |_{[S=Ծ ;@Rb8UTSA[B{Ǩ_ {S҃j`dj`c*j ATSA@{è_ {S*`@ `SA{¨_{S*`@K`SA{¨_{ ĪRcRr a@ t |$B`A|Ka! KT @{¨_ R C@! #pCD!|_ATl@A l_ Ղhb#hbkTԀZ_B_TR_ Ղ hb#hbkTԀZ_B_TR_ { ZaR  @!5BQ_1aT @{ƨ_֣R*@|!|A !|5 @{ƨ_ {S[@Tq  |q RsQ&svS*IsQ;@! 1TSA[B{Ǩ_q  | { fabRBQ_1T @!`4R*@| !|A !|5 @{ɨ_ {S[e@Tq 3s~sQS7svS&8*msQ3@! t1TSA[B{ʨ_q ss~{S[D7R!RXs: 67R!R(Tw@~BKsq!T@SA[B{˨_ {SCR[c''@7 !Rps 67R!R */A~BKsq!TSA[BcC{Ө_{SR[ck77@!Rs!R2!R64C+* !R!RAtTK*U'*?sqaT+@SA[BcCkD{ܨ_ {SR[Cc#k ]Z!RA!Rw!R6T4* !Rb!R_/AUUK*u*qaTSA[BcCkD{Ө_@qZ_ "aRRr"|"B`" B|B|KAb(_ {S*a@ R Q SA{¨_{SRR[0R& !Rs@s q T~5G*SA[B@{Ĩ_{[CRSRRc# !R\sS@s  S kT~35G*SA[BcC#@{̨_{SC#[''@wtXSA[B@{Ө_{S#@Y@SA@{Ϩ_ {SfASA@{Ǩ_{kS[c-5RSA[BcCkD{ר_n4jq-TC#3R/c VqMTQ 4aRR*!R@46~q @Z ARQQB|_qT T qZZ_qZ{S[C#ck45?!R!R54c\!R!R54@7E7;5`5SA[BcCkD{ڨ_$7ZSA[BcCkD{ڨ_ {SC#[c'F'@BJ@SA[B@{ר_{S*"aRRr#R~"B`ӂ B|B|K@ D|@4qBazdb BQ" bz$T|@z 4qTSA{¨_ {[CRS#cR#0RAAR!K B!xSR!D R|c| #|cK! |B|  "|B K!  *q***a*bT**M*zSqT>0RcSA[BcC#@{Ө_{S*/"aRRr#R~"B`ӂ B|B|K@ D|@lqBazdb BQ" bz$T|@z lqTSA{¨_ {S*q T@Q5 Ra@8@ TSA@{Ĩ_ @*2!A*!A*! A*!@A*"|SB!K"!|S!A !A ||S_{A\GS$@BGB@SA{Ǩ_ {[AGS @RSA:[B{Ψ_ {S9@SA{ʨ_ {!\GS\SA@{ʨ_ {S:@`:SA{¨_ {SSA{ƨ_ {S*sb:@K:@JB J:@`:@Jb:SA{è_{S*m:@K:@@"JB BJ:SA{è_ {  R`: @{¨_{  @{ƨ_" {!\GS[o!:@@qTQ(**qT7RaK'sqT@ R[B:SA{˨_ N)F)|0*|B0*SRb @ct *{SURUqSA@{˨_{c@D8@S 8@|$T@R:SA{ʨ_  B{c@S 8@| T@R:SA{ʨ_p@ {S-:@:@ `:kTSA@{è_SA@{èU {[A\GS:@Q}**  R :kTSA[B{Ǩ_0SA[B{Ǩ_ {S*[cRb6K8R:@`~kT*:@|:5SA[BcC{̨_#*t0a]x4SA[BcC{̨_ {SwSA@{Ǩ_{SA\GLu14!RgSA@{Ǩ_{SzSA{ƨ_ {S[Cc#kPRf* 1B_1~+TR*8R)k*T!AT8R~@!T9_qmT QQ˔~@B9BT9TR{@SA[BcCkD_{A\GSARgSA@{Ǩ_{!\GSH*~qSA@{ʨ_ {[A\GSf!Rp,ARGSA[B{ʨ_{S**`*`SA@{è {S**`*`SA@{è { T5 @{¨_`Nq @{¨_{S[c8 4qSA[BcC{̨_ {S1`.`SA{¨){ , @{¨& {W|B|JSSKsQ[s~S #s~bQB|SbRBQB|SbRBQB|S|bRrBQB|SvbRB BQB|SpRbJBQB|SibRBQB|Scb RBQB|S]TSA[B@{Ш_{ `h` @{¨  {SvG@ 1@T!GSA@{Ǩ_bR {S[BY:403R, *SA[B@{̨_**SA[B@{̨_{c*a\GS[% q@TRm*SA[BcC{Ϩ_*wkT1*SA[BcC{Ϩ_{S4SA{̨_[u`5wWUSA[B@{̨_SA[B{̨_{So5a**SA@{Ϩ_ {SX 5[ usRRRESA[B{Ψ_ր&>SA{Ψ_{$`5Stb^RRSA@{ʨ_ր&@{ʨ_{[S@<8RRRSA[B{Ψ_{S[VWV4a@BR"9qT`@!RaSA[B{ʨ_b@R RC9``@`@SA[B{ʨ_`@aR9 {[!@S3@8Nq`Ta QR?qTSA[B{ʨ_bqSA[B{ʨ_֡@!5aqSA[B{ʨ_ {BGc!Gs@@S#@[k#44kxk@k* MIyuk@*~b^tXTfF>T0F*@:/53{@SA[BcCkDsE _!G7$ 7@\N7@Ekuk@b WM}y;k3}-]shn{@SA[BcCkDsE _  {GkBGs@!SD@[c7#4"4TwB!"77/ "7@Bl"BRw@d4 *kD6k@*KGCs;3/3^trp{@SA[BcCkDsE _  7[?;M1G7@} k!G@k@[wB! !7? nw@ w"7@BQ"?@B5w@w@a] UQIE {SHTSA{Ψ_ !{S[Cc ksK.v) 4$T, *!Ro#*!R3o@*Q* 1B~qT*9 ;ҡR@QB{*8R ?TRbQR<8B|B B|A`!_1TQ~@B9 1T3@c{@SA[BcCkDsE!_{S*[c*q$T+sg*'Q*1!TzSA[BcC{ۨ_{ 34 @{è_@@5 @{è" @{è !xG!@?qT{?qST? qT!FSSA{ƨ_֌SA{ƨ__ {!@S!\G5 R!R 55SA@{ʨ_ '{'mg)g[Scksr; ;@B f!ff!f!f-foc s!Rl*!Ras@yf*Ms!RN*!RCs@[!f*/T2{C s~S `~sqTs@C ;9  aRhQ*hARaR\Q*\ AR  {8aTaRJ*aRF @RBf#8BQB|B B|A\!3{@1kTs@Qs~@sB9Afofmf1ETff3{@SA[BcCkDsE'Fm'_ {!FS!XG SA@{ʨ_ {S[#c!G@RgRRSA[BcC{ר_֡@?{!\G[S!G`4 *!|A !|F!R 4- 4X@5SA[B@{ڨ_  {[@Sc4!G{^/*5@R+*SA[B{٨_U {C *kS[cCsC C#GA+7!G>@@RG@_qBЃ c#WS[ @5i!`7@PWRv5OGR`@bb`@R{@SA[BcCkDsE_ց@#CT F57@ 0`4@{sC Sc[cC#kG!G@@R@_qBЃ c #  jrM@5s;@7@5?@?@`@R`OHR`@bb`@R{@SA[BcCkDsE_ց@# T5;@]7@MTx 4@ {kS[cCc+!G@!Q<@!Q<@;@8 @R!@qЂGG`56@56 #4Z5| 5{@SA[BcCkD+@ _`{@SA[BcCkD+@ _@ *{cckSC[c?M!Ga@!QW<@!QS<@@[@R3@qЂ@5|6`5u6R# =`4 `5^N5{@SA[BcCkD _`{@SA[BcCkD _@ C { /[*cc*#Sk/ w{4{@SA[BcCkDC_/@#B`5ck=;*Rf@R [@c@Bh`8"h 8[@k@!!@@9Ah 8@T Ac@a@R0< A@; A; A*A#*? A{@SA[BcCkDC_   {. Sc*c[#k/ osw{/@ 4R{@SA[BcCkD_c<;*R?R [@c@Bh`8"h 8[@k@!!@@9Ah 8@T@4@cR;y@\;Y;@#*?y@;q{@SA[BcCkD_{ 5R @{¨_`@4`q @{¨_{ 5R @{¨_`{@4`xq @{¨_?@T{S``B`SA{¨__{ `` R` @{¨_{ `` @{¨_ {S_5RSA{¨_ց`W 4`SqSA{¨_ { aa @{¨{ j`v`t@R` @{¨_{  [`@W@`SR` @{è_ {k#S [ cs3b b 73@?3#rA3@;ie7@c 3^C3@P3@HD7@?@ۂ=sq1*D$;@9SN03@`R{@SAcCkDsE[B_{[ SC ck9:+[&K<xnhz`pQMIR{@SA[BkD+@cC_{S[cRSAcC[B{Ө_ { @`>` @{¨: {"B_q TSC[c k: +;ׂKIB?q! {@SA[BcCkD+@_{@_ C{ckS[C Us\7{k} 3w3@W7@3a]YUQMec/A'^62,D3@#R{@SA[BcCkDsEC_C{B_q$T#B[q#TSq,T_q#Tcks b C \7Z7@11,RnSA[BcCkDsE{@C_sckqB q@TB qTC evqQc 7]us7@=tqIEA=84LJ(E+ oC  B qTB qTmv{@[BC_{@C_ySA[BR { `` @{¨ C{[C Sckp!zUy#D~zR`{@SA[BcCkDC_{[cS*c*#R wqTZR8R*sKQsV6T6z1Tc{@SA[BcC#@_ {ScC#[c#EbR@;}QqTsq`TB*** Kq@T1TiZcsqT{@SA[BcC#@_F{bR  @{¨C)Ѥ{sF[Sckc7!F !\G7@Q2 5CM O{@SA[BcCkDsEC)_{@SA[BcCkDsEC)_{ ` RR`R` @ R{¨{HRS^@X@Q@J@@C@<@5@.@@'@r @b @R @@SA@{Ǩ_ {!@Sg@!`@!Y@!@R@!K@!D@!=@!@6@!/@!(r@!!b @!@R SA@{Ǩ_{S***BKB@JB BJSA{è_  {W|B|JSSKsQ[s~S #s~bQB|SbRR BQB|SbRBQB|SbR!BQB|SbRB-BQB|SRbJBQ8B|SbRBQB|Sb RBQyҡB|SY{@SA[B@ _ ʃc0{3g[#Sckעs1a-a)?a%R &#aR [CsB-!QKC@ s!CY8T:yY2C+3R `K*3 8q TQ3Ҕ !R!SQs 8T6; ;@R8;R8Z|!R~Kr_{{S\8T@Q?kJTGc@u~@8fBxSBqMT@cQQs~@ G"B9sc9B fffTC@ff@fpʃ3@{@SA[BcCkDsEc0_`T@fc?@B8BxSB{S* *` *`SA@{è  {S * ` SA{¨_{S ` `SA{¨ {  ` ` @{¨  {S[c8   4   qSA[BcC{Ө_ {S4SA{Ө_[u vS 5B j f Z X  SA[B@{Ө_N L SA[B@{Ө_{[So5a*| y *SA[B{ڨ_ {SZ5cR R `HSA{Ѩ_`&BSA{Ѩ_{ :5ARs R`o R`k @& @{٨_`& @{٨_{S[B@<@5@.@@R[BSA{֨_ {S @ !Gv X r 6 SA@{Ϩ_ {S[d 43R*SA[B@{Ө_**SA[B@{Ө_{[!@S#,@!%@!@!@qSA[B@{ר_{S[v 4o4Rk*SA[B{˨_*i*SA[B{˨_ {  x @{¨  {W|B|JSSKsQ[s~S #s~bQB|SbRBQB|SbRB BQB|S bRBQB|SbRBQB|SRbJBQ"B|SbR!BQB|Sb Rb'BQB|SSA[B@{ۨ_ {k#SC[c+c} 6 k /+a BGB@B T< V L ~ > 8 jb* \  R{@SA[BcCkD+@ _CѤ{G[Ck@s| USStc#w1-7(  G Cc?7@G@7@xC@pfr\Xw@l?@H~Rxw@nVp< 7@IGER{@SA[BcCkDsEC_ {SLSA{٨_ ={c[CSkc's4T*!Ro Ey*!R3}9o@Q*7T* 1B~qT*9 ;ҡRf@QB{*8bR?TRTbQ-R<8B|B B|A`!'_1TQ~@B91T3@eO{@SA[BcCkDsE=_{ 4 @{è_ @@{è\ {[#S1-*SA[B@{̨_0c0{3g[#SckB saa?aԢaCsB ق C@sY#T!Yc'{Ct3R}`K*@d`\X3 8q TQ3Ҕ !RV!SQs 8TC 6; ;@R8;R8Z@|!R|~Qr_{{S\8T@Q?kJTG@u~@8fBxSBq-T@QQs~@ G"B9sc9B ffy!TfC@Kf@f103@{@SA[BcCkDsEc0_րT@C f?@B8BxSB {!@S[ccC#Y!\G0!R<4#!F#!F;/!F7{@SA[BcC#@_ {!FS`!@G!G!(GxSA@{Ҩ_ C?{S4[ck9s T\?74/,|?@|_;@j{7@Zq@R{@SA[BkDsEcCC_ c C ?#~OKHR45R+;@BGB@B ?@  Nz_7@p{AFS5bR/SA@{Ǩ__ {SSA{¨E0{kS[cs *'7@cs Q<bRk7gqTZRC$tR  R sq@T* ** Kq@T1!T7@R sqT{@SA[BcCkDsE0_3@C0{3gckS[sC?S*?@s Q?LfqT$fsqTffE***KqT1T?@3$fysqTff{@SA[BcCkDsE3@C0_4c0c{3gS[#*c# CkCCs$Cs *ACK@s QW}mG@3C@KGo_xuCKpCkG@K@C@fLqmT/#;sqTfff;@**?@*KqT1TK@C@{fsqTffA43@{@SA[BcCkDsEc0_O@oG@C?ѡ{!FcS#([kcs!F3!FiHEM!RC!R-&OFJ{@SA[BcCkDsEC?_ հ  C9Ѣ{'m)ggAFsS[ ckL!F?BwR?@G!F!fqT5!|xfR ע8s!lf*W kTsjR Tfs{@SA[BcCkDsE'FmC9_{ 5 @{¨_`q @{¨_{S**`SA@{è {S@C5SA{ƨ_րqSA{ƨ_ { ` @{¨ {S'5SA{¨_ց` qSA{¨_{ s` @@{èm{ #` @@{è{ \` @{¨ { ` @{¨ T{SE`SA{¨@_{ ~` @{¨z {SSA{ƨ_ {7S[ ! SA[B@{̨_{SSA{¨ {S`SA@{è {SSA@{˨_{S`SA@{è {S**`SA@{è {c8S[XLSA[BcC{Ш_ ѣ{Sca\G+[cC kNq:@c@v@`;@ew@D  |$T_qL T?qmTCzzr w}o/`R:(@R{@SA[BkD+@vcC _{v@{S[` R:PR6L R2SA[B{ʨ_ { ` R!mR`i @ R{¨{Sa`SA{¨\ {S[vSA[B{Ϩ_{ ` @{¨ {S[~{VMSA[B@{̨_ {So`*SA@{˨_ {SU`tSA@{˨_ {Sc#[C''@"#NA`4}!R*u4/5SA[B@{ب_{S[5RJ4*SA[B{̨_*'4?n5Ub 4$5R*SA[B@{̨_*SA[B@{̨_{SSA@{Ǩ_{ 5 @{¨_`q @{¨_{ 5 @{¨_`q @{¨_{S5SA{¨_ց`qSA{¨_{ '` @@{è!{ ` @{¨& {  @{¨T{S`SA{¨_{ ` @{¨ { ` @{¨ {S7`SA@{è0 { ` @{¨ { X` @{¨T {S[7 SA[B@{Ө_ {SSA@{Ҩ_{S`SA{¨ {S!ySA{¨ {S+`SA@{è$ {S`SA@{è {S**`SA@{è {c8S[1#zi6`\6SA[BcC{ۨ_{[C#Sc8kZ<7mk(^9{@SA[BcCkD_ { ` R/R+` @ R{¨%{ ` RR` @ R{¨{S[6%"?6SA[B@{Ө_{Sc[c_NKySA[BcC{ר_ {SSA{¨{[#SC''@KL&l`4!R*u4Z5'SA[B@{ۨ_ {SC['Is ii'@{@SA[B@_ {S.uSA{Ѩ_ {cSc[Ck+aRfl} w*L!Ri[ 4q$TC`sQe1T*a@4sQH{1AT5-)Y{@SA[BcCkD+@_!RJqeT{3gSC[cckCs R 2;@.G@C@?@ !R@5!R4#5@71* 4,qmTRh!qM T5!Rf2f6RA{qT 5!Rxu*5 f{4 ffkaTff{@SA[BcCkDsE3@_(T<96`I*q@Ta^!R'Xi`*MJ}&*qT!Rfnf/)bF*-' {S*7*`SA@{è0 {S`SA{¨ {S**` *b`bSA@{è {S**` *b`bSA@{è { 5 @{¨_`bq @{¨_{S[c8`brnQ4fbEqSA[BcC{ʨ_ {S`b`bSA{¨{  @{¨ {W|B|JSSKsQ[s~S #s~bQB|SbRBQB|SbR"BQB|S|bR2BQB|SvbRBBQB|SpRbJBQR B|SibRb BQB|Scb RrBQB|S]TSA[B@{ͨ_{ v``b @{¨p {S$G@ 1@T!GhSA@{ƨ_ bR1 {S[A~43Rbn*SA[B@{ʨ_**SA[B@{ʨ_{c*aFSC[{ n&q@TRm*SA[BcC{̨_*ײThJkTb#*SA[BcC{̨_{S4SA{ʨ_[ub`5|w!ZSA[B@{ʨ_SA[B{ʨ_{So5a**SA@{̨_ {SX 5[ub|s#uR"TRPRL SA[B{˨_@&SA{˨_{$`5StcR*R& cSA@{Ȩ_@&\@{Ȩ_{[S#bRRR 9SA[B{˨_{Sc[VWV4a@BR"9[qT`@!Ra+SA[B{Ȩ_b@R RC9``@`@SA[B{Ȩ_`@aR9 {[!@S3@8 q`Ta QR?qTSA[B{Ȩ_bqSA[B{Ȩ_֡@c! aqSA[B{Ȩ_{ЁB$Gc!G`s@@S#@[k"44kC C. "k@k*F|nk@*MI1{siUSA[BcCkDsE{ߨ_ց!G7CCPLI+[q!Qg7@BX<N2H$ 7@FkCk@b 7WSA[BcCkDsE{ߨ_ф{$GkBGs@!`SD@[c7#4"4Twd_CBc!cZ7Fv"cl7@Bcf|,\n"cRhBcLbBTw@d4C*kvF*&82k@*W iO3c{@SA[BcCkDsE_C7})7@^}k!Gk@[wNICBc!cDt7l?C~.^w@ wm"cQg7@BcKaAS"c7M?@Bc/E%7-w@S #w@Cq {SLXSA{˨_ {S[CckssO2z- 4(To *!Rocs / e *u!R3g # o@3*# * 1B~qT*#9 ;ҡRR @QB{*8L  Rm ?TR@ bQR<8B|B B|A`!_1TQ~@B9   1T3@c{@SA[BcCkDsE_{S*[#c*q$T+sg*+Q*!1!T~SA[BcC{ը_{ 74 @{è_@L@5 @{è" @{è Ձ!pG!@?qT{?qST? qT!GSA{Ũ_֐SA{Ũ__ {!@Sc!F|  R!R > 55SA@{Ȩ_ {'mg)g[Sc "ks2;f;@R B`f!ff!f!f1fb rCo# s!R  *!R s@f*Q s!R *!Rs@!f*3T*0 {C s~S `~sqTs@C ;9  aR Q*zARaR Q*nAR  {8aTaR *aR  @RBf#8BQB|B B|A\!7{@1kTs@Qs~@sB9Efsfqf1ETff7{@SA[BcCkDsE'Fm_ {!GSic!FdSA@{Ȩ_ {Sc[#c!GK} @R gRRSA[BcC{Ҩ_֡@ {!F[S !G`4Cm*X!|A !|W !R. 4 4\@5SA[B@{Ԩ_  {[@ScJ4!G3*5@R*SA[B{Ө_U  {C*kS[cCsC CG+7!G@@RG@_qBЃ cc #  _z_@5   7@  5OGR`@bb`@R{@SA[BcCkDsE _ց@cc # T+5: y 7@_p `4@C {sSc[ckG!G@U@R@_qBЃd c# #C   nA@5  ;@ 7@  "5?@?@`@e@R`OHR`@bb\`@YR{@SA[BcCkDsEC _ց@# #jCXsX5 ;@7@ 4@ {kS[c+C!G6@!Q@!Q@@ @R!@qЂ`5Y65R61 p#i4^5+ 5{@SA[BcCkD+@ _`{@SA[BcCkD+@ _@ *{cckS[CAM!G@!Q@!Q@@[@R3@qЂ(&@56`56#A`4 `5be5{@SA[BcCkD _`{@SA[BcCkD _@ { . [*ccc*Sk/ w{4SA[BcCkD{ܨ_/@#E5c=*RR[@c@Bh`8"h 8[@k@!!@@9Ah 8@T@c a@R|@@@\*#*>@SA[BcCkD{ܨ_ { . Sccc* [#k/ w{/@4RSA[BcCkD{ܨ_cM*RHR [@c@Bh`8"h 8[@k@!!@@9Ah 8@T4@cRy@@#*y@RqSA[BcCkD{ܨ_  @5T R_R_ "@!?5T@q_R_ @T@4R_ R_ {[ՒS4b&R aF@T&@ SA&[B{è}Khc$hcJ Jh#%hcJ$h#cT_ Khd#hdJc cJh$T_Khd#hdJc cJh$@T_{[2S4b&RV aF@FTN@ SA&[B{è= #hbh"B_T_  #hbh"B_@T_ #hbh"B_T$$@@l$!$@!|( _DT_ D_T#h`Ch T_ !#hbh"B_T_ DT_@ DT_"RD DT_ $hcEhc h#cAT_ $hcEhcKh#cAT_ $hcEhcKh#c@AT_ $hcEhc h#c@AT_ $hc|h#caT_ #hdc"elh$c\e|@T*_ {S*Ҡjcej4ldj#\c|@T@`*SA{è_{SRe |@$q(Tzfzcx(lx#\c(AT(TSA@{è_ C(G# yc xcc,|&!T@ *m\ @K} kT 'xc)heFheHxc KcKk&Tlx*J!_)\TK}%q`T E~#ҥ'xc)heFheHxc KcKk&Tl\x* JK}o[%q˄Tlx*_Iq\TLC_ .R*҃E@c|#blEd\#@)B|# blh(j}c\ih_q"@|" T"&xbB__k&lT$ic%q $bli(d\ T!&@ %#"hh)}B|&&xcc_?k&lT *. *yjH%"$@ *} kc|"MT%  &xbB_k &lTi)bly*)}k"xjc\$$@? k|"-TB%&xbB_?k&lT"hcC "bly*J d\_%aT#D)c|"blDc\!$@# !alc\ )_$ic $bli(d\{Ld@rE@Cf҅|@>@| l+@2p>H|}'  mhx) *F}@D*|ӁqT&xl}+@Q k|@&TQ K*~mie*@(gyfѥ K@1  K'Tq*R Ն}$q@TfK~F%' cya!Hib]B@cKK#T  ly,"z[MDpˀT}l$ @{ʨ_bR$|"Ir#R?q%|"`% |KcK*pSFKc&KD $T@! !l%  x!!kT_CRcKRK#?|qb_B(B*$LT|@ yc$ycB Bl(B*x#cѿkT@?lqB Blx*lT_ D)RK c(*$ C) lc(*@!T@$@A !l|_ {SuRa@8@ TSA@{è_ {S*[qRuҕqTRjs8s@k TSA[B{è_bR(|"IrRdRR%|"?q`% |KcKKpS#Kb%Kc_KB c(B*LT|@C yc$ycB Bl(B*x#ckT@?lqB Blx*T x!!kT_@! !l&cR$|#Ir"R'|#`' |KBK*pS_qfK&KT|@BQBR ˥)K d@)B Bl(B*bh(cT?\qAR!KT$@!F(f?$q!|@Tx!!?$qT_ D@)ҥS*D$@Kl| hcEhcS*Eh#&hcK lh#c|aTC$@c|C$!$@!K$ $|S_  R QR@K d@b@(B BlB*bDT$@A($_cR$|#IrbR&|#`& |KBK*pS_qeK%KT|@BQCR ˄K C@)! !lc(!*Ah'BTR!KL@?Lq!!|@E(eTx!!?LqT_ eR%Ire|%`e ||KpSKek TChd#h$TD$@#Rc cQc #$?@TCL@RKA`  Cxad(*x!!c ? `lT_R_ Dhc$h#cT?TB Chah!!?T$@al$`|_R C@! #lCD!|_AT$@! $ |_{[S5~ ;@Rb8STSA[B{ƨ_ {S҃j`dj`c*j ATSA@{è_ {S*`@ `SA{¨_{S*`@K`SA{¨_{ ĪRcRr a@ p |$B`A|Ka! KT @{¨_ 0R C@! #lCD!|_ATL@A L_ Ղhb#hbkTԀZ_B_TR_ Ղ hb#hbkTԀZ_B_TR_ { Za"R  @!5BQ_1aT @{Ũ_CpS*`KtS !|A !|5 @{Ũ_ {S[@Tq  |qR5sQ&svSv*CsQ;@! 1TSA[B{ƨ_q  | { \~a2bRBQ_1T @!`4CpS*`KtS!|A !|5 @{Ǩ_ {S[c@Tq 3s~sQS75svS&.*isQ3@! X1TSA[B{Ȩ_q ss~{S[B7R!RPs8 67R!R$Jg@~BKsq!T@SA[B{ɨ_ {SCR[c''@7 !Rhs 67R!R @~BKsq!TSA[BcC{Ϩ_{SR[ck77@!Rs!R*!R64Cc+* !R!R_AtTK*K%*5sqaT+@SA[BcCkD{֨_ {SR[Cck SP!R?!Ru!R6T4#* !R^!R[@UUK*k*qaTSA[BcCkD{Ϩ_@qZ_ bR"Ir"|"B`" B|B|KCpScKb#K(_{S*a@ R Q SA{¨_{SRR[ R !Rs@s q T~5 *SA[B@{Ĩ_{[CRSRRc# !RTsS@s  SkT~35o *SA[BcC#@{ʨ_{SC[''@wtNSA[B@{Ϩ_{S#u@Y@SA@{̨_ {S\ASA@{ƨ_{kS[cCw-5RSA[BcCkD{Ҩ_l4hq-T)R%c TqMTO 4aRR*!R@46~q @Z ARQQB|_qT T qZZ_qZ{S[Ccck# 45?!R!R54aZ!R!R54@7C795`5zSA[BcCkD{Ԩ_"7PSA[BcCkD{Ԩ_ {S[c'<'@8CJ@SA[B@{Ҩ_{S*bR#R"Ir~"B`ӂ B|B|K@ DpSE|@K$q Kazec cQ# cz%T|@ z $qTSA{¨_ {[CRSc#R#$RAAR!K B!xSR!D R|c| #|cK! |B|  "|B K! *f***V*_I**J*zSqT; RbSA[BcC#@{Ϩ_ {S*+bR#R"Ir~"B`ӂ B|B|K@ DpSE|@KLq Kazec cQ# cz%T|@ z LqTSA{¨_ {S*q T@Q5 Ra@8@ TSA@{Ĩ_ @*2!A*!A*! A*!@A*"|SB!K"!|S!A !A ||S_{bAFSb@BFB@SA{ƨ_ {b[AhGS@RSA*[B{˨_ {S+@SA{Ȩ_ {a!FScNSA@{Ȩ_ {S*@`*SA{¨_ {SSA{Ũ_ {S*eb*@K*@JB J*@`*@Jb*SA{è_{S*_*@K*@@"JB BJ*SA{è_ {  R`* @{¨_{  @{Ũ_ {a!FS[a*@@qTQ(**qT7RYKsqT@ R[B*SA{ɨ_yg@Fy&@SR0*B0*b @cp *x{SUROqSA@{ɨ_{_@D(@S (@|$T@R*SA{Ȩ_  B{_@S (@| T @R*SA{Ȩ_p@ {S*@*@ `*kTSA@{è_SA@{èUz {b[AFS*@Q}** R *kTSA[B{ƨ_0SA[B{ƨ_ {S*[cRb6K8R*@`~kT**@|*5SA[BcC{ʨ_#*n*a]x4SA[BcC{ʨ_ {SwSA@{ƨ_{bSAF>u-4!R_SA@{ƨ_{SlSA{Ũ_ {S[CckPR`* 1B_1~+TR*8R!k*Tb!AT8R~@!T9_qmT QQ˔~@B9BT9TR{@SA[BcCkD_{bAFSARaSA@{ƨ_{a!FScD*~qSA@{Ȩ_ {b[AFScubw!Rj&ARGSA[B{Ȩ_{  S[G @)BA4@D @eHJ&LDJ CJ(AJ!  ! A<!TLA)RHB),@C)8D)AQr******** ****hl * ***"$ , *cJJcdJ4J b if J  B cXJJA b # ! T e  G #    ))) $)SA[B@{Ĩ_  @@  { G @B A4@D @e Ó&LʣCAʄ!!A<!TCAĕ@Bm.@ @$@AQfif@@`&f  g in  b&HƓ c8ʂcE ǓihbpD BcʤAbf! #!TfG&   ,Abf{J BfI "f $C_{.@!R @#-҈r RS[cks!A@@@ @B@B,@$@B0@ʔe4@8@T@ʳK@@D@`@H@L@<@11s(@P@d@&QʅʆʤGeCbсATA@ATTD@aBCR!@A&D3PG9sٓBؓE\œ4@ד@@N֓B“Փ ēcÓԓܓ{ ۓZړ!TTRO g {HIJK&דd@֞֓œB “9ٓؓfՓēScÓ_kw~"|!3!x"bbB _ KK4|)|)Tjdc je~_!34!x"B_TR`T|1^_~!bBb! KB K!|@B|@!BSyaAyb@ `T@ESA[BcCkDsE{ը_ ?D?T̜DnOb5%Ač!bD"l`|R h_ @!D B EC(@# *C(5@!? @T_ {SR[X@)R`@ qATvV )(`jAqT | *c#"Sa@!$j 8ajA?kTSA[B{è@@ ??T ۓ蠚碛&'%f$҂ҩ Ϧ #B߷H%G+PiwHS'+eaR| _ @@ ??T !hg&ކ%Z䃍c"/҉wHҿżg#hoGnFOc5")AlǍ!`c|R| _ @!@D B$F C(@# C(@!$@T_  {SR[X@R`@$@ATvV `BqT | *c#"Sa@!$šj 8aB?kTSA[B{è  @_|_|B__aT RBKBxS)_Ѐ̌R@̬r!@ibǚ( ǚB_qCcJ|%kk|LHdEZe}%}KpSa$ Ě|Kc cKc|@cb" A@D G_ {[ Sc*7A `f&$@|@ j 8k|@HMT@ c4T!?TB !TSA[BcC{Ĩ_ {S@@#|@ÚB!K?qTRa@b@Ra@b@#Q@ kTRb@a@SA{¨uR {S@@#|@*ÚB!K?q@TRna@b@Rha@b@#Q@ kTR^*SA@{èRU*SA@{èv {S@@#|@ÚB!K?qT!R>a@b@R8a@b@#Q@ kTR.b@Ra@SA{¨R# RP'RT*X@A@c! aKkITXkBTXAD_TTqT$RR@_ {SR*qTaV@!aV?PqTaaqTa@^SA{ڨ_ {PS*c\DTqTSAcC{ި_#[Qta@8TC5R7Rur6R` @9Rd@9"Rc@9e@9<S`*@C **J |5K*b|K! ?q|@{`cJ{ *aTRWq@TW@!W?Pq-TnqTsT[B#@SAcC{ި_T\ ?8?TP_D_TX_ {\@ #\!|q3A9T* @{¨_`* @{¨_ r#|S|S"|S$|Sd@zK'|SR T!! #Rra8m8! #|cgm\SK!Ka8qd@z@T! F"Rraa8ff8! "|BgF\SK!Ka8#J_qR$@z T!"Rre8d8! "|BgD\SK!Ka8'4!|S$Rra8g8 |!g$\SKK`8J`J_ 8T?qD@T Ah`8h 8@T_hb8#h"8B_@T_{_qSS s*s~bz_qdHzT[ck )hquST  #x`QdkLTM#  "B_y QkLTJ3kJTk~@!" 1R O*KKiM#J3ҠyfnqyfdJ S *r`*R*j<CT3@sBBATcCsE@Z37@!xbD_aT RSA[BkD{ɨ_RSA{ɨ_  &eibhbB_PJ!T @@)qA)T Q b!P-B pC]PӥHӁR ) )q Tq@ Tq TqT#@5@qTcqTkTq TqT@!ht8b@kTq-TbQB  Ձ_?8Tq`TqTqT@_kTBKR*O{@SA[BcC_֡@!ht8G@@!ht8@@<@@"cc+cO^c~ {᠈REr{|p_{cS[*#//@ B*R9{@SA[BcC#@_ R){;{_){@S@[@@0@@@@@@@R{@SA@[B)_ ){@S@[@@@@@@@%@@R{@SA@[B)_ q{S*[c**k+`TqTq T@qTq TkTq TqT@!ht8D@kTqTS_P?HӔR )c)q Tq` Tq TqT6@qTq@TkTqTqT@!ht8@kTq Tq TqTw4kT*{@SA[BcCkD+@_֡@!ht8 @@!ht8[@@!ht8@@!ht8O@KR)*{@SA[BcCkD+@_֡@:@@@^[UX R> {qSRR… qT[*c*#A@?kLT/c@RCKRBR*A R8**/@*} RSA[BcC#@{ר_RRSA{ר_ {S*cxQk[*7 C3Rs/@BOk@T**R@ _kT[skTSA[BcCkD{ʨ_ {[*kQcCZ'm(gCgs** 7Z wS9R ՂR*@f**TqTTRf**FOkT f9?kTSA f*Ҭ[BcCkDsE'Fm{Ѩ_ {cS[J@5{@SA[BcC _b@c@#CR!RR7C Հ~@@$Rk T@!?@qBh`8h 8T@?kT@@9"38sT#|@ RcRKAKc"|@ !"8To"C@?kT@@9#38sT#@{@SA[BcC _ {kS[@@5 R{@SA[BkD _b@4R@@cc@+@9*RyC Հ~@C@bRWh 8kTA@Bq7h`8T@?kT@@9"38s?TA9QQ<qOz`T?8qTRcK@q!R Te|@`RBK|@&RB_8_k!ATa4cCR+@{@SA[BkD _qTR @?kT@b@9"38s{kTcC R+@{@SA[BkD _R?8qcKT@qTR C RRR(Q  $`9xbB_(@ !JaD TxbBe@_ !JaD!T5AqTR@@ !T@ |S|SA9|SB 9kE 9AE8 `Te@C_@  C!D)(E)!tpS)upS)&|S$|SD9$|SF9cA 9fDD8P`T_! դbha8_8BJbh!8!?D!T{S*[  h 8D8aT*w Rbр!_!ZAh PAT`Bl  R@RhaBC*h!ha!?@BS!T4@!J@T2qTb(ҡj`8Ah 80T`B b  Ra.  @H98_T[B@2SA{Ũ_ R`2qT-RRc jm8!<qd`9MzBJb 9a.5b*HBb*mT0R kTa.H@T`bB   @9@998_aT[B@2SA{Ũ_@R`2 0HC5*_q T{/,$HR!il8c!?<q`9LzJ 9%5!H!mT R kT%H @ R@T1{_R_ @ R@T1_{S0H 5c R2*qT ~([kZ9+R.J!ZZ. ja8!?D8aTkTb$B|@Akb8<q*ǟk_8ןj!J!!k"8Bjd8!Jj$8.H!.5*H*Tk T[BkD+@@ RTARcC2SA{Ǩ_qR TSA{Ǩ_SAcC{Ǩ_@ R[BkD+@Tc{S0H 5c R2*qT ~([kZ9+R.J!ZZ. ja8!?DD8aTkTa"!|@Dka8_<q*ǟk_8ןjJ%k!8!jb8Jj"8B.H.5*H*!T3k,T[BkD+@@ RTARcC2SA{Ǩ_qR TSA{Ǩ_SAcC{Ǩ_@ R[BkD+@Tc {S[ AB J  _8@9!J8aT aj`8j 8_h 8j 8@AT`RSA2[B{è{S1[1*cCܦt գzss*`?֟!TSA[BcC{Ĩ_ _{{_load_file ?@]^Error opening %sfseek(end) error in %s: %sfseek(start) error in %s: %ssize of file: %uError reading, file is emptyError reading first line: %sSkipping shebangFile too big, truncated at maximum supported sizeIncomplete file read (%u of %u bytes)EOF after %u bytesError in %s: %sloaded file (%u bytes)Usage: zenroom [-h] [-s] [ -D scenario ] [ -i ] [ -c config ] [ -k keys ] [ -a data ] [ -S seed ] [ -p ] [ -z ] [ -l lib ] [ script.lua ] hD:ic:k:a:l:S:pz2.0.0Zenroom v%s - secure crypto language VMZenroom is Copyright (C) 2017-2021 by the Dyne.org foundationFor the original source code and documentation go to https://zenroom.orgZenroom is free software: you can redistribute it and/or modifyit under the terms of the GNU Affero General Public License aspublished by the Free Software Foundation, either version 3 of theLicense, or (at your option) any later version.Zenroom is distributed in the hope that it will be useful,but WITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See theGNU Affero General Public License for more details.You should have received a copy of the GNU Affero General Public Licensealong with this program. If not, see http://www.gnu.org/licenses/reading KEYS from file: %sreading DATA from file: %sflushreadwriteInteractive console, press ctrl-d to quit.using default configurationInitialisation failed.Documentation for scenario: %sfunction Given(text, fn) ZEN.given_steps[text] = true end function When(text, fn) ZEN.when_steps[text] = true end function Then(text, fn) ZEN.then_steps[text] = true end function IfWhen(text, fn) ZEN.if_steps[text] = true end function ZEN.add_schema(arr) for k,v in pairs(arr) do ZEN.schemas[k] = true end end ZEN.given_steps = {} ZEN.when_steps = {} ZEN.then_steps = {} ZEN.if_steps = {} ZEN.schemas = {} require_once('zencode_%s') print(JSON.encode( { Scenario = "%s", Given = ZEN.given_steps, When = ZEN.when_steps, Then = ZEN.then_steps, If = ZEN.if_steps, Schemas = ZEN.schemas }))Zencode execution errorScript: %sSide loading library: %srbreading Zencode from file: %sreading Zencode from stdinDirect Zencode executionprotected mode (seccomp isolation) activatedSeccomp fail to set no_new_privs: %sSeccomp fail to install filter: %sstarting execution.Execution completed.Execution interrupted by signal %d.Time used: %lu888888888888888888888888888-n8n8888888n88((((((((((((((((((((((((((((((((((S(((zen_init_pmainzen_initzen_exec_zencodezen_exec_script VERSIONRelease version: %sda203527COMMITBuild commit hash: %sBRANCHBuild branch: %sLINUXARCHBuild architecture: %saarch64MAKETARGETBuild target: %s-O3 -fPIC -D'ARCH=LINUX' -DARCH_LINUX -I. -I../lib/lua53/src -I../lib/milagro-crypto-c/build/include -I../lib/milagro-crypto-c/include -Wall -WextraCFLAGSBuild CFLAGS: %sinitialisation of lua scripts failed%s: %sPANIC: unprotected error in call to Lua API (%s) nullNo floatError handler fault at initalizationRuntime error at initializationMemory allocation error at initalizationUnknown error at initalizationFatal errorSTB print functions in useMUTT print functions in useLIBC print functions in useRNG seed converted from hex to %u bytesRNG seed not found in configurationLua newstate creation failedDEBUG%s: %s %sMemory in use: %u KBRNGSEEDdeclaring global: DATADATAdeclaring global: KEYSKEYSZenroom teardown.Memory used: %u KBlua gc and close...finally free Zen context%s: Zenroom context is NULL.%s: Zenroom context not initialised.local _res, _err _res, _err = pcall( function() ZEN:begin() end) if not _res then exitcode(1) ZEN.OK = false error('INIT: '.._err,2) end _res, _err = pcall( function() ZEN:parse([[ %s ]]) end) if not _res then exitcode(1) ZEN.OK = false error('PARSE: '.._err,2) end _res, _err = pcall( function() ZEN:run() end) if not _res then exitcode(1) ZEN.OK = false error('EXEC: '.._err,2) end CODEERROR:Script successfully executedExecution abortedNULL string as script for zencode_exec()Empty string as script for zencode_exec()Error detected. Execution aborted.Zenroom operations completed.NULL string as script for zenroom_exec()Empty string as script for zenroom_exec()ZEN_traceback[!] %s[*]%s %s [*] %s [D] %s %s[!]%s %s [!] %s . %s %s[W]%s %s [W] %s setenv: NULL string detectedsetenv: empty value for key: %s__index_LOADEDname conflict for module '%s'zen_load_stringzen_exec_extensionzen_requireillegal instruction: require%s syntax error: %s%s out of memory: %s%s garbage collection error: %sNULL variable in %sloaded %s%s %saesrequired extension not found: %s_Gloading lua initialisationinitError loading lua init scriptexitcoderequiretablemathutf8L)-- -- json.lua -- -- Copyright (c) 2019 rxi -- Copyright (c) 2020-2021 Dyne.org foundation -- -- Permission is hereby granted, free of charge, to any person obtaining a copy of -- this software and associated documentation files (the "Software"), to deal in -- the Software without restriction, including without limitation the rights to -- use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies -- of the Software, and to permit persons to whom the Software is furnished to do -- so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in all -- copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -- SOFTWARE. -- local json = { _version = "0.1.2" } ------------------------------------------------------------------------------- -- Encode ------------------------------------------------------------------------------- local encode local escape_char_map = { [ "\\" ] = "\\\\", [ "\"" ] = "\\\"", [ "\b" ] = "\\b", [ "\f" ] = "\\f", [ "\n" ] = "\\n", [ "\r" ] = "\\r", [ "\t" ] = "\\t", } local escape_char_map_inv = { [ "\\/" ] = "/" } for k, v in pairs(escape_char_map) do escape_char_map_inv[v] = k end local function escape_char(c) return escape_char_map[c] or string.format("\\u%04x", c:byte()) end local function encode_nil(val) return "null" end local function encode_table(val, stack) local res = {} stack = stack or {} -- Circular reference? if stack[val] then error("circular reference") end stack[val] = true if rawget(val, 1) ~= nil or next(val) == nil then -- Treat as array -- check keys are valid and it is not sparse local n = 0 for k in pairs(val) do if type(k) ~= "number" then error("invalid table: mixed or invalid key types") end n = n + 1 end if n ~= #val then warn("JSON encoding error: "..type(val)) error("invalid table: sparse array (n="..n..", #val="..#val..")") end -- Encode for i, v in sort_ipairs(val) do table.insert(res, encode(v, stack)) end stack[val] = nil return "[" .. table.concat(res, ",") .. "]" else -- Treat as an object for k, v in sort_pairs(val) do if type(k) ~= "string" then error("invalid table: mixed or invalid key types") end table.insert(res, encode(k, stack) .. ":" .. encode(v, stack)) end stack[val] = nil return "{" .. table.concat(res, ",") .. "}" end end local function encode_string(val) return '"' .. val:gsub('[%z\1-\31\\"]', escape_char) .. '"' end local function encode_number(val) -- Check for NaN, -inf and inf -- if val ~= val or val <= -math.huge or val >= math.huge then -- error("unexpected number value '" .. tostring(val) .. "'") -- end -- return string.format("%.14g", val) return val end local function encode_function(val) -- return hex function address as string return '"' .. strtok(tostring(val))[2] .. '"' end local type_func_map = { [ "nil" ] = encode_nil, [ "table" ] = encode_table, [ "string" ] = encode_string, [ "number" ] = encode_number, [ "function"] = encode_function, [ "boolean" ] = tostring, } encode = function(val, stack) local t = type(val) local f = type_func_map[t] if f then return f(val, stack) end error("unexpected type '" .. t .. "'") end function json.raw_encode(val) return(encode(val)) -- sort -- local out = "{ " -- for k,v in sort_pairs(val) do -- out = out .. '"'..k..'": ' -- out = out .. encode(v).."," -- end -- return(out:sub(1,-2) .. "}") end ------------------------------------------------------------------------------- -- Decode ------------------------------------------------------------------------------- local parse local function create_set(...) local res = {} for i = 1, select("#", ...) do res[ select(i, ...) ] = true end return res end local space_chars = create_set(" ", "\t", "\r", "\n") local delim_chars = create_set(" ", "\t", "\r", "\n", "]", "}", ",") local escape_chars = create_set("\\", "/", '"', "b", "f", "n", "r", "t", "u") local literals = create_set("true", "false", "null") local literal_map = { [ "true" ] = true, [ "false" ] = false, [ "null" ] = nil, } local function next_char(str, idx, set, negate) for i = idx, #str do if set[str:sub(i, i)] ~= negate then return i end end return #str + 1 end local function decode_error(str, idx, msg) local line_count = 1 local col_count = 1 for i = 1, idx - 1 do col_count = col_count + 1 if str:sub(i, i) == "\n" then line_count = line_count + 1 col_count = 1 end end error( string.format("The JSON input is not valid: %s at line %d col %d", msg, line_count, col_count) ) end local function codepoint_to_utf8(n) -- http://scripts.sil.org/cms/scripts/page.php?site_id=nrsi&id=iws-appendixa local f = math.floor if n <= 0x7f then return string.char(n) elseif n <= 0x7ff then return string.char(f(n / 64) + 192, n % 64 + 128) elseif n <= 0xffff then return string.char(f(n / 4096) + 224, f(n % 4096 / 64) + 128, n % 64 + 128) elseif n <= 0x10ffff then return string.char(f(n / 262144) + 240, f(n % 262144 / 4096) + 128, f(n % 4096 / 64) + 128, n % 64 + 128) end error( string.format("invalid unicode codepoint '%x'", n) ) end local function parse_unicode_escape(s) local n1 = tonumber( s:sub(3, 6), 16 ) local n2 = tonumber( s:sub(9, 12), 16 ) -- Surrogate pair? if n2 then return codepoint_to_utf8((n1 - 0xd800) * 0x400 + (n2 - 0xdc00) + 0x10000) else return codepoint_to_utf8(n1) end end local function parse_string(str, i) local has_unicode_escape = false local has_surrogate_escape = false local has_escape = false local last for j = i + 1, #str do local x = str:byte(j) if x < 32 then decode_error(str, j, "control character in string") end if last == 92 then -- "\\" (escape char) if x == 117 then -- "u" (unicode escape sequence) local hex = str:sub(j + 1, j + 5) if not hex:find("%x%x%x%x") then decode_error(str, j, "invalid unicode escape in string") end if hex:find("^[dD][89aAbB]") then has_surrogate_escape = true else has_unicode_escape = true end else local c = string.char(x) if not escape_chars[c] then decode_error(str, j, "invalid escape char '" .. c .. "' in string") end has_escape = true end last = nil elseif x == 34 then -- '"' (end of string) local s = str:sub(i + 1, j - 1) if has_surrogate_escape then s = s:gsub("\\u[dD][89aAbB]..\\u....", parse_unicode_escape) end if has_unicode_escape then s = s:gsub("\\u....", parse_unicode_escape) end if has_escape then s = s:gsub("\\.", escape_char_map_inv) end return s, j + 1 else last = x end end decode_error(str, i, "expected closing quote for string") end local function parse_number(str, i) local x = next_char(str, i, delim_chars) local s = str:sub(i, x - 1) local n = tonumber(s) if not n then decode_error(str, i, "invalid number '" .. s .. "'") end return n, x end local function parse_literal(str, i) local x = next_char(str, i, delim_chars) local word = str:sub(i, x - 1) if not literals[word] then decode_error(str, i, "invalid literal '" .. word .. "'") end return literal_map[word], x end local function parse_array(str, i) local res = {} local n = 1 i = i + 1 while 1 do local x i = next_char(str, i, space_chars, true) -- Empty / end of array? if str:sub(i, i) == "]" then i = i + 1 break end -- Read token x, i = parse(str, i) res[n] = x n = n + 1 -- Next token i = next_char(str, i, space_chars, true) local chr = str:sub(i, i) i = i + 1 if chr == "]" then break end if chr ~= "," then decode_error(str, i, "expected ']' or ','") end end return res, i end local function parse_object(str, i) local res = {} i = i + 1 while 1 do local key, val i = next_char(str, i, space_chars, true) -- Empty / end of object? if str:sub(i, i) == "}" then i = i + 1 break end -- Read key if str:sub(i, i) ~= '"' then decode_error(str, i, "expected string for key") end key, i = parse(str, i) -- Read ':' delimiter i = next_char(str, i, space_chars, true) if str:sub(i, i) ~= ":" then decode_error(str, i, "expected ':' after key") end i = next_char(str, i + 1, space_chars, true) -- Read value val, i = parse(str, i) -- Set res[key] = val -- Next token i = next_char(str, i, space_chars, true) local chr = str:sub(i, i) i = i + 1 if chr == "}" then break end if chr ~= "," then decode_error(str, i, "expected '}' or ','") end end return res, i end local char_func_map = { [ '"' ] = parse_string, [ "0" ] = parse_number, [ "1" ] = parse_number, [ "2" ] = parse_number, [ "3" ] = parse_number, [ "4" ] = parse_number, [ "5" ] = parse_number, [ "6" ] = parse_number, [ "7" ] = parse_number, [ "8" ] = parse_number, [ "9" ] = parse_number, [ "-" ] = parse_number, [ "t" ] = parse_literal, [ "f" ] = parse_literal, [ "n" ] = parse_literal, [ "[" ] = parse_array, [ "{" ] = parse_object, } parse = function(str, idx) local chr = str:sub(idx, idx) local f = char_func_map[chr] if f then return f(str, idx) end decode_error(str, idx, "unexpected character '" .. chr .. "'") end function json.raw_decode(str) if type(str) ~= "string" then error("expected argument of type string, got " .. type(str)) end local res, idx = parse(str, next_char(str, 1, space_chars, true)) idx = next_char(str, idx, space_chars, true) if idx <= #str then decode_error(str, idx, "trailing garbage") end return res end return json !--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --Coconut implementation by Alberto Sonnino and Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local petition = { } local G1 = ECP.generator() local O = ECP.order() function petition.prove_sign_petition(pub, m) -- sign == vote local k = INT.random() -- vote encryption local enc_v = { left = G1 * k, right = pub * k + SALT * m } -- opposite of vote encryption local enc_v_neg = { left = enc_v.left:negative(), right = enc_v.right:negative() + SALT } -- commitment to the vote local r1 = INT.random() local r2 = r1 * (BIG.new(1) - m) local cv = G1 * m + SALT * r1 -- proof -- create the witnesess local wk = INT.random() local wm = INT.random() local wr1 = INT.random() local wr2 = INT.random() -- compute the witnessess commitments local Aw = G1*wk local Bw = pub*wk + SALT*wm local Cw = G1*wm + SALT*wr1 local Dw = cv*wm + SALT*wr2 -- create the challenge local c = ZKP_challenge({enc_v.left, enc_v.right, cv, Aw, Bw, Cw, Dw}) % O -- create responses local rk = wk - c * k local rm = wm - c * m local rr1 = wr1 - c * r1 local rr2 = wr2 - c * r2 local pi_vote = { c = c, rk = rk, rm = rm, rr1 = rr1, rr2 = rr2 } -- signature's Theta return { scores = { pos = enc_v, neg = enc_v_neg }, -- left/right tuples cv = cv, -- ecp pi_vote = pi_vote } -- pi end function petition.verify_sign_petition(pub, theta) -- recompute witnessess commitment local scores = theta.scores.pos -- only positive, not negative? local Aw = G1 * theta.pi_vote.rk + scores.left * theta.pi_vote.c local Bw = pub * theta.pi_vote.rk + SALT * theta.pi_vote.rm + scores.right * theta.pi_vote.c local Cw = G1 * theta.pi_vote.rm + SALT * theta.pi_vote.rr1 + theta.cv * theta.pi_vote.c local Dw = theta.cv * theta.pi_vote.rm + SALT * theta.pi_vote.rr2 + theta.cv * theta.pi_vote.c -- verify challenge ZEN.assert(theta.pi_vote.c == ZKP_challenge( {scores.left, scores.right, theta.cv, Aw, Bw, Cw, Dw }), "verify_sign_petition: challenge fails") return true end function petition.prove_tally_petition(sk, scores) local wx = INT.random() local Aw = { wx:modneg(O) * scores.pos.left, wx:modneg(O) * scores.neg.left } local c = ZKP_challenge(Aw) local rx = wx - c * sk local dec = { pos = scores.pos.left * sk:modneg(O), neg = scores.neg.left * sk:modneg(O) } -- return pi_tally return { dec = dec, rx = rx, c = c } end function petition.verify_tally_petition(scores, pi_tally) local rxneg = pi_tally.rx:modneg(O) local Aw = { rxneg*scores.pos.left + pi_tally.c * pi_tally.dec.pos, rxneg*scores.neg.left + pi_tally.c * pi_tally.dec.neg } ZEN.assert(pi_tally.c == ZKP_challenge(Aw), "verify_tally_petition: challenge fails") return true end function petition.count_signatures_petition(scores, pi_tally) local restab = { } for idx=1,1000 do -- if idx ~= 0 then -- not zero restab[(BIG.new(idx) * SALT):octet():hex()] = idx -- end end local res = { pos = scores.pos.right + pi_tally.dec.pos, neg = scores.neg.right + pi_tally.dec.neg } return { pos = restab[res.pos:octet():hex()], neg = restab[res.neg:octet():hex()] } end return petition--[[ --This file is part of zenroom -- --Copyright (C) 2022 Dyne.org foundation --designed, written and maintained by Alberto Lerda and Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Monday, 21th February 2022 --]] ETH = require_once'crypto_ethereum' local function big_wei_to_str_wei(x) return x:decimal() end local function str_wei_to_big_wei(x) return BIG.from_decimal(tostring(x)) end -- TODO: these conversions are slow weimult = BIG.new(10):modpower(BIG.new(18), ECP.order()) gweimult = BIG.new(10):modpower(BIG.new(9), ECP.order()) local function str_gwei_to_big_wei(x) return ( BIG.from_decimal(tostring(x)) * gweimult ) end local function big_wei_to_str_gwei(x) return ( x / gweimult ):decimal() end local function str_eth_to_big_wei(x) return ( BIG.from_decimal(tostring(x)) * weimult ) end local function big_wei_to_str_eth(x) return ( ( x / weimult ):decimal() ) end local function import_eth_tx(obj) local res = { } res.nonce = ZEN.get(obj, 'nonce', INT.from_decimal, tostring) res.gas_price = ZEN.get(obj, 'gas_price', INT.from_decimal, tostring) res.gas_limit = ZEN.get(obj, 'gas_limit', INT.from_decimal, tostring) res.value = ZEN.get(obj, 'value', INT.from_decimal, tostring) res.to = ZEN.get(obj, 'to', O.from_hex, tostring) if obj.data then res.data = ZEN.get(obj, 'data', O.from_hex, tostring) else res.data = O.new() end if obj.v then res.v = ZEN.get(obj, 'v', O.from_hex) end if obj.r then res.r = ZEN.get(obj, 'r', O.from_hex) end if obj.s then res.s = ZEN.get(obj, 's', O.from_hex) end return res end local function export_eth_tx(obj) local res = { } res.nonce = obj.nonce:decimal() res.gas_price = obj.gas_price:decimal() res.gas_limit = obj.gas_limit:decimal() res.to = obj.to:hex() if #obj.value == 0 then res.value = '0' elseif type(obj.value) == 'zenroom.big' then res.value = obj.value:decimal() else error("invalid value type: "..type(obj.value)) end if obj.data then res.data = obj.data:octet():hex() end if obj.v then res.v = obj.v:octet():hex() end if obj.r then res.r = obj.r:octet():hex() end if obj.s then res.s = obj.s:octet():hex() end return res end ZEN.add_schema( { ethereum_public_key = { import = O.from_hex, export = O.to_hex }, ethereum_address = { import = O.from_hex, export = O.to_hex }, ethereum_nonce = function(obj) return ZEN.get(obj, '.', INT.new, tonumber) end, ethereum_transaction = { import = import_eth_tx, export = export_eth_tx }, signed_ethereum_transaction = { import = O.from_hex, export = O.to_hex }, gas_price = { import = str_wei_to_big_wei, export = big_wei_to_str_wei }, gas_limit = { import = str_wei_to_big_wei, export = big_wei_to_str_wei }, ethereum_value = { import = str_eth_to_big_wei, export = big_wei_to_str_eth }, gwei_value = { import = str_gwei_to_big_wei, export = big_wei_to_str_gwei }, wei_value = { import = str_wei_to_big_wei, export = big_wei_to_str_wei } }) When('create the ethereum key', function() initkeys'ethereum' ACK.keys.ethereum = ECDH.keygen().private end) When('create the ethereum address', function() empty'ethereum address' local pk = ACK.ethereum_public_key if not pk then pk = ECDH.pubgen( havekey'ethereum' ) end ACK.ethereum_address = ETH.address_from_public_key(pk) new_codec('ethereum address', { zentype = 'element', encoding = 'hex' }) end) When("create the ethereum transaction of '' to ''", function(quantity, destaddr) empty'ethereum transaction' local tx = { } tx.gas_price = have'gas price' tx.gas_limit = have'gas limit' tx.nonce = have'ethereum nonce' tx.value = have(quantity) tx.to = have(destaddr) tx.data = O.new() ACK.ethereum_transaction = tx new_codec('ethereum transaction', { zentype = 'schema', encoding = 'complex'}) end) When("create the ethereum transaction to ''", function(destaddr) empty'ethereum transaction' local tx = { } tx.gas_price = have'gas price' tx.gas_limit = have'gas limit' tx.nonce = have'ethereum nonce' tx.value = O.new() tx.data = O.new() tx.to = have(destaddr) ACK.ethereum_transaction = tx new_codec('ethereum transaction', { zentype = 'schema', encoding = 'complex'}) end) When("use the ethereum transaction to store ''", function(obj) local content = have(obj) local tx = have'ethereum transaction' ZEN.assert(not tx.data or #tx.data == 0, "Cannot overwrite transaction data") tx.data = ETH.make_storage_data(content) end) -- TODO: more contract methods -- use the ethereum transaction to store '' -- use the ethereum transaction to transfer '' to '' -- use the ethereum transaction to elect '' -- use the ethereum transaction to vote '' When("create the signed ethereum transaction", function() local sk = havekey'ethereum' local tx = have'ethereum transaction' tx.v = INT.new(1337) -- default local testnet ACK.signed_ethereum_transaction = ETH.encodeSignedTransaction(sk, tx) new_codec('signed ethereum transaction', { zentype = 'schema', encoding = 'complex'}) end) When("create the signed ethereum transaction for chain ''", function(chainid) local sk = havekey'ethereum' local tx = have'ethereum transaction' local cid = tonumber(chainid) if not cid then cid = INT.new(O.from_string(tostring(chainid))) else cid = INT.new(cid) end ZEN.assert(cid, "Invalid chain id: "..chainid) if not tx.data then tx.data = O.new() end if not tx.value then tx.value = O.new() end tx.v = cid tx.r = O.new() tx.s = O.new() ACK.signed_ethereum_transaction = ETH.encodeSignedTransaction(sk, tx) new_codec('signed ethereum transaction', { zentype = 'schema', encoding = 'complex'}) end) When("verify the signed ethereum transaction from ''", function(pubkey) local pk = have(pubkey) local rawtx = have'signed ethereum transaction' local tx = ETH.decodeTransaction(rawtx) -- TODO: check decode errors ZEN.assert( ETH.verifySignatureTransaction(pk, tx) ) end) --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 12th November 2021 --]] local J = require('json') J.decode = function(data) if not data then error("JSON.decode called without argument", 2) end assert(#data > 1,"JSON.decode argument is empty string") assert(luatype(data) == "string", "JSON.decode argument of unsopported type: "..luatype(data)) local res = {} local right = tostring(data) local left local tmp while right do left, right = jsontok(right) -- function in zen_parser.c if not left then break end tmp = JSON.raw_decode(left) if luatype(tmp) == 'table' then for k,v in pairs(tmp) do -- adds all unnamed array elements into 'array' if luatype(k)=='number' then res.array = fif(res.array, res.array, {}) table.insert(res.array, v) else res[k] = v end end else error("JSON decode has not returned a table", 2) end end return res end J.encode = function(tab,enc) return JSON.raw_encode( -- process encodes zencode types -- it is part of inspect.lua INSPECT.process(tab, enc or CONF.output.encoding.name) ) end J.auto = function(obj) local t = type(obj) if t == 'table' then -- export table to JSON return JSON.encode(obj) elseif t == 'string' then -- import JSON string to table return JSON.decode(obj) else error("JSON.auto unrecognised input type: "..t, 3) return nil end end return J S2local strformat = string.format local floor = math.floor local function idiv(n, d) return floor(n / d) end local c_locale = { abday = {"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"}; day = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}; abmon = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"}; mon = {"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"}; am_pm = {"AM", "PM"}; } --- ISO-8601 week logic -- ISO 8601 weekday as number with Monday as 1 (1-7) local function iso_8601_weekday(wday) if wday == 1 then return 7 else return wday - 1 end end local iso_8601_week do -- Years that have 53 weeks according to ISO-8601 local long_years = {} for _, v in ipairs { 4, 9, 15, 20, 26, 32, 37, 43, 48, 54, 60, 65, 71, 76, 82, 88, 93, 99, 105, 111, 116, 122, 128, 133, 139, 144, 150, 156, 161, 167, 172, 178, 184, 189, 195, 201, 207, 212, 218, 224, 229, 235, 240, 246, 252, 257, 263, 268, 274, 280, 285, 291, 296, 303, 308, 314, 320, 325, 331, 336, 342, 348, 353, 359, 364, 370, 376, 381, 387, 392, 398 } do long_years[v] = true end local function is_long_year(year) return long_years[year % 400] end function iso_8601_week(self) local wday = iso_8601_weekday(self.wday) local n = self.yday - wday local year = self.year if n < -3 then year = year - 1 if is_long_year(year) then return year, 53, wday else return year, 52, wday end elseif n >= 361 and not is_long_year(year) then return year + 1, 1, wday else return year, idiv(n + 10, 7), wday end end end --- Specifiers local t = {} function t:a(locale) return "%s", locale.abday[self.wday] end function t:A(locale) return "%s", locale.day[self.wday] end function t:b(locale) return "%s", locale.abmon[self.month] end function t:B(locale) return "%s", locale.mon[self.month] end function t:c(locale) return "%.3s %.3s%3d %.2d:%.2d:%.2d %d", locale.abday[self.wday], locale.abmon[self.month], self.day, self.hour, self.min, self.sec, self.year end -- Century function t:C() return "%02d", idiv(self.year, 100) end function t:d() return "%02d", self.day end -- Short MM/DD/YY date, equivalent to %m/%d/%y function t:D() return "%02d/%02d/%02d", self.month, self.day, self.year % 100 end function t:e() return "%2d", self.day end -- Short YYYY-MM-DD date, equivalent to %Y-%m-%d function t:F() return "%d-%02d-%02d", self.year, self.month, self.day end -- Week-based year, last two digits (00-99) function t:g() return "%02d", iso_8601_week(self) % 100 end -- Week-based year function t:G() return "%d", iso_8601_week(self) end t.h = t.b function t:H() return "%02d", self.hour end function t:I() return "%02d", (self.hour-1) % 12 + 1 end function t:j() return "%03d", self.yday end function t:m() return "%02d", self.month end function t:M() return "%02d", self.min end -- New-line character ('\n') function t:n() -- luacheck: ignore 212 return "\n" end function t:p(locale) return self.hour < 12 and locale.am_pm[1] or locale.am_pm[2] end -- TODO: should respect locale function t:r(locale) return "%02d:%02d:%02d %s", (self.hour-1) % 12 + 1, self.min, self.sec, self.hour < 12 and locale.am_pm[1] or locale.am_pm[2] end -- 24-hour HH:MM time, equivalent to %H:%M function t:R() return "%02d:%02d", self.hour, self.min end function t:s() return "%d", self:timestamp() end function t:S() return "%02d", self.sec end -- Horizontal-tab character ('\t') function t:t() -- luacheck: ignore 212 return "\t" end -- ISO 8601 time format (HH:MM:SS), equivalent to %H:%M:%S function t:T() return "%02d:%02d:%02d", self.hour, self.min, self.sec end function t:u() return "%d", iso_8601_weekday(self.wday) end -- Week number with the first Sunday as the first day of week one (00-53) function t:U() return "%02d", idiv(self.yday - self.wday + 7, 7) end -- ISO 8601 week number (00-53) function t:V() return "%02d", select(2, iso_8601_week(self)) end -- Weekday as a decimal number with Sunday as 0 (0-6) function t:w() return "%d", self.wday - 1 end -- Week number with the first Monday as the first day of week one (00-53) function t:W() return "%02d", idiv(self.yday - iso_8601_weekday(self.wday) + 7, 7) end -- TODO make t.x and t.X respect locale t.x = t.D t.X = t.T function t:y() return "%02d", self.year % 100 end function t:Y() return "%d", self.year end -- TODO timezones function t:z() -- luacheck: ignore 212 return "+0000" end function t:Z() -- luacheck: ignore 212 return "GMT" end -- A literal '%' character. t["%"] = function(self) -- luacheck: ignore 212 return "%%" end local function strftime(format_string, timetable) return (string.gsub(format_string, "%%([EO]?)(.)", function(locale_modifier, specifier) local func = t[specifier] if func then return strformat(func(timetable, c_locale)) else error("invalid conversation specifier '%"..locale_modifier..specifier.."'", 3) end end)) end local function asctime(timetable) -- Equivalent to the format string "%c\n" return strformat(t.c(timetable, c_locale)) .. "\n" end local strformat = string.format local mon_lengths = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31} -- Number of days in year until start of month; not corrected for leap years local months_to_days_cumulative = {0} for i = 2, 12 do months_to_days_cumulative[i] = months_to_days_cumulative[i-1] + mon_lengths[i-1] end -- For Sakamoto's Algorithm (day of week) local sakamoto = {0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4}; local function is_leap(y) if (y % 4) ~= 0 then return false elseif (y % 100) ~= 0 then return true else return (y % 400) == 0 end end local function month_length(m, y) if m == 2 then return is_leap(y) and 29 or 28 else return mon_lengths[m] end end local function leap_years_since(year) return idiv(year, 4) - idiv(year, 100) + idiv(year, 400) end local function day_of_year(day, month, year) local yday = months_to_days_cumulative[month] if month > 2 and is_leap(year) then yday = yday + 1 end return yday + day end local function day_of_week(day, month, year) if month < 3 then year = year - 1 end return(year + leap_years_since(year) + sakamoto[month] + day) % 7 + 1 end local function borrow(tens, units, base) local frac = tens % 1 units = units + frac * base tens = tens - frac return tens, units end local function carry(tens, units, base) if units >= base then tens = tens + idiv(units, base) units = units % base elseif units < 0 then tens = tens + idiv(units, base) units = (base + units) % base end return tens, units end -- Modify parameters so they all fit within the "normal" range local function normalise(year, month, day, hour, min, sec) -- `month` and `day` start from 1, need -1 and +1 so it works modulo month, day = month - 1, day - 1 -- Convert everything (except seconds) to an integer -- by propagating fractional components down. year , month = borrow(year , month, 12) -- Carry from month to year first, so we get month length correct in next line around leap years year , month = carry(year, month, 12) month, day = borrow(month, day , month_length(floor(month + 1), year)) day , hour = borrow(day , hour , 24) hour , min = borrow(hour , min , 60) min , sec = borrow(min , sec , 60) -- Propagate out of range values up -- e.g. if `min` is 70, `hour` increments by 1 and `min` becomes 10 -- This has to happen for all columns after borrowing, as lower radixes may be pushed out of range min , sec = carry(min , sec , 60) -- TODO: consider leap seconds? hour , min = carry(hour, min , 60) day , hour = carry(day , hour, 24) -- Ensure `day` is not underflowed -- Add a whole year of days at a time, this is later resolved by adding months -- TODO[OPTIMIZE]: This could be slow if `day` is far out of range while day < 0 do month = month - 1 if month < 0 then year = year - 1 month = 11 end day = day + month_length(month + 1, year) end year, month = carry(year, month, 12) -- TODO[OPTIMIZE]: This could potentially be slow if `day` is very large while true do local i = month_length(month + 1, year) if day < i then break end day = day - i month = month + 1 if month >= 12 then month = 0 year = year + 1 end end -- Now we can place `day` and `month` back in their normal ranges -- e.g. month as 1-12 instead of 0-11 month, day = month + 1, day + 1 return year, month, day, hour, min, sec end local leap_years_since_1970 = leap_years_since(1970) local function timestamp(year, month, day, hour, min, sec) year, month, day, hour, min, sec = normalise(year, month, day, hour, min, sec) local days_since_epoch = day_of_year(day, month, year) + 365 * (year - 1970) -- Each leap year adds one day + (leap_years_since(year - 1) - leap_years_since_1970) - 1 return days_since_epoch * (60*60*24) + hour * (60*60) + min * 60 + sec end local timetable_methods = {} function timetable_methods:unpack() return assert(self.year , "year required"), assert(self.month, "month required"), assert(self.day , "day required"), self.hour or 12, self.min or 0, self.sec or 0, self.yday, self.wday end function timetable_methods:normalise() local year, month, day year, month, day, self.hour, self.min, self.sec = normalise(self:unpack()) self.day = day self.month = month self.year = year self.yday = day_of_year(day, month, year) self.wday = day_of_week(day, month, year) return self end timetable_methods.normalize = timetable_methods.normalise -- American English function timetable_methods:timestamp() return timestamp(self:unpack()) end function timetable_methods:rfc_3339() local year, month, day, hour, min, fsec = self:unpack() local sec, msec = borrow(fsec, 0, 1000) msec = math.floor(msec) return strformat("%04u-%02u-%02uT%02u:%02u:%02d.%03d", year, month, day, hour, min, sec, msec) end function timetable_methods:strftime(format_string) return strftime(format_string, self) end local timetable_mt local function coerce_arg(t) if getmetatable(t) == timetable_mt then return t:timestamp() end return t end timetable_mt = { __index = timetable_methods; __tostring = timetable_methods.rfc_3339; __eq = function(a, b) return a:timestamp() == b:timestamp() end; __lt = function(a, b) return a:timestamp() < b:timestamp() end; __sub = function(a, b) return coerce_arg(a) - coerce_arg(b) end; } local function cast_timetable(tm) return setmetatable(tm, timetable_mt) end local function new_timetable(year, month, day, hour, min, sec, yday, wday) return cast_timetable { year = year; month = month; day = day; hour = hour; min = min; sec = sec; yday = yday; wday = wday; } end function timetable_methods:clone() return new_timetable(self:unpack()) end local function new_from_timestamp(ts) if type(ts) ~= "number" then error("bad argument #1 to 'new_from_timestamp' (number expected, got " .. type(ts) .. ")", 2) end return new_timetable(1970, 1, 1, 0, 0, ts):normalise() end --- Parse an RFC 3339 datetime at the given position -- Returns a time table and the `tz_offset` -- Return value is not normalised (this preserves a leap second) -- If the timestamp is only partial (i.e. missing "Z" or time offset) then `tz_offset` will be nil -- TODO: Validate components are within their boundarys (e.g. 1 <= month <= 12) local function rfc_3339(str, init) local year, month, day, hour, min, sec, patt_end = str:match("^(%d%d%d%d)%-(%d%d)%-(%d%d)[Tt](%d%d%.?%d*):(%d%d):(%d%d)()", init) -- luacheck: ignore 631 if not year then return nil, "Invalid RFC 3339 timestamp" end year = tonumber(year, 10) month = tonumber(month, 10) day = tonumber(day, 10) hour = tonumber(hour, 10) min = tonumber(min, 10) sec = tonumber(sec, 10) local tt = new_timetable(year, month, day, hour, min, sec) local tz_offset if str:match("^[Zz]", patt_end) then tz_offset = 0 else local hour_offset, min_offset = str:match("^([+-]%d%d):(%d%d)", patt_end) if hour_offset then tz_offset = tonumber(hour_offset, 10) * 3600 + tonumber(min_offset, 10) * 60 else -- luacheck: ignore 542 -- Invalid RFC 3339 timestamp offset (should be Z or (+/-)hour:min) -- tz_offset will be nil end end return tt, tz_offset end return { -- used in zenroom from_string = rfc_3339; to_string = function(a) return a:normalise():rfc_3339() end; from_seconds = new_from_timestamp; to_seconds = function(a) return a:normalise():timestamp() end; -- original from luatz is_leap = is_leap; day_of_year = day_of_year; day_of_week = day_of_week; normalise = normalise; timestamp = timestamp; new = new_timetable; new_from_timestamp = new_from_timestamp; cast = cast_timetable; timetable_mt = timetable_mt; } O--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] ---

Zencode language parser

-- -- Zencode is a Domain -- Specific Language (DSL) made to be understood by humans. Its -- purpose is detailed in the -- Zencode Whitepaper and DECODE EU project. -- -- @module ZEN -- -- @author Denis "Jaromil" Roio -- @license AGPLv3 -- @copyright Dyne.org foundation 2018-2020 -- -- The Zenroom VM is capable of parsing specific scenarios written in -- Zencode and execute high-level cryptographic operations described -- in them; this is to facilitate the integration of complex -- operations in software and the non-literate understanding of what a -- distributed application does. -- -- This section doesn't provide the documentation on how to write -- Zencode. Refer to the links above to learn it. This documentation -- continues to illustrate internals: how the Zencode direct-syntax -- parser is made, how it integrates in the Zenroom memory model. -- This is also the reference implementation to learn how to code -- Zencode simple scenario using Zeroom's Lua. -- -- @module ZEN local zencode = { given_steps = {}, when_steps = {}, if_steps = {}, then_steps = {}, schemas = {}, branch = false, branch_valid = false, id = 0, AST = {}, traceback = {}, -- execution backtrace eval_cache = {}, -- zencode_eval if...then conditions checks = {version = false}, -- version, scenario checked, etc. OK = true -- set false by asserts } -- set_sentence -- set_rule local function set_sentence(self, event, from, to, ctx) local index = self.current if self.current == 'whenif' then index = 'when' end if self.current == 'thenif' then index = 'then' end local reg = ctx.Z[index .. '_steps'] ctx.Z.OK = false xxx('Zencode parser from: ' .. from .. " to: "..to, 3) assert(reg,'Callback register not found: ' .. self.current) assert(#reg,'Callback register empty: '..self.current) local gsub = string.gsub -- optimization -- TODO: optimize in C -- remove '' contents, lower everything, expunge prefixes -- ignore 'the' only in Then statements local tt = gsub(ctx.msg, "'(.-)'", "''") -- msg trimmed on parse tt = gsub(tt, ' I ', ' ', 1) -- eliminate first person pronoun tt = tt:lower() -- lowercase all statement if to == 'then' then tt = gsub(tt, ' the ', ' ', 1) end if to == 'given' then tt = gsub(tt, ' the ', ' a ', 1) tt = gsub(tt, ' have ', ' ', 1) end -- prefixes found at beginning of statement tt = gsub(tt, '^when ', '', 1) tt = gsub(tt, '^then ', '', 1) tt = gsub(tt, '^given ', '', 1) tt = gsub(tt, '^if ', '', 1) tt = gsub(tt, '^and ', '', 1) -- TODO: expunge only first 'and' -- generic particles tt = gsub(tt, '^that ', ' ', 1) tt = gsub(tt, ' valid ', ' ', 1) -- backward compat tt = gsub(tt, ' known as ', ' ', 1) tt = gsub(tt, ' all ', ' ', 1) tt = gsub(tt, ' inside ', ' in ', 1) -- equivalence tt = gsub(tt, '^an ', 'a ', 1) tt = gsub(tt, ' +', ' ') -- eliminate multiple internal spaces -- TODO: OPTIMIZE here to avoid iteration over all zencode language every time for pattern, func in pairs(reg) do if (type(func) ~= 'function') then error('Zencode function missing: ' .. pattern, 2) return false end -- xxx(tt .. ' == ' ..pattern) if strcasecmp(tt, pattern) then local args = {} -- handle multiple arguments in same string for arg in string.gmatch(ctx.msg, "'(.-)'") do -- convert all spaces to underscore in argument strings arg = uscore(arg, ' ', '_') table.insert(args, arg) end ctx.Z.id = ctx.Z.id + 1 -- AST data prototype table.insert( ctx.Z.AST, { id = ctx.Z.id, -- ordered number args = args, -- array of vars source = ctx.msg, -- source text section = self.current, from = from, to = to, hook = func } ) -- function ctx.Z.OK = true break end end if not ctx.Z.OK and CONF.parser.strict_match then debug_traceback() exitcode(1) error('Zencode pattern not found ('..index..'): ' .. trim(ctx.msg), 1) return false elseif not ctx.Z.OK and not CONF.parser.strict_match then warn('Zencode pattern ignored: ' .. trim(ctx.msg), 1) end end local function set_rule(text) local res = false local tr = text.msg:gsub(' +', ' ') -- eliminate multiple internal spaces local rule = strtok(trim(tr):lower()) if rule[2] == 'check' and rule[3] == 'version' and rule[4] then -- TODO: check version of running VM -- elseif rule[2] == 'load' and rule[3] then -- act("zencode extension: "..rule[3]) -- require("zencode_"..rule[3]) local ver = V(rule[4]) -- SEMVER if ver == ZENROOM_VERSION then act('Zencode version match: ' .. ZENROOM_VERSION.original) res = true elseif ver < ZENROOM_VERSION then warn('Zencode written for an older version: ' .. ver.original) res = true elseif ver > ZENROOM_VERSION then warn('Zencode written for a newer version: ' .. ver.original) res = true else error('Version check error: ' .. rule[4]) end text.Z.checks.version = res elseif rule[2] == 'input' and rule[3] then -- rule input encoding|format '' if rule[3] == 'encoding' and rule[4] then CONF.input.encoding = input_encoding(rule[4]) res = true and CONF.input.encoding elseif rule[3] == 'format' and rule[4] then CONF.input.format = get_format(rule[4]) res = true and CONF.input.format elseif rule[3] == 'untagged' then res = true CONF.input.tagged = false end elseif rule[2] == 'output' and rule[3] then -- TODO: rule debug [ format | encoding ] -- rule input encoding|format '' if rule[3] == 'encoding' then CONF.output.encoding = { fun = guess_outcast(rule[4]), name = rule[4] } res = true and CONF.output.encoding elseif rule[3] == 'format' then CONF.output.format = get_format(rule[4]) res = true and CONF.output.format elseif rule[3] == 'versioning' then CONF.output.versioning = true res = true elseif strcasecmp(rule[3], 'ast') then CONF.output.AST = true res = true end elseif rule[2] == 'unknown' and rule[3] then if rule[3] == 'ignore' then CONF.parser.strict_match = false res = true end elseif rule[2] == 'collision' and rule[3] then if rule[3] == 'ignore' then CONF.heap.check_collision = false res = true end -- alias of unknown ignore for specific callers elseif rule[2] == 'caller' and rule[3] then if rule[3] == 'restroom-mw' then CONF.parser.strict_match = false CONF.heap.check_collision = false res = true end elseif rule[2] == 'set' and rule[4] then CONF[rule[3]] = fif( tonumber(rule[4]), tonumber(rule[4]), fif( rule[4]=='true', true, fif( rule[4]=='false', false, rule[4]))) res = true end if not res then error('Rule invalid: ' .. text.msg, 3) else act(text.msg) end return res end local function new_state_machine() -- stateDiagram -- [*] --> Given -- Given --> When -- When --> Then -- state branch { -- IF -- when then -- -- -- EndIF -- } -- When --> branch -- branch --> When -- Then --> [*] local machine = MACHINE.create( { initial = 'init', events = { {name = 'enter_rule', from = {'init', 'rule', 'scenario'}, to = 'rule'}, {name = 'enter_scenario', from = {'init', 'rule', 'scenario'}, to = 'scenario'}, {name = 'enter_given', from = {'init', 'rule', 'scenario'}, to = 'given'}, {name = 'enter_given', from = {'given'}, to = 'given'}, {name = 'enter_when', from = {'given', 'when', 'then', 'endif'}, to = 'when'}, {name = 'enter_then', from = {'given', 'when', 'then', 'endif'}, to = 'then'}, {name = 'enter_if', from = {'if', 'given', 'when', 'then', 'endif'}, to = 'if'}, {name = 'enter_whenif', from = {'if', 'whenif', 'thenif'}, to = 'whenif'}, {name = 'enter_thenif', from = {'if', 'whenif', 'thenif'}, to = 'thenif'}, {name = 'enter_endif', from = {'whenif', 'thenif'}, to = 'endif'}, {name = 'enter_and', from = 'given', to = 'given'}, {name = 'enter_and', from = 'when', to = 'when'}, {name = 'enter_and', from = 'then', to = 'then'}, {name = 'enter_and', from = 'whenif', to = 'whenif'}, {name = 'enter_and', from = 'thenif', to = 'thenif'}, {name = 'enter_and', from = 'if', to = 'if'} }, -- graph TD -- Given --> When -- IF --> When -- Then --> When -- Given --> IF -- When --> IF -- Then --> IF -- IF --> Then -- When --> Then -- Given --> Then callbacks = { -- msg is a table: { msg = "string", Z = ZEN (self) } onscenario = function(self, event, from, to, msg) -- first word until the colon local scenarios = strtok(string.match(trim(msg.msg):lower(), '[^:]+')) for k, scen in ipairs(scenarios) do if k ~= 1 then -- skip first (prefix) load_scenario('zencode_' .. trimq(scen)) ZEN:trace('Scenario ' .. scen) return end end end, onrule = function(self, event, from, to, msg) -- process rules immediately if msg then set_rule(msg) end end, ongiven = set_sentence, onwhen = set_sentence, onif = set_sentence, onendif = set_sentence, onthen = set_sentence, onand = set_sentence, onwhenif = set_sentence, onthenif = set_sentence } } ) return machine end -- Zencode HEAP globals IN = {} -- Given processing, import global DATA from json KIN = {} -- Given processing, import global KEYS from json TMP = TMP or {} -- Given processing, temp buffer for ack*->validate->push* ACK = ACK or {} -- When processing, destination for push* OUT = OUT or {} -- print out AST = AST or {} -- AST of parsed Zencode WHO = nil -- init statements zencode.endif_steps = { endif = function() return end } --nop function Given(text, fn) assert( not ZEN.given_steps[text], 'Conflicting GIVEN statement loaded by scenario: ' .. text, 2 ) ZEN.given_steps[text] = fn end function When(text, fn) assert( not ZEN.when_steps[text], 'Conflicting WHEN statement loaded by scenario: ' .. text, 2 ) ZEN.when_steps[text] = fn end function IfWhen(text, fn) assert( not ZEN.if_steps[text], 'Conflicting IF-WHEN statement loaded by scenario: ' .. text, 2 ) assert( not ZEN.when_steps[text], 'Conflicting IF-WHEN statement loaded by scenario: ' .. text, 2 ) ZEN.if_steps[text] = fn ZEN.when_steps[text] = fn end function Then(text, fn) assert( not ZEN.then_steps[text], 'Conflicting THEN statement loaded by scenario : ' .. text, 2 ) ZEN.then_steps[text] = fn end --- -- Declare 'my own' name that will refer all uses of the 'my' pronoun -- to structures contained under this name. -- -- @function Iam(name) -- @param name own name to be saved in WHO function Iam(name) if name then ZEN.assert(not WHO, 'Identity already defined in WHO') ZEN.assert(type(name) == 'string', 'Own name not a string') WHO = name else ZEN.assert(WHO, 'No identity specified in WHO') end assert(ZEN.OK) end -- init schemas function zencode.add_schema(arr) local _illegal_schemas = { -- const whoami = true } for k, v in pairs(arr) do -- check overwrite / duplicate to avoid scenario namespace clash if ZEN.schemas[k] then error('Add schema denied, already registered schema: ' .. k, 2) end if _illegal_schemas[k] then error('Add schema denied, reserved name: ' .. k, 2) end ZEN.schemas[k] = v end end function have(obj) -- accepts arrays for depth checks local res if luatype(obj) == 'table' then local prev = ACK for k, v in ipairs(obj) do res = prev[uscore(v)] if not res then error('Cannot find object: ' .. v, 2) end prev = res end else res = ACK[uscore(obj)] if not res then error('Cannot find object: ' .. obj, 2) end end return res end function empty(obj) -- convert all spaces to underscore in argument if ACK[uscore(obj)] then error('Cannot overwrite existing object: ' .. obj, 2) end end --------------------------------------------------------------- -- ZENCODE PARSER local function zencode_iscomment(b) local x = string.char(b:byte(1)) if x == '#' then return true else return false end end local function zencode_isempty(b) if b == nil or b == '' then return true else return false end end -- returns an iterator for newline termination local function zencode_newline_iter(text) s = trim(text) -- implemented in zen_io.c if s:sub(-1) ~= '\n' then s = s .. '\n' end return s:gmatch('(.-)\n') -- iterators return functions end function zencode:begin() self.id = 0 self.AST = {} self.eval_cache = {} self.checks = {version = false} -- version, scenario checked, etc. self.OK = true -- set false by asserts self.traceback = {} -- Reset HEAP self.machine = {} IN = {} -- Given processing, import global DATA from json KIN = {} -- Given processing, import global KEYS from json TMP = {} -- Given processing, temp buffer for ack*->validate->push* ACK = {} -- When processing, destination for push* OUT = {} -- print out AST = {} -- AST of parsed Zencode self.CODEC = {} -- saves input conversions for to decode using same WHO = nil collectgarbage 'collect' -- Zencode init traceback self.machine = new_state_machine() end function zencode:parse(text) if #text < 9 then -- strlen("and debug") == 9 warn("Zencode text too short to parse") return false end local linenum=0 -- xxx(text,3) local prefix local branching = false local parse_prefix = parse_prefix -- optimization for line in zencode_newline_iter(text) do linenum = linenum + 1 local tline = trim(line) -- saves trims in isempty / iscomment if zencode_isempty(tline) then goto continue end if zencode_iscomment(tline) then goto continue end -- xxx('Line: '.. text, 3) -- max length for single zencode line is #define MAX_LINE -- hard-coded inside zenroom.h prefix = parse_prefix(line) -- trim is included assert(prefix, "Invalid Zencode line "..linenum..": "..line) self.OK = true exitcode(0) if prefix == 'if' then branching = true end if branching and (prefix == 'when') then prefix = prefix..'if' end if branching and (prefix == 'then') then prefix = prefix..'if' end if prefix == 'endif' then branching = false end -- try to enter the machine state named in prefix -- xxx("Zencode machine enter_"..prefix..": "..text, 3) local fm = self.machine["enter_"..prefix] assert(fm, "Invalid Zencode line "..linenum..": '"..line.."'") assert(fm(self.machine, { msg = tline, Z = self }), line.."\n ".. "Invalid transition from: "..self.machine.current) ::continue:: end collectgarbage'collect' return true end function zencode:trace(src) -- take current line of zencode local tr = trim(src) -- TODO: tabbing, ugly but ok for now if string.sub(tr, 1, 1) == '[' then table.insert(self.traceback, tr) else table.insert(self.traceback, ' . ' .. tr) end end -- trace function execution also on success function zencode:ftrace(src) -- take current line of zencode table.insert(self.traceback, ' D ZEN:' .. trim(src)) end -- log zencode warning in traceback function zencode:wtrace(src) -- take current line of zencode table.insert(self.traceback, ' W ZEN:' .. trim(src)) end local function IN_uscore(i) -- convert all element keys of IN to underscore local res = {} for k,v in pairs(i) do if luatype(v) == 'table' then res[uscore(k)] = IN_uscore(v) -- recursion else res[uscore(k)] = v end end return setmetatable(res, getmetatable(i)) end -- return true: caller skip execution and go to ::continue:: -- return false: execute statement local function manage_branching(x) if x.section == 'if' then xxx("START conditional execution: "..x.source, 2) if not ZEN.branch then ZEN.branch_valid = true end ZEN.branch = true return false end if x.section == 'endif' then xxx("END conditional execution: "..x.source, 2) ZEN.branch = false return true end if not ZEN.branch then return false end if not ZEN.branch_valid then xxx('skip execution in false conditional branch: '..x.source, 2) return true end return false end function zencode:run() -- runtime checks if not ZEN.checks.version then warn( 'Zencode is missing version check, please add: rule check version N.N.N' ) end -- HEAP setup IN = {} -- import global DATA from json if DATA then -- if plain array conjoin into associative IN = CONF.input.format.fun(DATA) or {} DATA = nil end KIN = {} -- import global KEYS from json if KEYS then KIN = CONF.input.format.fun(KEYS) or {} KEYS = nil end collectgarbage 'collect' -- convert all spaces in keys to underscore IN = IN_uscore(IN) KIN = IN_uscore(KIN) -- check name collisions between DATA and KEYS if CONF.heap.check_collision then for k in pairs(IN) do if KIN[k] then error("Object name collision in input: "..k) end end end -- EXEC zencode for _, x in pairs(self.AST) do -- ZEN:trace(x.source) if manage_branching(x) then goto continue end -- trigger upon switch to when or then section if x.from == 'given' and x.to ~= 'given' then -- delete IN memory KIN = {} IN = {} collectgarbage 'collect' end -- HEAP integrity guard if CONF.heapguard then -- guard ACK's contents on section switch deepmap(zenguard, ACK) end ZEN.OK = true exitcode(0) local ok, err = pcall(x.hook, table.unpack(x.args)) if not ok or not ZEN.OK then if err then ZEN:trace('[!] ' .. err) end fatal(x.source) -- traceback print inside end collectgarbage 'collect' ::continue:: end -- PRINT output ZEN:trace('--- Zencode execution completed') if type(OUT) == 'table' then ZEN:trace('<<< Encoding { OUT } to JSON ') -- this is all already encoded -- needs to be formatted -- was used CONF.output.format.fun -- suspended until more formats are implemented print( JSON.encode(OUT) ) ZEN:trace('>>> Encoding successful') else -- this should never occur in zencode, OUT is always a table ZEN:trace('<<< Printing OUT (plain format, not a table)') print(OUT) end end function zencode.serialize(A) local t = luatype(A) if t == 'table' then local res res = serialize(A) return OCTET.from_string(res.strings) .. res.octets elseif t == 'number' then return O.from_string(tostring(A)) elseif t == 'string' then return O.from_string(A) else local zt = type(A) if not iszen(zt) then error('Cannot convert value to octet: '..zt, 2) end -- all zenroom types have :octet() method to export return A:octet() end error('Unknown type, cannot convert to octet: '..type(A), 2) end function zencode.heap() return ({ IN = IN, KIN = KIN, TMP = TMP, ACK = ACK, OUT = OUT }) end function zencode.debug() debug_traceback() debug_heap_dump() -- I.warn(ZEN.traceback) -- I.warn({ HEAP = { IN = IN, -- TMP = TMP, -- ACK = ACK, -- OUT = OUT }}) end function zencode.debug_json() write( JSON.encode( { TRACE = ZEN.traceback, HEAP = { IN = IN, TMP = TMP, ACK = ACK, OUT = OUT } } ) ) end function zencode.assert(condition, errmsg) if condition then return true else ZEN.branch_valid = false end -- in conditional branching ZEN.assert doesn't quit if ZEN.branch then ZEN:trace(errmsg) xxx(errmsg) else -- ZEN.debug() -- prints all data in memory ZEN:trace('ERR ' .. errmsg) ZEN.OK = false exitcode(1) error(errmsg, 3) end end return zencode I--[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda and Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] local btc -- mostly loaded at init if not BTC then btc = require_once('crypto_bitcoin') else btc = BTC end -- TODO: any mean to verify that the content of address and txid is valid local function _get_addr(obj) local res = ZEN.get(obj, '.', O.from_base58, tostring) if not res then error("invalid segwit address",2) end return res end local function _bitcoin_unspent_import(obj) local res = {} for _,v in pairs(obj) do -- compatibility with electrum and bitcoin core local n_amount = fif( v.amount, 'amount', 'value') local n_txid = fif( v.txid, 'txid', 'prevout_hash') local n_vout = fif( v.vout, 'vout', 'prevout_n') local address if v.address then address = ZEN.get(v,'address', O.from_segwit, tostring) end local amount = ZEN.get(v,n_amount, btc.value_btc_to_satoshi, tostring) local txid = ZEN.get(v,n_txid, OCTET.from_hex, tostring) local vout = v[n_vout] -- number table.insert(res, { address = address, amount = amount, txid = txid, vout = vout }) end return(res) end local function _bitcoin_unspent_export(obj) local res = { } for _,v in pairs(obj) do -- to_segwit: octet, version number(0), 'bc' or 'tc' local address = v.address:segwit(0, 'tb') local amount = btc.value_satoshi_to_btc(v.amount) local txid = v.txid:hex() local vout = v.vout table.insert(res, { address = address, amount = amount, txid = txid, vout = vout }) end return res end local function _satoshi_unspent_import(obj) local res = {} for _,v in pairs(obj) do -- compatibility with electrum and bitcoin core table.insert(res, { amount = ZEN.get(v,'value', BIG.from_decimal, tostring), txid = ZEN.get(v,'txid', OCTET.from_hex, tostring), vout = v.vout }) end return(res) end local function _satoshi_unspent_export(obj) local res = { } for _,v in pairs(obj) do -- to_segwit: octet, version number(0), 'bc' or 'tc' local address = v.address:segwit(0, 'tb') local amount = BIG.to_decimal(v.amount) local txid = v.txid:hex() local vout = v.vout table.insert(res, { amount = amount, txid = txid, vout = vout }) end return res end local function _address_import(obj) return { raw = ZEN.get(obj, '.', O.from_segwit, tostring) } end local function _address_export(obj) return O.to_segwit(obj.raw, obj.version, O.to_string(obj.network)) end local function _wif_import(obj) return ZEN.get(obj, '.', BTC.wif_to_sk, O.from_base58) end local function _wif_bitcoin_export(obj) return O.to_base58( BTC.sk_to_wif( obj, 'bitcoin') ) end local function _wif_testnet_export(obj) return O.to_base58( BTC.sk_to_wif( obj, 'testnet') ) end ZEN.add_schema( { bitcoin_key = { import = _wif_import, export = _wif_bitcoin_export }, testnet_key = { import = _wif_import, export = _wif_testnet_export }, satoshi_amount = function(obj) return ZEN.get(obj, '.', BIG.from_decimal, tostring) end, satoshi_fee = function(obj) return ZEN.get(obj, '.', BIG.from_decimal, tostring) end, satoshi_unspent = { import = _satoshi_unspent_import, export = _satoshi_unspent_export }, bitcoin_unspent = { import = _bitcoin_unspent_import, export = _bitcoin_unspent_export }, testnet_unspent = { import = _bitcoin_unspent_import, export = _bitcoin_unspent_export }, bitcoin_address = { import = _address_import, export = _address_export }, testnet_address = { import = _address_import, export = _address_export }, }) -- generate a keypair in "bitcoin" format (only x coord, 03 prepended) local function _keygen(name) initkeys(name) local kp = ECDH.keygen() ACK.keys[name] = kp.private end When('create the bitcoin key', function() _keygen('bitcoin') end) When('create the testnet key', function() _keygen('testnet') end) local function _import_wif(sec, name) local sk = have(sec) local res if #sk == 32+6 then -- wif btc.wif_to_sk(sk) -- checks res = sk elseif #sk == 32 then res = sk -- TODO: import from hdwallet xpriv format else error("Invalid "..name.." key size for "..sec..": "..#sk) end initkeys(name) ACK.keys[name] = res end When("create the bitcoin key with secret key ''", function(sec) _import_wif(sec, 'bitcoin') end) When("create the testnet key with secret key ''", function(sec) _import_wif(sec, 'testnet') end) local function _get_pub(name) empty(name..' public key') local sk = havekey(name) ACK[name..'_public_key'] = ECDH.sk_to_pubc(sk) new_codec(name..' public key', { zentype = 'schema' }) end When("create the bitcoin public key", function() _get_pub('bitcoin') end) When("create the testnet public key", function() _get_pub('testnet') end) local function _create_addr(name,pfx) empty(name..' address') local pk if ACK[name..'_public_key'] then pk = have(name..' public key') else pk = ECDH.sk_to_pubc( havekey(name) ) end ACK[name..'_address'] = { raw = btc.address_from_public_key(pk), version = 0, network = O.from_string(pfx) } new_codec(name..' address', { zentype = 'schema', encoding = 'complex' }) end When("create the bitcoin address", function() _create_addr('bitcoin','bc') end) When("create the testnet address", function() _create_addr('testnet','tb') end) local function _create_tx(name, recipient) local to = have(recipient or 'recipient') if not to then error("Cannot create "..name.." transaction: recipient not specified") end local q = have'satoshi amount' local fee = have'satoshi fee' local unspent = have(name..' unspent') local tx = btc.build_tx_from_unspent(unspent, to, q, fee, ACK.sender) ZEN.assert(tx, "Not enough "..name.." in the unspent list") ACK[name..'_transaction'] = tx end When('create the bitcoin transaction', function() _create_tx('bitcoin') end) When('create the testnet transaction', function() _create_tx('testnet') end) When("create the bitcoin transaction to ''", function(recipient) _create_tx('bitcoin', recipient) end) When("create the testnet transaction to ''", function(recipient) _create_tx('testnet', recipient) end) local function _sign_tx(name) local sk = havekey(name) local tx = have(name..'_transaction') ZEN.assert(not tx.witness, "The "..name.." transaction is already signed") tx.witness = btc.build_witness(tx, sk) end When("sign the bitcoin transaction", function() _sign_tx('bitcoin') end) When("sign the testnet transaction", function() _sign_tx('testnet') end) local function _toraw_tx(name) local tx = have(name..' transaction') empty(name..' raw transaction') ACK[name..'_raw_transaction'] = btc.build_raw_transaction(tx) end When("create the bitcoin raw transaction", function() _toraw_tx('bitcoin') end) When("create the testnet raw transaction", function() _toraw_tx('testnet') end) --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 4th September 2021 --]] -- defined outside because reused across different schemas local function public_key_f(o) local res = CONF.input.encoding.fun(o) ZEN.assert( ECDH.pubcheck(res), 'Public key is not a valid point on curve' ) return res end local function warn_keypair() warn("Use of 'keypair' is deprecated in favor of 'keyring'") warn("Examples: I have my 'keyring' or I create the keyring") end ZEN.add_schema( { -- keypair (ECDH) public_key = public_key_f, ecdh_public_key = public_key_f, keypair = function(obj) local pub = public_key_f(obj.public_key) local sec = ZEN.get(obj, 'private_key') ZEN.assert( pub == ECDH.pubgen(sec), 'Public key does not belong to secret key in keypair' ) warn_keypair() return { public_key = pub, private_key = sec } end, secret_message = function(obj) return { checksum = ZEN.get(obj, 'checksum'), header = ZEN.get(obj, 'header'), iv = ZEN.get(obj, 'iv'), text = ZEN.get(obj, 'text') } end, signature = function(obj) return { r = ZEN.get(obj, 'r'), s = ZEN.get(obj, 's') } end } ) -- generate keypair local function f_keygen() empty'keypair' local kp = ECDH.keygen() ACK.keypair = { public_key = kp.public, private_key = kp.private } new_codec('keypair', { zentype = 'schema' }) warn_keypair() end When('create the keypair', f_keygen) When( "create the ecdh key", function() initkeys'ecdh' ACK.keys.ecdh = ECDH.keygen().private end ) When( "create the ecdh public key", function() empty'ecdh public key' local sk = havekey'ecdh' ACK.ecdh_public_key = ECDH.pubgen(sk) end ) When( "create the ecdh key with secret key ''", function(sec) local sk = have(sec) initkeys'ecdh' ECDH.pubgen(sk) ACK.keys.ecdh = sk end ) When( "create the keypair with secret key ''", function(sec) local sk = have(sec) empty'keypair' local pub = ECDH.pubgen(sk) ACK.keypair = { public_key = pub, private_key = sk } warn_keypair() end ) -- encrypt with a header and secret When( "encrypt the secret message '' with ''", function(msg, sec) local text = have(msg) local sk = have(sec) empty'secret message' -- KDF2 sha256 on all secrets local secret = KDF(sk) ACK.secret_message = { header = ACK.header or OCTET.from_string('DefaultHeader'), iv = O.random(32) } ACK.secret_message.text, ACK.secret_message.checksum = ECDH.aead_encrypt( secret, text, ACK.secret_message.iv, ACK.secret_message.header ) new_codec('secret message', { zentype = 'dictionary' }) end ) -- decrypt with a secret When( "decrypt the text of '' with ''", function(msg, sec) local sk = have(sec) local text = have(msg) empty'text' empty'checksum' local secret = KDF(sk) -- KDF2 sha256 on all secrets, this way the -- secret is always 256 bits, safe for direct aead_decrypt ACK.text, ACK.checksum = ECDH.aead_decrypt( secret, text.text, text.iv, text.header ) ZEN.assert( ACK.checksum == text.checksum, 'Decryption error: authentication failure, checksum mismatch' ) end ) local function _havekey_compat() initkeys() local sk = ACK.keys.ecdh if sk then return sk else local kp = have'keypair' if not kp then goto fail else warn_keypair() end sk = kp.private_key if not sk then goto fail end return sk end ::fail:: ZEN.assert(sk, "ECDH Private key not found anywhere in keyring or keypair") end -- check various locations to find the public key local function _pubkey_compat(_key) local pubkey = ACK[_key] if not pubkey then local pubkey_arr pubkey_arr = ACK.public_key or ACK.public_key_session or ACK.ecdh_public_key if luatype(pubkey_arr) == 'table' then pubkey = pubkey_arr[_key] else pubkey = pubkey_arr end ZEN.assert(pubkey, 'Public key not found for: ' .. _key) end return pubkey end -- encrypt to a single public key When( "encrypt the secret message of '' for ''", function(msg, _key) local sk = _havekey_compat() have(msg) local pk = _pubkey_compat(_key) empty'secret message' local key = ECDH.session(sk, pk) ACK.secret_message = { header = ACK.header or OCTET.from_string('DefaultHeader'), iv = O.random(32) } ACK.secret_message.text, ACK.secret_message.checksum = ECDH.aead_encrypt( key, ACK[msg], ACK.secret_message.iv, ACK.secret_message.header ) new_codec('secret message', { zentype = 'dictionary' }) end ) When( "decrypt the text of '' from ''", function(secret, _key) local sk = _havekey_compat() have(secret) local pk = _pubkey_compat(_key) local message = ACK[secret][_key] or ACK[secret] local session = ECDH.session(sk, pk) local checksum ACK.text, checksum = ECDH.aead_decrypt(session, message.text, message.iv, message.header) ZEN.assert( checksum == message.checksum, 'Failed verification of integrity for secret message' ) end ) -- sign a message and verify When( "create the signature of ''", function(doc) local sk = _havekey_compat() empty'signature' local obj = have(doc) ACK.signature = ECDH.sign(sk, ZEN.serialize(obj)) ZEN.CODEC.signature = CONF.output.encoding.name end ) IfWhen( "verify the '' has a signature in '' by ''", function(msg, sig, by) local pk = _pubkey_compat(by) local obj = have(msg) local s = have(sig) ZEN.assert( ECDH.verify(pk, ZEN.serialize(obj), s), 'The signature by ' .. by .. ' is not authentic' ) end ) g --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] -- Decentralized Privacy-Preserving Proximity Tracing scenarion in Zencode SHA256 = HASH.new('sha256') -- ZEN.add_schema({ -- -- secret_day_key = function(obj) -- -- ZEN.assert(#obj == 32, "Secret day key has wrong size (not 32 bytes / 256 bits)") -- -- return obj -- -- end -- -- TODO: -- -- list of infected (array of 32 byte random hashes) -- -- ephemeral ids (array of 16 byte AES-GCM checksums) -- }) When("renew the secret day key to a new day", function() ZEN.assert(ACK.secret_day_key, "Secret day key not found") local sk = SHA256:process(ACK.secret_day_key) ZEN.assert(sk, "Error renewing secret day key (SHA256)") ACK.secret_day_key = sk end) When("create the ephemeral ids for today", function() ZEN.assert(ACK.secret_day_key, "Secret day key not found") ZEN.assert(ACK.broadcast_key, "Broadcast key not found") ZEN.assert(type(ACK.epoch) == 'number', "Epoch length (minutes) not found") local PRF = SHA256:hmac(ACK.secret_day_key, ACK.broadcast_key) local epd = (24*60)/ACK.epoch -- num epochs per day local zero = OCTET.zero(epd*16) -- 0 byte buffer ACK.ephemeral_ids = { } for i = 0,epd,1 do local PRG = AES.ctr(PRF, zero, O.from_number(i)) local l,r = OCTET.chop(PRG,16) table.insert(ACK.ephemeral_ids, l) end end) When("create the proximity tracing of infected ids", function() ZEN.assert(type(ACK.epoch) == 'number', "Number of moments not found") ZEN.assert(type(ACK.list_of_infected) == 'table', "List of infected not found") ZEN.assert(type(ACK.ephemeral_ids) == 'table', "List of ephemeral ids not found") ZEN.assert(ACK.broadcast_key, "Broadcast key not found") ACK.proximity_tracing = { } local epd = (24*60)/ACK.epoch -- num epochs per day local zero = OCTET.zero(epd*16) -- 0 byte buffer for n,sk in ipairs(ACK.list_of_infected) do local PRF = SHA256:hmac(sk, ACK.broadcast_key) for i = 0,epd,1 do local PRG = OCTET.chop( AES.ctr(PRF, zero, O.from_number(i)), 16) for nn,eph in next, ACK.ephemeral_ids, nil do if eph == PRG then table.insert(ACK.proximity_tracing, sk) end end end end end) O--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Sunday, 11th July 2021 --]] -- generic comparison using overloaded __eq on values local function _eq(left, right) if luatype(left) == 'number' and luatype(right) == 'number' then return (left == right) elseif luatype(left) == 'table' and luatype(right) == 'table' then if(#left ~= #right) then return false end -- optimization return (ZEN.serialize(left) == ZEN.serialize(right)) elseif iszen(type(left)) and iszen(type(right)) then return (left:octet() == right:octet()) else error("Comparison between incompatible types: " ..type(left).." and "..type(right), 2) end end local function _neq(left, right) if luatype(left) == 'number' and luatype(right) == 'number' then return (left ~= right) elseif luatype(left) == 'table' and luatype(right) == 'table' then if(#left == #right) then return false end -- optimization return (ZEN.serialize(left) ~= ZEN.serialize(right)) elseif iszen(type(left)) and iszen(type(right)) then return (left:octet() ~= right:octet()) else error("Comparison between incompatible types: " ..type(left).." and "..type(right), 2) end end IfWhen( "verify '' is equal to ''", function(l, r) local left = have(l) local right = have(r) ZEN.assert( _eq(left, right), 'Verification fail: elements are not equal: ' .. l .. ' == ' .. r ) end ) IfWhen( "verify '' is not equal to ''", function(l, r) local left = have(l) local right = have(r) ZEN.assert( _neq(left, right), 'Verification fail: elements are equal: ' .. l .. ' == ' .. r ) end ) -- comparison inside dictionary IfWhen( "verify '' is equal to '' in ''", function(l, tr, tt) local left = have(l) local tab = have(tt) local right = tab[tr] ZEN.assert( _eq(left, right), 'Verification fail: elements are not equal: ' .. l .. ' == ' .. tt .. '.' .. tr ) end ) IfWhen( "verify '' is not equal to '' in ''", function(l, tr, tt) local left = have(l) local tab = have(tt) local right = tab[tr] ZEN.assert( _neq(left, right), 'Verification fail: elements are equal: ' .. l .. ' == ' .. tt .. '.' .. tr ) end ) -- check a tuple of numbers before comparison, convert to BIG or number local function numcheck(left, right) local al, ar -- if left == nil then error('1st argument of numerical comparison is nil', 2) end local tl = type(left) if not iszen(tl) then if tl ~= 'number' then error('1st argument invalid numeric type: ' .. tl, 2) end end if tl == 'zenroom.octet' then al = BIG.new(left) elseif tl == 'zenroom.big' or tl == 'number' then al = left else al = left:octet() end -- if right == nil then error('2nd argument of numerical comparison is nil', 2) end local tr = type(right) if not iszen(tr) then if tr ~= 'number' then error('2nd argument invalid numeric type: ' .. tr, 2) end end if tr == 'zenroom.octet' then ar = BIG.new(right) elseif tr == 'zenroom.big' or tr == 'number' then ar = right else ar = right:octet() end return al, ar end IfWhen( "number '' is less than ''", function(left, right) local l, r = numcheck(ACK[left], ACK[right]) ZEN.assert( l < r, 'Comparison fail: ' .. left .. ' is not less than ' .. right ) end ) IfWhen( "number '' is less or equal than ''", function(left, right) local l, r = numcheck(ACK[left], ACK[right]) ZEN.assert( l <= r, 'Comparison fail: ' .. left .. ' is not less or equal than ' .. right ) end ) IfWhen( "number '' is more than ''", function(left, right) local l, r = numcheck(ACK[left], ACK[right]) ZEN.assert( r < l, 'Comparison fail: ' .. left .. ' is not more than ' .. right ) end ) IfWhen( "number '' is more or equal than ''", function(left, right) local l, r = numcheck(ACK[left], ACK[right]) ZEN.assert( r <= l, 'Comparison fail: ' .. left .. ' is not more or equal than ' .. right ) end ) -- TODO: substitute with RFC2047 compliant code (take from jaromail) local function validemail(str) if str == nil then return nil end if (type(str) ~= 'string') then error('Expected string') return nil end local lastAt = str:find('[^%@]+$') local localPart = str:sub(1, (lastAt - 2)) -- Returns the substring before '@' symbol local domainPart = str:sub(lastAt, #str) -- Returns the substring after '@' symbol -- we werent able to split the email properly if localPart == nil then return nil, 'Local name is invalid' end if domainPart == nil then return nil, 'Domain is invalid' end -- local part is maxed at 64 characters if #localPart > 64 then return nil, 'Local name must be less than 64 characters' end -- domains are maxed at 253 characters if #domainPart > 253 then return nil, 'Domain must be less than 253 characters' end -- somthing is wrong if lastAt >= 65 then return nil, 'Invalid @ symbol usage' end if string.sub(domainPart, 1, 1) == '.' then return false, 'first character in domainPart is a dot' end -- quotes are only allowed at the beginning of a the local name local quotes = localPart:find('["]') if type(quotes) == 'number' and quotes > 1 then return nil, 'Invalid usage of quotes' end -- no @ symbols allowed outside quotes if localPart:find('%@+') and quotes == nil then return nil, 'Invalid @ symbol usage in local part' end -- no dot found in domain name if not domainPart:find('%.') then return nil, 'No TLD found in domain' end -- only 1 period in succession allowed if domainPart:find('%.%.') then return nil, 'Too many periods in domain' end if localPart:find('%.%.') then return nil, 'Too many periods in local part' end -- just a general match if not str:match('[%w]*[%p]*%@+[%w]*[%.]?[%w]*') then return nil, 'Email pattern test failed' end if (lastAt == nil) then lastAt = #str + 1 end -- all our tests passed, so we are ok return true end IfWhen( "verify '' is a email", function(name) local A = ACK[name] ZEN.assert(A, 'Object not found: ' .. name) local res, err = validemail(O.to_string(A)) ZEN.assert(res, err) end ) IfWhen( "verify '' contains a list of emails", function(name) local A = ACK[name] ZEN.assert(A, 'Object not found: ' .. name) ZEN.assert( luatype(A) == 'table', 'Object is not a container: ' .. name ) local res, err for k, v in pairs(A) do res, err = validemail(O.to_string(v)) ZEN.assert(res, (err or 'OK') .. ' on email: ' .. O.to_string(v)) end end ) --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local octet = require'octet' --- implicit convertion functions going both ways -- if input is an encoded string, will become an octet -- if input is a non-encoded string, it will become a base64 string -- if input is an octet, will become an encoded string function hex(data) local t = type(data) if(t == "string") then if O.is_hex(data) then return O.from_hex(data) else return O.from_str(data):hex() end elseif(t == "number") then return data elseif(t == "table") then return data elseif iszen(t) then return data:octet():hex() -- any zenroom type to octet end end function str(data) local t = type(data) if(t == "string") and data ~= "" then if OCTET.is_url64(data) then -- return decoded string format for JSON.decode return OCTET.from_url64(data):str() elseif OCTET.is_base64(data) then -- return decoded string format for JSON.decode return OCTET.from_base64(data):str() elseif OCTET.is_base58(data) then -- return decoded string format for JSON.decode return OCTET.from_base58(data):str() elseif OCTET.is_hex(data) then -- return decoded string format for JSON.decode return OCTET.from_hex(data):str() elseif OCTET.is_bin(data) then -- return decoded string format for JSON.decode return OCTET.from_bin(data):str() else -- its already a string (we suppose, this is not deterministic) return data end elseif iszen(t) then return data:octet():str() else error("automatic str() conversion failed for type: "..t) end end function bin(data) local t = type(data) if(t == "string") then if O.is_bin(data) then return O.from_bin(data) else return O.from_str(data):bin() end elseif(t == "number") then return data elseif(t == "table") then return data elseif iszen(t) then return data:octet():bin() -- any zenroom type to octet end end function base64(data) if not data then error("Internal data conversion on nil",2) end local t = type(data) if(t == "string") then if O.is_base64(data) then return O.from_base64(data) else return O.from_str(data):base64() end elseif(t == "number") then return data elseif(t == "table") then return data elseif iszen(t) then return data:octet():base64() -- any zenroom type to octet end end function url64(data) if not data then error("Internal data conversion on nil",2) end local t = type(data) if(t == "string") then if O.is_url64(data) then return O.from_url64(data) else return O.from_str(data):url64() end elseif(t == "number") then return data elseif(t == "table") then return data elseif iszen(t) then return data:octet():url64() -- any zenroom type to octet end end function base58(data) local t = type(data) if(t == "string") then if O.is_base58(data) then return O.from_base58(data) else return O.from_str(data):base58() end elseif iszen(t) then return data:octet():base58() -- any zenroom type to octet end end return octet ---[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 14th January 2022 --]] load_scenario('zencode_credential') ABC = require_once('crypto_credential') G2 = ECP2.generator() local function import_reflow_seal_fingerprints_f(o) if not o then return {} end local rawarr = deepmap(CONF.input.encoding.fun, o) local arr = {} for _, v in ipairs(rawarr) do table.insert(arr, ECP.new(v)) end return arr end local function import_reflow_seal_f(obj) local f if obj.fingerprints then f = import_reflow_seal_fingerprints_f(obj.fingerprints) else f = nil end return { identity = ZEN.get(obj, 'identity', ECP.new), SM = ZEN.get(obj, 'SM', ECP.new), verifier = ZEN.get(obj, 'verifier', ECP2.new), fingerprints = f } end ZEN.add_schema( { reflow_public_key = function(obj) return ZEN.get(obj, '.', ECP2.new) end, reflow_seal = import_reflow_seal_f, reflow_signature = function(obj) return { identity = ZEN.get(obj, 'identity', ECP.new), signature = ZEN.get(obj, 'signature', ECP.new), proof = import_credential_proof_f(obj.proof), zeta = ZEN.get(obj, 'zeta', ECP.new) } end, reflow_identity = function(obj) return ZEN.get(obj, '.', ECP.new) end, material_passport = function(obj) return { seal = import_reflow_seal_f(obj.seal), proof = import_credential_proof_f(obj.proof), zeta = ZEN.get(obj, 'zeta', ECP.new) } end } ) local function _makeuid(src) local uid if luatype(src) == 'table' then uid = ECP.hashtopoint(ZEN.serialize(src)) else uid = ECP.hashtopoint(src) end return(uid) end When( 'create the reflow key', function() -- keygen: δ = r.O ; γ = δ.G2 initkeys 'reflow' ACK.keys.reflow = INT.random() -- BLS secret signing key end ) When( 'create the reflow public key', function() empty 'reflow public key' havekey 'reflow' ACK.reflow_public_key = G2 * ACK.keys.reflow end ) When( "aggregate the reflow public key from array ''", function(arr) empty 'reflow public key' local s = have(arr) ZEN.assert(#s ~= 0, "Empty array: "..arr) local val for k, v in pairs(s) do if k == 'reflow_public_key' then val = v -- tolerate about named arrays elseif v.reflow_public_key then val = v.reflow_public_key else ZEN.assert(false, "Reflow public key not found in array: " ..arr.."["..#s.."] at key "..k) end if not ACK.reflow_public_key then ACK.reflow_public_key = val else ACK.reflow_public_key = ACK.reflow_public_key + val end end end ) When( "create the reflow identity of ''", function(doc) empty 'reflow identity' ACK.reflow_identity = _makeuid(have(doc)) end ) When( "create the reflow identity of objects in ''", function(doc) empty 'reflow identity' local arr = have(doc) ZEN.assert(luatype(arr)=='table', "Object is not an array or dictionary: "..doc) local first = { } for k,v in pairs(arr) do -- if reflow_id already present then check if ECP and use that if v.reflow_identity then local rid = ECP.new(v.reflow_identity) ZEN.assert(not rid:isinfinity(), "Object "..doc.."["..k.."] has an invalid reflow identity") table.insert(first, rid) else table.insert(first, _makeuid(v)) end end local res for _,v in pairs(first) do if not res then res = v else res = res + v end end ACK.reflow_identity = res end ) local function _create_reflow_seal_f(uid) empty 'reflow seal' have(uid) have 'reflow public key' local UID = ACK[uid] ZEN.assert(type(UID) == 'zenroom.ecp', "Invalid reflow identity: " ..uid.." ("..type(UID)..")") local r = INT.random() ACK.reflow_seal = { identity = UID, SM = UID * r, verifier = ACK.reflow_public_key + G2 * r } end When( "create the reflow seal with identity ''", _create_reflow_seal_f) When("create the reflow seal", function() _create_reflow_seal_f('reflow identity') end) When( 'create the reflow signature', function() empty 'reflow signature' have 'reflow seal' have 'issuer public key' havekey 'reflow' havekey 'credential' -- aggregate all credentials local pubcred = false for _, v in pairs(ACK.issuer_public_key) do if not pubcred then pubcred = v else pubcred = { pubcred.alpha + v.alpha, pubcred.beta + v.beta } end end local p, z = ABC.prove_cred_uid( pubcred, ACK.credentials, ACK.keys.credential, ACK.reflow_seal.identity ) ACK.reflow_signature = { identity = ACK.reflow_seal.identity, signature = ACK.reflow_seal.identity * ACK.keys.reflow, proof = p, zeta = z } end ) When( 'prepare credentials for verification', function() have 'credential' local res = false for _, v in pairs(ACK.issuer_public_key) do if not res then res = {alpha = v.alpha, beta = v.beta} else res.alpha = res.alpha + v.alpha res.beta = res.beta + v.beta end end ACK.verifiers = res end ) IfWhen( 'verify the reflow signature credential', function() have 'reflow_signature' have 'verifiers' have 'reflow_seal' ZEN.assert( ABC.verify_cred_uid( ACK.verifiers, ACK.reflow_signature.proof, ACK.reflow_signature.zeta, ACK.reflow_seal.identity ), 'Signature has an invalid credential to sign' ) end ) IfWhen( 'check the reflow signature fingerprint is new', function() have 'reflow_signature' have 'reflow_seal' if not ACK.reflow_seal.fingerprints then return end ZEN.assert( not ACK.reflow_seal.fingerprints[ACK.reflow_signature.zeta], 'Signature fingerprint is not new' ) end ) When( 'add the reflow fingerprint to the reflow seal', function() have 'reflow_signature' have 'reflow_seal' if not ACK.reflow_seal.fingerprints then ACK.reflow_seal.fingerprints = { ACK.reflow_signature.zeta } else table.insert( ACK.reflow_seal.fingerprints, ACK.reflow_signature.zeta ) end end ) When( 'add the reflow signature to the reflow seal', function() have 'reflow_seal' have 'reflow_signature' ACK.reflow_seal.SM = ACK.reflow_seal.SM + ACK.reflow_signature.signature end ) IfWhen( 'verify the reflow seal is valid', function() have 'reflow_seal' ZEN.assert( ECP2.miller(ACK.reflow_seal.verifier, ACK.reflow_seal.identity) == ECP2.miller(G2, ACK.reflow_seal.SM), "reflow seal doesn't validates" ) end ) When( "aggregate the reflow seal array in ''", function(arr) have(arr) empty 'reflow seal' local dst = {} for _, v in pairs(ACK[arr]) do if not dst.UID then dst.UID = v.UID else dst.UID = dst.UID + v.UID end if not dst.SM then dst.SM = v.SM else dst.SM = dst.SM + v.SM end if not dst.verifier then dst.verifier = v.verifier else dst.verifier = dst.verifier + v.verifier end end ACK.reflow_seal = dst end ) -------------------- -- MATERIAL PASSPORT -- -- Simplified flow to generate and verify material passports, which -- are a particular use-case of reflow signatures. Statements here do -- implicit things and reduce complexity of operations, in particular -- there is no multi-party computation in this process so credential -- use is omitted. -- aggregation supports single element arrays and fixes off-by-one local function _aggregate_array(arr) assert(isarray(arr), "Cannot aggregate invalid array", 2) local res = arr[1] if #arr > 1 then for i = 2, #arr do res = res + arr[i] end end return(res) end When( "create the material passport of ''", function(obj) local key = havekey'reflow' local cred = have'credentials' local id = have'reflow identity' local issuer_pub = have'issuer public key' -- object to sign local src = have(obj) empty('material passport') -- append agent id to track and trace if not ACK.fingerprints then ACK.fingerprints = { } end table.insert(ACK.fingerprints, id) -- calculate object uid local UID = _makeuid(src) -- reflow unique ID of object -- calculate signing uid (aggregation of all fingerprints) local SID = UID + _aggregate_array(ACK.fingerprints) local r = INT.random() -- blinding factor local p, z = ABC.prove_cred_uid(issuer_pub, cred, ACK.keys.credential, SID) ACK.material_passport = { seal = { identity = UID, fingerprints = ACK.fingerprints, -- optional SM = (SID * r) + (SID * key), -- blinding factor verifier = (G2 * r) + (G2 * key) }, proof = p, zeta = z } end) IfWhen( "verify the material passport of ''", function(obj) local src = have(obj) local mp = have'material passport' local pub = have'issuer public key' ZEN.assert(mp.seal.fingerprints, "No fingerprints found in material passport seal: "..obj) local UID = _makeuid(src) ZEN.assert(UID == mp.seal.identity, "Object does not match material passport identity (needs track and trace?): "..obj) local SID = UID + _aggregate_array(mp.seal.fingerprints) ZEN.assert( ECP2.miller(mp.seal.verifier, SID) == ECP2.miller(G2, mp.seal.SM), "Object matches, but seal is invalid: "..obj) ZEN.assert( ABC.verify_cred_uid(pub, mp.proof, mp.zeta, SID), "Object and seal are valid, but proof of issuance fails: "..obj) end) -- Complex check calculates UID of object and compares to seal, if -- correct then validates, else searches for .track array of seals and -- calculates aggregated UID, if correct then validates IfWhen( "verify the material passport of '' is valid", function(obj) have(obj) have(obj..'.seal') -- TODO end) --[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] -- Elgamal based Additive Homomorphic commitment scheme local elgah = { _VERSION = 'crypto_elgamal.lua 0.5', _URL = 'https://zenroom.dyne.org', _DESCRIPTION = 'Elgamal based Additive Homomorphic commitment scheme ', _LICENSE = [[ Licensed under the terms of the GNU Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ]] } local G = ECP.generator() -- return value local O = ECP.order() -- return value -- stateful challenge hardcoded string local hs = ECP.hashtopoint(str([[ Jaromil started writing this code on Tuesday 21st January 2020 ]] .. elgah._LICENSE)) local challenge = G:octet() .. hs:octet() local function to_challenge(list) local ser = serialize(list) return INT.new( sha256( challenge .. ser.octets .. OCTET.from_string(ser.strings))) end function elgah.keygen() local res = { private = INT.random() } res.public = G * res.private return(res) end function elgah.new(pub, m) -- sign == vote local k = INT.random() local hsm = hs * m -- optimisation -- vote encryption local enc_v = { left = G * k, right = pub * k + hsm } -- opposite of vote encryption local enc_v_neg = { left = enc_v.left:negative(), right = enc_v.right:negative() + hs } -- commitment to the vote local r = INT.random() local cv = G * r + hsm -- proof -- create the witnesess local wk = INT.random() local wm = INT.random() local wr = INT.random() local hswm = hs * wm -- optimisation -- compute the witnessess commitments local Aw = G * wk local Bw = pub * wk + hswm local Cw = G * wr + hswm -- create the challenge local c = to_challenge({enc_v.left, enc_v.right, cv, Aw, Bw, Cw}) -- create responses local rk = wk - c * k local rm = wm - c * m local rr = wr - c * r local pi = { c = c, rk = rk, rm = rm, rr = rr } -- signature's Theta return { value = { pos = enc_v, neg = enc_v_neg }, -- left/right tuples cv = cv, -- ecp pi = pi } -- pi end function elgah.verify(pub, theta) -- recompute witnessess commitment ZEN.assert(theta.pi, "ELGAH.verify 1st argument has no proof") ZEN.assert(theta.value,"ELGAH.verify 2nd argument has no value") local value = theta.value.pos local Aw = G * theta.pi.rk + value.left * theta.pi.c local Bw = pub * theta.pi.rk + hs * theta.pi.rm + value.right * theta.pi.c local Cw = G * theta.pi.rr + hs * theta.pi.rm + theta.cv * theta.pi.c -- verify challenge ZEN.assert(theta.pi.c == to_challenge( {value.left, value.right, theta.cv, Aw, Bw, Cw }), "ELGAH.verify: challenge fails") return true end function elgah.zero() return { pos = { left = ECP.infinity(), right = ECP.infinity() }, neg = { left = ECP.infinity(), right = ECP.infinity() } } end function elgah.add(pub, a, b) elgah.verify(pub, a) local pos = { left = nil, right = nil } local neg = { left = nil, right = nil } pos.left = a.value.pos.left + b.pos.left pos.right = a.value.pos.right + b.pos.right neg.left = a.value.neg.left + b.neg.left neg.right = a.value.neg.right + b.neg.right return { pos = pos, neg = neg } end function elgah.sub(pub, a, b) elgah.verify(pub, a) local pos = { left = nil, right = nil } local neg = { left = nil, right = nil } pos.left = a.value.pos.left - b.pos.left pos.right = a.value.pos.right - b.pos.right neg.left = a.value.neg.left - b.neg.left neg.right = a.value.neg.right - b.neg.right return { pos = pos, neg = neg } end function elgah.tally(pub, priv, n) local wx = INT.random() local Aw = { wx:modneg(O) * n.pos.left, wx:modneg(O) * n.neg.left } local c = to_challenge(Aw) local rx = wx - c * priv local dec = { pos = n.pos.left * priv:modneg(O), neg = n.neg.left * priv:modneg(O) } -- return pi_tally return { dec = dec, rx = rx, c = c } end function elgah.verify_tally(tally, value) local rxneg = tally.rx:modneg(O) local Aw = { rxneg * value.pos.left + tally.c * tally.dec.pos, rxneg * value.neg.left + tally.c * tally.dec.neg } ZEN.assert(tally.c == to_challenge(Aw), "ELGAH.verify_tally: challenge fails") return true end function elgah.count(tally, value, max) elgah.verify_tally(tally, value) local restab = { } max = max or 1000 for idx=1,max do restab[(BIG.new(idx) * hs):octet():url64()] = idx end local res = { pos = value.pos.right + tally.dec.pos, neg = value.neg.right + tally.dec.neg } return restab[res.pos:octet():url64()] end return elgah --[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation -- Implementation by Alberto Ibrisevich and Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Alberto Lerda --on Tuesday, 04th October 2021 --]] local li = { _VERSION = 'crypto_lagrange_interpolation.lua 1.0', _URL = 'https://zenroom.dyne.org', _DESCRIPTION = 'Secret Sharing based on BIG INT using Lagrange Interpolation over 1st order elliptic curves",Attribute-based credential system supporting multiple unlinkable private attribute revelations', _LICENSE = [[ Licensed under the terms of the GNU Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ]] } -- the biggest prime less than 2^(32*8) -- computed with -- i:=2^(32*8); -- while i ge 2^(31*8) do -- if IsPrime(i) then -- print(i); -- break; -- end if; -- i:=i-1; -- end while; -- at http://magma.maths.usyd.edu.au/calc/ -- 115792089237316195423570985008687907853269984665640564039457584007913129639747 octP = O.from_hex('ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff43') P = BIG.new(octP) assert(P:octet() == octP) function li.create_shared_secret(total, quorum, secret) if quorum >= total then error('Error calling create_shared_secret: quorum ('..quorum..') must be smaller than total ('..total..')', 2) end -- check that BIG can contain the whole secret, depends from curve's size and the choosen prime P local secbig = BIG.new(secret) if secbig:octet() ~= secret or secbig > P then error('Secret exceeds maximum BIG size: '..#O..' bytes or the size of the choosen prime') end secbig = secbig % P -- generation of the coefficients of the secret polynomial local coeff = { } -- take last argument or create random if secret then coeff[1] = BIG.new(secret) else coeff[1] = BIG.modrand(P) end for i=2,quorum,1 do coeff[i] = BIG.modrand(P) end --generation of the shares local shares = { } for i=1,total,1 do local x repeat x = BIG.modrand(P) if x ~=0 then --checking for duplicates in shares for _, k in pairs(shares) do if x == k then x = 0 end end end until x ~= 0 --this part provides trivial unleakability: x coordinate is never zero local y = coeff[1] --a_0 local x_n = BIG.new(1) for n=2,quorum,1 do x_n = x_n:modmul(x, P) -- x^(n-1) y = BIG.add(y, coeff[n]:modmul(x_n, P)) y = BIG.mod(y, P) -- +a_(n-1)x^(n-1) end table.insert(shares, {x = x, y = y}) end -- for i,total -- overwrite secret for secure disposal return shares, coeff[1] end function li.compose_shared_secret(shares) local sec = BIG.new(0) local num local den local quorum = #shares for i = 1,quorum,1 do num = BIG.new(1) if quorum % 2 == 0 then num = P - num end den = BIG.new(1) for j = 1,quorum,1 do if j~=i then num = num:modmul(shares[j].x, P) den = den:modmul((shares[i].x):modsub(shares[j].x, P), P) end end sec = BIG.add(sec, (shares[i].y):modmul(num:moddiv(den, P), P)) sec = BIG.mod(sec, P) end return sec end return li --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] -- override type to recognize zenroom's types luatype = type _G['type'] = function(var) local simple = luatype(var) if simple == "userdata" then local meta = getmetatable(var) if meta then return(meta.__name) else return("unknown") end else return(simple) end end -- TODO: optimise in C function iszen(n) for _ in n:gmatch("zenroom") do return true end return false end -- workaround for a ternary conditional operator function fif(condition, if_true, if_false) if condition then return if_true else return if_false end end function uscore(input) local it = luatype(input) if it == 'string' then return string.gsub(input, ' ', '_') elseif it == 'number' then return input else error("Underscore transform not a string or number: "..it, 2) end end function space(input) local it = luatype(input) if it == 'string' then return string.gsub(input, '_', ' ') elseif it == 'number' then return input else error("Whitespace transform not a string or number: "..it, 2) end end -- debugging facility function xxx(s, n) n = n or 3 if DEBUG >= n then printerr("LUA "..s) end end -- sorted iterator for deterministic ordering of tables -- from: https://www.lua.org/pil/19.3.html _G["lua_pairs"] = _G["pairs"] _G["lua_ipairs"] = _G["ipairs"] local function _pairs(t) local a = {} for n in lua_pairs(t) do table.insert(a, n) end table.sort(a) local i = 0 -- iterator variable return function () -- iterator function i = i + 1 -- if a[i] == nil then return nil return a[i], t[a[i]] end end local function _ipairs(t) local a = {} for n in lua_ipairs(t) do table.insert(a, n) end table.sort(a) local i = 0 -- iterator variable return function () -- iterator function i = i + 1 -- if a[i] == nil then return nil return a[i] end end -- Switch to deterministic (sorted) table iterators: this breaks lua -- tests in particular those stressing i/pairs and pack/unpack, which -- are anyway unnecessary corner cases in zenroom, which exits cleanly -- and signaling a stack overflow. Please report back if this -- generates problems leading to the pairs for loop in function above. _G["sort_pairs"] = _pairs _G["sort_ipairs"] = _pairs function deepcopy(orig) local orig_type = type(orig) local copy if orig_type == 'table' then copy = {} for orig_key, orig_value in next, orig, nil do copy[deepcopy(orig_key)] = deepcopy(orig_value) end setmetatable(copy, deepcopy(getmetatable(orig))) else -- number, string, boolean, etc copy = orig end return copy end -- deep recursive map on a tree structure -- for usage see test/deepmap.lua -- operates only on strings, passes numbers through function deepmap(fun,t,...) local luatype = luatype if luatype(fun) ~= 'function' then error("Internal error: deepmap 1st argument is not a function", 3) return nil end -- if luatype(t) == 'number' then -- return t end if luatype(t) ~= 'table' then error("Internal error: deepmap 2nd argument is not a table", 3) return nil end local res = {} for k,v in pairs(t) do if luatype(v) == 'table' then res[k] = deepmap(fun,v,...) -- recursion else res[k] = fun(v,k,...) end end return setmetatable(res, getmetatable(t)) end function isarray(obj) if not obj then warn("Argument of isarray() is nil") return false end if luatype(obj) == 'string' then -- seach HEAD for ACK[obj] and check its CODEC local o = ACK[obj] if not o then return false end if luatype(o) ~= 'table' then return false end if ZEN.CODEC[obj].zentype == 'array' then return true end return false end if luatype(obj) ~= 'table' then -- warn("Argument of isarray() is not a table") return false end local count = 0 for k, v in pairs(obj) do -- check that all keys are numbers -- don't check sparse ratio (cjson's lua_array_length) if luatype(k) ~= "number" then return false end count = count + 1 end return count end function isdictionary(obj) if not obj then warn("Argument of isdictionary() is nil") return false end if luatype(obj) == 'string' then -- seach HEAD for ACK[obj] and check its CODEC local o = ACK[obj] if not o then return false end if luatype(o) ~= 'table' then return false end if ZEN.CODEC[obj].zentype == 'dictionary' or ZEN.CODEC[obj].zentype == 'schema' then return true end -- TRUE return false end -- check the object itself if luatype(obj) ~= 'table' then return false end -- error("Argument is not a table: "..type(obj) local count = 0 for k, v in pairs(obj) do -- check that all keys are not numbers -- don't check sparse ratio (cjson's lua_array_length) if luatype(k) ~= "string" then return false end count = count + 1 end return count end function array_contains(arr, obj) assert(luatype(arr) == 'table', "Internal error: array_contains argument is not a table") for k, v in pairs(arr) do assert(luatype(k) == 'number', "Internal error: array_contains argument is not an array") if v == obj then return true end end return false end function help(module) if module == nil then print("usage: help(module)") print("example > help(octet)") print("example > help(ecdh)") print("example > help(ecp)") return end for k,v in pairs(module) do if type(v)~='table' and string.sub(k,1,1)~='_' then print("class method: "..k) end end -- local inst = module.new() -- if inst == nil then return end -- for s,f in pairs(getmetatable(inst)) do -- if(string.sub(s,1,2)~='__') then print("object method: "..s) end -- end end -- TODO: optimize in C using strtok local function split(src,pat) local tbl = {} src:gsub(pat, function(x) tbl[#tbl+1]=x end) return tbl end function strtok(src, pat) if not src then return { } end pat = pat or "%S+" ZEN.assert(luatype(src) == "string", "strtok error: argument is not a string") return split(src, pat) end -- assert all values in table are converted to zenroom types -- used in zencode when transitioning out of given memory function zenguard(val) local tv = type(val) if not (tv == 'number' or tv == 'boolean' or iszen(tv)) then I.print(ZEN.heap().ACK) -- xxx("Invalid value: "..val) debug_heap_dump() error("Zenguard detected an invalid value in HEAP: type "..type(val), 2) return nil end end Ilocal big = require'big' -- optimization: we could implement it in C function big.sqrt(num) local two = BIG.new(2) local xn = num local xnn; if xn ~= BIG.new(0) then xnn = (xn + (num / xn)) / two while xnn < xn do xn = xnn xnn = (xn + (num / xn)) / two end end return xn end return big --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --]] local HDW = {} -- an extended key is a table with the fields -- secret, chain_code, level, fingerprint_parent, child_number -- a private key may have public=nil -- a public key have secret=nil -- parse extended key -- @param data octet to be parsed -- @return extended key function HDW.parse_extkey(data) data = O.from_base58(data) -- check checksum assert(#data == 82 and data:sub(#data-3, #data) == HASH.dsha256(data:sub(1, #data-4)):chop(4), "Wrong input key", 2) local extkey = {} local i = 1 version = data:sub(i,i+3) i = i + 4 assert(version == HDW.MAINPK or version == HDW.MAINSK or version == HDW.TESTPK or version == HDW.TESTSK, "Unknown version", 2) local public = HDW.isPublic(version) extkey.level = tonumber(data:sub(i,i):hex(), 16) i = i + 1 extkey.fingerprint_parent = data:sub(i, i+3) i = i + 4 -- big endian 4 bytes integer extkey.child_number = BIG.new(data:sub(i, i+3)) i = i + 4 extkey.chain_code = data:sub(i, i+31) i = i + 32 if public then extkey.public = data:sub(i,i+32) else extkey.secret = data:sub(i+1,i+32) end return extkey end HDW.MAINPK = O.from_hex('0488B21E') HDW.TESTPK = O.from_hex('043587CF') HDW.MAINSK = O.from_hex('0488ADE4') HDW.TESTSK = O.from_hex('04358394') function HDW.isPublic(version) return version == HDW.MAINPK or version == HDW.TESTPK end function HDW.getPublic(extkey) if not extkey.public then extkey.public = ECDH.sk_to_pubc(extkey.secret) end assert(extkey.public ~= nil) return extkey.public end function HDW.format_extkey(extkey, version) local data = O.new() assert(version == HDW.MAINPK or version == HDW.MAINSK or version == HDW.TESTPK or version == HDW.TESTSKK, "Unknown version", 2) local public = HDW.isPublic(version) data = data .. version data = data .. O.from_hex(string.format("%02x", extkey.level)) data = data .. BIG.new(extkey.fingerprint_parent):fixed(4) data = data .. BIG.new(extkey.child_number):fixed(4) data = data .. extkey.chain_code if public then data = data .. HDW.getPublic(extkey) else assert(extkey.secret, "From a public key it is not possible to print a private key") data = data .. O.from_hex('00') .. extkey.secret end local check = HASH.dsha256(data):sub(1,4) data = data .. check return data:base58() end -- Child key derivation private key -- @param parent_key extended key object -- @param i index function HDW.ckd_priv(parent_key, i) local newkey = {} local l local s512 = HASH.new('sha512') local pk -- check validity of index assert(i <= BIG.new(O.from_hex('ffffffff')), "Invalid index") -- we cannot derive a private key from a public key assert(parent_key.secret, "Cannot derive a private key from a public key") newkey.child_number = i local i_oct = i:octet() if #i_oct < 4 then i_oct = O.zero(4 - #i_oct) .. i_oct end if i >= BIG.new(O.from_hex('80000000')) then l = O.zero(1) .. parent_key.secret .. i_oct; else pk = HDW.getPublic(parent_key) l = pk .. i_oct; end l = HASH.hmac(s512, parent_key.chain_code, l) lL = BIG.new(l:sub( 1,32)) lR = l:sub(33,64) -- On BIP32 there is a mod, if I add it, it doesn't work -- TODO improve arithmetics modulo order of curve secp256k1 newkey.secret = ((lL + BIG.new(parent_key.secret)) % (BIG.new(O.from_hex('FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141')))):octet() -- check if lR >= order curve, in that case return ckd_priv(parent_key, i+1) if newkey.secret == INT.new(0) then return ckd_priv(parent_key, i+1) end -- compute fingerprint -- parent_key is a private key pk = HDW.getPublic(parent_key) newkey.fingerprint_parent = HASH.hash160(pk):sub(1,4) newkey.chain_code = lR newkey.level = parent_key.level + 1 return newkey end -- the "neutered" version, as it removes the ability to sign transactions function HDW.neutered(parent_key) local newkey = {} for k, v in pairs(parent_key) do newkey[k] = v end HDW.getPublic(newkey) newkey.secret = nil return newkey end -- Child key derivation public key -- @param parent_key extended key object -- @param i it is only defined for non-hardened child keys (i <= 0x80000000) function HDW.ckd_pub(parent_key, i) local newkey = {} local l, lR, lL local s512 = HASH.new('sha512') -- check validity of index --assert(i <= BIG.new(O.from_hex('ffffffff')), "Invalid index") assert(i < BIG.new(O.from_hex('80000000')), "Public key derivation is only defined for non-hardened child keys") if parent_key.secret then newkey = HDW.neutered(HDW.ckd_priv(parent_key, i)) else pk = HDW.getPublic(parent_key) newkey.child_number = i l = parent_key.public .. i:fixed(4) l = HASH.hmac(s512, parent_key.chain_code, l) lL = BIG.new(l:sub( 1,32)) lR = l:sub(33,64) local nG = ECDH.pubgen(lL) -- = n * G newkey.public = ECDH.compress_public_key(ECDH.add(nG, parent_key.public)) -- check if lR >= order curve, in that case return ckd_priv(parent_key, i+1) if newkey.secret == INT.new(0) then return ckd_priv(parent_key, i+1) end newkey.fingerprint_parent = HASH.hash160(pk):sub(1,4) newkey.chain_code = lR newkey.level = parent_key.level + 1 end return newkey end function HDW.master_key_generation(seed) if not seed then seed = O.random(32) end local s512 = HASH.new('sha512') local l = HASH.hmac(s512, O.from_string('Bitcoin seed'), seed) local lL = l:sub( 1,32) -- check Ll < order of the curve local lR = l:sub(33,64) return { secret = lL, chain_code = lR, level = 0, fingerprint_parent = O.from_hex('00000000'), child_number = O.from_hex('00000000'), } end -- Implements the default wallet layout -- only external keys are supported -- @param parent_key parent private key -- @param i bignum i >= 0 and i <= 80000000 -- @param wallet bignum or the string '' (the dafult wallet), optional -- @param nohardened by default child keys are hardened (if there is not the parameter -- nohardned = nil which is the same as false) function HDW.standard_child(parent_key, i, wallet, nohardened) local HARDNED = BIG.new(O.from_hex('80000000')) assert(i < HARDNED) if not nohardened then i = i + HARDNED end if not wallet or wallet=='' then wallet = INT.new(0) end assert(wallet < HARDNED) wallet_key = HDW.ckd_priv(parent_key, wallet+HARDNED) external_key = HDW.ckd_priv(wallet_key, INT.new(0)) address_key = HDW.ckd_priv(external_key, i) return address_key end function HDW.mnemonic_master_key(mnemonic, password) return HDW.master_key_generation(HASH.mnemonic_seed(mnemonic, password)) end return HDW $--[[ --This file is part of zenroom -- --Copyright (C) 2018-2022 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 27th November 2021 --]] local stats = require('stats') -- array operations local function check_container(name) ZEN.assert(ACK[name], "Invalid container, not found: "..name) ZEN.assert(luatype(ACK[name]) == 'table', "Invalid container, not a table: "..name) if ZEN.CODEC[name] then ZEN.assert(ZEN.CODEC[name].zentype ~= 'element', "Invalid container: "..name.." is a "..ZEN.CODEC[name].zentype) else xxx("Object has no CODEC registration: "..name) end end local function check_element(name) local o = ACK[name] ZEN.assert(o, "Invalid element, not found: "..name) ZEN.assert(iszen(type(o)), "Invalid element, not a zenroom object: "..name.." ("..type(o)..")") if ZEN.CODEC[name] then ZEN.assert(ZEN.CODEC[name].zentype == 'element', "Invalid element: "..name.." is a "..ZEN.CODEC[name].zentype) else xxx("Object has no CODEC registration: "..name) end return o end local function _when_remove_dictionary(ele, from) -- ele is just the name (key) of object to remove local dict = have(from) ZEN.assert(dict, "Dictionary not found: "..from) if dict[ele] then ACK[from][ele] = nil -- remove from dictionary elseif ZEN.CODEC[ele].name ~= ele and dict[ZEN.CODEC[ele].name] then -- it may be a copy or random object with different name ACK[from][ZEN.CODEC[ele].name] = nil else error("Object not found in dictionary: "..ele.." in "..from) end end local function _when_remove_array(ele, from) local obj = have(ele) local arr = have(from) local found = false local newdest = { } for k,v in next,arr,nil do if not (v == obj) then table.insert(newdest,v) else found = true end end ZEN.assert(found, "Element to be removed not found in array") ACK[from] = newdest end When("remove the '' from ''", function(ele,from) local codec = ZEN.CODEC[from] ZEN.assert(codec, "No codec registration for target: "..from) if codec.zentype == 'dictionary' or codec.zentype == 'schema' then _when_remove_dictionary(ele, from) elseif codec.zentype == 'array' then _when_remove_array(ele, from) else I.warn({ CODEC = codec}) error("Invalid codec registration for target: "..from) end end) When("create the new array", function() ACK.new_array = { } new_codec('new array', {zentype='array', luatype='table'}) end) When("create the length of ''", function(arr) local obj = have(arr) ACK.length = #obj new_codec('length', {luatype='number',zentype='element'}) end) When("create the size of ''", function(arr) local obj = have(arr) ACK.size = #obj new_codec('size', {zentype='element',luatype='number'}) end) When("create the copy of element '' in array ''", function(pos, arr) ZEN.assert(ACK[arr], "No array found in: "..arr) ZEN.assert(isarray(ACK[arr]), "Not an array: "..arr) local num = tonumber(pos) ZEN.assert(num, "Argument is not a position number: "..pos) ZEN.assert(ACK[arr][num], "No element found in: "..arr.."["..pos.."]") ACK.copy = ACK[arr][num] -- TODO: support nested arrays or dictionaries new_codec('copy',{zentype='element',luatype=luatype(ACK.copy)},arr) end) When("insert string '' in ''", function(st, dest) local d = have(dest) ZEN.assert(luatype(d) == 'table', "Invalid destination, not a table: "..dest) ZEN.assert(ZEN.CODEC[dest].zentype == 'array', "Invalid destination, not an array: "..dest) table.insert(ACK[dest], O.from_string(st)) end) When("insert '' in ''", function(ele, dest) local d = have(dest) local e = have(ele) ZEN.assert(luatype(d) == 'table', "Invalid destination, not a table: "..dest) ZEN.assert(ZEN.CODEC[dest].zentype ~= 'element', "Invalid destination, not a container: "..dest) if ZEN.CODEC[dest].zentype == 'array' then table.insert(ACK[dest], e) elseif ZEN.CODEC[dest].zentype == 'dictionary' then ACK[dest][ele] = e elseif ZEN.CODEC[dest].zentype == 'schema' then ACK[dest][ele] = e else ZEN.assert(false, "Invalid destination type: " ..ZEN.CODEC[dest].zentype) end ZEN.CODEC[dest][ele] = ZEN.CODEC[ele] ACK[ele] = nil ZEN.CODEC[ele] = nil end) -- When("insert the '' in ''", function(ele,arr) -- ZEN.assert(ACK[ele], "Element not found: "..ele) -- ZEN.assert(ACK[arr], "Array not found: "..arr) -- ZEN.assert(ZEN.CODEC[arr].zentype == 'array', -- "Object is not an array: "..arr) -- table.insert(ACK[arr], ACK[ele]) -- end) IfWhen("the '' is not found in ''", function(ele, arr) local obj = ACK[ele] ZEN.assert(obj, "Element not found: "..ele) ZEN.assert(ACK[arr], "Array not found: "..arr) if ZEN.CODEC[arr].zentype == 'array' then for k,v in pairs(ACK[arr]) do ZEN.assert(v ~= obj, "Element '"..ele.."' is contained inside: "..arr) end elseif ZEN.CODEC[arr].zentype == 'dictionary' then for k,v in pairs(ACK[arr]) do local val = k if luatype(k) == 'string' then val = O.from_string(k) end ZEN.assert(val ~= obj, "Element '"..ele.."' is contained inside: "..arr) end else ZEN.assert(false, "Invalid container type: "..arr.." is "..ZEN.CODEC[arr].zentype) end end) IfWhen("the '' is found in ''", function(ele, arr) local obj = ACK[ele] ZEN.assert(obj, "Element not found: "..ele) ZEN.assert(ACK[arr], "Array not found: "..arr) local found = false if ZEN.CODEC[arr].zentype == 'array' then for k,v in pairs(ACK[arr]) do if v == obj then found = true end end elseif ZEN.CODEC[arr].zentype == 'dictionary' then for k,v in pairs(ACK[arr]) do local val = k if luatype(k) == 'string' then val = O.from_string(k) end if val == obj then found = true end end else ZEN.assert(false, "Invalid container type: "..arr.." is "..ZEN.CODEC[arr].zentype) end ZEN.assert(found, "The content of element '"..ele.."' is not found inside: "..arr) end) IfWhen("the '' is found in '' at least '' times", function(ele, arr, times) local obj = have(ele) ZEN.assert( luatype(obj) ~= 'table', "Invalid use of table in object comparison: "..ele) local num = have(times) ZEN.assert( luatype(num) == 'number', "Not a number: "..times) local list = have(arr) ZEN.assert( luatype(list) == 'table', "Not a table: "..arr) ZEN.assert( isarray(list), "Not an array: "..arr) local found = 0 for _,v in pairs(list) do if v == obj then found = found + 1 end end ZEN.assert(found >= num, "Object "..ele.." found only "..found.." times instead of "..num.." in array "..arr) end) local function _aggr_array(arr) local A = have(arr) local codec = ZEN.CODEC[arr] ZEN.assert(codec.zentype == 'array' or (codec.zentype == 'schema' and codec.encoding == 'array'), "Object is not a valid array: "..arr) local count = isarray(A) ZEN.assert( count > 0, "Array is empty or invalid: "..arr) local res, par if luatype(A[1]) == 'number' then res = 0 for k,v in next,A,nil do res = res + tonumber(v) end par = {encoding='number',zentype='element'} elseif type(A[1]) == 'zenroom.big' then res = BIG.new(0) for k,v in next,A,nil do res = res + v end par = {zentype = 'element'} elseif type(A[1]) == 'zenroom.ecp' then res = ECP.generator() for k,v in next,A,nil do res = res + v end par = {zentype = 'element'} elseif type(A[1]) == 'zenroom.ecp2' then res = ECP2.generator() for k,v in next,A,nil do res = res + v end par = {zentype = 'element'} else error("Unknown aggregation for type: "..type(A[1])) end return res, par end When("create the aggregation of array ''", function(arr) empty'aggregation' local params ACK.aggregation, params = _aggr_array(arr) new_codec('aggregation', params) end) When("create the sum value of elements in array ''", function(arr) empty'sum value' local params ACK.sum_value, params = _aggr_array(arr) new_codec('sum value', params) end) When("create the average of elements in array ''", function(arr) empty'average' local data = have(arr) ACK.average = O.from_string(stats.average(data):decimal()) new_codec('average', { encoding="string" }) end) When("create the variance of elements in array ''", function(arr) empty'variance' local data = have(arr) ACK.variance = O.from_string(stats.variance(data):decimal()) new_codec('variance', { encoding="string" }) end) When("create the standard deviation of elements in array ''", function(arr) empty'standard_deviation' local data = have(arr) ACK.standard_deviation = O.from_string(stats.standardDeviation(data):decimal()) new_codec('standard_deviation', { encoding="string" }) end) 8-- Concise Binary Object Representation (CBOR) -- RFC 7049 -- local function softreq(pkg, field) -- -- local ok, mod = pcall(require, pkg); -- -- if not ok then return end -- if field then return [field]; end -- return mod; -- end -- local dostring = function (s) -- local ok, f = pcall(loadstring or load, s); -- luacheck: read globals loadstring -- if ok and f then return f(); end -- end local setmetatable = setmetatable; local getmetatable = getmetatable; local dbg_getmetatable = debug.getmetatable; local assert = assert; local error = error; local type = type; local pairs = pairs; local ipairs = ipairs; local tostring = tostring; local s_char = string.char; local t_concat = table.concat; local t_sort = table.sort; local m_floor = math.floor; local m_abs = math.abs; local m_huge = math.huge; local m_max = math.max; local maxint = math.maxinteger or 9007199254740992; local minint = math.mininteger or -9007199254740992; local NaN = 0/0; local m_frexp = math.frexp; local m_ldexp = math.ldexp or function (x, exp) return x * 2.0 ^ exp; end; local m_type = math.type or function (n) return n % 1 == 0 and n <= maxint and n >= minint and "integer" or "float" end; local s_pack = string.pack -- or softreq("struct", "pack"); local s_unpack = string.unpack -- or softreq("struct", "unpack"); local b_rshift = bit32.rshift -- softreq("bit32", "rshift") or softreq("bit", "rshift") or -- dostring "return function(a,b) return a >> b end" or -- function (a, b) return m_max(0, m_floor(a / (2 ^ b))); end; -- sanity check if s_pack and s_pack(">I2", 0) ~= "\0\0" then s_pack = nil; end if s_unpack and s_unpack(">I2", "\1\2\3\4") ~= 0x102 then s_unpack = nil; end local encoder = {}; local function encode(obj, opts) return encoder[type(obj)](obj, opts); end -- Major types 0, 1 and length encoding for others local function integer(num, m) if m == 0 and num < 0 then -- negative integer, major type 1 num, m = - num - 1, 32; end if num < 24 then return s_char(m + num); elseif num < 2 ^ 8 then return s_char(m + 24, num); elseif num < 2 ^ 16 then return s_char(m + 25, b_rshift(num, 8), num % 0x100); elseif num < 2 ^ 32 then return s_char(m + 26, b_rshift(num, 24) % 0x100, b_rshift(num, 16) % 0x100, b_rshift(num, 8) % 0x100, num % 0x100); elseif num < 2 ^ 64 then local high = m_floor(num / 2 ^ 32); num = num % 2 ^ 32; return s_char(m + 27, b_rshift(high, 24) % 0x100, b_rshift(high, 16) % 0x100, b_rshift(high, 8) % 0x100, high % 0x100, b_rshift(num, 24) % 0x100, b_rshift(num, 16) % 0x100, b_rshift(num, 8) % 0x100, num % 0x100); end error "int too large"; end if s_pack then function integer(num, m) local fmt; m = m or 0; if num < 24 then fmt, m = ">B", m + num; elseif num < 256 then fmt, m = ">BB", m + 24; elseif num < 65536 then fmt, m = ">BI2", m + 25; elseif num < 4294967296 then fmt, m = ">BI4", m + 26; else fmt, m = ">BI8", m + 27; end return s_pack(fmt, m, num); end end local simple_mt = {}; function simple_mt:__tostring() return self.name or ("simple(%d)"):format(self.value); end function simple_mt:__tocbor() return self.cbor or integer(self.value, 224); end local function simple(value, name, cbor) assert(value >= 0 and value <= 255, "bad argument #1 to 'simple' (integer in range 0..255 expected)"); return setmetatable({ value = value, name = name, cbor = cbor }, simple_mt); end local tagged_mt = {}; function tagged_mt:__tostring() return ("%d(%s)"):format(self.tag, tostring(self.value)); end function tagged_mt:__tocbor() return integer(self.tag, 192) .. encode(self.value); end local function tagged(tag, value) assert(tag >= 0, "bad argument #1 to 'tagged' (positive integer expected)"); return setmetatable({ tag = tag, value = value }, tagged_mt); end local null = simple(22, "null"); -- explicit null local undefined = simple(23, "undefined"); -- undefined or nil local BREAK = simple(31, "break", "\255"); -- Number types dispatch function encoder.number(num) return encoder[m_type(num)](num); end -- Major types 0, 1 function encoder.integer(num) if num < 0 then return integer(-1 - num, 32); end return integer(num, 0); end -- Major type 7 function encoder.float(num) if num ~= num then -- NaN shortcut return "\251\127\255\255\255\255\255\255\255"; end local sign = (num > 0 or 1 / num > 0) and 0 or 1; num = m_abs(num) if num == m_huge then return s_char(251, sign * 128 + 128 - 1) .. "\240\0\0\0\0\0\0"; end local fraction, exponent = m_frexp(num) if fraction == 0 then return s_char(251, sign * 128) .. "\0\0\0\0\0\0\0"; end fraction = fraction * 2; exponent = exponent + 1024 - 2; if exponent <= 0 then fraction = fraction * 2 ^ (exponent - 1) exponent = 0; else fraction = fraction - 1; end return s_char(251, sign * 2 ^ 7 + m_floor(exponent / 2 ^ 4) % 2 ^ 7, exponent % 2 ^ 4 * 2 ^ 4 + m_floor(fraction * 2 ^ 4 % 0x100), m_floor(fraction * 2 ^ 12 % 0x100), m_floor(fraction * 2 ^ 20 % 0x100), m_floor(fraction * 2 ^ 28 % 0x100), m_floor(fraction * 2 ^ 36 % 0x100), m_floor(fraction * 2 ^ 44 % 0x100), m_floor(fraction * 2 ^ 52 % 0x100) ) end if s_pack then function encoder.float(num) return s_pack(">Bd", 251, num); end end -- Major type 2 - byte strings function encoder.bytestring(s) return integer(#s, 64) .. s; end -- Major type 3 - UTF-8 strings function encoder.utf8string(s) return integer(#s, 96) .. s; end -- Lua strings are byte strings encoder.string = encoder.bytestring; function encoder.boolean(bool) return bool and "\245" or "\244"; end encoder["nil"] = function() return "\246"; end function encoder.userdata(ud, opts) local mt = dbg_getmetatable(ud); if mt then local encode_ud = opts and opts[mt] or mt.__tocbor; if encode_ud then return encode_ud(ud, opts); end end error "can't encode userdata"; end function encoder.table(t, opts) local mt = getmetatable(t); if mt then local encode_t = opts and opts[mt] or mt.__tocbor; if encode_t then return encode_t(t, opts); end end -- the table is encoded as an array iff when we iterate over it, -- we see successive integer keys starting from 1. The lua -- language doesn't actually guarantee that this will be the case -- when we iterate over a table with successive integer keys, but -- due an implementation detail in PUC Rio Lua, this is what we -- usually observe. See the Lua manual regarding the # (length) -- operator. In the case that this does not happen, we will fall -- back to a map with integer keys, which becomes a bit larger. local array, map, i, p = { integer(#t, 128) }, { "\191" }, 1, 2; local is_array = true; for k, v in pairs(t) do is_array = is_array and i == k; i = i + 1; local encoded_v = encode(v, opts); array[i] = encoded_v; map[p], p = encode(k, opts), p + 1; map[p], p = encoded_v, p + 1; end -- map[p] = "\255"; map[1] = integer(i - 1, 160); return t_concat(is_array and array or map); end -- Array or dict-only encoders, which can be set as __tocbor metamethod function encoder.array(t, opts) local array = { }; for i, v in ipairs(t) do array[i] = encode(v, opts); end return integer(#array, 128) .. t_concat(array); end function encoder.map(t, opts) local map, p, len = { "\191" }, 2, 0; for k, v in pairs(t) do map[p], p = encode(k, opts), p + 1; map[p], p = encode(v, opts), p + 1; len = len + 1; end -- map[p] = "\255"; map[1] = integer(len, 160); return t_concat(map); end encoder.dict = encoder.map; -- COMPAT function encoder.ordered_map(t, opts) local map = {}; if not t[1] then -- no predefined order local i = 0; for k in pairs(t) do i = i + 1; map[i] = k; end t_sort(map); end for i, k in ipairs(t[1] and t or map) do map[i] = encode(k, opts) .. encode(t[k], opts); end return integer(#map, 160) .. t_concat(map); end -- stringify the function hex address encoder['function'] = function(f) local val = strtok(tostring(f))[2] return integer(#val, 64) .. val end -- Decoder -- Reads from a file-handle like object local function read_bytes(fh, len) return fh:read(len); end local function read_byte(fh) return fh:read(1):byte(); end local function read_length(fh, mintyp) if mintyp < 24 then return mintyp; elseif mintyp < 28 then local out = 0; for _ = 1, 2 ^ (mintyp - 24) do out = out * 256 + read_byte(fh); end return out; else error "invalid length"; end end local decoder = {}; local function read_type(fh) local byte = read_byte(fh); return b_rshift(byte, 5), byte % 32; end local function read_object(fh, opts) local typ, mintyp = read_type(fh); return decoder[typ](fh, mintyp, opts); end local function read_integer(fh, mintyp) return read_length(fh, mintyp); end local function read_negative_integer(fh, mintyp) return -1 - read_length(fh, mintyp); end local function read_string(fh, mintyp) if mintyp ~= 31 then return read_bytes(fh, read_length(fh, mintyp)); end local out = {}; local i = 1; local v = read_object(fh); while v ~= BREAK do out[i], i = v, i + 1; v = read_object(fh); end return t_concat(out); end local function read_unicode_string(fh, mintyp) return read_string(fh, mintyp); -- local str = read_string(fh, mintyp); -- if have_utf8 and not utf8.len(str) then -- TODO How to handle this? -- end -- return str; end local function read_array(fh, mintyp, opts) local out = {}; if mintyp == 31 then local i = 1; local v = read_object(fh, opts); while v ~= BREAK do out[i], i = v, i + 1; v = read_object(fh, opts); end else local len = read_length(fh, mintyp); for i = 1, len do out[i] = read_object(fh, opts); end end return out; end local function read_map(fh, mintyp, opts) local out = {}; local k; if mintyp == 31 then local i = 1; k = read_object(fh, opts); while k ~= BREAK do out[k], i = read_object(fh, opts), i + 1; k = read_object(fh, opts); end else local len = read_length(fh, mintyp); for _ = 1, len do k = read_object(fh, opts); out[k] = read_object(fh, opts); end end return out; end local tagged_decoders = {}; local function read_semantic(fh, mintyp, opts) local tag = read_length(fh, mintyp); local value = read_object(fh, opts); local postproc = opts and opts[tag] or tagged_decoders[tag]; if postproc then return postproc(value); end return tagged(tag, value); end local function read_half_float(fh) local exponent = read_byte(fh); local fraction = read_byte(fh); local sign = exponent < 128 and 1 or -1; -- sign is highest bit fraction = fraction + (exponent * 256) % 1024; -- copy two(?) bits from exponent to fraction exponent = b_rshift(exponent, 2) % 32; -- remove sign bit and two low bits from fraction; if exponent == 0 then return sign * m_ldexp(fraction, -24); elseif exponent ~= 31 then return sign * m_ldexp(fraction + 1024, exponent - 25); elseif fraction == 0 then return sign * m_huge; else return NaN; end end local function read_float(fh) local exponent = read_byte(fh); local fraction = read_byte(fh); local sign = exponent < 128 and 1 or -1; -- sign is highest bit exponent = exponent * 2 % 256 + b_rshift(fraction, 7); fraction = fraction % 128; fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); if exponent == 0 then return sign * m_ldexp(exponent, -149); elseif exponent ~= 0xff then return sign * m_ldexp(fraction + 2 ^ 23, exponent - 150); elseif fraction == 0 then return sign * m_huge; else return NaN; end end local function read_double(fh) local exponent = read_byte(fh); local fraction = read_byte(fh); local sign = exponent < 128 and 1 or -1; -- sign is highest bit exponent = exponent % 128 * 16 + b_rshift(fraction, 4); fraction = fraction % 16; fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); fraction = fraction * 256 + read_byte(fh); if exponent == 0 then return sign * m_ldexp(exponent, -149); elseif exponent ~= 0xff then return sign * m_ldexp(fraction + 2 ^ 52, exponent - 1075); elseif fraction == 0 then return sign * m_huge; else return NaN; end end if s_unpack then function read_float(fh) return s_unpack(">f", read_bytes(fh, 4)) end function read_double(fh) return s_unpack(">d", read_bytes(fh, 8)) end end local function read_simple(fh, value, opts) if value == 24 then value = read_byte(fh); end if value == 20 then return false; elseif value == 21 then return true; elseif value == 22 then return null; elseif value == 23 then return undefined; elseif value == 25 then return read_half_float(fh); elseif value == 26 then return read_float(fh); elseif value == 27 then return read_double(fh); elseif value == 31 then return BREAK; end if opts and opts.simple then return opts.simple(value); end return simple(value); end decoder[0] = read_integer; decoder[1] = read_negative_integer; decoder[2] = read_string; decoder[3] = read_unicode_string; decoder[4] = read_array; decoder[5] = read_map; decoder[6] = read_semantic; decoder[7] = read_simple; -- opts.more(n) -> want more data -- opts.simple -> decode simple value -- opts[int] -> tagged decoder local function decode(s, opts) local fh = {}; local pos = 1; local more; if type(opts) == "function" then more = opts; elseif type(opts) == "table" then more = opts.more; elseif opts ~= nil then error(("bad argument #2 to 'decode' (function or table expected, got %s)"):format(type(opts))); end if type(more) ~= "function" then function more() error "input too short"; end end function fh:read(bytes) local ret = s:sub(pos, pos + bytes - 1); if #ret < bytes then ret = more(bytes - #ret, fh, opts); if ret then self:write(ret); end return self:read(bytes); end pos = pos + bytes; return ret; end function fh:write(bytes) -- luacheck: no self s = s .. bytes; if pos > 256 then s = s:sub(pos + 1); pos = 1; end return #bytes; end return read_object(fh, opts); end return { -- en-/decoder functions raw_encode = encode; raw_decode = decode; -- tables of per-type en-/decoders type_encoders = encoder; type_decoders = decoder; -- special treatment for tagged values tagged_decoders = tagged_decoders; -- constructors for annotated types simple = simple; tagged = tagged; -- pre-defined simple values null = null; undefined = undefined; }; $--[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Wednesday, 6th October 2021 --]] -- this is a map reduce function processing a single argument as -- values found, it uses function pointers and conditions from the -- params structure. -- param.target = key name of the value to find -- param.op = single argument function to run on found value -- param.cmp = dual argument comparison for dictionary eligibility -- param.conditions = k/v list of elements to compare in dictionary local function dicts_reduce(dicts, params) local found local arr for ak,av in pairs(dicts) do if luatype(av) == 'table' then found = false -- apply params filters, boolean just check key presence if params.conditions and params.cmp then for pk,pv in pairs(params.conditions) do local tv = av[pk] if tv then if params.cmp(tv, pv) then found = true end end end else found = true end -- no filters, apply everywhere -- apply sum of selected key/value if found then for k,v in pairs(av) do if k == params.target then params.op(v) end end end end -- av is a table end end When("create the new dictionary", function() empty'new dictionary' ACK.new_dictionary = { } new_codec('new dictionary', { zentype = 'dictionary' }) end) When("create the new dictionary named ''", function(name) empty(name) ACK[name] = { } new_codec(name, { zentype = 'dictionary' }) end) When("create the array of elements named '' for dictionaries in ''", function(name, dict) empty'array' local src = have(dict) ZEN.assert(luatype(src)=='table', "Object is not a table: "..dict) local res = { } for k, v in pairs(src) do if k == name then table.insert(res, v) end -- dict is most oftern an array of dictionaries for kk, vv in pairs(v) do if kk == name then table.insert(res, vv) end end end ACK.array = res new_codec('array', {luatype='table',zentype='array'}, dict) end) When("create the pruned dictionary of ''", function(dict) empty'pruned dictionary' local d = have(dict) ZEN.assert(luatype(d) == 'table', 'Object is not a table: '..dict) ACK.pruned_dictionary = prune(d) new_codec('pruned dictionary', nil, dict) end) When("find the max value '' for dictionaries in ''", function(name, arr) ZEN.assert(luatype(have(arr)) == 'table', 'Object is not a table: '..arr) empty'max value' local max = 0 local params = { target = name, op = function(v) if max < v then max = v end end } dicts_reduce(ACK[arr],params) -- optimization? operate directly on ACK ZEN.assert(max, "No max value "..name.." found across dictionaries in"..arr) ACK.max_value = max new_codec('max value', { zentype = 'element', -- introduce scalar? luatype = 'number' }, arr) -- clone array's encoding end) When("find the min value '' for dictionaries in ''", function(name, arr) ZEN.assert(luatype(have(arr)) == 'table', 'Object is not a table: '..arr) empty'min value' local min -- init min with any value for k,v in pairs(ACK[arr]) do min = v[name] -- suppose existance of key break end local params = { target = name, op = function(v) if v < min then min = v end end } dicts_reduce(ACK[arr],params) ACK.min_value = min new_codec('min value', { zentype = 'element', -- introduce scalar? luatype = 'number' }, arr) -- clone array's encoding end) When("create the sum value '' for dictionaries in ''", function(name,arr) ZEN.assert(luatype(have(arr)) == 'table', 'Object is not a table: '..arr) empty'sum value' local sum -- result of reduction local params = { target = name, op = function(v) if not sum then sum = v else sum = sum + v end end } dicts_reduce(ACK[arr], params) ZEN.assert(sum, "No sum of value "..name .." found across dictionaries in "..arr) ACK.sum_value = sum new_codec('sum value', { zentype = type(sum), -- introduce scalar? }) -- clone array's encoding end) When("create the sum value '' for dictionaries in '' where '' > ''", function(name,arr, left, right) ZEN.assert(luatype(have(arr)) == 'table', 'Object is not a table: '..arr) have(right) empty'sum value' local sum = 0 -- result of reduction local params = { target = name, conditions = { }, cmp = function(l,r) return l > r end, op = function(v) sum = sum + v end } params.conditions[left] = ACK[right] -- used in cmp dicts_reduce(ACK[arr], params) ZEN.assert(sum, "No sum of value "..name .." found across dictionaries in"..arr) ACK.sum_value = sum new_codec('sum value', { zentype = 'element', -- introduce scalar? luatype = 'number' }, arr) -- clone array's encoding end) When("find the '' for dictionaries in '' where '' = ''",function(name, arr, left, right) ZEN.assert(luatype(have(arr)) == 'table', 'Object is not a table: '..arr) have(right) empty(name) local val = { } local params = { target = name, conditions = { }, cmp = function(l,r) return l == r end, op = function(v) table.insert(val, v) end } params.conditions[left] = ACK[right] dicts_reduce(ACK[arr], params) ZEN.assert(val, "No value found "..name.." across dictionaries in "..arr) if #val == 1 then ACK[name] = val[1] new_codec(name, { luatype = luatype(ACK[name]), zentype = 'element' }, arr) else ACK[name] = val new_codec(name, { luatype = 'table', zentype = 'array' }, arr) end end) local function create_copy_f(root, in1, in2) local r = have(root) empty'copy' ZEN.assert(luatype(r) == 'table', "Object is not a table:"..root) ZEN.assert(in1, "Undefined key or index: "..in1.." in "..root) local res if tonumber(in1) then ZEN.assert(isarray(r), "Invalid index "..in1.." as object is not an array: "..root) else ZEN.assert(isdictionary(r), "Invalid key "..in1.." as object is not a dictionary:"..root) end ACK.copy = r[in1] ZEN.assert(ACK.copy, "Member not found: "..in1.." in "..root) if in2 then if tonumber(in2) then ZEN.assert(isarray(ACK.copy), "Invalid index "..in2.." as object is not an array: "..in1.." in "..root) else ZEN.assert(isdictionary(ACK.copy), "Invalid key "..in2.." as object is not a dictionary:"..in1.." in "..root) end ACK.copy = ACK.copy[in2] ZEN.assert(ACK.copy, "Member not found: "..in2.." in "..in1.." in "..root) end new_codec('copy', { luatype = luatype(ACK.copy) }, root) if ZEN.CODEC.copy.luatype == 'table' then if isdictionary(ACK.copy) then ZEN.CODEC.copy.zentype = 'dictionary' elseif isarray(ACK.copy) then ZEN.CODEC.copy.zentype = 'array' else ZEN.assert(false, "Unknown zentype for lua table element: "..dict.."."..name) end else ZEN.CODEC.copy.zentype = 'element' end end When("create the copy of '' from dictionary ''", function(name, dict) create_copy_f(dict, name) end) When("create the copy of '' from ''", function(name, dict) create_copy_f(dict, name) end) When("create the copy of '' in ''", function(name, dict) create_copy_f(dict, name) end) When("create the copy of '' in '' in ''", function(obj, branch, root) create_copy_f(root, branch, obj) end) When("create the copy of object named by '' from dictionary ''", function(name, dict) local label = have(name) create_copy_f(dict, label:string()) end) When("for each dictionary in '' append '' to ''", function(arr, right, left) local dicts = have(arr) ZEN.assert(luatype(dicts) == 'table', 'Object is not a table: '..arr) for kk,vv in pairs(dicts) do local l, r for k,v in pairs(vv) do if k == right then r = v end if k == left then l = v end end ZEN.assert(l, "Object not found: "..kk.."."..left) ZEN.assert(r, "Object not found: "..kk.."."..right) vv[left] = l..r end end) When("move '' in ''", function(src, dict) local s = have(src) local d = have(dict) ZEN.assert(luatype(d) == 'table', "Object is not a table: "..dict) ZEN.assert(ZEN.CODEC[dict].zentype == 'dictionary' or ZEN.CODEC[dict].zentype == 'schema', "Object is not a schema or dictionary: "..dict) d[src] = s ACK[src] = nil end) When("filter '' fields from ''", function(filters, target) local t = have(target) ZEN.assert(isdictionary(target), "Object is not a dictionary: "..target) local f = have(filters) ZEN.assert(isarray(filters), "Object is not an array: "..filters) if isarray(t) then -- array of dictionaries for ak,av in pairs(t) do for k,_ in pairs(av) do keep = false for _, fv in pairs(f) do if fv:str() == k then keep = true end end if not keep then t[ak][k] = nil end end end else for k,_ in pairs(t) do for _, fv in pairs(f) do if k ~= fv then t[k] = nil end end end end end) H--[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --]] local btc = {} -- A bitcoin address is unique given the public key -- address = RIPEMD160(SHA256(public_key)) -- the composition of RIPEMD160 and SHA256 is known as HASH160 function btc.address_from_public_key(public_key) return HASH.hash160(public_key) end -- The user knows his private key in the WIF format (base58) -- This function compute the bytes of the private key (an octet) -- from the WIF format -- @param wif Private key in WIF format -- @return Private key octet function btc.wif_to_sk(wif) if not type(wif) == 'zenroom.octet' then error("invalid bitcoin key type, not an octet: "..type(wif), 3) end local len = #wif if not (len == 32+6) then error("Invalid bitcoin key, wrong WIF size: "..len.." bytes", 3) end local ver = wif:chop(1):hex() if not(ver == 'ef' or ver == '80') then error("Invalid bitcoin key version: "..ver, 3) end local compress = wif:sub(34,34):hex() if not(compress == '01') then error("Invalid bitcoin key compression byte: "..wif:sub(len, len):hex(), 3) end local data = wif:sub(1, len-4) local check = HASH.dsha256(data):chop(4) if not(wif:sub(len-3, len) == check) then error("Invalid bitcoin key: checksum mismatch", 3) end return wif:sub(2,len-5) end -- 0x80 = Mainnet -- 0xEF = Testnet function btc.sk_to_wif(sk, vs) local ver if vs == 'testnet' then ver = O.from_hex('EF') else ver = O.from_hex('80') end local res = ver..sk res = res..O.from_hex('01') -- compressed public key res = res..HASH.dsha256(res):chop(4) -- checksum return res end -- variable length encoding for integer based on the -- actual length of the number function btc.encode_compact_size(n) local res, padding, prefix, le -- littleEndian; if type(n) ~= "zenroom.big" then n = INT.new(n) end padding = 0 res = O.new() if n <= INT.new(252) then res = n:octet() else le = n:octet():reverse() prefix = O.new() if n <= INT.new('0xffff') then prefix = O.from_hex('fd') padding = 2 elseif n <= INT.new('0xffffffff') then prefix = O.from_hex('fe') padding = 4 elseif n <= INT.new('0xffffffffffffffff') then prefix = O.from_hex('ff') padding = 8 else padding = #le end res = prefix .. le padding = padding - #le end if padding > 0 then res = res .. O.zero(padding) end return res end local function decode_compact_size_at_index(raw, i) local b1 b1 = tonumber(raw:sub(i,i):hex(), 16) local s, e -- start and end index if b1 < 0xfd then s, e = 1, 1 elseif b1 == 0xfd then s, e = 2, 3 elseif b1 == 0xfe then s, e = 2, 5 else s, e = 2, 9 end return INT.new(raw:sub(i+s-1, i+e-1)), i+e end -- fixed size encoding for integer function btc.to_uint(num, nbytes) if type(num) ~= "zenroom.big" then num = INT.new(num) end num = num:octet():reverse() if #num < nbytes then num = num .. O.zero(nbytes - #num) end return num end -- read little endian number from transaction raw at position i local function read_uint(raw, i, nbytes) return tonumber(raw:sub(i,i+nbytes-1):reverse():hex(), 16), i+nbytes end -- The sender address is not in the raw transaction function btc.decode_raw_transaction(raw, sender_address, amounts_spent) local SCRIPT_SIZE_LIMIT = BIG.from_decimal('10000') local tx local i=1 local scriptBytes tx = {} -- version (little endian) tx.version, i = read_uint(raw, i, 4) assert(tx.version == 1 or tx.version == 2) -- check if this is segwit, BIP 141 segwit = (raw:sub(i, i+1) == O.from_hex('0001')) if segwit then i=i+2 end -- read txin local n_txin n_txin, i = decode_compact_size_at_index(raw, i) tx.txIn = {} for j=1,tonumber(n_txin:octet():hex(), 16),1 do local currIn = {} -- previous output currIn.txid = raw:sub(i, i+32-1):reverse() i=i+32 currIn.vout, i = read_uint(raw, i, 4) currIn.amountSpent = amounts_spent[j] scriptBytes, i = decode_compact_size_at_index(raw, i) assert(scriptBytes < SCRIPT_SIZE_LIMIT) scriptBytes = tonumber(scriptBytes:octet():hex(), 16) if scriptBytes > 0 then -- empty script i = i + scriptBytes end currIn.sequence = raw:sub(i, i+3):reverse() i = i + 4 currIn.address = sender_address table.insert(tx.txIn, currIn) end -- read txout n_txout, i = decode_compact_size_at_index(raw, i) tx.txOut = {} for j=1,tonumber(n_txout:octet():hex(), 16),1 do local currOut = {} currOut.amount = BIG.new(raw:sub(i,i+8-1):reverse()) i=i+8 scriptBytes, i = decode_compact_size_at_index(raw, i) assert(scriptBytes < SCRIPT_SIZE_LIMIT) scriptBytes = tonumber(scriptBytes:octet():hex(), 16) if scriptBytes > 0 then -- decode the script -- the script is 00 ADDRESS_LEN ADDRESS -- test segwit ver 0 script assert(raw:sub(i,i) == O.from_hex('00')) local addressLen = tonumber(raw:sub(i+1,i+1):hex(), 16) assert(2+addressLen == scriptBytes) currOut.address = raw:sub(i+2, i+scriptBytes-1) i = i + scriptBytes end table.insert(tx.txOut, currOut) end -- read witness (if segwit) if segwit then tx.witness = {} for j=1,#tx.txIn,1 do stackSize, i = decode_compact_size_at_index(raw, i) stackSize = tonumber(stackSize:octet():hex(), 16) items = {} for k=1,stackSize,1 do itemBytes, i = decode_compact_size_at_index(raw, i) itemBytes = tonumber(itemBytes:octet():hex(), 16) item = raw:sub(i, i+itemBytes-1) i=i+itemBytes table.insert(items, item) end table.insert(tx.witness, items) end end -- read nlocktime tx.nLockTime, i = read_uint(raw, i, 4) return tx end -- create an octet which is a raw transaction -- works only with Bech32 v0 addresses -- with not coinbase input -- @param tx table which reppresent a transaction -- @return octet raw transaction function btc.build_raw_transaction(tx) local raw, script raw = O.new() sigwit = (tx["witness"] and #tx["witness"]>0) -- version raw = raw .. O.from_hex('02000000') if sigwit then -- marker + flags raw = raw .. O.from_hex('0001') end raw = raw .. btc.encode_compact_size(INT.new(#tx.txIn)) -- txIn for _, v in pairs(tx.txIn) do -- outpoint (hash and index of the transaction) raw = raw .. v.txid:reverse() .. btc.to_uint(v.vout, 4) -- the script depends on the signature script = O.new() raw = raw .. btc.encode_compact_size(#script) .. script -- Sequence number disabled raw = raw .. O.from_hex('ffffffff') end raw = raw .. btc.encode_compact_size(INT.new(#tx.txOut)) -- txOut for k, v in pairs(tx.txOut) do --raw = raw .. btc.to_uint(v.amount, 8) assert(v.address, "Address not found in txout["..k.."]") local amount = O.new(v.amount) raw = raw .. amount:reverse() if #v.amount < 8 then raw = raw .. O.zero(8 - #amount) end -- fixed script to send bitcoins -- OP_DUP OP_HASH160 20byte --script = O.from_hex('76a914') --script = script .. v.address -- OP_EQUALVERIFY OP_CHECKSIG --script = script .. O.from_hex('88ac') -- Bech32 script = O.from_hex('0014') -- readBech32Address(v.address) script = script .. fif(v.address.raw, v.address.raw, v.address) raw = raw .. btc.encode_compact_size(#script) .. script end if sigwit then -- Documentation https://bitcoincore.org/en/segwit_wallet_dev/ -- The documentation talks about "stack items" but it doesn't specify -- which are they, I think that It depends on the type of transaction -- (P2SH or P2PKH) -- The size of witnesses is not necessary because it is equal to the number of -- txin --raw = raw .. btc.encode_compact_size(#tx["witness"]) for _, v in pairs(tx["witness"]) do -- encode all the stack items for the witness raw = raw .. btc.encode_compact_size(#v) for _, s in pairs(v) do raw = raw .. btc.encode_compact_size(#s) raw = raw .. s end end end raw = raw .. O.from_hex('00000000') return raw end local function encode_with_prepend(bytes) if tonumber(bytes:sub(1,1):hex(), 16) >= 0x80 then bytes = O.from_hex('00') .. bytes end return bytes end -- DER is the format used by bitcoin to encode -- ECDSA signatures -- @param sig signature table (with r and s) -- @return octet encoded with DER format function btc.encode_der_signature(sig) local res, tmp; res = O.new() -- r tmp = encode_with_prepend(sig.r) res = res .. O.from_hex('02') .. INT.new(#tmp):octet() .. tmp -- s tmp = encode_with_prepend(sig.s) res = res .. O.from_hex('02') .. INT.new(#tmp):octet() .. tmp res = O.from_hex('30') .. INT.new(#res):octet() .. res return res end local function read_number_from_der(raw, pos) local size assert(raw:sub(pos, pos) == O.from_hex('02')) pos= pos+1 size = tonumber(raw:sub(pos, pos):hex(), 16) pos = pos +1 -- If the first byte is a 0 do not consider it if raw:sub(pos, pos) == O.from_hex('00') then pos = pos +1 size = size -1 end data = raw:sub(pos, pos+size-1) return { data, pos+size } end -- DER is the format used by bitcoin to encode -- ECDSA signatures -- @param raw octet encoded with DER format -- @return signature table (with r and s) function btc.decode_der_signature(raw) local sig, tmp, size; sig = {} assert(raw:chop(1) == O.from_hex('30')) size = tonumber(raw:sub(2,2):hex(), 16) tmp = read_number_from_der(raw, 3) sig.r = tmp[1] tmp = tmp[2] tmp = read_number_from_der(raw, tmp) sig.s = tmp[1] return sig end -- Hash required in the raw transaction (is exposed to be able to use it -- in the tests) local function _hash_prevouts(tx) local raw local H H = HASH.new('sha256') raw = O.new() for _, v in pairs(tx.txIn) do raw = raw .. v.txid:reverse() .. btc.to_uint(v.vout, 4) end return H:process(H:process(raw)) end -- Hash required in the raw transaction (is exposed to be able to use it -- in the tests) local function _hash_sequence(tx) local raw local H local seq H = HASH.new('sha256') raw = O.new() for _, v in pairs(tx.txIn) do seq = v['sequence'] if not seq then -- default value, not enabled seq = O.from_hex('ffffffff') end raw = raw .. btc.to_uint(seq, 4) end return H:process(H:process(raw)) end -- Hash required in the raw transaction (is exposed to be able to use it -- in the tests) local function _hash_outputs(tx) local raw local H H = HASH.new('sha256') raw = O.new() for _, v in pairs(tx.txOut) do amount = O.new(v.amount) raw = raw .. amount:reverse() if #v.amount < 8 then raw = raw .. O.zero(8 - #amount) end -- This is specific to Bech32 addresses, we should be able to verify the kind of address raw = raw .. O.from_hex('160014') .. fif( v.address.raw, v.address.raw, v.address) end return H:process(H:process(raw)) end -- BIP0143 -- Double SHA256 of the serialization of: -- 1. nVersion of the transaction (4-byte little endian) -- 2. hash_prevouts (32-byte hash) -- 3. hash_sequence (32-byte hash) -- 4. outpoint (32-byte hash + 4-byte little endian) -- 5. scriptCode of the input (serialized as scripts inside CTxOuts) -- 6. value of the output spent by this input (8-byte little endian) -- 7. nSequence of the input (4-byte little endian) -- 8. hash_outputs (32-byte hash) -- 9. nLocktime of the transaction (4-byte little endian) -- 10. sighash type of the signature (4-byte little endian) local function build_transaction_to_sign(tx, i) local raw local amount local address = fif(tx.txIn[i].address.raw, tx.txIn[i].address.raw, tx.txIn[i].address) assert(address, "Cannot sign or verify transaction: no address provided") raw = O.new() -- 1. nVersion of the transaction (4-byte little endian) raw = raw .. btc.to_uint(tx.version, 4) -- 2. hash_prevouts (32-byte hash) raw = raw .. _hash_prevouts(tx) -- 3. hash_sequence (32-byte hash) raw = raw .. _hash_sequence(tx) -- 4. outpoint (32-byte hash + 4-byte little endian) raw = raw .. tx.txIn[i].txid:reverse() .. btc.to_uint(tx.txIn[i].vout, 4) -- 5. scriptCode of the input (serialized as scripts inside CTxOuts) raw = raw .. O.from_hex('1976a914') .. address .. O.from_hex('88ac') -- 6. value of the output spent by this input (8-byte little endian) amount = O.new(tx.txIn[i].amountSpent) raw = raw .. amount:reverse() if #amount < 8 then raw = raw .. O.zero(8 - #amount) end -- 7. nSequence of the input (4-byte little endian) raw = raw .. tx.txIn[i].sequence:reverse() -- 8. hash_outputs (32-byte hash) raw = raw .. _hash_outputs(tx) -- 9. nLocktime of the transaction (4-byte little endian) raw = raw .. btc.to_uint(tx.nLockTime, 4) -- 10. sighash type of the signature (4-byte little endian) raw = raw .. btc.to_uint(tx.nHashType, 4) return raw end -- Here I sign the transaction function btc.build_witness(tx, sk) local pk = ECDH.compress_public_key(ECDH.pubgen(sk)) local witness = {} for i=1,#tx.txIn,1 do if tx.txIn[i].sigwit then -- fill address generated from sk if not present in txin local rawTx = build_transaction_to_sign(tx, i) local sigHash = HASH.dsha256(rawTx) local sig = ECDH.sign_ecdh(sk, sigHash) witness[i] = { btc.encode_der_signature(sig) .. O.from_hex('01'), pk } else witness[i] = O.zero(1) end end return witness end function btc.verify_witness(tx) tx.nHashType = O.from_hex('00000001') if tx.witness == nil then return false end for i, v in pairs(tx.witness) do local rawTx = build_transaction_to_sign(tx, i) local sigHash = HASH.dsha256(rawTx) local sig = btc.decode_der_signature(v[1]) if not ECDH.verify_hashed(ECDH.uncompress_public_key(v[2]), sigHash, sig, #sigHash) then return false end end return true end -- Pay attention to the amount, it has to be multiplied for 10^8 -- @param unspent list of unspent transactions -- @param to receiver bitcoin address (must be segwit/Bech32!) -- @param amount satoshi to transfer (BIG integer) -- @param fee satoshi of fee we want to pay -- @return nil if the transaction cannot built -- (for example if there are not enough founds) function btc.build_tx_from_unspent(unspent, to, amount, fee, from) local tx, i, currentAmount tx = { version=2, txIn = {}, txOut = {}, nLockTime=0, nHashType=O.from_hex('00000001') } i=1 currentAmount = INT.new(0) while i <= #unspent and currentAmount < amount+fee do assert(unspent[i].address or from, "No sender address specified") -- amount should be already converted to a zenroom type, if not -- then we assume it is a string value expressed in satoshis local amount = unspent[i].amount if not iszen( type( amount ) ) then amount = BIG.from_decimal( amount ) end currentAmount = currentAmount + amount tx.txIn[i] = { txid = unspent[i].txid, vout = unspent[i].vout, sigwit = O.from_hex('01'), -- this should be true address = unspent[i].address or from, amountSpent = amount, sequence = O.from_hex('ffffffff'), --scriptPubKey = unspent[i].scriptPubKey } i=i+1 end if currentAmount < amount+fee or i==1 then -- Not enough BTC return nil end -- Add exactly two outputs, one for the receiver and one for the exceding amount tx.txOut[1] = { amount = amount, address = to } if currentAmount > amount+fee then tx.txOut[2] = { amount = currentAmount-amount-fee, address = tx.txIn[1].address } end return tx end -- 1 BTC = 1e8 satoshi -- @param value number of BTC as string (digits with a dot) -- @return number of sathosi as zenroom.big function btc.value_btc_to_satoshi(value) pos = value:find("%.") decimals = value:sub(pos+1, #value) if #decimals > 8 then error("Satoshi is the smallest unit of measure") end decimals = decimals .. string.rep("0", 8-#decimals) return BIG.from_decimal(value:sub(1, pos-1) .. decimals) end -- 1 BTC = 1e8 satoshi -- @param value number of sathosi as zenroom.big -- @return number of BTC as string (digits with a dot) function btc.value_satoshi_to_btc(value) local str_value = value:decimal() local len = #str_value local str_btc; if len <= 8 then str_btc = '0.'; for i=1,8-len,1 do str_btc = str_btc .. '0' end str_btc = str_btc .. str_value else str_btc = string.sub(str_value, 1, len-8) .. '.' .. string.sub(str_value, len-7, len) end str_btc = string.gsub(str_btc, '%.?0*$', '') return str_btc end -- function rawTransactionFromJSON(data, sk) -- local obj = JSON.decode(data) -- local sk = btc.read_wif_private_key(sk) -- for k, v in pairs(obj.unspent) do -- v.txid = O.from_hex(v.txid) -- v.amount = valueSatoshiToBTC(v.amount) -- end -- local tx = btc.build_tx_from_unspent(obj.unspent, sk, obj.to, btc.big_from_string(obj.amount), btc.big_from_string(obj.fee)) -- tx.witness = btc.build_witness(tx, sk) -- local rawTx = btc.build_raw_transaction(tx) -- return rawTx -- end return btc q--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --Written by Denis Roio and Alberto Sonnino -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] -- Zero-Knowledge proof scheme based on Coconut -- -- Coconut is a selective disclosure credential scheme supporting public -- and private attributes, re-randomization, and multiple unlinkable -- selective attribute revelations. local credential = {} local G1 = ECP.generator() -- return value local G2 = ECP2.generator() -- return value -- local zero-knowledge proof verifications local function make_pi_s(gamma, commit, k, r, m) local wk = INT.random() local wm = INT.random() local wr = INT.random() local Aw = G1 * wk local Bw = gamma * wk + commit * wm local Cw = G1 * wr + SALT * wm local c = ZKP_challenge({commit, Aw, Bw, Cw}) -- return pi_s return { commit = c, rk = wk - c * k, rm = wm - c * m, rr = wr - c * r } end function credential.verify_pi_s(l) local Aw = l.sign.a * l.pi_s.commit + G1 * l.pi_s.rk local Bw = l.sign.b * l.pi_s.commit + l.public * l.pi_s.rk + l.commit * l.pi_s.rm local Cw = l.commit * l.pi_s.commit + G1 * l.pi_s.rr + SALT * l.pi_s.rm -- return a bool for assert return l.pi_s.commit == ZKP_challenge({l.commit, Aw, Bw, Cw}) end -- Public Coconut API function credential.issuer_keygen() return { x = INT.random(), y = INT.random() } end function credential.aggregate_keys(keys) local agg_alpha = keys[1].alpha local agg_beta = keys[1].beta if #keys > 1 then for i = 2, #keys do agg_alpha = agg_alpha + keys[i].alpha agg_beta = agg_beta + keys[i].beta end end -- return aggkeys return { alpha = agg_alpha, beta = agg_beta } end function credential.prepare_blind_sign(secret) local gamma = G1 * secret local m = INT.new(sha256(secret)) % ECP.order() -- ElGamal commitment local r = INT.random() local commit = G1 * r + SALT * m local k = INT.random() local sign = { a = G1 * k, b = gamma * k + commit * m } -- calculate zero knowledge proofs local pi_s = make_pi_s(gamma, commit, k, r, m) -- return Lambda return { commit = commit, sign = sign, pi_s = pi_s, public = gamma } end function credential.blind_sign(sk, Lambda) assert( credential.verify_pi_s(Lambda), 'Zero knowledge proof does not verify (Lambda.pi_s)', 2 ) local h = Lambda.commit local a_tilde = Lambda.sign.a * sk.y local b_tilde = h * sk.x + Lambda.sign.b * sk.y -- sigma tilde return { h = h, a_tilde = a_tilde, b_tilde = b_tilde } end function credential.aggregate_creds(sk, sigma_tilde) local agg_s = sigma_tilde[1].b_tilde - sigma_tilde[1].a_tilde * sk -- ElGamal verify commitment if #sigma_tilde > 1 then for i = 2, #sigma_tilde do agg_s = agg_s + sigma_tilde[i].b_tilde - sigma_tilde[i].a_tilde * sk end end -- aggregated sigma return { h = sigma_tilde[1].h, s = agg_s } end function credential.prove_cred(verify, sigma, secret) local m = INT.new(sha256(secret)) % ECP.order() local r = INT.random() local r_prime = INT.random() local sigma_prime = { h_prime = sigma.h * r_prime, s_prime = sigma.s * r_prime } local kappa = verify.alpha + verify.beta * m + G2 * r local nu = sigma_prime.h_prime * r local wm = INT.random() local wr = INT.random() local challenge = ZKP_challenge( { verify.alpha, verify.beta, verify.alpha + G2 * wr + verify.beta * wm, -- Aw sigma_prime.h_prime * wr } ) -- Bw -- return Theta return { kappa = kappa, nu = nu, sigma_prime = sigma_prime, pi_v = { c = challenge, rr = wr - r * challenge, rm = wm - m * challenge } } end function credential.verify_cred(verify, Theta) if #verify == 1 then verify = verify[1] end -- single element in array -- verify pi_v local Aw = Theta.kappa * Theta.pi_v.c + G2 * Theta.pi_v.rr + verify.alpha * (BIG.new(1) - Theta.pi_v.c) + verify.beta * Theta.pi_v.rm local Bw = Theta.nu * Theta.pi_v.c + Theta.sigma_prime.h_prime * Theta.pi_v.rr -- check zero knowledge proof assert( Theta.pi_v.c == ZKP_challenge({verify.alpha, verify.beta, Aw, Bw}), 'credential verification: invalid challenge', 2 ) assert( not Theta.sigma_prime.h_prime:isinf(), 'credential verification: invalid signature (infinite sigma)', 2 ) assert( ECP2.miller(Theta.kappa, Theta.sigma_prime.h_prime) == ECP2.miller(G2, Theta.sigma_prime.s_prime + Theta.nu), 'credential verification: invalid signature (miller loop)', 2 ) return true end function credential.prove_cred_uid(vk, sigma, secret, uid) local m = INT.new(sha256(secret)) % ECP.order() local r = INT.random() -- material local r_prime = INT.random() local sigma_prime = { h_prime = sigma.h * r_prime, s_prime = sigma.s * r_prime } local kappa = vk.alpha + vk.beta * m + G2 * r local nu = sigma_prime.h_prime * r local zeta = m * ECP.hashtopoint(uid) -- proof -- -- create the witnessess local wm = INT.random() local wr = INT.random() -- compute the witnessess commitments local Aw = vk.alpha + vk.beta * wm + G2 * wr local Bw = sigma_prime.h_prime * wr local Cw = wm * ECP.hashtopoint(uid) -- create the challenge local c = ZKP_challenge({vk.alpha, vk.beta, Aw, Bw, Cw}) -- create responses local pi_v = { c = c, rm = wm - m * c, rr = wr - r * c } local Theta = { kappa = kappa, nu = nu, sigma_prime = sigma_prime, pi_v = pi_v } return Theta, zeta end function credential.verify_cred_uid(vk, theta, zeta, uid) -- recompute witnessess commitments local Aw = theta.kappa * theta.pi_v.c + G2 * theta.pi_v.rr + vk.alpha * (BIG.new(1) - theta.pi_v.c) + vk.beta * theta.pi_v.rm local Bw = theta.pi_v.rr * theta.sigma_prime.h_prime + theta.nu * theta.pi_v.c local Cw = theta.pi_v.rm * ECP.hashtopoint(uid) + zeta * theta.pi_v.c -- compute the challenge prime assert( theta.pi_v.c == ZKP_challenge({vk.alpha, vk.beta, Aw, Bw, Cw}), 'credential verification: invalid challenge for UID', 2 ) -- verify signature -- assert( not theta.sigma_prime.h_prime:isinf(), 'credential verification: invalid signature (infinite sigma) for UID', 2 ) assert( ECP2.miller(theta.kappa, theta.sigma_prime.h_prime) == ECP2.miller(G2, theta.sigma_prime.s_prime + theta.nu), 'credential verification: invalid signature (miller loop) for UID', 2 ) return true end return credential 4--[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] -- Lagrange interpolation implementation in Zencode LAG = require_once('crypto_lagrange_interpolation') function single_share_f(o) local obj = deepmap(CONF.input.encoding.fun, o) return { x = ZEN.get(obj, 'x', BIG.new), y = ZEN.get(obj, 'y', BIG.new) } end ZEN.add_schema({ -- single share single_share = single_share_f, -- array of single shares secret_shares = function(obj) local res = { } for k,v in pairs(obj) do res[k] = single_share_f(v) end return res end }) When("create the secret shares of '' with '' quorum ''", function(sec, tot, q) local soct = have(sec) -- this check is relative to the BIG size, established by curve's size -- it is made inside the crypto function, but could also be made here -- local sbig = BIG.new(soct) % ECP.order() -- ZEN.assert(sbig:octet() == soct, "Secret too big to share: "..#soct.." bytes") local total = tonumber(tot) ZEN.assert(total, "Total shares is not a number: "..tot) local quorum = tonumber(q) ZEN.assert(quorum, "Quorum shares is not a number: "..q) ACK.secret_shares = LAG.create_shared_secret(total,quorum,soct) end) When("compose the secret using ''", function(shares) local sh = have(shares) ACK.secret = LAG.compose_shared_secret(sh) end) X--[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local CRED = require_once'crypto_credential' local PET = require_once'crypto_petition' local function petition_scores_f(o) local obj = deepmap(CONF.input.encoding.fun, o) return ({ pos = { left = ZEN.get(obj.pos, 'left', ECP.new), right = ZEN.get(obj.pos, 'right', ECP.new) }, neg = { left = ZEN.get(obj.neg, 'left', ECP.new), right = ZEN.get(obj.neg, 'right', ECP.new) } }) end -- petition ZEN.add_schema( { petition_scores = petition_scores_f, petition = function(obj) local res = { uid = ZEN.get(obj, 'uid'), scores = petition_scores_f(obj.scores) } if obj.owner then res.owner = ZEN.get(obj, 'owner', ECP.new) end if obj.issuer_public_key then res.issuer_public_key = key_import_issuer_verifier_f(obj.issuer_public_key) end if obj.list then res.list = deepmap( function(o) return ZEN.get(o, '.', ECP.new) end, obj.list ) end if obj.signature then res.signature = { r = ZEN.get(obj.signature, 'r'), s = ZEN.get(obj.signature, 's') } end return res end, petition_signature = function(obj) return { -- from zencode_credential proof = import_credential_proof_f(obj.proof), uid_signature = ZEN.get(obj, 'uid_signature', ECP.new), uid_petition = ZEN.get(obj, 'uid_petition') } end, petition_tally = function(obj) local dec = {} dec.neg = ZEN.get(obj.dec, 'neg', ECP.new) dec.pos = ZEN.get(obj.dec, 'pos', ECP.new) return { uid = ZEN.get(obj, 'uid'), c = ZEN.get(obj, 'c', INT.new), dec = dec, rx = ZEN.get(obj, 'rx', INT.new) } end } ) When( "create the petition ''", function(uid) havekey'credential' -- ZEN.assert(ACK.keys.credential,"Credential key not found") ACK.petition = { uid = OCTET.from_string(uid), -- TODO: take UID from HEAP not STACK owner = ECP.generator() * ACK.keys.credential, scores = { pos = { left = ECP.infinity(), right = ECP.infinity() }, neg = { left = ECP.infinity(), right = ECP.infinity() } } } ZEN.CODEC.petition = { name = 'petition', encoding = check_codec('petition'), zentype = 'schema' } -- generate an ECDH signature of the (encoded) petition using the -- credential keys -- ecdh = ECDH.new() -- ecdh:private(ACK.cred_kp.private) -- ACK.petition_ecdh_sign = { ecdh:sign(MSG.pack(OUT.petition)) } -- OUT.petition_ecdh_sign = map(ACK.petition_ecdh_sign, hex) end ) When( 'verify the new petition to be empty', function() ZEN.assert( ECP.isinf(ACK.petition.scores.pos.left), 'Invalid new petition: positive left score is not zero' ) ZEN.assert( ECP.isinf(ACK.petition.scores.pos.right), 'Invalid new petition: positive right score is not zero' ) ZEN.assert( ECP.isinf(ACK.petition.scores.neg.left), 'Invalid new petition: negative left score is not zero' ) ZEN.assert( ECP.isinf(ACK.petition.scores.neg.right), 'Invalid new petition: negative right score is not zero' ) end ) When( "create the petition signature ''", function(uid) have'credentials' have'issuer public key' havekey'credential' local Theta local zeta local ack_uid = OCTET.from_string(uid) Theta, zeta = CRED.prove_cred_uid( ACK.issuer_public_key, ACK.credentials, ACK.keys.credential, ack_uid ) ACK.petition_signature = { proof = Theta, uid_signature = zeta, -- ECP uid_petition = ack_uid } end ) IfWhen( 'verify the signature proof is correct', function() ZEN.assert( CRED.verify_cred_uid( ACK.issuer_public_key, ACK.petition_signature.proof, ACK.petition_signature.uid_signature, ACK.petition_signature.uid_petition ), 'Petition signature is invalid' ) end ) IfWhen( 'the petition signature is not a duplicate', function() if luatype(ACK.petition.list) == 'table' then ZEN.assert( (not array_contains( ACK.petition.list, ACK.petition_signature.uid_signature )), 'Duplicate petition signature detected' ) else ACK.petition.list = {} end table.insert(ACK.petition.list, ACK.petition_signature.uid_signature) end ) IfWhen( 'the petition signature is just one more', function() -- verify that the signature is +1 (no other value supported) ACK.petition_signature.one = PET.prove_sign_petition(ACK.petition.owner, BIG.new(1)) ZEN.assert( PET.verify_sign_petition( ACK.petition.owner, ACK.petition_signature.one ), 'ABC petition signature adds more than one signature' ) end ) When( 'add the signature to the petition', function() -- add the signature to the petition count local scores = ACK.petition.scores local psign = ACK.petition_signature.one scores.pos.left = scores.pos.left + psign.scores.pos.left scores.pos.right = scores.pos.right + psign.scores.pos.right scores.neg.left = scores.neg.left + psign.scores.neg.left scores.neg.right = scores.neg.right + psign.scores.neg.right -- TODO: ZEN:push({'petition' ,'scores'} ACK.petition.scores = scores end ) When( 'create a petition tally', function() havekey'credential' ZEN.assert(ACK.petition, 'Petition not found') ACK.petition_tally = PET.prove_tally_petition( ACK.keys.credential, ACK.petition.scores ) ACK.petition_tally.uid = ACK.petition.uid end ) When( 'count the petition results', function() ZEN.assert(ACK.petition, 'Petition not found') ZEN.assert(ACK.petition_tally, 'Tally not found') ZEN.assert( ACK.petition_tally.uid == ACK.petition.uid, 'Tally does not correspond to petition' ) ACK.petition_results = PET.count_signatures_petition( ACK.petition.scores, ACK.petition_tally ).pos end ) --[[ --This file is part of zenroom -- --Copyright (C) 2019-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local _cbor = require('cbor') _cbor.decode = _cbor.raw_decode _cbor.encode = function(tab) -- encodes zencode types according to CODEC assert(luatype(tab) == 'table', "CBOR encode argument needs to be a table") local fun local res = { } for k,v in pairs(tab) do fun = guess_outcast( check_codec(k) ) if luatype(v) == 'table' then res[k] = deepmap(fun, v) else res[k] = fun(v) end end return _cbor.raw_encode( res ) end _cbor.auto = function(obj) local t = luatype(obj) if t == 'table' then -- export table to JSON return _cbor.encode(obj) elseif t == 'string' then -- import JSON string to table return _cbor.decode(obj) else error("CBOR.auto unrecognised input type: "..t, 3) return nil end end return _cbor local machine = {} machine.__index = machine local NONE = "none" local ASYNC = "async" local function call_handler(handler, params) if handler then return handler(table.unpack(params)) end end local function create_transition(name) local can, to, from, params local function transition(self, ...) if self.asyncState == NONE then can, to = self:can(name) from = self.current params = { self, name, from, to, ...} if not can then return false end self.currentTransitioningEvent = name local beforeReturn = call_handler(self["onbefore" .. name], params) local leaveReturn = call_handler(self["onleave" .. from], params) if beforeReturn == false or leaveReturn == false then return false end self.asyncState = name .. "WaitingOnLeave" if leaveReturn ~= ASYNC then transition(self, ...) end return true elseif self.asyncState == name .. "WaitingOnLeave" then self.current = to local enterReturn = call_handler(self["onenter" .. to] or self["on" .. to], params) self.asyncState = name .. "WaitingOnEnter" if enterReturn ~= ASYNC then transition(self, ...) end return true elseif self.asyncState == name .. "WaitingOnEnter" then call_handler(self["onafter" .. name] or self["on" .. name], params) call_handler(self["onstatechange"], params) self.asyncState = NONE self.currentTransitioningEvent = nil return true else if string.find(self.asyncState, "WaitingOnLeave") or string.find(self.asyncState, "WaitingOnEnter") then self.asyncState = NONE transition(self, ...) return true end end self.currentTransitioningEvent = nil return false end return transition end local function add_to_map(map, event) if type(event.from) == 'string' then map[event.from] = event.to else for _, from in ipairs(event.from) do map[from] = event.to end end end function machine.create(options) assert(options.events) local fsm = {} setmetatable(fsm, machine) fsm.options = options fsm.current = options.initial or 'none' fsm.asyncState = NONE fsm.events = {} for _, event in ipairs(options.events or {}) do local name = event.name fsm[name] = fsm[name] or create_transition(name) fsm.events[name] = fsm.events[name] or { map = {} } add_to_map(fsm.events[name].map, event) end for name, callback in pairs(options.callbacks or {}) do fsm[name] = callback end return fsm end function machine:is(state) return self.current == state end function machine:can(e) local event = self.events[e] local to = event and event.map[self.current] or event.map['*'] return to ~= nil, to end function machine:cannot(e) return not self:can(e) end function machine:todot(filename) local dotfile = io.open(filename,'w') dotfile:write('digraph {\n') local transition = function(event,from,to) dotfile:write(string.format('%s -> %s [label=%s];\n',from,to,event)) end for _, event in pairs(self.options.events) do if type(event.from) == 'table' then for _, from in ipairs(event.from) do transition(event.name,from,event.to) end else transition(event.name,event.from,event.to) end end dotfile:write('}\n') dotfile:close() end function machine:transition(event) if self.currentTransitioningEvent == event then return self[self.currentTransitioningEvent](self) end end function machine:cancelTransition(event) if self.currentTransitioningEvent == event then self.asyncState = NONE self.currentTransitioningEvent = nil end end machine.NONE = NONE machine.ASYNC = ASYNC return machine --[[ --This file is part of zenroom -- --Copyright (C) 2022 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt --]] local mpack = require'msgpack' local pack, unpack = string.pack, string.unpack local to_octenv = O.to_url64 local from_octenv = O.from_url64 -- userdata codes available -- 0xc{7,8,9} mpack.encoder_functions['zenroom.octet'] = function(v) return pack('>Bs4', 0xc7, to_octenv(v)) end mpack.encoder_functions['zenroom.big'] = function(v) return pack('>Bs4', 0xc8, to_octenv(v:octet())) end -- reserved for zenroom 3.0 -- mpack.encoder_functions['zenroom.float'] = function(v) -- return pack('>Bs4', 0xc9, to_octenv(v:octet())) end -- 0xd{4,5,6,7,8} mpack.encoder_functions['zenroom.ecp'] = function(v) return pack('>Bs4', 0xd4, to_octenv(v:octet())) end mpack.encoder_functions['zenroom.ecp2'] = function(v) return pack('>Bs4', 0xd5, to_octenv(v:octet())) end local function decode_octet(data, offset) local value, pos = string.unpack('>s4', data, offset) return from_octenv(value), pos end local function decode_big(data, offset) local value, pos = string.unpack('>s4', data, offset) return BIG.new(from_octenv(value)), pos end local function decode_ecp(data, offset) local value, pos = string.unpack('>s4', data, offset) return ECP.new(from_octenv(value)), pos end local function decode_ecp2(data, offset) local value, pos = string.unpack('>s4', data, offset) return ECP2.new(from_octenv(value)), pos end mpack.decoder_functions[0xc7] = decode_octet mpack.decoder_functions[0xc8] = decode_big mpack.decoder_functions[0xd4] = decode_ecp mpack.decoder_functions[0xd5] = decode_ecp2 return mpack --[[ --This file is part of zenroom -- --Copyright (C) 2019-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local bench = { } bench.entropy = function() act("Benchmark: entropy of random generators (Shannon ratios)") -- use standard ECP size local s = #ECP.random():octet() return { SEED = RNGSEED:entropy(), PRNG = OCTET.random(256):entropy(), OCTET = OCTET.random(s):entropy(), BIG = BIG.random():octet():entropy(), ECP = ECP.random():octet():entropy(), ECP2 = ECP2.random():octet():entropy() } end bench.random_hamming_freq = function (s, q) local _s = s or 97 local _q = q or 5000 act("Benchmark: hamming distance between random, arguments: ".._s.." ".._q) -- ECP coordinates are 97 bytes local new = O.random(_s) local tot = 0 local old for i=_q,1,-1 do old = new new = O.random(_s) tot = tot + O.hamming(old,new) end return tot / _q end bench.random_kdf = function() act("Benchmark: KDF2 SHA256 and SHA512 on random") -- KDF2 input can be any, output local r = O.random(64) HASH.kdf2(HASH.new('SHA256'),r) HASH.kdf2(HASH.new('SHA512'),r) end -- find primes local square = {} for i=0,9 do square[i]=i*i end local function sqrsum(n) local sum = 0 while n > 0 do sum, n = sum + square[n % 10], math.floor(n / 10) end return sum end local function isHappy(n) while n ~= 1 and n ~= 4 do n = sqrsum(n) end return n == 1 end local prime_numbers = { 2, 3 } local function isPrime(n) if n == 1 then return true end for _,i in ipairs(prime_numbers) do if n == i then return true end if n%i == 0 then return false end end for i = prime_numbers[#prime_numbers], math.floor(n/2)+1, 2 do if n%i == 0 then return false end end if n > prime_numbers[#prime_numbers] then table.insert(prime_numbers, n) end return true end bench.math = function(a, b, c) local _a = a or 50000 local _b = b or _a+50000 local _c = c or 1 act("Benchmark: math based prime number, args: ".._a.." ".._b.." ".._c) local res = { } for n=_a,_b,_c do if isHappy(n) and isPrime(n) then table.insert(res, n) end end return res end function bench.bit32(N) N = N or 1000 act("Benchmark: bit32 based Mandelbrot generation, iterations: "..N) local bit = bit32 local bor, band = bit.bor, bit.band local shl, shr, rol = bit.lshift, bit.rshift, bit.lrotate local char, unpack = string.char, table.unpack local M, buf = 2/N, {} for y=0,N-1 do local Ci, b, p = y*M-1, -16777216, 0 local Ciq = Ci*Ci for x=0,N-1,2 do local Cr, Cr2 = x*M-1.5, (x+1)*M-1.5 local Zr, Zi, Zrq, Ziq = Cr, Ci, Cr*Cr, Ciq local Zr2, Zi2, Zrq2, Ziq2 = Cr2, Ci, Cr2*Cr2, Ciq b = rol(b, 2) for i=1,49 do Zi = Zr*Zi*2 + Ci; Zi2 = Zr2*Zi2*2 + Ci Zr = Zrq-Ziq + Cr; Zr2 = Zrq2-Ziq2 + Cr2 Ziq = Zi*Zi; Ziq2 = Zi2*Zi2 Zrq = Zr*Zr; Zrq2 = Zr2*Zr2 if band(b, 2) ~= 0 and Zrq+Ziq > 4.0 then b = band(b, -3) end if band(b, 1) ~= 0 and Zrq2+Ziq2 > 4.0 then b = band(b, -2) end if band(b, 3) == 0 then break end end if b >= 0 then p = p + 1; buf[p] = b; b = -16777216; end end if b ~= -16777216 then if band(N, 1) ~= 0 then b = shr(b, 1) end p = p + 1; buf[p] = shl(b, 8-band(N, 7)) end -- write(char(unpack(buf, 1, p))) -- write('.') end -- print('.') end return bench :---

Debug inspection facility

-- -- The INSPECT class provides a number of functions to ease -- development and debugging. It mainly consists of an advanced -- @{print} function that can represent complex data structures (Lua -- tables) and tag their encoding formats and size. Another @{spy} -- function prints the same as pass-through. -- -- @module INSPECT -- @version inspect.lua 3.1.0 -- @author Kikito github.com/kikito/inspect.lua -- @license MIT local inspect ={ _VERSION = 'inspect.lua 3.1.0', _URL = 'http://github.com/kikito/inspect.lua', _DESCRIPTION = 'human-readable representations of tables' -- _LICENSE = [[ -- MIT LICENSE -- Copyright (c) 2013 Enrique García Cota -- Copyright (c) 2018-2021 Dyne.org foundation -- Permission is hereby granted, free of charge, to any person obtaining a -- copy of this software and associated documentation files (the -- "Software"), to deal in the Software without restriction, including -- without limitation the rights to use, copy, modify, merge, publish, -- distribute, sublicense, and/or sell copies of the Software, and to -- permit persons to whom the Software is furnished to do so, subject to -- the following conditions: -- The above copyright notice and this permission notice shall be included -- in all copies or substantial portions of the Software. -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- ]] } local tostring = tostring inspect.KEY = setmetatable({}, {__tostring = function() return 'inspect.KEY' end}) inspect.METATABLE = setmetatable({}, {__tostring = function() return 'inspect.METATABLE' end}) --- -- Convert a data object to the desired format (argument name provided -- as string), or use CONF.encoding when called without argument -- -- @function export_obj(object, format) -- @param object data element to be converted -- @param format pointer to a converter function -- @return object converted to format local function export_arr(object, format) ZEN.assert( iszen(type(object)), 'export_arr called on a ' .. type(object) ) local conv_f = nil local ft = type(format) if format and ft == 'function' then conv_f = format goto ok end if format and ft == 'string' then conv_f = guess_outcast(format) goto ok end if not CONF.output.encoding then error('CONF.output.encoding is not configured', 2) end conv_f = CONF.debug.encoding.fun -- fallback to configured conversion function ::ok:: ZEN.assert( type(conv_f) == 'function', 'export_arr conversion function not configured' ) return conv_f(object) -- TODO: protected call? deepmap? end local function export_obj(object, format) -- CONF { encoding = , -- encoding_prefix = "u64" } assert(object, 'export_obj object not found') if luatype(object) == 'table' then local tres = {} for k, v in pairs(object) do -- only flat tables support recursion table.insert(tres, export_arr(v, format)) end return tres end return export_arr(object, format) end -- Apostrophizes the string if it has quotes, but not aphostrophes -- Otherwise, it returns a regular quoted string local function smartQuote(str) if str:match('"') and not str:match("'") then return "'" .. str .. "'" end return '"' .. str:gsub('"', '\\"') .. '"' end -- \a => '\\a', \0 => '\\0', 31 => '\31' local shortControlCharEscapes = { ["\a"] = "\\a", ["\b"] = "\\b", ["\f"] = "\\f", ["\n"] = "\\n", ["\r"] = "\\r", ["\t"] = "\\t", ["\v"] = "\\v" } local longControlCharEscapes = {} -- \a => nil, \0 => \000, 31 => \031 for i=0, 31 do local ch = string.char(i) if not shortControlCharEscapes[ch] then shortControlCharEscapes[ch] = "\\"..i longControlCharEscapes[ch] = string.format("\\%03d", i) end end local function escape(str) return (str:gsub("\\", "\\\\") :gsub("(%c)%f[0-9]", longControlCharEscapes) :gsub("%c", shortControlCharEscapes)) end local function isIdentifier(str) return type(str) == 'string' and str:match( "^[_%a][_%a%d]*$" ) end local function isSequenceKey(k, sequenceLength) return type(k) == 'number' and 1 <= k and k <= sequenceLength and math.floor(k) == k end local defaultTypeOrders = { ['number'] = 1, ['boolean'] = 2, ['string'] = 3, ['table'] = 4, ['function'] = 5, ['userdata'] = 6, ['thread'] = 7 } local function sortKeys(a, b) local ta, tb = type(a), type(b) -- strings and numbers are sorted numerically/alphabetically if ta == tb and (ta == 'string' or ta == 'number') then return a < b end local dta, dtb = defaultTypeOrders[ta], defaultTypeOrders[tb] -- Two default types are compared according to the defaultTypeOrders table if dta and dtb then return defaultTypeOrders[ta] < defaultTypeOrders[tb] elseif dta then return true -- default types before custom ones elseif dtb then return false -- custom types after default ones end -- custom types are sorted out alphabetically return ta < tb end -- For implementation reasons, the behavior of rawlen & # is "undefined" when -- tables aren't pure sequences. So we implement our own # operator. local function getSequenceLength(t) local len = 1 local v = rawget(t,len) while v ~= nil do len = len + 1 v = rawget(t,len) end return len - 1 end local function getNonSequentialKeys(t) local keys = {} local sequenceLength = getSequenceLength(t) for k,_ in pairs(t) do if not isSequenceKey(k, sequenceLength) then table.insert(keys, k) end end table.sort(keys, sortKeys) return keys, sequenceLength end local function getToStringResultSafely(t, mt) local __tostring = type(mt) == 'table' and rawget(mt, '__tostring') local str, ok if type(__tostring) == 'function' then ok, str = pcall(__tostring, t) str = ok and str or 'error: ' .. tostring(str) end if type(str) == 'string' and #str > 0 then return str end end local function countTableAppearances(t, tableAppearances) tableAppearances = tableAppearances or {} if type(t) == 'table' then if not tableAppearances[t] then tableAppearances[t] = 1 for k,v in pairs(t) do countTableAppearances(k, tableAppearances) countTableAppearances(v, tableAppearances) end countTableAppearances(getmetatable(t), tableAppearances) else tableAppearances[t] = tableAppearances[t] + 1 end end return tableAppearances end local copySequence = function(s) local copy, len = {}, #s for i=1, len do copy[i] = s[i] end return copy, len end local function makePath(path, ...) local keys = {...} local newPath, len = copySequence(path) for i=1, #keys do newPath[len + i] = keys[i] end return newPath end local function processRecursive(process, item, path, visited) if item == nil then return nil end if visited[item] then return visited[item] end local processed = process(item, path) if type(processed) == 'table' then local processedCopy = {} visited[item] = processedCopy local processedKey for k,v in pairs(processed) do processedKey = processRecursive(process, k, makePath(path, k, inspect.KEY), visited) if processedKey ~= nil then processedCopy[processedKey] = processRecursive(process, v, makePath(path, processedKey), visited) end end local mt = processRecursive(process, getmetatable(processed), makePath(path, inspect.METATABLE), visited) if type(mt) ~= 'table' then mt = nil end -- ignore not nil/table __metatable field setmetatable(processedCopy, mt) processed = processedCopy end return processed end ------------------------------------------------------------------- local Inspector = {} local Inspector_mt = {__index = Inspector} function Inspector:puts(...) local args = {...} local buffer = self.buffer local len = #buffer for i=1, #args do len = len + 1 buffer[len] = args[i] end end function Inspector:down(f) self.level = self.level + 1 f() self.level = self.level - 1 end function Inspector:tabify() self:puts(self.newline, string.rep(self.indent, self.level)) end function Inspector:alreadyVisited(v) return self.ids[v] ~= nil end function Inspector:getId(v) local id = self.ids[v] if not id then local tv = type(v) id = (self.maxIds[tv] or 0) + 1 self.maxIds[tv] = id self.ids[v] = id end return tostring(id) end function Inspector:putKey(k) if isIdentifier(k) then return self:puts(k) end self:puts("[") self:putValue(k) self:puts("]") end function Inspector:putTable(t, exp) if t == inspect.KEY or t == inspect.METATABLE then self:puts(tostring(t)) -- self:puts("["..#t.."]") elseif self:alreadyVisited(t) then self:puts('') -- self:puts("["..#t.."]") elseif self.level >= self.depth then self:puts('{...}') else if self.tableAppearances[t] > 1 then self:puts('<', self:getId(t), '>') end local nonSequentialKeys, sequenceLength = getNonSequentialKeys(t) local mt = getmetatable(t) local toStringResult = getToStringResultSafely(t, mt) self:puts('{') self:down(function() if toStringResult then self:puts(' -- ', escape(toStringResult)) if sequenceLength >= 1 then self:tabify() end end local count = 0 for i=1, sequenceLength do if count > 0 then self:puts(',') end self:puts(' ') self:putValue(t[i], exp) count = count + 1 end for _,k in ipairs(nonSequentialKeys) do if count > 0 then self:puts(',') end self:tabify() self:putKey(k) self:puts(' = ') self:putValue(t[k], exp) count = count + 1 end if type(mt) == 'table' then if count > 0 then self:puts(',') end self:tabify() self:puts(' = ') self:putValue(mt, exp) end end) if #nonSequentialKeys > 0 or type(mt) == 'table' then -- result is multi-lined. Justify closing } self:tabify() elseif sequenceLength > 0 then -- array tables have one extra space before closing } self:puts(' ') end self:puts('}') end end function Inspector:putValue(v, exp) local tv = type(v) local exporter = exp or export_obj if tv == 'string' then self:puts(smartQuote(escape(v))) elseif tv == 'number' or tv == 'boolean' or tv == 'nil' or tv == 'cdata' or tv == 'ctype' then self:puts(tostring(v)) elseif tv == 'table' then if #v > 0 then self:puts("["..#v.."] ") end self:putTable(v, exporter) elseif iszen(tv) then if tv == "zenroom.octet" then if #v == 0 then self:puts("octet[0] (null)") else self:puts("octet[" .. #v .. "] " .. exporter(v)) end elseif tv == "zenroom.big" then local i = v:octet() self:puts("int[" .. #i.. "] " .. exporter(i)) elseif tv == "zenroom.ecp" then local i = v:octet() if v == "Infinity" or v == ECP.infinity() then self:puts("ecp[...] (Infinity)") else self:puts("ecp[" .. #i.. "] " .. exporter(i)) end elseif tv == "zenroom.ecp2" then local i = v:octet() if v == "Infinity" or v == ECP2.infinity() then self:puts("ecp[...] (Infinity)") else self:puts("ecp2[" ..#i.. "] ".. exporter(i)) end elseif tv == "zenroom.fp12" then local i = v:octet() self:puts("fp12[" ..#i.. "] ".. exporter(i)) elseif tv == "zenroom.ecdh" then local pk = v:public() local sk = v:private() if not pk and not sk then self:puts("ecdh keyring is empty\n") else if pk then self:puts("ecdh.public["..#pk.."] ".. exporter(pk).."\n") end if sk then self:puts("ecdh.private["..#sk.."] ".. exporter(sk).."\n") end end else self:puts(exporter(v:octet())) end else self:puts('<',tv,' ',self:getId(v),'>') end end ------------------------------------------------------------------- function inspect.inspect(root, options) options = options or {} local depth = options.depth or math.huge local newline = options.newline or '\n' local indent = options.indent or ' ' local process = options.process local schema = options.schema or false if process then root = processRecursive(process, root, {}, {}) end local inspector = setmetatable({ depth = depth, level = 0, buffer = {}, ids = {}, maxIds = {}, newline = newline, indent = indent, tableAppearances = countTableAppearances(root) }, Inspector_mt) -- option schema only (don't print contents) if schema then local _f = function(_) return("") end inspector:putValue(root, _f) else inspector:putValue(root) end return table.concat(inspector.buffer) end -- apply conversion wrapper to all values of a table function inspect.process(item, format) return processRecursive(function(item) if iszen(type(item)) then return export_obj(item, format) else return item end end, item, {}, {}) end --- Print all contents of a table in a tree representation, works with -- complex data structures and prints to STDOUT. -- -- @function INSPECT.print(object) -- @param object complex table data structure function inspect.print(root, options) print(inspect.inspect(root, options)) return root end --- Print the prototype (no contents only schema) of a table in a tree --- representation, works with complex data structures and prints to --- STDOUT. -- -- @function INSPECT.schema(object) -- @param object complex table data structure function inspect.schema(root, options) warn(inspect.inspect(root, { schema = true })) return root end --- Print all contents of a table to STDERR. Works same way as @{print}. -- -- @function INSPECT.warn(object) -- @param object complex table data structure function inspect.warn(root, options) if luatype(options) == 'string' then warn('Spy on: '..options) warn(inspect.inspect(root, {})) else warn(inspect.inspect(root, options)) end return root end --- Print all contents of a table to STDERR and return same object as --- passthrough. Works same way as @{print}. -- -- @function INSPECT.spy(object) -- @param object complex table data structure -- @return object itself (passthrough for nesting) inspect.spy = inspect.warn setmetatable(inspect, { __call = function(_, ...) return inspect.print(...) end }) return inspect --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] -- ABC/COCONUT implementation in Zencode local CRED = require_once('crypto_credential') -- local G1 = ECP.generator() local G2 = ECP2.generator() -- exported function (non local) for use in zencode_petition function import_credential_proof_f(obj) return { nu = ZEN.get(obj, 'nu', ECP.new), kappa = ZEN.get(obj, 'kappa', ECP2.new), pi_v = { c = ZEN.get(obj.pi_v, 'c', INT.new), rm = ZEN.get(obj.pi_v, 'rm', INT.new), rr = ZEN.get(obj.pi_v, 'rr', INT.new) }, sigma_prime = { h_prime = ZEN.get(obj.sigma_prime, 'h_prime', ECP.new), s_prime = ZEN.get(obj.sigma_prime, 's_prime', ECP.new) } } end function key_import_issuer_verifier_f(obj) return { alpha = ZEN.get(obj, 'alpha', ECP2.new), beta = ZEN.get(obj, 'beta', ECP2.new) } end -- credential keypair operations When( 'create the credential key', function() initkeys'credential' ACK.keys.credential = INT.random() end ) When( "create the credential key with secret key ''", function(sec) initkeys'credential' ACK.keys.credential = INT.new(secret) % ECP.modulo() end ) When( 'create the issuer key', function() initkeys'issuer' ACK.keys.issuer = CRED.issuer_keygen() end ) When( 'create the issuer public key', function() havekey'issuer' ACK.issuer_public_key = { alpha = G2 * ACK.keys.issuer.x, beta = G2 * ACK.keys.issuer.y } end ) -- request credential signatures ZEN.add_schema( { issuer_public_key = key_import_issuer_verifier_f, -- lambda credential_request = function(obj) local req = { sign = { a = ZEN.get(obj.sign, 'a', ECP.new), b = ZEN.get(obj.sign, 'b', ECP.new) }, pi_s = { rr = ZEN.get(obj.pi_s, 'rr', INT.new), rm = ZEN.get(obj.pi_s, 'rm', INT.new), rk = ZEN.get(obj.pi_s, 'rk', INT.new), commit = ZEN.get(obj.pi_s, 'commit', INT.new) }, commit = ZEN.get(obj, 'commit', ECP.new), public = ZEN.get(obj, 'public', ECP.new) } ZEN.assert( CRED.verify_pi_s(req), 'Error in credential request: proof is invalid (verify_pi_s)' ) return req end } ) When( 'create the credential request', function() havekey'credential' ACK.credential_request = CRED.prepare_blind_sign(ACK.keys.credential) end ) -- issuer's signature of credentials ZEN.add_schema( { -- sigmatilde credential_signature = function(obj) return { h = ZEN.get(obj, 'h', ECP.new), b_tilde = ZEN.get(obj, 'b_tilde', ECP.new), a_tilde = ZEN.get(obj, 'a_tilde', ECP.new) } end, -- aggsigma: aggregated signatures of ca issuers credentials = function(obj) return { h = ZEN.get(obj, 'h', ECP.new), s = ZEN.get(obj, 's', ECP.new) } end } ) When( 'create the credential signature', function() have 'credential request' havekey'issuer' ACK.credential_signature = CRED.blind_sign(ACK.keys.issuer, ACK.credential_request) ACK.verifier = { alpha = G2 * ACK.keys.issuer.x, beta = G2 * ACK.keys.issuer.y } end ) When( 'create the credentials', function() have 'credential signature' havekey'credential' -- prepare output with an aggregated sigma credential -- requester signs the sigma with private key ACK.credentials = CRED.aggregate_creds(ACK.keys.credential, {ACK.credential_signature}) end ) ZEN.add_schema( { -- theta: blind proof of certification credential_proof = function(obj) return { nu = ZEN.get(obj, 'nu', ECP.new), kappa = ZEN.get(obj, 'kappa', ECP2.new), pi_v = { c = ZEN.get(obj.pi_v, 'c', INT.new), rm = ZEN.get(obj.pi_v, 'rm', INT.new), rr = ZEN.get(obj.pi_v, 'rr', INT.new) }, sigma_prime = { h_prime = ZEN.get(obj.sigma_prime, 'h_prime', ECP.new), s_prime = ZEN.get(obj.sigma_prime, 's_prime', ECP.new) } } end } ) When( 'aggregate the issuer public keys', function() have 'issuer public key' if not ACK.verifiers then ACK.verifiers = {} end for k, v in pairs(ACK.issuer_public_key) do ACK.verifiers[k] = v end -- TODO: aggregate all array end ) When( 'create the credential proof', function() have 'verifiers' have 'credentials' empty 'credential proof' havekey'credential' ACK.credential_proof = CRED.prove_cred(ACK.verifiers, ACK.credentials, ACK.keys.credential) end ) IfWhen( 'verify the credential proof', function() have 'credential proof' have 'verifiers' ZEN.assert( CRED.verify_cred(ACK.verifiers, ACK.credential_proof), 'Credential proof does not validate' ) end ) --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Wednesday, 14th July 2021 --]] ZEN.add_schema( { -- flexible verifiable credential -- only internal 'jws' member has peculiar encoding verifiable_credential = function(obj) ZEN.CODEC.verifiable_credential = { name = 'verifiable_credential', encoding = 'string', zentype = 'schema', luatype = 'table' } return (deepmap(OCTET.from_string, obj)) end } ) -- return { r , s } table suitable for signature verification local function jws_octet_to_signature(obj) local toks = strtok(OCTET.to_string(obj), '[^.]*') -- header parsing may be skipped -- local header = JSON.decode( OCTET.from_url64(toks[1]):to_string() ) local res = {} res.r, res.s = OCTET.chop(OCTET.from_url64(toks[3]), 32) return (res) end -- return octet string suitable for JWS encapsulation local function jws_signature_to_octet(obj) local header = OCTET.from_string( JSON.encode( { alg = 'ES256K', b64 = true, crit = 'b64' } ) ) return (OCTET.to_url64(header) .. '..' .. OCTET.to_url64(obj.r .. obj.s)) end When( "set the verification method in '' to ''", function(vc, meth) local cred = have(vc) ZEN.assert(cred.proof, 'The object is not signed: ' .. vc) local m = have(meth) ACK[vc].proof.verificationMethod = m end ) When( "get the verification method in ''", function(vc) empty 'verification_method' local cred = have(vc) ZEN.assert(cred.proof, 'The object is not signed: ' .. vc) ACK.verification_method = cred.proof.verificationMethod end ) When( "sign the verifiable credential named ''", function(vc) local cred = have(vc) local keypair = have 'keypair' ZEN.assert( not cred.proof, 'The object is already signed: ' .. vc ) local proof = { type = 'Zenroom', -- .. VERSION, -- , "Signature", -- TODO: check what to write here for secp256k1 -- created = "2018-06-18T21:19:10Z", proofPurpose = 'authenticate' -- assertionMethod", -- TODO: check } local cred_str = JSON.encode(cred) proof.jws = jws_signature_to_octet( ECDH.sign(keypair.private_key, OCTET.from_string(cred_str)) ) ACK[vc].proof = deepmap(OCTET.from_string, proof) end ) IfWhen( "verify the verifiable credential named ''", function(vc) local cred = have(vc) local public_key = have 'public_key' ZEN.assert(cred.proof, 'The object has no signature: ' .. vc) ZEN.assert( cred.proof.jws, 'The object has no signature: ' .. vc ) local sign = jws_octet_to_signature(cred.proof.jws) -- omit the proof subtable from verification local proof = cred.proof cred.proof = nil local cred_str = JSON.encode(cred) -- restore proof in HEAP (cred is still a pointer here) cred.proof = proof -- if public_key is a table then use the first value: support 'from' -- extraction, but not multiple keys local pub if luatype(public_key) == 'table' then _, pub = next(public_key) else pub = public_key end ZEN.assert( ECDH.verify(pub, OCTET.from_string(cred_str), sign), 'The signature does not validate: ' .. vc ) end ) ;--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 26th November 2021 --]] -- hashing single strings When( "create the hash of ''", function(s) local src = have(s) if luatype(src) == 'table' then src = ZEN.serialize(src) -- serialize tables using zenroom's algo end ACK.hash = HASH.new(CONF.hash):process(src) new_codec('hash', { zentype = 'element' }) end ) When( "create the hash of '' using ''", function(s, h) local src = have(s) if luatype(src) == 'table' then src = ZEN.serialize(src) end if strcasecmp(h, 'sha256') then ACK.hash = sha256(src) elseif strcasecmp(h, 'sha512') then ACK.hash = sha512(src) end ZEN.assert(ACK.hash, 'Invalid hash: ' .. h) new_codec('hash', { zentype = 'element' }) end ) When( "create the hash to point '' of each object in ''", function(what, arr) local F = _G[what] ZEN.assert( luatype(F.hashtopoint) == 'function', 'Hash type ' .. what .. ' is invalid (no hashtopoint)' ) local A = have(arr) local count = isarray(A) ZEN.assert(count > 0, 'Object is not an array: ' .. arr) ACK.hash_to_point = deepmap(F.hashtopoint, A) new_codec('hash_to_point', { luatype='table', zentype='array' }) end ) When( "create the hashes of each object in ''", function(arr) local A = have(arr) local count = isarray(A) ZEN.assert(count > 0, 'Object is not an array: ' .. arr) ACK.hashes = deepmap(sha256, A) new_codec('hashes', { luatype='table', zentype='array' }) end ) -- HMAC from RFC2104. When( "create the HMAC of '' with key ''", function(obj, key) local src = have(obj) if luatype(src) == 'table' then src = ZEN.serialize(src) end local hkey = have(key) -- static int hash_hmac(lua_State *L) { -- hash *h = hash_arg(L,1); -- octet *k = o_arg(L, 2); -- octet *in = o_arg(L, 3); ACK.HMAC = HASH.new(CONF.hash):hmac(hkey, obj) new_codec('HMAC', { zentype = 'element' }) end ) When( "create the key derivation of ''", function(obj) local src = have(obj) if luatype(src) == 'table' then src = ZEN.serialize(src) end ACK.key_derivation = HASH.new(CONF.hash):kdf(src) new_codec('key_derivation', { zentype = 'element' }) end ) When( "create the key derivation of '' with password ''", function(obj, salt) local src = have(obj) if luatype(src) == 'table' then src = ZEN.serialize(src) end local pass = have(salt) ACK.key_derivation = HASH.new('sha512'):pbkdf2(src, {salt = pass, iterations = 5000, length = 32}) new_codec('key derivation', { zentype = 'element' }) end ) N%--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] -- TODO: use strict table -- https://stevedonovan.github.io/Penlight/api/libraries/pl.strict.html -- the main security concern in this Zencode module is that no data -- passes without validation from IN to ACK or from inline input. -- GIVEN local function gc() TMP = {} collectgarbage 'collect' end -- safely take any zenroom object as index local function _index_to_string(what) local t = type(what) if t == 'string' then return what elseif iszen(t) then return what:octet():string() end error("Invalid type to index variable in heap: "..t, 3) return nil end --- -- Pick a generic data structure from the IN memory -- space. Looks for named data on the first and second level and makes -- it ready in TMP for @{validate} or @{ack}. -- -- @function pick(name, data, encoding) -- @param what string descriptor of the data object -- @param conv[opt] optional encoding spec (default CONF.input.encoding) -- @return true or false local function pick(what, conv) local guess local data local raw local name = _index_to_string(what) raw = KIN[name] or IN[name] if not raw then error("Cannot find '" .. name .. "' anywhere (null value?)", 2) end if raw == '' then error("Found empty string in '" .. name) end -- if not conv and ZEN.schemas[what] then conv = what end TMP = guess_conversion(raw, conv or name) if not TMP then error('Cannot guess any conversion for: ' .. luatype(raw) .. ' ' .. (conv or name or '(nil)')) end TMP.name = name TMP.schema = conv assert(ZEN.OK) if DEBUG > 1 then ZEN:ftrace('pick found ' .. name .. '('..TMP.zentype..')') end end --- -- Pick a data structure named 'what' contained under a 'section' key -- of the at the root of the IN memory space. Looks for named -- data at the first and second level underneath IN[section] and moves -- it to TMP[what][section], ready for @{validate} or @{ack}. If -- TMP[what] exists already, every new entry is added as a key/value -- -- @function pickin(section, name) -- @param section string descriptor of the section containing the data -- @param what string descriptor of the data object -- @param conv string explicit conversion or schema to use -- @param fail bool bail out or continue on error -- @return true or false local function pickin(section, what, conv, fail) ZEN.assert(section, 'No section specified') local root -- section local raw -- data pointer local bail -- fail local name = _index_to_string(what) root = KIN[section] if root then raw = root[name] if raw then goto found end end root = IN[section] if root then raw = root[name] if raw then goto found end end -- TODO: check all corner cases to make sure TMP[name] is a k/v map ::found:: if not raw then error("Cannot find '" .. name .. "' inside '" .. section .. "' (null value?)",2) end if raw == '' then error("Found empty string '" .. name .."' inside '"..section.."'", 2) end -- conv = conv or name -- if not conv and ZEN.schemas[name] then conv = name end -- if no encoding provided then conversion is same as name (schemas etc.) TMP = guess_conversion(raw, conv or name) TMP.name = name TMP.root = section TMP.schema = conv assert(ZEN.OK) if DEBUG > 1 then ZEN:ftrace('pickin found ' .. name .. ' in ' .. section) end end local function ack_table(key, val) ZEN.assert( type(key) == 'string', 'ZEN:table_add arg #1 is not a string' ) ZEN.assert( type(val) == 'string', 'ZEN:table_add arg #2 is not a string' ) if not ACK[key] then ACK[key] = {} end ACK[key][val] = operate_conversion(TMP) ZEN.CODEC[key] = { name = TMP.name, luatype = 'table', zentype = 'dictionary', encoding = TMP.encoding, root = TMP.root } -- name of schema may differ from name of object if TMP.schema and ( TMP.schema ~= TMP.encoding ) then ZEN.CODEC[key].schema = TMP.schema end end --- -- Final step inside the Given block towards the When: -- pass on a data structure into the ACK memory space, ready for -- processing. It requires the data to be present in TMP[name] and -- typically follows a @{pick}. In some restricted cases it is used -- inside a When block following the inline insertion of data -- from zencode. -- -- @function ack(name) -- @param name string key of the data object in TMP[name] local function ack(what) local name = _index_to_string(what) ZEN.assert(TMP, 'No valid object found: ' .. name) -- CODEC[what] = CODEC[what] or { -- name = guess.name, -- istable = guess.istable, -- isschema = guess.isschema } ZEN.assert( not ACK[name], 'Destination already exists, cannot overwrite: ' .. name, 2 ) assert(ZEN.OK) ACK[name] = operate_conversion(TMP) -- also creates codec insice operate conversion -- name of schema may differ from name of object if TMP.schema and ( TMP.schema ~= TMP.encoding ) then ZEN.CODEC[name].schema = TMP.schema end -- ACK[name] already holds an object -- not a table? -- if not (dsttype == 'table') then -- convert single object to array -- ACK[name] = { ACK[name] } -- table.insert(ACK[name], operate_conversion(TMP)) -- goto done -- end -- -- it is a table already -- if isarray(ACK[name]) then -- plain array -- table.insert(ACK[name], operate_conversion(TMP)) -- goto done -- else -- associative map (dictionary) -- table.insert(ACK[name], operate_conversion(TMP)) -- TODO: associative map insertion -- goto done -- end -- ::done:: -- assert(ZEN.OK) end Given( 'nothing', function() ZEN.assert( not DATA and not KEYS, 'Undesired data passed as input' ) end ) -- maybe TODO: Given all valid data -- convert and import data only when is known by schema and passes validation -- ignore all other data structures that are not known by schema or don't pass validation Given( "am ''", function(name) Iam(name) end ) Given( "my name is in a '' named ''", function(sc, name) pick(name, sc) assert(TMP.name, 'No name found in: ' .. name) Iam(O.to_string(operate_conversion(TMP))) end ) -- variable names: -- s = schema of variable (or encoding) -- n = name of variable -- t = table containing the variable -- TODO: I have a '' as '' Given( "a ''", function(n) pick(n) ack(n) gc() end ) Given( "a '' in ''", function(s, t) pickin(t, s) ack(s) -- save it in ACK.obj gc() end ) -- public keys for keyring arrays -- returns a special array for upcoming session: -- public_key_session : { name : value } Given( "a '' public key from ''", function(s, t) -- if not pickin(t, s, nil, false) then -- pickin(s, t) -- end pickin(t, s..'_public_key', s..'_public_key', false) ack_table('public_key_session', t) end ) Given( "a '' from ''", function(s, t) -- if not pickin(t, s, nil, false) then -- pickin(s, t) -- end pickin(t, s, s, false) ack_table(s, t) gc() end ) Given( "a '' named ''", function(s, n) -- ZEN.assert(encoder, "Invalid input encoding for '"..n.."': "..s) pick(n, s) ack(n) gc() end ) Given( "a '' named by ''", function(s, n) -- local name = have(n) local name = _index_to_string(KIN[n] or IN[n]) -- ZEN.assert(encoder, "Invalid input encoding for '"..n.."': "..s) pick(name, s) ack(name) gc() end ) Given( "a '' named '' in ''", function(s, n, t) pickin(t, n, s) ack(n) -- save it in ACK.name gc() end ) Given( "a '' named by '' in ''", function(s, n, t) local name = _index_to_string(KIN[n] or IN[n]) pickin(t, name, s) ack(name) -- save it in ACK.name gc() end ) Given( "my ''", function(n) ZEN.assert(WHO, 'No identity specified, use: Given I am ...') pickin(WHO, n) ack(n) gc() end ) Given( "my '' named ''", function(s, n) -- ZEN.assert(encoder, "Invalid input encoding for '"..n.."': "..s) pickin(WHO, n, s) ack(n) gc() end ) Given( "my '' named by ''", function(s, n) -- ZEN.assert(encoder, "Invalid input encoding for '"..n.."': "..s) local name = _index_to_string(KIN[n] or IN[n]) pickin(WHO, name, s) ack(name) gc() end ) Given( "a '' is valid", function(n) pick(n) gc() end ) Given( "my '' is valid", function(n) pickin(WHO, n) gc() end ) a--[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 12th November 2021 --]] -- DESCRIPTION: Special keys schema has optional members common to -- multiple scenarios, it provides a common interface to create keys, -- verifiers and check their existance. It does not use the keys, that's -- up to the specific scenarios. One single scenario may require and use -- the same key types (one or more) as others do, for instance reflow -- uses bls and credential, petition uses credential and ecdh. function initkeys(ktype) if luatype(ACK.keys) == 'table' then -- TODO: check that curve types match elseif ACK.keys == nil then -- initialise empty ACK.keys ACK.keys = {} -- TODO: save curve types new_codec('keys', { zentype = 'schema', luatype = 'table', encoding = 'complex' }) else error('Keys table is corrupted', 2) end -- if ktype is specified then check overwriting if ktype then ZEN.assert( not ACK.keys[uscore(ktype)], 'Cannot overwrite existing key: ' .. ktype ) end end When("create the keys", function() empty'keys' initkeys() end) -- KNOWN KEY TYPES FOUND IN ACK.keys local keytypes = { ecdh = true, credential = true, issuer = true, bls = true, reflow = true, bitcoin = true, testnet = true, ethereum = true } function havekey(ktype) local kname = uscore(ktype) ZEN.assert(keytypes[kname], 'Unknown key type: ' .. ktype) -- check that keys exist and are a table initkeys() local res = ACK.keys[kname] ZEN.assert(res, 'Key not found: ' .. ktype) return res end local function nop(x) return(x) end local function _keys_import(obj) -- ecdh_curve -- bls_curve local res = {} if obj.ecdh then res.ecdh = ZEN.get(obj, 'ecdh') end if obj.credential then res.credential = ZEN.get(obj, 'credential', INT.new) end if obj.issuer then res.issuer = { x = ZEN.get(obj.issuer, 'x', INT.new), y = ZEN.get(obj.issuer, 'y', INT.new) } end if obj.bls then res.bls = ZEN.get(obj, 'bls', INT.new) end if obj.reflow then res.reflow = ZEN.get(obj, 'reflow', INT.new) end if obj.bitcoin then res.bitcoin = ZEN.get(obj, 'bitcoin', BTC.wif_to_sk, O.from_base58) end if obj.testnet then res.testnet = ZEN.get(obj, 'testnet', BTC.wif_to_sk, O.from_base58) end if obj.ethereum then res.ethereum = ZEN.get(obj, 'ethereum', nop, O.from_hex) end return (res) end local function _default_export(obj) local fun = guess_outcast(CONF.output.encoding.name) return fun(obj) end local function _keys_export(obj) -- ecdh_curve -- bls_curve local res = {} if obj.ecdh then res.ecdh = _default_export(obj.ecdh) end if obj.credential then res.credential = _default_export(obj.credential) end if obj.issuer then local fun = guess_outcast(CONF.output.encoding.name) res.issuer = deepmap(fun, obj.issuer) end if obj.bls then res.bls = _default_export(obj.bls) end if obj.reflow then res.reflow = _default_export(obj.reflow) end if obj.bitcoin then res.bitcoin = O.to_base58( BTC.sk_to_wif(obj.bitcoin, 'bitcoin') ) end if obj.testnet then res.testnet = O.to_base58( BTC.sk_to_wif(obj.testnet, 'testnet') ) end if obj.ethereum then res.ethereum = O.to_hex(obj.ethereum) end return (res) end ZEN.add_schema( { keys = { import = _keys_import, export = _keys_export } } ) d-- This file is part of Zenroom (https://zenroom.dyne.org) -- -- Copyright (C) 2018-2021 Dyne.org foundation designed, written and -- maintained by Denis Roio -- -- This program is free software: you can redistribute it and/or modify -- it under the terms of the GNU Affero General Public License as -- published by the Free Software Foundation, either version 3 of the -- License, or (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, but -- WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- Affero General Public License for more details. -- -- You should have received a copy of the GNU Affero General Public -- License along with this program. If not, see -- . -- init script embedded at compile time. executed in -- zen_load_extensions(L) usually after zen_init() -- -- remap fatal and error function fatal(msg) if type(msg) == 'string' then warn(trim(msg), 2) end debug.traceback() -- if ZEN_traceback ~= "" then ZEN:debug() end if DEBUG > 1 then -- TODO: ZEN:backtrace() and traceback as sorted array warn(ZEN_traceback) end if DEBUG > 2 then -- TODO: ZEN:dump() I.warn( { HEAP = { IN = IN, TMP = TMP, ACK = ACK, OUT = OUT } } ) end ZEN:debug() msg = msg or 'fatal error' error(msg, 2) end -- global REQUIRED = {} -- avoid duplicating requires (internal includes) function require_once(ninc) local class = REQUIRED[ninc] local _res if not class then _res, class = pcall( function() return require(ninc) end ) assert(_res, class) REQUIRED[ninc] = class end return class end SCENARIOS = {} function load_scenario(scen) local s = SCENARIOS[scen] if not s then local _res, _err _res, _err = pcall( function() require(scen) end) assert(_res, _err) SCENARIOS[scen] = true end end -- error = zen_error -- from zen_io -- ZEN = { assert = assert } -- zencode shim when not loaded require('zenroom_common') INSPECT = require('inspect') CBOR = require('zenroom_cbor') JSON = require('zenroom_json') MPACK = require('msgpack') OCTET = require('zenroom_octet') BIG = require('zenroom_big') ECDH = require('zenroom_ecdh') -- ECDH public keys cannot function as ECP because of IANA 7303 AES = require'aes' ECP = require('zenroom_ecp') ECP2 = require('zenroom_ecp2') HASH = require('zenroom_hash') BENCH = require('zenroom_bench') MACHINE = require('statemachine') TIME = require('timetable') -- BITCOIN primitives are imported by default BTC = require('crypto_bitcoin') O = OCTET -- alias INT = BIG -- alias I = INSPECT -- alias H = HASH -- alias PAIR = ECP2 -- alias PAIR.ate = ECP2.miller --alias V = require('semver') ZENROOM_VERSION = V(VERSION) ZEN = require('zencode') -- the global ZEN context -- base zencode functions and schemas load_scenario('zencode_data') -- pick/in, conversions etc. load_scenario('zencode_given') load_scenario('zencode_when') load_scenario('zencode_hash') -- when extension load_scenario('zencode_array') -- when extension load_scenario('zencode_random') -- when extension load_scenario('zencode_dictionary') -- when extension load_scenario('zencode_verify') -- when extension load_scenario('zencode_then') load_scenario('zencode_keys') -- this is to evaluate expressions or derivate a column -- it would execute lua code inside the zencode and is -- therefore dangerous, switched off by default -- require('zencode_eval') load_scenario('zencode_debug') -- bitcoin is loaded by default load_scenario('zencode_bitcoin') -- scenario are loaded on-demand -- scenarios can only implement "When ..." steps _G['Given'] = nil _G['Then'] = nil ----------- -- defaults _G['CONF'] = { input = { encoding = input_encoding('base64'), format = { fun = JSON.auto, name = 'json' }, tagged = false }, output = { encoding = { fun = guess_outcast('base64'), name = 'base64' }, format = { fun = JSON.auto, name = 'json' }, versioning = false }, debug = { encoding = { fun = guess_outcast('hex'), name = 'hex' } }, parser = {strict_match = true}, heap = { check_collision = true }, hash = 'sha256', } -- turn on heapguard when DEBUG or linux-debug build if DEBUG > 1 or MAKETARGET == "linux-debug" then _G['CONF'].heapguard = true else _G['CONF'].heapguard = false end -- do not modify _G['LICENSE'] = [[ Licensed under the terms of the GNU Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ]] _G['COPYRIGHT'] = [[ Forked by Jaromil on 18 January 2020 from Coconut Petition ]] SALT = ECP.hashtopoint(OCTET.from_string(COPYRIGHT .. LICENSE)) -- Calculate a system-wide crypto challenge for ZKP operations -- returns a BIG INT -- this is a sort of salted hash for advanced ZKP operations and -- should not be changed. It may be made configurable in future. function ZKP_challenge(list) local challenge = ECP.generator():octet() .. ECP2.generator():octet() .. SALT:octet() local ser = serialize(list) return INT.new( sha256(challenge .. ser.octets .. OCTET.from_string(ser.strings)) ) % ECP.order() end collectgarbage 'collect' --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local ecp = require'ecp' function ecp.hashtopoint(s) return ecp.mapit(sha512(s)) end function ecp.random() return ecp.mapit(OCTET.random(64)) end return ecp --[[ --This file is part of zenroom -- --Copyright (C) 2020-2021 Dyne.org foundation --Implementation by Alberto Ibrisevic and Denis Roio --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] --prime modulus of the coordinates of ECP and order of the curve p = ECP.prime() o = ECP.order() --generator of the curve G = ECP.generator() --method for obtaining a valid EC keypair where the secret key is chosen at random function key_gen() keypair = { } local sk repeat sk = OCTET.random(32) d = BIG.new(sk) if o <= d then d = BIG.new(0) end --guaranties that the generated keypair is valid until (d ~= BIG.new(0)) local P = d*G pk = (P:x()):octet():pad(48) keypair.sk = sk keypair.pk = pk return keypair end --given a valid secret key, extracts the related public key as the x-coordinate of the alleged ECP --N.B: key_gen() already provides this functionality, the difference is that pkey_gen stops if sk is invalid function pkey_gen(sk) assert(sk, "no secret key found") assert(#sk == 32, 'invalid secret key: length is not of 32B') d = BIG.new(sk) assert(d ~= BIG.new(0), 'invalid secret key, is zero') assert(d <= o, 'invalid secret key, overflow with curve order') P = d*G return P end --method for obtaining an hash digest using a (UTF-8) encoded tag name together with the data to process --N.B1: By doing this, we make sure hashes used in one context can't be reinterpreted in another one, -- in such a way that collisions across contexts can be assumed to be infeasible. --N.B2: tag names can be customized at will hash_tag = function(tag, data) return sha256(sha256(OCTET.str(tag))..sha256(OCTET.str(tag))..data) end --signing algorithm --input: a 32 Byte OCTET secret key 'sk' -- a 32 Byte OCTET message 'm' --output: an 80 Byte OCTET signature '(r,s)'', where r is long 48 Byte, and s is long 32 Byte function Sign(sk, m) P = pkey_gen(sk) --for convention we need that P has even y-coordinate if (P:y() % BIG.new(2)) ~= BIG.new(0) then d = o - d end --N.B: we don't change the point with the new one, but only store the coefficient d needed to obtain it local k repeat local a = OCTET.random(32) local h = hash_tag("BIP0340/aux", a) local t = OCTET.xor(d:octet(), h) local rand = hash_tag("BIP0340/nonce", t..((P:x()):octet())..m) k = BIG.new(rand) % o --maybe it is not needed since o is bigger until k ~= BIG.new(0) local R = k*G if (R:y() % BIG.new(2)) ~= BIG.new(0) then k = o - k end --also here we store only the coefficient k, /wo changing the point R local e = BIG.new(hash_tag("BIP0340/challenge", ((R:x()):octet())..((P:x()):octet())..m)) % o local r = (R:x()):octet():pad(48) --padding is fundamental, otherwise we could lose non-significant zeros local s = BIG.mod(k + e*d, o):octet():pad(32) local sig = r..s assert(Verify(P:x(),m,sig), "Invalid signature") --comment this line if it is unnecessary return sig end --verification algortihm --input: a 48 Byte OCTET public key 'pk' -- a 32 Byte OCTET message 'm' -- an 80 Byte OCTET signature 'sig'=(r,s) --output: true if verification passes, false otherwise function Verify(pk, m, sig) --the follwing "lifts" pk to an ECP with x = pk and y is even local P = ECP.new(BIG.new(pk)) assert(P, "lifting failed") local r_arr, s_arr = OCTET.chop(sig,48) local r = BIG.new(r_arr) assert(r <= p, "Verification failed, r overflows p") local s = BIG.new(s_arr) assert(s <= o, "Verification failed, s overflows o") local e = BIG.new(hash_tag("BIP0340/challenge", r:octet()..(P:x()):octet()..m)) % o local R = (s*G) - (e*P) --if the signature is valid the result will be k*G as expected assert(not ECP.isinf(R), "Verification failed, point to infinity") assert((R:y() % BIG.new(2) == BIG.new(0)) , "Verification failed, y is odd") assert((R:x() == r), "Verification failed") return true end --TODO: batch verification--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 12th November 2021 --]] --- THEN combinations: -- the -- the from -- the as -- the in -- my -- my from -- my as -- the from as -- the from in -- the as in -- the from as in -- my from as ---------------------- -- executes a guess_outcast and then operates it -- sch may be fed with check_codec() result (name of encoding) local function then_outcast(val, sch) if not val then error("Then outcast called on empty variable", 2) end local fun = guess_outcast(sch) if luatype(val) == 'table' then local codec = ZEN.CODEC[sch] if codec and codec.zentype == 'schema' and codec.encoding == 'complex' then if not isdictionary(val) then error('Complex schema value is not a dictionary: '..sch, 2) end -- check that the schema has an hardcoded encoding if ZEN.CODEC[sch] and ZEN.CODEC[sch].encoding and ZEN.CODEC[sch].encoding ~= 'complex' then local res = fun(val) local enc = guess_outcast( ZEN.CODEC[sch].encoding ) if luatype(res) == 'table' then return deepmap(enc, res) else return enc(res) end else return fun(val) end else if luatype(val) == 'table' then return deepmap(fun, val) else return fun(val) end end else return fun(val) end end local function then_insert(dest, val, key) if not ACK[dest] then OUT[dest] = val elseif luatype(OUT[dest]) == 'table' then if isarray(OUT[dest]) then table.insert(OUT[dest], val) else assert(key, 'Then statement targets dictionary with empty key: '..dest) OUT[dest][key] = val end else -- extend string to array local tmp = OUT[dest] OUT[dest] = { tmp } table.insert(OUT[dest], val) end end local function iterate_data(t) local a = {} for k,v in lua_pairs(t) do if k ~= 'keys' then table.insert(a, n) end end local i = 0 -- iterator variable return function () -- iterator function i = i + 1 return a[i], t[a[i]] end end Then("nothing", function() return end) -- nop to terminate if Then("print string ''", function(k) if not OUT.output then OUT.output = {} end table.insert(OUT.output, k) -- raw string value end) Then("print ''", function(name) local val = have(name) OUT[name] = then_outcast( val, check_codec(name) ) end) Then("print '' as ''",function(k, s) local val = have(k) OUT[k] = then_outcast( val, s ) end) Then("print '' from ''",function(k, f) local val = have({f,k}) -- use array to check in depth OUT[k] = then_outcast( val, check_codec(f) ) end) Then("print '' from '' as ''",function(k, f, s) local val = have({f,k}) -- use array to check in depth OUT[k] = then_outcast( val, s ) end) Then("print '' from '' as '' in ''",function(k, f, s, d) local val = have({f,k}) -- use array to check in depth then_insert( d, then_outcast( val, s ), k) end) Then("print '' as '' in ''",function(k, s, d) local val = have(k) -- use array to check in depth then_insert( d, then_outcast( val, s ), k) end) Then("print my '' from '' as ''",function(k, f, s) Iam() local val = have({f,k}) -- use array to check in depth then_insert( WHO, then_outcast( val, s ), k) end) Then("print my '' from ''",function(k, f) Iam() local val = have({f,k}) -- use array to check in depth -- my statements always print to a dictionary named after WHO if not OUT[WHO] then OUT[WHO] = { } end OUT[WHO][k] = then_outcast( val, check_codec(f) ) end) Then("print my '' as ''",function(k, s) Iam() local val = have(k) -- use array to check in depth then_insert( WHO, then_outcast( val, s ), k) end) Then("print my ''",function(k) Iam() local val = have(k) -- my statements always print to a dictionary named after WHO if not OUT[WHO] then OUT[WHO] = { } end OUT[WHO][k] = then_outcast( val, check_codec(k) ) end) Then('print keys',function() OUT.keys = ZEN.schemas.keys.export(ACK.keys) end) Then("print keys for ''", function(k) local keys = ZEN.schemas.keys.export(ACK.keys) if not OUT.keys then OUT.keys = { } end OUT.keys[k] = keys[k] end) Then('print my keys',function() Iam() OUT[WHO] = { keys = ZEN.schemas.keys.export(ACK.keys) } end) Then("print my keys for ''", function(k) Iam() local keys = ZEN.schemas.keys.export(ACK.keys) if not OUT[WHO] then OUT[WHO] = { keys = { } } end OUT[WHO].keys[k] = keys[k] end) -- data -- data as -- data from -- data from as -- my data -- my data as -- my data from -- my data from as Then('print data',function() for k, v in pairs(ACK) do OUT[k] = then_outcast(v, check_codec(k)) end end ) Then("print data as ''",function(e) local fun for k, v in pairs(ACK) do OUT[k] = then_outcast(v, e) end end ) Then("print data from ''", function(src) local obj = have(src) for k,v in pairs(obj) do ACK[k] = true -- to legitimate new_codec creation OUT[k] = then_outcast( v, check_codec(src) ) end end) Then("print data from '' as ''", function(src, e) local obj = have(src) for k,v in pairs(obj) do ACK[k] = true -- to legitimate new_codec creation OUT[k] = then_outcast( v, e ) end end) Then('print my data',function() Iam() -- sanity checks OUT[WHO] = { } for k, v in pairs(ACK) do OUT[WHO][k] = then_outcast( v, check_codec(k) ) end end) Then("print my data as ''",function(e) Iam() -- sanity checks OUT[WHO] = { } for k, v in pairs(ACK) do OUT[WHO][k] = then_outcast( v, e ) end end ) Then("print my data from ''",function(src) Iam() -- sanity checks OUT[WHO] = { } local obj = have(src) for k, v in pairs(obj) do OUT[WHO][k] = then_outcast( v, check_codec(k) ) end end ) Then("print my data from '' as ''",function(src, e) Iam() -- sanity checks OUT[WHO] = { } local obj = have(src) for k, v in pairs(obj) do OUT[WHO][k] = then_outcast( v, e ) end end ) Then("print object named by ''", function(name) local val = have(name):string() local real_name = have(val) OUT[val] = then_outcast( real_name, check_codec(val) ) end) local semver = { _VERSION = '1.2.2', _DESCRIPTION = 'semver for Lua', _URL = 'https://github.com/kikito/semver.lua' -- _LICENSE = [[ -- MIT LICENSE -- Copyright (c) 2015 Enrique García Cota -- Copyright (c) 2019-2021 Dyne.org foundation -- Permission is hereby granted, free of charge, to any person obtaining a -- copy of tother software and associated documentation files (the -- "Software"), to deal in the Software without restriction, including -- without limitation the rights to use, copy, modify, merge, publish, -- distribute, sublicense, and/or sell copies of the Software, and to -- permit persons to whom the Software is furnished to do so, subject to -- the following conditions: -- The above copyright notice and tother permission notice shall be included -- in all copies or substantial portions of the Software. -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- ]] } local function checkPositiveInteger(number, name) assert(number >= 0, name .. ' must be a valid positive number') assert(math.floor(number) == number, name .. ' must be an integer') end local function present(value) return value and value ~= '' end -- splitByDot("a.bbc.d") == {"a", "bbc", "d"} local function splitByDot(str) str = str or "" local t, count = {}, 0 str:gsub("([^%.]+)", function(c) count = count + 1 t[count] = c end) return t end local function parsePrereleaseAndBuildWithSign(str) local prereleaseWithSign, buildWithSign = str:match("^(-[^+]+)(+.+)$") if not (prereleaseWithSign and buildWithSign) then prereleaseWithSign = str:match("^(-.+)$") buildWithSign = str:match("^(+.+)$") end assert(prereleaseWithSign or buildWithSign, ("The parameter %q must begin with + or - to denote a prerelease or a build"):format(str)) return prereleaseWithSign, buildWithSign end local function parsePrerelease(prereleaseWithSign) if prereleaseWithSign then local prerelease = prereleaseWithSign:match("^-(%w[%.%w-]*)$") assert(prerelease, ("The prerelease %q is not a slash followed by alphanumerics, dots and slashes"):format(prereleaseWithSign)) return prerelease end end local function parseBuild(buildWithSign) if buildWithSign then local build = buildWithSign:match("^%+(%w[%.%w-]*)$") assert(build, ("The build %q is not a + sign followed by alphanumerics, dots and slashes"):format(buildWithSign)) return build end end local function parsePrereleaseAndBuild(str) if not present(str) then return nil, nil end local prereleaseWithSign, buildWithSign = parsePrereleaseAndBuildWithSign(str) local prerelease = parsePrerelease(prereleaseWithSign) local build = parseBuild(buildWithSign) return prerelease, build end local function parseVersion(str) local sMajor, sMinor, sPatch, sPrereleaseAndBuild = str:match("^(%d+)%.?(%d*)%.?(%d*)(.-)$") assert(type(sMajor) == 'string', ("Could not extract version number(s) from %q"):format(str)) local major, minor, patch = tonumber(sMajor), tonumber(sMinor), tonumber(sPatch) local prerelease, build = parsePrereleaseAndBuild(sPrereleaseAndBuild) return major, minor, patch, prerelease, build end -- return 0 if a == b, -1 if a < b, and 1 if a > b local function compare(a,b) return a == b and 0 or a < b and -1 or 1 end local function compareIds(myId, otherId) if myId == otherId then return 0 elseif not myId then return -1 elseif not otherId then return 1 end local selfNumber, otherNumber = tonumber(myId), tonumber(otherId) if selfNumber and otherNumber then -- numerical comparison return compare(selfNumber, otherNumber) -- numericals are always smaller than alphanums elseif selfNumber then return -1 elseif otherNumber then return 1 else return compare(myId, otherId) -- alphanumerical comparison end end local function smallerIdList(myIds, otherIds) local myLength = #myIds local comparison for i=1, myLength do comparison = compareIds(myIds[i], otherIds[i]) if comparison ~= 0 then return comparison == -1 end -- if comparison == 0, continue loop end return myLength < #otherIds end local function smallerPrerelease(mine, other) if mine == other or not mine then return false elseif not other then return true end return smallerIdList(splitByDot(mine), splitByDot(other)) end local methods = {} function methods:nextMajor() return semver(self.major + 1, 0, 0) end function methods:nextMinor() return semver(self.major, self.minor + 1, 0) end function methods:nextPatch() return semver(self.major, self.minor, self.patch + 1) end local mt = { __index = methods } function mt:__eq(other) return self.major == other.major and self.minor == other.minor and self.patch == other.patch and self.prerelease == other.prerelease -- notice that build is ignored for precedence in semver 2.0.0 end function mt:__lt(other) if self.major ~= other.major then return self.major < other.major end if self.minor ~= other.minor then return self.minor < other.minor end if self.patch ~= other.patch then return self.patch < other.patch end return smallerPrerelease(self.prerelease, other.prerelease) -- notice that build is ignored for precedence in semver 2.0.0 end -- This works like the "pessimisstic operator" in Rubygems. -- if a and b are versions, a ^ b means "b is backwards-compatible with a" -- in other words, "it's safe to upgrade from a to b" function mt:__pow(other) if self.major == 0 then return self == other end return self.major == other.major and self.minor <= other.minor end local function new(major, minor, patch, prerelease, build) assert(major, "At least one parameter is needed") local result = { } if type(major) == 'string' then result.original = major major,minor,patch,prerelease,build = parseVersion(major) end patch = patch or 0 minor = minor or 0 checkPositiveInteger(major, "major") checkPositiveInteger(minor, "minor") checkPositiveInteger(patch, "patch") result.major = major result.minor = minor result.patch = patch result.prerelease = prerelease result.build = build return setmetatable(result, mt) end setmetatable(semver, { __call = function(_, ...) return new(...) end }) semver._VERSION= semver(semver._VERSION) return semver u*--[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --]] local ETH = {} -- number to octet (n2o), were number is a big integer -- in RLP the 0 is reppresented as the empty octet function ETH.n2o(num) if num == INT.new(0) then return O.new() else return num:octet() end end -- idem for octet to number (o2n) function ETH.o2n(o) if #o == 0 then return INT.new(0) else return INT.new(o) end end -- the empty octect is encoded as nil -- a table contains in the first position (i.e. 1) the number of elements function ETH.encodeRLP(data) local header = nil local res = nil local byt = nil if type(data) == 'zenroom.big' then data = ETH.n2o(data) end if type(data) == 'table' then -- empty octet res = O.new() for _, v in pairs(data) do res = res .. ETH.encodeRLP(v) end if #res < 56 then res = INT.new(192+#res):octet() .. res else -- Length of the result to be saved before the bytes themselves byt = INT.new(#res):octet() header = INT.new(247+#byt):octet() .. byt end elseif iszen(type(data)) then res = data:octet() -- index single bytes of an octet local byt = INT.new(0) if #res > 0 then byt = INT.new( res:chop(1) ) end if #res ~= 1 or byt >= INT.new(128) then if #res < 56 then header = INT.new(128+#res):octet() else -- Length of the result to be saved before the bytes themselves byt = INT.new(#res):octet() header = INT.new(183+#byt):octet() .. byt end end else error("Invalid data type for ETH RLP encoder: "..type(data)) end if header then res = header .. res end return res end -- i is the position from which we start to parse -- return a table with -- * res which is the content read -- * idx which is the position of the next byte to read local function decodeRLPgeneric(rlp, i) local byt, res, idx local u128 u128 = INT.new(128) byt = rlp:sub(i, i) idx=i+1 bytInt = tonumber(byt:hex(), 16) if bytInt < 128 then res = byt elseif bytInt <= 183 then idx = i+bytInt-128+1 if bytInt == 128 then res = O.new() else res = rlp:sub(i+1, idx-1) end elseif bytInt < 192 then local sizeEnd = bytInt-183; local size = tonumber(rlp:sub(i+1, i+sizeEnd):hex(), 16) idx = i+sizeEnd+size+1 res = rlp:sub(i+sizeEnd+1, idx-1) else -- it is a tuple local j if bytInt <= 247 then idx = i+bytInt-192+1 -- total number of bytes else -- decode big endian encoding local sizeEnd sizeEnd = bytInt-247; local size = tonumber(rlp:sub(i+1, i+sizeEnd):hex(), 16) idx = i+sizeEnd+size+1 i=i+sizeEnd end i=i+1 -- initial position j=1 -- index inside res res = {} -- decode the tuple in a table while i < idx do local readNext readNext = decodeRLPgeneric(rlp, i) res[j] = readNext.res j = j+1 i = readNext.idx end end return { res=res, idx=idx } end function ETH.decodeRLP(rlp) return decodeRLPgeneric(rlp, 1).res end function ETH.encodeTransaction(tx) local fields = {tx["nonce"], tx["gas_price"], tx["gas_limit"], tx["to"], tx["value"], tx["data"], tx["v"], tx["r"], tx["s"]} return ETH.encodeRLP(fields) end function ETH.decodeTransaction(rlp) local t = ETH.decodeRLP(rlp) return { nonce=ETH.o2n(t[1]), gas_price=ETH.o2n(t[2]), gas_limit=ETH.o2n(t[3]), to=t[4], value=ETH.o2n(t[5]), data=t[6], v=ETH.o2n(t[7]), r=t[8], s=t[9] } end -- modify the input transaction function ETH.encodeSignedTransaction(sk, tx) local H, txHash, sig, pk, x, y, two, res H = HASH.new('keccak256') txHash = H:process(ETH.encodeTransaction(tx)) sig, y = ECDH.sign_ecdh(sk, txHash) two = INT.new(2) res = tx res.v = two * INT.new(tx.v) + INT.new(35) + INT.new(y) % two res.r = INT.new(sig.r) res.s = INT.new(sig.s) return ETH.encodeTransaction(res) end -- Verify the signature of a transaction which implements EIP-155 -- Simple replay attack protection -- https://github.com/ethereum/EIPs/blob/master/EIPS/eip-155.md function ETH.verifySignatureTransaction(pk, txSigned) local fields, H, txHash, tx fields = {"nonce", "gasPrice", "gasLimit", "to", "value", "data"} -- construct the transaction which was signed tx = {} for _, v in pairs(fields) do tx[v] = txSigned[v] end tx["v"] = (txSigned["v"]-INT.new(35))/INT.new(2) tx["r"] = O.new() tx["s"] = O.new() H = HASH.new('keccak256') txHash = H:process(ETH.encodeTransaction(tx)) sig = { r=txSigned["r"], s=txSigned["s"] } return ECDH.verify_hashed(pk, txHash, sig, #txHash) end -- Assume we are given a smart contract with a function with the -- following signature -- function writeString(string memory) -- We send a string and the smart contract signals an event -- Smart contract -- // SPDX-License-Identifier: GPL-3.0 -- pragma solidity ^0.8.4; -- contract SaveString { -- event StringSaveEvent(address user, string content); -- function writeString(string memory content) public { -- emit StringSaveEvent(msg.sender, content); -- } -- } -- Taken from https://docs.soliditylang.org/en/v0.5.6/abi-spec.html#function-selector-and-argument-encoding function ETH.make_storage_data(src) local fId, offset, paddingLength, padding, bytLen, paddingLen -- local H = HASH.new('keccak256') -- string.sub(hex(H:process('storage(string)')), 1, 8) fId = O.from_hex('b374012b') -- dynamic parameter are saved at the end of string, this is at which offset they are saved offset = O.from_hex('0000000000000000000000000000000000000000000000000000000000000020') -- length as a 256 unsigned integer bytLen = INT.new(#src):octet() paddingLength = 32-#bytLen paddingLen = O.zero(paddingLength) paddingLength = #src % 32 if paddingLength > 0 then paddingLength = 32 - paddingLength padding = O.zero(paddingLength) else padding = O.new() end -- done with padding return fId .. offset .. paddingLen .. bytLen .. src .. padding end -- generate an ethereum keypair function ETH.keygen() local kp = ECDH.keygen() -- the address is the keccak hash of the x concatenated with -- the y of the public key (without 04 at the beginning!) -- Taken from https://github.com/ethereumbook/ethereumbook/blob/develop/04keys-addresses.asciidoc -- in the section Ethereum Address -- or in the Yellow Paper -- Warning: we take only the last 20bytes of the hash (...) return { address=ETH.address_from_public_key(kp.public), private=kp.private, } end function ETH.address_from_public_key(pk) local H = HASH.new('keccak256') return H:process(pk:sub(2, #pk)):sub(13, 32) end -- Really simple data encoder, it only works with elementary types (for -- example ERC-20 only uses this kind of data types) function ETH.data_contract_builder(fz_name, params) local H = HASH.new('keccak256') if type(params) ~= 'table' then params = {} end local signature = fz_name .. '(' .. table.concat(params, ",") .. ')' local f_id = O.from_hex(string.sub(hex(H:process(signature)), 1, 8)) return function(...) local args = table.pack(...) local res = f_id for i, v in ipairs(params) do -- I don't check the range of values (for bool the input should be 0 or 1), -- while for int should be 0 ... 2^()-1 if string.match(v, 'uint%d+') or v == 'address' then res = res .. BIG.new(args[i]):fixed(32) elseif v == 'bool' then res = res .. BIG.new(fif(args[i], 1, 0)):fixed(32) end end return res end end function ETH.contract_return_builder(params) if type(params) ~= 'table' then params = {} end -- @param val string or octet with the value returned by the contract return function(val) if type(val) == 'string' then val = string.gsub(val, '^0x', '') val = O.from_hex(val) end assert(type(val) == 'zenroom.octet') local res = {} for i, v in ipairs(params) do -- I don't check the range of values (for bool the input should be 0 or 1), -- while for int should be 0 ... 2^()-1 if v == 'address' or string.match(v, '^uint%d+$') then table.insert(res, BIG.new(val:sub(32 * (i-1)+1, 32 * i))) elseif v == 'bool' then table.insert(res, BIG.new(val:sub(32 * (i-1)+1, 32 * i)) ~= BIG.new(0)) elseif v == 'string' then -- TODO: don't know the maximum size of argument -- there could be an overflow local offset = tonumber(val:sub(32 * (i-1)+1, 32 * i):hex(), 16) local slen = tonumber(val:sub(1+offset, 32+offset):hex(), 16) local s = val:sub(1+offset+32, offset+32+slen):string() table.insert(res, s) else assert(false, "Unknown data type") end end return res end end -- methods with the modifier "view" have to be executed (locally) with -- eth_call, they don't change the blockchain -- the i property are the input parameter -- the o property is (are) the output return types local ERC20_SIGNATURES = { balanceOf = { i={'address'}, o={'uint256'}, view=true }, transfer = { i={'address', 'uint256'}, o={'bool'} }, approve = { i={'address', 'uint256'}, o={'bool'} }, allowance = { i={'address', 'address'}, view=true, o={'uint256'} }, transferFrom = { i={'address', 'address', 'uint256'}, o={'bool'} }, decimals = { o={'uint8'}, view=true }, name = { o={'string'}, view=true }, symbol = { o={'string'}, view=true }, totalSupply = { o={'uint256'}, view=true }, } ETH.erc20 = {} for k, v in pairs(ERC20_SIGNATURES) do ETH.erc20[k] = ETH.data_contract_builder(k, v.i) end ETH.erc20return = {} for k, v in pairs(ERC20_SIGNATURES) do ETH.erc20return[k] = ETH.contract_return_builder(v.o) end local FAUCET_SIGNATURES = { transfer = { i={'address'} }, } ETH.faucet = {} for k, v in pairs(FAUCET_SIGNATURES) do ETH.faucet[k] = ETH.data_contract_builder(k, v.i) end return ETH %2--[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Friday, 26th November 2021 --]] --- WHEN -- nop to terminate IF blocks When("done", function() end) IfWhen("'' is found", function(n) have(n) end) IfWhen("'' is not found", function(n) ZEN.assert(ACK[n] == nil, "Object should not be found: "..n) end) When("append '' to ''", function(src, dest) local val = have(src) local dst = have(dest) -- if the destination is a number, fix the encoding to string if luatype(dst) == 'number' then dst = tostring(dst) ZEN.CODEC[dest].encoding = "string" ZEN.CODEC[dest].luatype = "string" ZEN.CODEC[dest].zentype = "element" end dst = dst .. val if luatype(dst) == 'string' then ACK[dest] = O.from_string(dst) else ACK[dest] = dst end end) When("create the ''", function(dest) empty (dest) ACK[dest] = { } ZEN.CODEC[dest] = guess_conversion(ACK[dest], dest) ZEN.CODEC[dest].name = dest end) When("create the '' named ''", function(sch, name) empty(name) ACK[name] = { } ZEN.CODEC[name] = guess_conversion(ACK[name], sch) ZEN.CODEC[name].name = name end) -- simplified exception for I write: import encoding from_string ... When("write string '' in ''", function(content, dest) empty(dest) ACK[dest] = O.from_string(content) ZEN.CODEC[dest] = new_codec(dest, {encoding = 'string', luatype = 'string', zentype = 'element' }) end) -- ... and from a number When("write number '' in ''", function(content, dest) empty(dest) -- TODO: detect number base 10 local num = tonumber(content) ZEN.assert(num, "Cannot convert value to number: "..content) if num > 2147483647 then error('Overflow of number object over 32bit signed size') -- TODO: maybe support unsigned native here end ACK[dest] = num ZEN.CODEC[dest] = new_codec(dest, {encoding = 'number', luatype = 'number', zentype = 'element' }) end) When("create the number from ''", function(from) empty'number' local get = have(from) local num = tonumber(O.to_string(get)) ZEN.assert(num, "Cannot convert object to number: "..from) if num > 2147483647 then error('Overflow of number object over 32bit signed size') -- TODO: maybe support unsigned native here end ACK.number = num ZEN.CODEC.number = new_codec('number', {encoding = 'number', luatype = 'number', zentype = 'element' }) end) When("set '' to '' as ''", function(dest, content, format) empty(dest) local guess = input_encoding(format) guess.raw = content guess.name = dest if format == 'number' then ACK[dest] = tonumber( operate_conversion(guess) ) else ACK[dest] = operate_conversion(guess) end -- ZEN.CODEC[dest] = new_codec(dest, { luatype = luatype(ACK[dest]), zentype = 'element' }) end) When("create the cbor of ''", function(src) have(src) empty'cbor' ACK.cbor = OCTET.from_string( CBOR.encode(ACK[src]) ) end) When("create the json of ''", function(src) have(src) empty'json' ACK.json = OCTET.from_string( JSON.encode(ACK[src]) ) end) -- numericals When("set '' to '' base ''", function(dest, content, base) empty(dest) local bas = tonumber(base) ZEN.assert(bas, "Invalid numerical conversion for base: "..base) local num = tonumber(content,bas) ZEN.assert(num, "Invalid numerical conversion for value: "..content) ACK[dest] = num ZEN.CODEC[dest] = new_codec(dest, {encoding = 'number', luatype = 'number', zentype = 'element' }) end) local function _delete_f(name) have(name) ACK[name] = nil ZEN.CODEC[name] = nil end When("delete ''", _delete_f) When("remove ''", _delete_f) When("rename the '' to ''", function(old,new) have(old) empty(new) ACK[new] = ACK[old] ACK[old] = nil ZEN.CODEC[new] = ZEN.CODEC[old] ZEN.CODEC[old] = nil end) When("rename '' to ''", function(old,new) have(old) empty(new) ACK[new] = ACK[old] ACK[old] = nil ZEN.CODEC[new] = ZEN.CODEC[old] ZEN.CODEC[old] = nil end) When("rename the object named by '' to ''", function(old,new) local oldo = have(old) local olds = oldo:octet():string() have(olds) empty(new) ACK[new] = ACK[olds] ACK[olds] = nil ZEN.CODEC[new] = ZEN.CODEC[olds] ZEN.CODEC[olds] = nil end) When("rename '' to named by ''", function(old,new) have(old) local newo = have(new) local news = newo:octet():string() empty(news) ACK[news] = ACK[old] ACK[old] = nil ZEN.CODEC[news] = ZEN.CODEC[old] ZEN.CODEC[old] = nil end) When("rename the object named by '' to named by ''", function(old,new) local oldo = have(old) local olds = oldo:octet():string() have(olds) local newo = have(new) local news = newo:octet():string() empty(news) ACK[news] = ACK[olds] ACK[olds] = nil ZEN.CODEC[news] = ZEN.CODEC[olds] ZEN.CODEC[olds] = nil end) When("copy the '' to ''", function(old,new) have(old) empty(new) ACK[new] = deepcopy(ACK[old]) new_codec(new, { }, old) end) When("copy '' to ''", function(old,new) have(old) empty(new) ACK[new] = deepcopy(ACK[old]) new_codec(new, { }, old) end) When("copy contents of '' in ''", function(src,dst) local obj = have(src) have(dst) for k, v in pairs(obj) do ACK[dst][k] = v -- no deepcopy -- no new codec (using dst) end end) When("copy contents of '' named '' in ''", function(src,name,dst) local obj = have(src) have(dst) for k, v in pairs(obj) do if k == name then ACK[dst][k] = v -- no deepcopy end -- no new codec (using dst) end end) When("copy the '' in '' to ''", function(old,inside,new) ZEN.assert(ACK[inside][old], "Object not found: "..old.." inside "..inside) empty(new) ACK[new] = deepcopy(ACK[inside][old]) new_codec(new, { }, inside) end) When("split the rightmost '' bytes of ''", function(len, src) local obj = have(src) empty'rightmost' local s = tonumber(len) ZEN.assert(s, "Invalid number arg #1: "..type(len)) local l,r = OCTET.chop(obj,#obj-s) ACK.rightmost = r ACK[src] = l new_codec('rightmost', { }, src) end) When("split the leftmost '' bytes of ''", function(len, src) local obj = have(src) empty'leftmost' local s = tonumber(len) ZEN.assert(s, "Invalid number arg #1: "..type(len)) local l,r = OCTET.chop(obj,s) ACK.leftmost = l ACK[src] = r new_codec('leftmost', { }, src) end) local function _numinput(num) local t = type(num) if not iszen(t) then if t == 'table' then -- TODO: only numbers supported, not zenroom.big local aggr = 0 for _,v in pairs(num) do aggr = aggr + _numinput(v) end return aggr, false elseif t ~= 'number' then error('Invalid numeric type: ' .. t, 2) end return num, false end if t == 'zenroom.octet' then return BIG.new(num), true elseif t == 'zenroom.big' then return num, true else return BIG.new(num:octet()), true -- may give internal errors end error("Invalid number", 2) return nil, false end -- escape math function overloads for pointers local function _add(l,r) return(l + r) end local function _sub(l,r) return(l - r) end local function _mul(l,r) return(l * r) end local function _div(l,r) return(l / r) end local function _mod(l,r) return(l % r) end local function _math_op(op, l, r) local left, lz = _numinput(l) local right, rz = _numinput(r) if lz ~= rz then error("Incompatible numeric arguments", 2) end local codec ACK.result = true -- new_codec checks existance if lz and rz then codec = new_codec('result', {encoding = CONF.output.encoding.name, luatype = 'string', zentype = 'big' }) else codec = new_codec('result', {encoding = 'number', luatype = 'number', zentype = 'element' }) end return op(left, right), codec end When("create the result of '' inverted sign", function(left) local l = have(left) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_sub, 0, l) end) When("create the result of '' + ''", function(left,right) local l = have(left) local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_add, l, r) end) When("create the result of '' in '' + ''", function(left, dict, right) local d = have(dict) local l = d[left] local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_add, l, r) end) When("create the result of '' in '' + '' in ''", function(left, ldict, right, rdict) local ld = have(ldict) local l = ld[left] local rd = have(rdict) local r = rd[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_add, l, r) end) When("create the result of '' - ''", function(left,right) local l = have(left) local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_sub, l, r) end) When("create the result of '' in '' - ''", function(left, dict, right) local d = have(dict) local l = d[left] local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_sub, l, r) end) When("create the result of '' in '' - '' in ''", function(left, ldict, right, rdict) local ld = have(ldict) local l = ld[left] local rd = have(rdict) local r = rd[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_sub, l, r) end) When("create the result of '' * ''", function(left,right) local l = have(left) local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mul, l, r) end) When("create the result of '' in '' * ''", function(left, dict, right) local d = have(dict) local l = d[left] local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mul, l, r) end) When("create the result of '' * '' in ''", function(left, right, dict) local l = have(left) local d = have(dict) local r = d[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mul, l, r) end) When("create the result of '' in '' * '' in ''", function(left, ldict, right, rdict) local ld = have(ldict) local l = ld[left] local rd = have(rdict) local r = rd[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mul, l, r) end) When("create the result of '' / ''", function(left,right) local l = have(left) local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_div, l, r) end) When("create the result of '' in '' / ''", function(left, dict, right) local d = have(dict) local l = d[left] local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_div, l, r) end) When("create the result of '' / '' in ''", function(left, right, dict) local l = have(left) local d = have(dict) local r = d[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_div, l, r) end) When("create the result of '' in '' / '' in ''", function(left, ldict, right, rdict) local ld = have(ldict) local l = ld[left] local rd = have(rdict) local r = rd[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_div, l, r) end) When("create the result of '' % ''", function(left,right) local l = have(left) local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mod, l, r) end) When("create the result of '' in '' % ''", function(left, dict, right) local d = have(dict) local l = d[left] local r = have(right) empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mod, l, r) end) When("create the result of '' in '' % '' in ''", function(left, ldict, right, rdict) local ld = have(ldict) local l = ld[left] local rd = have(rdict) local r = rd[right] empty 'result' ACK.result, ZEN.CODEC.result = _math_op(_mod, l, r) end) -- TODO: -- When("set '' as '' with ''", function(dest, format, content) end) -- When("append '' as '' to ''", function(content, format, dest) end) -- When("write '' as '' in ''", function(content, dest) end) -- implicit conversion as string -- https://github.com/dyne/Zenroom/issues/175 When("remove zero values in ''", function(target) have(target) ACK[target] = deepmap(function(v) if luatype(v) == 'number' then if v == 0 then return nil else return v end else return v end end, ACK[target]) end) -- When("remove all empty strings in ''", function(target) -- have(target) -- ACK[target] = deepmap(function(v) if trim(v) == '' then return nil end, ACK[target]) -- end) ~--[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 27th November 2021 --]] local _UNRESERVED = "A-Za-z0-9%-._~" local _GEN_DELIMS = ":/?#%[%]@" local _SUB_DELIMS = "!$&'()*+,;=" local _RESERVED = _GEN_DELIMS .. _SUB_DELIMS local _REG_NAME = "^[" .. _UNRESERVED .. "%%" .. _SUB_DELIMS .. "]*$" local _IP_FUTURE_LITERAL = "^v[0-9A-Fa-f]+%." .. "[" .. _UNRESERVED .. _SUB_DELIMS .. "]+$" local function _normalize_percent_encoding (s) if s:find("%%$") or s:find("%%.$") then error("unfinished percent encoding at end of URI '" .. s .. "'") end return s:gsub("%%(..)", function (hex) if not hex:find("^[0-9A-Fa-f][0-9A-Fa-f]$") then error("invalid percent encoding '%" .. hex .. "' in URI '" .. s .. "'") end -- Never percent-encode unreserved characters, and always use uppercase -- hexadecimal for percent encoding. RFC 3986 section 6.2.2.2. local char = string.char(tonumber("0x" .. hex)) return char:find("^[" .. _UNRESERVED .. "]") and char or "%" .. hex:upper() end) end local function _is_ip4_literal (s) if not s:find("^[0-9]+%.[0-9]+%.[0-9]+%.[0-9]+$") then return false end for dec_octet in s:gmatch("[0-9]+") do if dec_octet:len() > 3 or dec_octet:find("^0.") or tonumber(dec_octet) > 255 then return false end end return true end local function _is_ip6_literal (s) local had_elipsis = false -- true when '::' found local num_chunks = 0 while s ~= "" do num_chunks = num_chunks + 1 local p1, p2 = s:find("::?") local chunk if p1 then chunk = s:sub(1, p1 - 1) s = s:sub(p2 + 1) if p2 ~= p1 then -- found '::' if had_elipsis then return false end -- two of '::' had_elipsis = true if chunk == "" then num_chunks = num_chunks - 1 end else if chunk == "" then return false end -- ':' at start if s == "" then return false end -- ':' at end end else chunk = s s = "" end -- Chunk is neither 4-digit hex num, nor IPv4address in last chunk. if (not chunk:find("^[0-9a-f]+$") or chunk:len() > 4) and (s ~= "" or not _is_ip4_literal(chunk)) and chunk ~= "" then return false end -- IPv4address in last position counts for two chunks of hex digits. if chunk:len() > 4 then num_chunks = num_chunks + 1 end end if had_elipsis then if num_chunks > 7 then return false end else if num_chunks ~= 8 then return false end end return true end local function _is_valid_host (host) if string.find(host,"^%[.*%]$") then local ip_literal = host:sub(2, -2) if ip_literal:find("^v") then if not ip_literal:find(_IP_FUTURE_LITERAL) then return "invalid IPvFuture literal '" .. ip_literal .. "'" end else if not _is_ip6_literal(ip_literal) then return "invalid IPv6 address '" .. ip_literal .. "'" end end elseif not _is_ip4_literal(host) and not host:find(_REG_NAME) then return "invalid host value '" .. host .. "'" end return nil end When("create the url from ''", function(src) local obj = have(src) local url = obj:str():lower() empty'url' local proto if url:sub(1,7)=='http://' then proto = 'http://' end if url:sub(1,8)=='https://' then proto = 'https://' end ZEN.assert(proto, "Invalid http prefix in url: "..obj:str()) local toks = strtok(url, '[^/]+') -- second is the host local res = _is_valid_host(toks[2]) ZEN.assert(not res, res) ACK.url = obj new_codec('url',{zentype='element',content='url', encoding='string'}) end) When("append '' as http request to ''", function(ele, dst) local arg = have(ele):str():lower() local url = have(dst):str():lower() local codec = ZEN.CODEC[dst] ZEN.assert(codec.content=='url', "Cannot append http request to invalid url: "..dst) local separator = fif( url:find('?'), '&', '?' ) ACK[dst] = O.from_string( url .. separator .. _normalize_percent_encoding(ele) .. '=' .. _normalize_percent_encoding(arg) ) end) /--[[ --This file is part of zenroom -- --Copyright (C) 2018-2022 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 27th November 2021 --]] -- random operations, mostly on arrays and schemas supported When("create the random ''", function(dest) ZEN.assert(not ACK[dest], "Cannot overwrite existing value: "..dest) ACK[dest] = OCTET.random(32) -- TODO: right now hardcoded 256 bit random secrets end) function shuffle_array_f(tab) -- do not enforce CODEC detection since some schemas are also 1st level arrays local count = isarray(tab) ZEN.assert( count > 0, "Randomized object is not an array") local res = { } for i = count,2,-1 do local r = (random_int16() % i)+1 table.insert(res,tab[r]) -- limit 16bit lenght for arrays table.remove(tab, r) end table.insert(res,tab[1]) return res end -- random and hashing operations When("create the random object of '' bits", function(n) empty'random object' local bits = tonumber(n) ZEN.assert(bits, 'Invalid number of bits: ' .. n) ACK.random_object = OCTET.random(math.ceil(bits / 8)) new_codec('random_object', { zentype = 'element' }) end ) When("create the random object of '' bytes",function(n) empty'random object' local bytes = math.ceil(tonumber(n)) ZEN.assert(bytes, 'Invalid number of bytes: ' .. n) ACK.random_object = OCTET.random(bytes) new_codec('random_object', { zentype = 'element' }) end ) When("randomize the '' array", function(arr) local A = ACK[arr] ZEN.assert(A, "Object not found: "..arr) -- ZEN.assert(ZEN.CODEC[arr].zentype == 'array', "Object is not an array: "..arr) ACK[arr] = shuffle_array_f(A) end) When("create the array of '' random objects", function(s) ZEN.assert(not ACK.array, "Cannot overwrite existing object: ".."array") ACK.array = { } for i = s,1,-1 do table.insert(ACK.array,OCTET.random(64)) end new_codec('array', { luatype = 'table', zentype = 'array'}) end) When("create the array of '' random objects of '' bits", function(s, b) empty'array' ACK.array = { } local q = tonumber(s) ZEN.assert(q, "Argument is not a number: "..s) local bits = tonumber(b) local bytes = math.ceil(bits/8) for i = q,1,-1 do table.insert(ACK.array,OCTET.random(bytes)) end new_codec('array', { luatype = 'table', zentype = 'array'}) end) When("create the array of '' random objects of '' bytes", function(s, b) empty'array' ACK.array = { } local q = tonumber(s) ZEN.assert(q, "Argument is not a number: "..s) local bytes = math.ceil(tonumber(b)) for i = q,1,-1 do table.insert(ACK.array,OCTET.random(bytes)) end new_codec('array', { luatype = 'table', zentype = 'array'}) end) When("create the array of '' random numbers", function(s) ZEN.assert(not ACK.array, "Cannot overwrite existing object: ".."array") ACK.array = { } for i = s,1,-1 do table.insert(ACK.array,tonumber(random_int16())) end new_codec('array', { luatype = 'table', zentype = 'array', encoding = 'number' }) end) When("create the array of '' random numbers modulo ''", function(s,m) ZEN.assert(not ACK.array, "Cannot overwrite existing object: ".."array") ACK.array = { } for i = s,1,-1 do table.insert(ACK.array,math.floor(random_int16() % m)) end new_codec('array', { luatype = 'table', zentype = 'array', encoding = 'number' }) end) When("pick the random object in ''", function(arr) local A = have(arr) empty'random object' ZEN.assert(luatype(A) == 'table', "Object is not a table: "..arr) local tmp = { } local keys = { } for k,v in pairs(A) do table.insert(keys, k) table.insert(tmp, v) end local r = (random_int16() % #tmp) +1 ACK.random_object = tmp[r] new_codec('random_object', {name=keys[r]}) end) When("create the random dictionary with '' random objects from ''", function(num, from) local n = tonumber(num) if not n then n = tonumber(have(num)) end ZEN.assert(n, "Not a number and object not found"..num) local src = have(from) local dst = { } ZEN.assert(luatype(src) == 'table', "Object is not a table: "..from) for k,v in pairs(src) do if n == 0 then break end if tonumber(k) then table.insert(dst, v) else dst[k] = v end n = n - 1 end ACK.random_dictionary = dst new_codec('random_dictionary') end) | --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] -- limit output of string if too long function limit(anystr) local t = luatype(anystr) ZEN.assert(t=='string',"Argument to limit on-screen not a string") if #anystr > 32 then return(string.sub(anystr,1,32).."..") end return(anystr) end -- debug functions function debug_traceback() for k,v in pairs(ZEN.traceback) do warn(v) end end Given("backtrace", function() debug_traceback() end) When("backtrace", function() debug_traceback() end) Then("backtrace", function() debug_traceback() end) Given("trace", function() debug_traceback() end) When("trace", function() debug_traceback() end) Then("trace", function() debug_traceback() end) function debug_heap_dump() local HEAP = ZEN.heap() I.warn({a_GIVEN_in = HEAP.IN, b_GIVEN_in = HEAP.KIN, c_WHEN_ack = HEAP.ACK, d_THEN_out = HEAP.OUT}) end function debug_heap_schema() I.schema({SCHEMA = ZEN.heap()}) -- print only keys without values end -- local function debug_obj_dump() -- local function debug_obj_schema() Given("debug", function() ZEN.debug() end) When("debug", function() ZEN.debug() end) Then("debug", function() ZEN.debug() end) Given("schema", function() debug_heap_schema() end) When("schema", function() debug_heap_schema() end) Then("schema", function() debug_heap_schema() end) function debug_codec() I.warn({CODEC = ZEN.CODEC}) end Given("codec", function() debug_codec() end) When("codec", function() debug_codec() end) Then("codec", function() debug_codec() end) Given("config", function() I.warn(_G["CONF"]) end) When("config", function() I.warn(_G["CONF"]) end) Then("config", function() I.warn(_G["CONF"]) end) --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda and Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local ecdh = require'ecdh' function ecdh.compress_public_key(public) local x, y = ECDH.pubxy(public) local pfx = fif( BIG.parity(BIG.new(y) ), OCTET.from_hex('03'), OCTET.from_hex('02') ) local pk = pfx .. x return pk end function ecdh.uncompress_public_key(public) local p = BIG.new(O.from_hex('fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f')) local e = BIG.new(O.from_hex('3fffffffffffffffffffffffffffffffffffffffffffffffffffffffbfffff0c')) local parity = public:sub(1,1) assert(parity == O.from_hex('02') or parity == O.from_hex('03')) local x = BIG.new(public:sub(2, #public)) -- y*y = x*x*x + 7 local rhs = BIG.mod(BIG.modmul(BIG.modmul(x,x,p),x,p)+BIG.new(7),p) local sqrt_rhs = rhs:modpower(e, p) assert(BIG.modmul(sqrt_rhs,sqrt_rhs, p) == rhs) if sqrt_rhs:parity() ~= (parity == O.from_hex('03')) then -- this is a xor sqrt_rhs = sqrt_rhs:modneg(p) end return O.from_hex('04') .. x .. sqrt_rhs end -- it is similar to sign eth, s < order/2 function ecdh.sign_ecdh(sk, data) local halfSecp256k1n = INT.new(hex('7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0')) local sig sig = nil repeat sig, y = ECDH.sign_hashed(sk, data, #data) until(INT.new(sig.s) < halfSecp256k1n); return sig, y end -- Compute the compressed public key (pubc) from the secret key function ecdh.sk_to_pubc(sk) if not #sk == 32 then error("Invalid ecdh private key size: "..#sk) end return( ECDH.compress_public_key( ECDH.pubgen(sk) ) ) end return ecdh --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local ecp2 = require'ecp2' require'fp12' -- FP12 implicit function ecp2.hashtopoint(s) return ecp2.mapit(sha512(s)) end function ecp2.random() return ecp2.mapit(OCTET.random(64)) end return ecp2  --[[ --This file is part of zenroom -- --Copyright (C) 2021 Dyne.org foundation --designed, written and maintained by Alberto Lerda -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --]] -- Tables supplied as arguments are not changed. -- Table to hold statistical functions stats={} -- Get the mean value of a table function stats.average( t ) local zero = BIG.new(0) local one = BIG.new(1) local sum = zero local count = zero for k,v in pairs(t) do local t = type(v) if t == 'number' then v = BIG.from_decimal(tostring(v)) elseif iszen(t) then v = BIG.from_decimal(v:octet():string()) else error("Unknown type for number", 2) end if type(v) == 'zenroom.big' then local newsum = sum + v count = count + one ZEN.assert(newsum > sum, "Overflow in sum") sum = newsum end end ZEN.assert(count > zero, "No numbers in array") return (sum / count) end -- Get the variance of a table function stats.variance( t ) local zero = BIG.new(0) local one = BIG.new(1) local m local vm local sum = zero local count = zero local result m = stats.average( t ) for k,v in pairs(t) do local t = type(v) if t == 'number' then v = BIG.from_decimal(tostring(v)) elseif iszen(t) then v = BIG.from_decimal(v:octet():string()) else error("Unknown type for number", 2) end if type(v) == 'zenroom.big' then local newsum vm = v - m newsum = sum + (vm * vm) ZEN.assert(newsum > sum, "Overflow in sum") count = count + one sum = newsum end end ZEN.assert(count > one, "Not enough numbers (at least 2)") result = sum / (count-one) return result end function stats.standardDeviation( t ) return BIG.sqrt(stats.variance( t )) end return stats eI --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Saturday, 13th November 2021 --]] --- Zencode data internals -- Used in scenario's schema declarations to cast to zenroom. type ZEN.get = function(obj, key, conversion, encoding) if type(key) ~= 'string' then error('ZEN.get key is not a string', 2) end if conversion and type(conversion) ~= 'function' then error('ZEN.get invalid conversion function', 2) end if encoding and type(encoding) ~= 'function' then error('ZEN.get invalid encoding function', 2) end local k if not obj then -- take from IN root -- does not support to pick in WHO (use of 'my') k = KIN[key] or IN[key] else if key == '.' then k = obj else k = obj[key] end end if not k then error('Key not found in object conversion: ' .. key, 2) end local res = nil local t = type(k) if iszen(t) and conversion then res = conversion(k) goto ok end if iszen(t) and not conversion then res = k goto ok end if t == 'string' then if encoding then res = encoding(k) else res = CONF.input.encoding.fun(k) end if conversion then res = conversion(res) end goto ok end if t == 'number' then res = k end if t == 'table' then if encoding then res = deepmap(encoding, k) else res = deepmap(CONF.input.encoding.fun, k) end if conversion then res = deepmap(conversion, res) end end ::ok:: assert( ZEN.OK and res, 'ZEN.get on invalid key: ' .. key .. ' (' .. t .. ')', 2) return res end -- return leftmost and rightmost if definition string indicates -- a lua table: dictionary, array or schema local function expect_table(definition) local toks = strtok(definition, '[^_]+') local res = { rightmost = toks[#toks] } if res.rightmost == 'array' or res.rightmost == 'dictionary' then res.leftwords = '' -- concat all left words in toks minus the last for i = 1, #toks - 2 do res.leftwords = res.leftwords .. toks[i] .. '_' end res.leftwords = uscore( res.leftwords .. toks[#toks - 1] ) -- no trailing underscore return res end -- schemas may or may be not tables end --- Given block (IN read-only memory) -- @section Given --- -- Guess how to convert the object, using what format or schema -- check the definition string (coming straight from zencode) -- considering the type of the object: -- ``` -- type def conv -- ------------------------------------------------------ -- schema schema_f(===, default_encoding) -- str format input_encoding(format) -- num input_encoding(number) -- table f dict deepmap(table, input_encoding(f)) -- table f array deepmap(table, input_encoding(f)) -- ``` -- returns a table with function pointers and string desc that -- will be used by @{operate_conversion} -- { fun = conversion function pointer -- conversion = conversion string description -- check = check function pointer -- raw = raw data pointer -- (name) = key name of data (set externally) -- (root) = root section name (set externally) -- luatype = type of raw data for lua -- zentype = type of data for zenroom (array, dict, element, schema) -- } function guess_conversion(obj, definition) local t local objtype = luatype(obj) local res if not definition then error("Cannot take undefined object, found a "..type(obj), 3) end -- a defined schema overrides any other conversion t = ZEN.schemas[definition] if t then -- complex schema is a table specfying in/out conversions as: {import=fun, export=fun} local c = fif(luatype(t)=='table', 'complex', CONF.output.encoding.name) -- default is always the configured output encoding return ({ fun = t, zentype = 'schema', luatype = objtype, raw = obj, encoding = c }) end if objtype == 'string' then if expect_table(definition) then error("Cannot take object: expected '"..definition.."' but found '"..objtype.."' (not a table)",3) end res = input_encoding(definition) res.luatype = 'string' res.zentype = 'element' res.raw = obj return (res) end -- definition: value_encoding .. data_type -- value_encoding: base64, hex, etc. -- data_type: array, dictionary, structure if objtype == 'table' then local def = expect_table(definition) if not def then -- check if the last word is among zentype collections error("Cannot take object: expected '"..definition .."' but found '"..objtype.."' (not a dictionary or array)",3) end -- schema type in array or dict t = ZEN.schemas[ def.leftwords ] if t then return ({ fun = t, zentype = 'schema', schema = def.leftwords, luatype = objtype, raw = obj, encoding = def.rightmost }) end -- normal type in input encoding: string, base64 etc. res = input_encoding(def.leftwords) if res then res.luatype = 'table' res.zentype = def.rightmost -- zentypes couples with table res.raw = obj return (res) end error("Cannot take object: invalid "..def.rightmost.." with encoding "..def.leftwords, 3) return nil end if objtype == 'number' or tonumber(obj) then if expect_table(definition) then error("Cannot take object: expected '"..definition.."' but found '"..objtype.."' (not a table)",3) elseif definition ~= 'number' then error("Cannot take object: expected '"..definition.."' but found '"..objtype.."'",3) end res = input_encoding(objtype) res.luatype = 'number' res.zentype = 'element' if obj > 2147483647 then error('Overflow of number object over 32bit signed size', 3) -- TODO: maybe support unsigned native here end res.raw = obj -- any type of additional conversion from a native number -- detected at input can happen here, for instance using a new -- native unsigned integer return (res) end error('Cannot take object: invalid conversion for type '..objtype..': '..definition, 3) return nil end -- takes a data object and the guessed structure, operates the -- conversion and returns the resulting raw data to be used inside the -- WHEN block in HEAP. function operate_conversion(guessed) if not guessed.fun then error('No conversion operation guessed', 2) return nil end -- carry guessed detection in CODEC ZEN.CODEC[guessed.name] = { name = guessed.name, encoding = guessed.encoding, zentype = guessed.zentype, luatype = guessed.luatype, root = guessed.root } -- TODO: make xxx print to stderr! -- xxx('Operating conversion on: '..guessed.name) if guessed.zentype == 'schema' then -- error('Invalid schema conversion for encoding: '..guessed.encoding, 2) local res = {} if guessed.encoding == 'array' then for _,v in pairs(guessed.raw) do table.insert(res, guessed.fun(v)) end return(res) elseif guessed.encoding == 'dictionary' then for k, v in pairs(guessed.raw) do res[k] = guessed.fun(v[guessed.schema]) end return (res) elseif guessed.encoding == 'complex' then return guessed.fun.import(guessed.raw) else return guessed.fun(guessed.raw) end elseif guessed.luatype == 'table' then -- TODO: better error checking on deepmap? if luatype(guessed.check) == 'function' then deepmap(guessed.check, guessed.raw) end return deepmap(guessed.fun, guessed.raw) else -- object if guessed.check then guessed.check(guessed.raw) end return guessed.fun(guessed.raw) end end -- factory function to generate a function and return its pointer the -- function is generated using another pointer to function which is -- the encoder, plus it applies common safety checks for data types -- that must be excluded for encoding, as for instance numbers and -- booleans. -- arguments: encoder's name, conversion and check functions local function f_factory_encoder(encoder_n, encoder_f, encoder_c) return { fun = function(data) local dt = luatype(data) if dt == 'number' then return data elseif dt == 'boolean' then return data end return encoder_f(data) end, encoding = encoder_n, check = encoder_c } end -- gets a string and returns the associated function, string and prefix -- comes before schema check function input_encoding(what) if not luatype(what) == 'string' then error("Call to input_encoding argument is not a string: "..type(what),2) end if what == 'u64' or what == 'url64' then return f_factory_encoder('url64', O.from_url64, O.is_url64) elseif what == 'b64' or what =='base64' then return f_factory_encoder('base64', O.from_base64, O.is_base64) elseif what == 'b58' or what =='base58' then return f_factory_encoder('base58', O.from_base58, O.is_base58) elseif what == 'hex' then return f_factory_encoder('hex', O.from_hex, O.is_hex) elseif what == 'bin' or what == 'binary' then return f_factory_encoder('binary', O.from_bin, O.is_bin) elseif what == 'str' or what == 'string' then -- string has no check function return f_factory_encoder('string', O.from_string, nil) elseif what =='mnemonic' then -- mnemonic has no check function (TODO:) return f_factory_encoder('mnemonic', O.from_mnemonic, nil) elseif what == 'num' or what == 'number' then return f_factory_encoder('number', function(data) return tonumber(data) end, function(data) if not tonumber(data) then error("Invalid encoding, not a number: " ..type(data), 3) end end) end error("Input encoding not found: " .. what, 2) return nil end -- factory function returns a small outcast function that applies -- return guessed.fun(guessed.raw)safety checks on values like -- exceptions for numbers and booleans local function f_factory_outcast(fun) return function(data) local dt = luatype(data) -- passthrough native number data if dt == 'number' or dt == 'boolean' then return data elseif iszen(dt) and dt ~= 'zenroom.octet' then -- leverage first class citizen method on zenroom data return fun(data:octet()) end return fun(data) end end -- takes a string returns the function, good for use in deepmap(fun,table) function guess_outcast(cast) if not cast then error('guess_outcast called with nil argument', 2) end if luatype(cast) ~= 'string' then error('guess_outcast called with wrong argument: '..type(cast), 3) end if cast == 'string' then return f_factory_outcast(O.to_string) elseif cast == 'hex' then return f_factory_outcast(O.to_hex) elseif cast == 'base64' then return f_factory_outcast(O.to_base64) elseif cast == 'url64' then return f_factory_outcast(O.to_url64) elseif cast == 'base58' then return f_factory_outcast(O.to_base58) elseif cast == 'binary' or cast == 'bin' then return f_factory_outcast(O.to_bin) elseif cast == 'mnemonic' then return f_factory_outcast(O.to_mnemonic) elseif cast == 'number' then return f_factory_outcast(tonumber) elseif cast == 'boolean' then return function(data) return data end end -- try schemas local fun = ZEN.schemas[uscore(cast, ' ', '_')] if luatype(fun) == 'table' then -- complex schema encoding assert(luatype(fun.export) == 'function', "Guess outcast cannot find schema export") return fun.export else return CONF.output.encoding.fun end error('Invalid output conversion: ' .. cast, 2) return nil end function get_format(what) if what == 'json' or what == 'JSON' then return { fun = JSON.auto, name = 'json' } elseif what == 'cbor' or what == 'CBOR' then return { fun = CBOR.auto, name = 'cbor' } end error("Conversion format not supported: "..what, 2) return nil end -- CODEC format: -- { name: string, -- encoding: encoder name string or 'complex' handled by schema -- zentype: zencode type: element, array, dictionary or schema -- luatype: lua type (string, number, table or userdata) -- schema: schema name used to import (may differ from name) -- } -- return: name of codec encoding function check_codec(name) if not ZEN.CODEC then return CONF.output.encoding.name end if not ZEN.CODEC[name] then xxx('Object has no CODEC registration: ' .. name) return CONF.output.encoding.name end local codec = ZEN.CODEC[name] if codec.zentype == 'schema' then if codec.encoding == 'complex' then local sch = codec.schema or codec.name assert(ZEN.schemas[sch], "Complex export for schema not found: "..name) assert(luatype(ZEN.schemas[sch].export) == 'function', "Complex export for schema is not a function: "..name) return name -- name of schema itself as it contains export end else return codec.encoding or CONF.output.encoding.name end return CONF.output.encoding.name end function new_codec(cname, parameters, clone) if not cname then error("Missing name in new codec", 2) end local name = fif(luatype(cname) == 'string', uscore(cname), cname) -- may be a numerical index if not ACK[name] then error("Cannot create codec, object not found: "..name, 2) end if ZEN.CODEC[name] then error("Cannot overwrite ZEN.CODEC."..name, 2) end local res if clone and not ZEN.CODEC[clone] then error("Clone not found in ZEN.CODEC."..clone, 2) end if ZEN.CODEC[clone] then res = deepcopy(ZEN.CODEC[clone]) res.name = name else res = { name = name } end -- overwrite with paramenters in argument if parameters then for k,v in pairs(parameters) do res[k] = v end end -- detect zentype and luatype if not res.luatype then res.luatype = luatype(ACK[name]) end if not res.zentype then if res.luatype == 'table' then if isdictionary(ACK[name]) then res.zentype = 'dictionary' elseif isarray(ACK[name]) then res.zentype = 'array' else error("Unknown zentype for lua table: "..name, 2) end else res.zentype = 'element' end end ZEN.CODEC[name] = res return(res) -- redundant, should not use return value for efficiency end -- Crawls a whole table structure and collects all strings and octets -- contained in its keys and values. Converts numbers to -- strings. Structure returned is: -- { octets = zenroom.octet -- strings = string } -- calling function may want to convert all to octet or string -- -- apply a function on all keys and values of a tree structure -- uses sorted listing for deterministic order local function sort_apply(fun,t,...) if luatype(fun) ~= 'function' then error("Internal error: apply 1st argument is not a function", 3) return nil end -- if luatype(t) == 'number' then -- return t end if luatype(t) ~= 'table' then error("Internal error: apply 2nd argument is not a table", 3) return nil end for k,v in sort_pairs(t) do -- OPTIMIZATION: was sort_pairs if luatype(v) == 'table' then sort_apply(fun,v,...) -- recursion else fun(v,k,...) end end end function serialize(tab) assert(luatype(tab) == 'table', 'Cannot serialize: not a table', 2) local octets = OCTET.zero(1) local strings = { 'K' } sort_apply( function(v, k) table.insert(strings, tostring(k)) if iszen(type(v)) then -- TODO: optimize octet concatenation in C -- to avoid reallocation of new octets in this loop -- should count total length allocate one and insert octets = octets.. v:octet() else -- number table.insert(strings, tostring(v)) end end, tab ) return { octets = octets, -- string concatenation is optimized strings = table.concat(strings) } end -- eliminate all empty string objects "" and all empty dictionaries -- (containing only empy objects), uses recursion into tables function prune(tab) assert(luatype(tab) == 'table', 'Cannot prune: not a table', 2) local pruned_values = deepmap(function(v) if #v == 0 then return nil else return v end end, tab) local function prune_in(ttab) local res = { } local next = next local luatype = luatype for k,v in pairs(ttab) do if luatype(v) == 'table' then if next(v) == nil then res[k] = nil -- {} to nil else res[k] = prune_in(v) -- recursion end else res[k] = v end end return setmetatable(res, getmetatable(ttab)) end pruned_tables = prune_in(pruned_values) return pruned_tables end --- -- Compare equality of two data objects (TODO: octet, ECP, etc.) -- @function ZEN:eq(first, second) --- -- Check that the first object is greater than the second (TODO) -- @function ZEN:gt(first, second) --- -- Check that the first object is lesser than the second (TODO) -- @function ZEN:lt(first, second) --- Then block (OUT write-only memory) -- @section Then --- -- Move a generic data structure from ACK to OUT memory space, ready -- for its final JSON encoding and print out. -- @function ZEN:out(name) --- -- Move 'my own' data structure from ACK to OUT.whoami memory space, -- ready for its final JSON encoding and print out. -- @function ZEN:outmy(name) (--[[---------------------------------------------------------------------------- MessagePack encoder / decoder written in pure Lua 5.3 / Lua 5.4 written by Sebastian Steinhauer This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. For more information, please refer to --]]---------------------------------------------------------------------------- local pack, unpack = string.pack, string.unpack local mtype, utf8len = math.type, utf8.len local tconcat, tunpack = table.concat, table.unpack local ssub = string.sub local type, pcall, pairs, select = type, pcall, pairs, select --[[---------------------------------------------------------------------------- Encoder --]]---------------------------------------------------------------------------- local encode_value -- forward declaration local function is_an_array(value) local expected = 1 for k in pairs(value) do if k ~= expected then return false end expected = expected + 1 end return true end local encoder_functions = { ['nil'] = function() return pack('B', 0xc0) end, ['boolean'] = function(value) if value then return pack('B', 0xc3) else return pack('B', 0xc2) end end, ['number'] = function(value) if mtype(value) == 'integer' then if value >= 0 then if value < 128 then return pack('B', value) elseif value <= 0xff then return pack('BB', 0xcc, value) elseif value <= 0xffff then return pack('>BI2', 0xcd, value) elseif value <= 0xffffffff then return pack('>BI4', 0xce, value) else return pack('>BI8', 0xcf, value) end else if value >= -32 then return pack('B', 0xe0 + (value + 32)) elseif value >= -128 then return pack('Bb', 0xd0, value) elseif value >= -32768 then return pack('>Bi2', 0xd1, value) elseif value >= -2147483648 then return pack('>Bi4', 0xd2, value) else return pack('>Bi8', 0xd3, value) end end else local test = unpack('f', pack('f', value)) if test == value then -- check if we can use float return pack('>Bf', 0xca, value) else return pack('>Bd', 0xcb, value) end end end, ['string'] = function(value) local len = #value if utf8len(value) then -- check if it is a real utf8 string or just byte junk if len < 32 then return pack('B', 0xa0 + len) .. value elseif len < 256 then return pack('>Bs1', 0xd9, value) elseif len < 65536 then return pack('>Bs2', 0xda, value) else return pack('>Bs4', 0xdb, value) end else -- encode it as byte-junk :) if len < 256 then return pack('>Bs1', 0xc4, value) elseif len < 65536 then return pack('>Bs2', 0xc5, value) else return pack('>Bs4', 0xc6, value) end end end, ['table'] = function(value) if is_an_array(value) then -- it seems to be a proper Lua array local elements = {} for i, v in pairs(value) do elements[i] = encode_value(v) end local length = #elements if length < 16 then return pack('>B', 0x90 + length) .. tconcat(elements) elseif length < 65536 then return pack('>BI2', 0xdc, length) .. tconcat(elements) else return pack('>BI4', 0xdd, length) .. tconcat(elements) end else -- encode as a map local elements = {} for k, v in pairs(value) do elements[#elements + 1] = encode_value(k) elements[#elements + 1] = encode_value(v) end local length = #elements // 2 if length < 16 then return pack('>B', 0x80 + length) .. tconcat(elements) elseif length < 65536 then return pack('>BI2', 0xde, length) .. tconcat(elements) else return pack('>BI4', 0xdf, length) .. tconcat(elements) end end end, } encode_value = function(value) return encoder_functions[type(value)](value) end local function encode(...) local data = {} for i = 1, select('#', ...) do data[#data + 1] = encode_value(select(i, ...)) end return tconcat(data) end --[[---------------------------------------------------------------------------- Decoder --]]---------------------------------------------------------------------------- local decode_value -- forward declaration local function decode_array(data, position, length) local elements, value = {} for i = 1, length do value, position = decode_value(data, position) elements[i] = value end return elements, position end local function decode_map(data, position, length) local elements, key, value = {} for i = 1, length do key, position = decode_value(data, position) value, position = decode_value(data, position) elements[key] = value end return elements, position end local decoder_functions = { [0xc0] = function(data, position) return nil, position end, [0xc2] = function(data, position) return false, position end, [0xc3] = function(data, position) return true, position end, [0xc4] = function(data, position) return unpack('>s1', data, position) end, [0xc5] = function(data, position) return unpack('>s2', data, position) end, [0xc6] = function(data, position) return unpack('>s4', data, position) end, -- 0xc7 - 0xc9 for userdata [0xca] = function(data, position) return unpack('>f', data, position) end, [0xcb] = function(data, position) return unpack('>d', data, position) end, [0xcc] = function(data, position) return unpack('>B', data, position) end, [0xcd] = function(data, position) return unpack('>I2', data, position) end, [0xce] = function(data, position) return unpack('>I4', data, position) end, [0xcf] = function(data, position) return unpack('>I8', data, position) end, [0xd0] = function(data, position) return unpack('>b', data, position) end, [0xd1] = function(data, position) return unpack('>i2', data, position) end, [0xd2] = function(data, position) return unpack('>i4', data, position) end, [0xd3] = function(data, position) return unpack('>i8', data, position) end, -- 0xd4 - 0xd8 for userdata [0xd9] = function(data, position) return unpack('>s1', data, position) end, [0xda] = function(data, position) return unpack('>s2', data, position) end, [0xdb] = function(data, position) return unpack('>s4', data, position) end, [0xdc] = function(data, position) local length length, position = unpack('>I2', data, position) return decode_array(data, position, length) end, [0xdd] = function(data, position) local length length, position = unpack('>I4', data, position) return decode_array(data, position, length) end, [0xde] = function(data, position) local length length, position = unpack('>I2', data, position) return decode_map(data, position, length) end, [0xdf] = function(data, position) local length length, position = unpack('>I4', data, position) return decode_map(data, position, length) end, } -- add fix-array, fix-map, fix-string, fix-int stuff for i = 0x00, 0x7f do decoder_functions[i] = function(data, position) return i, position end end for i = 0x80, 0x8f do decoder_functions[i] = function(data, position) return decode_map(data, position, i - 0x80) end end for i = 0x90, 0x9f do decoder_functions[i] = function(data, position) return decode_array(data, position, i - 0x90) end end for i = 0xa0, 0xbf do decoder_functions[i] = function(data, position) local length = i - 0xa0 return ssub(data, position, position + length - 1), position + length end end for i = 0xe0, 0xff do decoder_functions[i] = function(data, position) return -32 + (i - 0xe0), position end end decode_value = function(data, position) local byte, value byte, position = unpack('B', data, position) value, position = decoder_functions[byte](data, position) return value, position end --[[---------------------------------------------------------------------------- Interface --]]---------------------------------------------------------------------------- return { _AUTHOR = 'Sebastian Steinhauer ', _VERSION = '0.6.1', encoder_functions = encoder_functions, decoder_functions = decoder_functions, -- primary encode function encode = function(...) local data, ok = {} for i = 1, select('#', ...) do ok, data[i] = pcall(encode_value, select(i, ...)) if not ok then return nil, 'cannot encode MessagePack' end end return tconcat(data) end, -- encode just one value encode_one = function(value) local ok, data = pcall(encode_value, value) if ok then return data else return nil, 'cannot encode MessagePack' end end, -- primary decode function decode = function(data, position) local values, value, ok = {} position = position or 1 while position <= #data do ok, value, position = pcall(decode_value, data, position) if ok then values[#values + 1] = value else return nil, 'cannot decode MessagePack' end end return tunpack(values) end, -- decode just one value decode_one = function(data, position) local value, ok ok, value, position = pcall(decode_value, data, position or 1) if ok then return value, position else return nil, 'cannot decode MessagePack' end end, } --[[---------------------------------------------------------------------------- --]]---------------------------------------------------------------------------- --[[ --This file is part of zenroom -- --Copyright (C) 2018-2021 Dyne.org foundation --designed, written and maintained by Denis Roio -- --This program is free software: you can redistribute it and/or modify --it under the terms of the GNU Affero General Public License v3.0 -- --This program is distributed in the hope that it will be useful, --but WITHOUT ANY WARRANTY; without even the implied warranty of --MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --GNU Affero General Public License for more details. -- --Along with this program you should have received a copy of the --GNU Affero General Public License v3.0 --If not, see http://www.gnu.org/licenses/agpl.txt -- --Last modified by Denis Roio --on Tuesday, 20th July 2021 --]] local hash = require'hash' -- when using facility functions, global hashers are created only once SHA256 = nil SHA512 = nil local function init(bits) local h if bits == 256 or bits == 32 then if SHA256==nil then SHA256 = hash.new('sha256') end h = SHA256 elseif bits == 512 or bits == 64 then if SHA512==nil then SHA512 = hash.new('sha512') end h = SHA512 else error("HASH bits not supported: "..bits) end return h end function sha256(data) return init(256):process(data) end function sha512(data) return init(512):process(data) end function KDF(data, bits) local b = bits or 256 return init(b):kdf2(data) end function hash.dsha256(msg) local SHA256 = HASH.new('sha256') return SHA256:process(SHA256:process(msg)) end function hash.hash160(msg) local SHA256 = HASH.new('sha256') local RMD160 = HASH.new('ripemd160') return RMD160:process(SHA256:process(msg)) end return hash zenroom_hashzencode_datastatszenroom_ecp2zenroom_ecdhzencode_debugzencode_randomzencode_httpzencode_whencrypto_ethereumsemverzencode_thencrypto_schnorr_signaturezenroom_ecpzencode_keyszencode_givenzencode_hashzencode_w3czencode_credentialinspectzenroom_benchzenroom_msgpackstatemachinezenroom_cborzencode_petitionzencode_secsharecrypto_credentialcrypto_bitcoinzencode_dictionaryzencode_arrayhdwalletzenroom_bigzenroom_commoncrypto_lagrange_interpolationcrypto_elgamalzencode_reflowzenroom_octetzencode_verifyzencode_dp3tzencode_ecdhzencode_bitcoinzencodetimetablezenroom_jsonzencode_ethereumcrypto_petitionFILE*  0123456789abcdef@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@>@?456789:;<=@@@@@@@ @@@@?@ !"#$%&'()*+,-./0123@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@$@@@%&@@@@'(@)*+ ,@@@@@@  !"#@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@abandonabilityaboutaboveabsentabsorbabstractabsurdabuseaccessaccidentaccountaccuseachieveacidacousticacquireacrossactactionactoractressactualadaptaddaddictaddressadjustadmitadultadvanceadviceaerobicaffairaffordafraidagainageagentagreeaheadaimairairportaislealarmalbumalcoholalertalienallalleyallowalmostalonealphaalreadyalsoalteralwaysamateuramazingamongamountamusedanalystanchorancientangerangleangryanimalankleannounceannualanotheranswerantennaantiqueanxietyanyapartapologyappearappleapproveaprilarcharcticareaarenaarguearmarmedarmorarmyaroundarrangearrestarrivearrowartartefactartistartworkaskaspectassaultassetassistassumeasthmaathleteatomattackattendattitudeattractauctionauditaugustauntauthorautoautumnaverageavocadoavoidawakeawareawayawesomeawfulawkwardaxisbabybachelorbaconbadgebagbalancebalconyballbamboobananabannerbarbarelybargainbarrelbasebasicbasketbattlebeachbeanbeautybecausebecomebeefbeforebeginbehavebehindbelievebelowbeltbenefitbestbetraybetterbetweenbeyondbicyclebidbikebindbiologybirdbirthbitterblackbladeblameblanketblastbleakblessblindbloodblossomblouseblueblurblushboardboatbodyboilbombbonebonusbookboostborderboringborrowbossbottombounceboxboybracketbrainbrandbrassbravebreadbreezebrickbridgebriefbrightbringbriskbroccolibrokenbronzebroombrotherbrownbrushbubblebuddybudgetbuffalobuildbulbbulkbulletbundlebunkerburdenburgerburstbusbusinessbusybutterbuyerbuzzcabbagecabincablecactuscagecakecallcalmcameracampcancanalcancelcandycannoncanoecanvascanyoncapablecapitalcaptaincarcarboncardcargocarpetcarrycartcasecashcasinocastlecasualcatcatalogcatchcategorycattlecaughtcausecautioncaveceilingcelerycementcensuscenturycerealcertainchairchalkchampionchangechaoschapterchargechasechatcheapcheckcheesechefcherrychestchickenchiefchildchimneychoicechoosechronicchucklechunkchurncigarcinnamoncirclecitizencitycivilclaimclapclarifyclawclaycleanclerkcleverclickclientcliffclimbclinicclipclockclogcloseclothcloudclownclubclumpclusterclutchcoachcoastcoconutcodecoffeecoilcoincollectcolorcolumncombinecomecomfortcomiccompanyconcertconductconfirmcongressconnectconsidercontrolconvincecookcoolcoppercopycoralcorecorncorrectcostcottoncouchcountrycouplecoursecousincovercoyotecrackcradlecraftcramcranecrashcratercrawlcrazycreamcreditcreekcrewcricketcrimecrispcriticcropcrosscrouchcrowdcrucialcruelcruisecrumblecrunchcrushcrycrystalcubeculturecupcupboardcuriouscurrentcurtaincurvecushioncustomcutecycledaddamagedampdancedangerdaringdashdaughterdawndaydealdebatedebrisdecadedecemberdecidedeclinedecoratedecreasedeerdefensedefinedefydegreedelaydeliverdemanddemisedenialdentistdenydepartdependdepositdepthdeputyderivedescribedesertdesigndeskdespairdestroydetaildetectdevelopdevicedevotediagramdialdiamonddiarydicedieseldietdifferdigitaldignitydilemmadinnerdinosaurdirectdirtdisagreediscoverdiseasedishdismissdisorderdisplaydistancedivertdividedivorcedizzydoctordocumentdogdolldolphindomaindonatedonkeydonordoordosedoubledovedraftdragondramadrasticdrawdreamdressdriftdrilldrinkdripdrivedropdrumdryduckdumbduneduringdustdutchdutydwarfdynamiceagereagleearlyearneartheasilyeasteasyechoecologyeconomyedgeediteducateefforteggeighteitherelbowelderelectricelegantelementelephantelevatoreliteelseembarkembodyembraceemergeemotionemployempoweremptyenableenactendendlessendorseenemyenergyenforceengageengineenhanceenjoyenlistenoughenrichenrollensureenterentireentryenvelopeepisodeequalequiperaeraseerodeerosionerroreruptescapeessayessenceestateeternalethicsevidenceevilevokeevolveexactexampleexcessexchangeexciteexcludeexcuseexecuteexerciseexhaustexhibitexileexistexitexoticexpandexpectexpireexplainexposeexpressextendextraeyeeyebrowfabricfacefacultyfadefaintfaithfallfalsefamefamilyfamousfanfancyfantasyfarmfashionfatfatalfatherfatiguefaultfavoritefeaturefebruaryfederalfeefeedfeelfemalefencefestivalfetchfeverfewfiberfictionfieldfigurefilefilmfilterfinalfindfinefingerfinishfirefirmfirstfiscalfishfitfitnessfixflagflameflashflatflavorfleeflightflipfloatflockfloorflowerfluidflyfoamfocusfogfoilfoldfollowfoodfootforceforestforgetforkfortuneforumforwardfossilfosterfoundfoxfragileframefrequentfreshfriendfringefrogfrontfrostfrownfrozenfruitfuelfunfunnyfurnacefuryfuturegadgetgaingalaxygallerygamegapgaragegarbagegardengarlicgarmentgasgaspgategathergaugegazegeneralgeniusgenregentlegenuinegestureghostgiantgiftgigglegingergiraffegirlgivegladglanceglareglassglideglimpseglobegloomglorygloveglowgluegoatgoddessgoldgoodgoosegorillagospelgossipgoverngowngrabgracegraingrantgrapegrassgravitygreatgreengridgriefgritgrocerygroupgrowgruntguardguessguideguiltguitargungymhabithairhalfhammerhamsterhandhappyharborhardharshharvesthathavehawkhazardheadhealthheartheavyhedgehogheighthellohelmethelphenherohiddenhighhillhinthiphirehistoryhobbyhockeyholdholeholidayhollowhomehoneyhoodhopehornhorrorhorsehospitalhosthotelhourhoverhubhugehumanhumblehumorhundredhungryhunthurdlehurryhurthusbandhybridiceiconideaidentifyidleignoreillillegalillnessimageimitateimmenseimmuneimpactimposeimproveimpulseinchincludeincomeincreaseindicateindoorindustryinfantinflictinforminhaleinheritinitialinjectinjuryinmateinnerinnocentinputinquiryinsaneinsectinsideinspireinstallintactinterestintoinvestinviteinvolveironislandisolateissueitemivoryjacketjaguarjarjazzjealousjeansjellyjeweljobjoinjokejourneyjoyjudgejuicejumpjunglejuniorjunkjustkangarookeenkeepketchupkeykickkidkidneykindkingdomkisskitkitchenkitekittenkiwikneeknifeknockknowlablabellaborladderladylakelamplanguagelaptoplaterlatinlaughlaundrylavalawlawnlawsuitlayerlazyleaderleaflearnleavelectureleftleglegallegendleisurelemonlendlengthlensleopardlessonletterlevelliarlibertylibrarylicenselifeliftlightlikelimblimitlinklionliquidlistlittlelivelizardloadloanlobsterlocallocklogiclonelylonglooplotteryloudloungeloveloyalluckyluggagelumberlunarlunchluxurylyricsmachinemadmagicmagnetmaidmailmainmajormakemammalmanmanagemandatemangomansionmanualmaplemarblemarchmarginmarinemarketmarriagemaskmassmastermatchmaterialmatrixmattermaximummazemeadowmeanmeasuremeatmechanicmedalmediamelodymeltmembermemorymentionmenumercymergemeritmerrymeshmessagemetalmethodmiddlemidnightmilkmillionmimicmindminimumminorminutemiraclemirrormiserymissmistakemixmixedmixturemobilemodelmodifymommomentmonitormonkeymonstermonthmoonmoralmoremorningmosquitomothermotionmotormountainmousemovemoviemuchmuffinmulemultiplymusclemuseummushroommusicmustmutualmyselfmysterymythnaivenamenapkinnarrownastynationnaturenearneckneedneglectneithernephewnervenestnetnetworkneutralnevernewsnextnicenightnoblenoisenomineenoodlenormalnorthnosenotablenotenothingnoticenovelnownuclearnursenutoakobeyobjectobligeobscureobserveobtainobviousoccuroceanoctoberodoroffofferofficeoftenoilokayoldoliveolympicomitonceoneoniononlineonlyopenoperaopinionopposeorangeorbitorchardorderordinaryorganorientoriginalorphanostrichotheroutdoorouteroutputoutsideovalovenoverownowneroxygenoysterozonepactpaddlepagepairpalacepalmpandapanelpanicpantherpaperparadeparentparkparrotpartypasspatchpathpatientpatrolpatternpausepavepaymentpeacepeanutpearpeasantpelicanpenpenaltypencilpeoplepepperperfectpermitpersonpetphonephotophrasephysicalpianopicnicpicturepiecepigpigeonpillpilotpinkpioneerpipepistolpitchpizzaplaceplanetplasticplateplaypleasepledgepluckplugplungepoempoetpointpolarpolepolicepondponypoolpopularportionpositionpossiblepostpotatopotterypovertypowderpowerpracticepraisepredictpreferpreparepresentprettypreventpriceprideprimaryprintpriorityprisonprivateprizeproblemprocessproduceprofitprogramprojectpromoteproofpropertyprosperprotectproudprovidepublicpuddingpullpulppulsepumpkinpunchpupilpuppypurchasepuritypurposepursepushputpuzzlepyramidqualityquantumquarterquestionquickquitquizquoterabbitraccoonracerackradarradiorailrainraiserallyrampranchrapidrarerateratherravenrawrazorreadyrealreasonrebelrebuildrecallreceivereciperecordrecyclereducereflectreformrefuseregionregretregularrejectrelaxreleasereliefrelyremainrememberremindremoverenderrenewrentreopenrepairrepeatreplacereportrescueresembleresistresourceresponseresultretireretreatreturnreunionrevealreviewrewardrhythmribribbonricerichrideridgeriflerightrigidriotrippleriskritualrivalriverroadroastrobotrobustrocketromanceroofrookieroomroserotateroughroundrouteroyalrubberruderugrulerunrunwayruralsadsaddlesadnesssafesailsaladsalmonsalonsaltsalutesamesamplesandsatisfysatoshisaucesausagesavesayscalescanscarescattersceneschemeschoolsciencescissorsscorpionscoutscrapscreenscriptscrubseasearchseasonseatsecondsecretsectionsecurityseedseeksegmentselectsellseminarseniorsensesentenceseriesservicesessionsettlesetupsevenshadowshaftshallowshareshedshellsheriffshieldshiftshineshipshivershockshoeshootshopshouldershoveshrimpshrugshuffleshysiblingsicksidesiegesightsignsilentsilksillysilversimilarsimplesincesingsirensistersituatesixsizeskatesketchskiskillskinskirtskullslabslamsleepslendersliceslideslightslimsloganslotslowslushsmallsmartsmilesmokesmoothsnacksnakesnapsniffsnowsoapsoccersocialsocksodasoftsolarsoldiersolidsolutionsolvesomeonesongsoonsorrysortsoulsoundsoupsourcesouthspacesparespatialspawnspeakspecialspeedspellspendspherespicespiderspikespinspiritsplitspoilsponsorspoonsportspotsprayspreadspringspysquaresqueezesquirrelstablestadiumstaffstagestairsstampstandstartstatestaysteaksteelstemstepstereostickstillstingstockstomachstonestoolstorystovestrategystreetstrikestrongstrugglestudentstuffstumblestylesubjectsubmitsubwaysuccesssuchsuddensuffersugarsuggestsuitsummersunsunnysunsetsupersupplysupremesuresurfacesurgesurprisesurroundsurveysuspectsustainswallowswampswapswarmswearsweetswiftswimswingswitchswordsymbolsymptomsyrupsystemtackletagtailtalenttalktanktapetargettasktastetattootaxiteachteamtelltentenanttennistenttermtesttextthankthatthemetheorytheretheythingthisthoughtthreethrivethrowthumbthundertickettidetigertilttimbertimetinytiptiredtissuetitletoasttobaccotodaytoddlertoetogethertoilettokentomatotomorrowtonetonguetonighttooltoothtoptopictoppletorchtornadotortoisetosstotaltouristtowardtowertowntoytracktradetraffictragictraintransfertraptrashtraveltraytreattreetrendtrialtribetricktriggertrimtriptrophytroubletrucktruetrulytrumpettrusttruthtubetuitiontumbletunatunnelturkeyturnturtletwelvetwentytwicetwintwisttwotypetypicaluglyumbrellaunableunawareuncleuncoverunderundounfairunfoldunhappyuniformuniqueunituniverseunknownunlockuntilunusualunveilupdateupgradeupholduponupperupseturbanurgeusageusedusefuluselessusualutilityvacantvacuumvaguevalidvalleyvalvevanvanishvaporvariousvastvaultvehiclevelvetvendorventurevenueverbversionveryvesselveteranviablevibrantviciousvictoryvideoviewvillagevintageviolinvirtualvirusvisavisitvisualvitalvividvocalvoicevoidvolcanovolumevotevoyagewagewagonwaitwalkwallwalnutwantwarfarewarmwarriorwashwaspwastewaterwavewaywealthweaponwearweaselweatherwebweddingweekendweirdwelcomewestwetwhalewhatwheatwheelwherewhipwhisperwidewidthwifewildwillwinwindowwinewingwinkwinnerwinterwirewisdomwisewishwitnesswolfwomanwonderwoodwoolwordworkworldworryworthwrapwreckwrestlewristwrongyardyearyellowyouyoungyouthzebrazerozonezoo123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz  !"#$%&'()*+,-./0123456789#EgܺvT2bech32_final_constant         qpzry9x8gf2tvdw0s3jn54khce6mua7lsegwit_addr.cMalloc out of memory, requested %u B#9u 5X # 5o``0123456789ABCDEF0123456789abcdeflua_print_stderr_tobuflua_print_stdout_tobufzen_writeError buffer full, log message lostFatal error writing error buffer: %sError buffer too small, log truncated: %u bytes (max %u)Output buffer full, result data lostFatal error writing output buffer: %sOutput buffer too small, data truncated: %u bytes (max %u)tostring'tostring' must return a string to 'print'%s%c %s%c . [W] ioprinterrzen_fatalwarnlua_parse_prefixlua_strcasecmpJSON as malformed beginning or endJSON doesn't starts with '{', char found: %cstrcasecmp: arg #1 MAX_LINE limit hitstrcasecmp: arg #2 MAX_LINE limit hitparse_prefixstrcasecmptrimqjsontokzen! zen> Error: LUA string too longzen_conf_parse%s: error parsing configuration: %sverboserngseedInvalid length of random seed: %u (must be %u)hex:Invalid rngseed data prefix (must be hex:)stbsysmuttInvalid print function: %sInvalid configuration: %sInvalid integer configurationUndefined config variable%s: Invalid string in configuration: %cis_hexis_binfrom_segwit_addressnew_randomfrom_mnemonicfrom_hexfrom_rawlenfrom_stringzeroo_argto_hexxor_nconcat_nsizeto_mnemonicto_segwit_addresspopcount_hamming_distancebitshift_hamming_distanceentropy_bytefreqentropymaxpadeqto_binto_arrayto_stringto_base45to_base58to_url64to_base64filloctetreversesubo_dupto_octetchopnewoctetpush_buffer_to_octetzenroom.octetstring expectedstring is not a valid url64 sequencestring is not a valid base64 sequenceinvalid base58 digithigh-bit set on invalid digitstring is not a valid base58 sequenceError in %sstring is not a valid hex sequencestring is not a valid binary sequenceCannot create octet, size less than zeroexecution abortedCannot create octet, size too big: %uError allocating new userdata for octetError allocating new octet of %u bytes%s :: invalid argumentbctb%s :: not bech32 address%s :: words cannot be encoded with bip39 formatbinary string sequence expectedinvalid binary sequence size: %uoperation abortedhex sequence invalidhex string sequence length: %uhex sequence too long: %u bytesO.new 2nd arg is not a number%s: invalid string size: %ubase58 string expectedbase58 string contains invalid charactersError in conversion from base58 for string: %surl64 string expectedurl64 string contains invalid charactersbase45 string expectedbase45 string contains invalid charactersbase45 invalid stringbase64 string expectedbase64 string contains invalid charactersO.from_number input is not a numberCannot create a zero length octetCreating a zero filled octet of %u bytesargument %u octet too long: %u bytesinvalid NULL string (zero size)failed implicit conversion from string to octetinvalid string size: %uzenroom.bigzenroom.ecpzenroom.ecp2Error in argument #%u%s: cannot convert %s to zeroom.octetoctet or string expected in concat%s :: octet bigger than 32 bytes cannot be encoded to mnemonic%s :: cannot be encoded to mnemonicInvalid segwit version: %dInvalid size for segwit address: %dInvalid human readable part: %s%s :: cannot be encoded to segwit formatCannot measure hamming distance of octets of different lengthsarray cannot encode an empty octetbase64 cannot encode an empty octetbase58 cannot encode octets smaller than 3 bytesurl64 cannot encode an empty stringbase64 cannot encode an empty stringinvalid octet:sub() position starts from 1 not %iinvalid octet:sub() to end position %i smaller than start position %iinvalid octet:sub() to end position %i on small octet of len %icannot chop octet of size %i to higher length %icannot chop octet with negative size %dchopsubreversefillhexbase64url64base58base45strbineqpadmaxentropybytefreqhammingpopcount_hammingsegwitmnemonic__len__concat__bxor__eq__gc__tostringnewconcatxoris_base64is_url64is_base58is_hexis_binfrom_numberfrom_base64from_base45from_url64from_base58from_stringfrom_strfrom_rawlenfrom_hexfrom_binfrom_mnemonicto_hexto_base64to_url64to_base58to_stringto_strto_arrayto_octetto_binto_mnemonicto_segwitfrom_segwitecp_primeecp_validateecp_orderecp_newecp_generatorecp_mapitecp_get_infinitylua_new_ecpecp_destroyecp_eqecp_isinfecp_dupecp_mulecp_subecp_addecp_doubleecp_negativeecp_affineecp_get_yecp_get_xecp_outputecp_octetError allocating new ecp in %soctet length is %u instead of 64 (need to use sha512)Invalid argument to ECP.mapit(), not an hashmapit on o->len %unew ECP value out of curve (points to infinity)Octet length %u instead of %u bytesInvalid octet length to parse an ECP pointECP point validation returns %iOctet is not a valid ECP (point is not on this curve)Octet doesn't contains a valid ECPecp class expectedcannot multiply ECP point with double BIG numbers, need moduloBLS381ECP curve is %saffineisinfisinfinityx__add__submul__mulinfinfinitymapitgeneratorGvalidateprimeecp2_newecp2_get_infinityecp2_mapitecp2_generatorlua_new_ecp2ecp2_destroyecp2_outputecp2_eqecp2_get_ziecp2_get_zrecp2_get_yiecp2_get_yrecp2_get_xiecp2_get_xrecp2_octetecp2_isinfecp2_millerloopecp2_dupecp2_mulecp2_subecp2_addecp2_negativeecp2_affinepError allocating new ecp2 in %sInvalid argument to ECP2.mapit(), not an hashOctet doesn't contains a valid ECP2ecp2 class expectedxrxiyryizrzimillerbig_newlua_bigmaxbig_randombig_from_decimal_stringbig_argbig_paritybig_montybig_jacobibig_modpowerbig_modinvbig_modsubbig_modnegbig_modsqrbig_moddivbig_modmulbig_bytesbig_bitsbig_ltebig_ltbig_eqbig_mulbig_to_decimal_stringbig_modrandnewbigbig_dupbig_divbig_modbig_sqrbig_subbig_addnew_octet_from_bigbig_to_fixed_octetbig_to_intbig_concatbig_to_hexluabig_to_octet uninitialised big in arg1uninitialised big in arg2incompatible sizes: arg1 is double, arg2 is notincompatible sizes: arg2 is double, arg1 is notbiglendbiglenmodbytessizeof_BIGsizeof_DBIGError allocating new big in %sbig384ignoring superflous initialization of bigcannot shrink double big to big in re-initialization%s: string is not a number %signoring superflous initialization of double biganomalous state of double big number detected on initializationCannot import BIG numberbig class expectedinvalid big number in argument: not initalizedinvalib big number in argumentfound leftover buffer while freeing double bigfound leftover buffer while freeing bigno need for montgomery reduction: not a double big numberdouble big modulus in montgomery reductionjacobi not supported on double big numbersmodneg not supported on double big numbersmodsqr not supported on double big numbersmoddiv not supported on double big numbersmodmul not supported on double big numberscannot multiply double BIG numbers with ECP point, need modulocannot multiply double BIG numbersImport of number to BIG limit exceeded (>16bit)Import of octet to BIG limit exceeded (%u > %u bytes)division not supported with double big modulusmodulus cannot be a double big (dmod)cannot make square root of a double big numberSubtraction error: arg1 smaller than arg2 (consider use of :modsub)ADD doublesizeInvalid BIG number, cannot convert to octetBIG too big for conversion to integerNumber conversion bigger than 32bit, BIG truncated to 4 bytesdecimal__mod__div__lt__ltebitsintsqrmodmulmoddivmodsqrmodnegmodsubmodinvmodpowerjacobimontyparityfixedfrom_decimalmoddivmodrandinfofp12_newfp12_from_octetfp12_argfp12_destroyfp12_to_octetfp12_eqfp12_dupfp12_powfp12_invfp12_sqrfp12_mul Error allocating new fp12 in %szenroom.fp12BLS383new fp12 (%u bytes)fp12 class expected%s: fp12 size mismatch (%u != %u)%s: fp12 chunk size mismatch (%u != %u)invpow__powrng_allocError allocating new random number generator in %sRandom seed is external, deterministic executionrandom_int8random_int16random_int32random8random16random32runtime_random256hash_newlua_new_hashhash_destroyhash_pbkdf2hash_kdf2hash_hmachash_yeldhash_feedhash_processhash_to_octet 0@ @ Error allocating new hash generator in %szenroom.hashsha256sha384sha512sha3_256sha3_512keccak256ripemd160Hash algorithm not known: %snew hash type %shash class expectediterations%s: hmac (%u bytes) failed.HMAC is only supported for hash SHA256 or SHA512yelddohmackdf2kdfpbkdf2pbkdfmnemonic_seedecdh_addECDH curve is SECP256K1Invalid public key passed as argumentecdh_pub_xyecdh_pubgenecdh_dsa_verify_hashedecdh_dsa_verifyecdh_pubcheckecdh_dsa_sign_hashedecdh_dsa_signecdh_keygenecdh_sessionecdh_aead_decryptecdh_aead_encryptsignature argument invalid: not a tableinvalid size zero for material to signsize of input does not match: %u != %umissing 3rd argument: byte size of octet to sign%s: public key not found in any argumentECDH.aead_decrypt accepts only keys of 16,24,32, this is %uECDH decryption abortedECDH.aead_decrypt accepts an iv of 12 bytes minimum, this is %uECDH.aead_encrypt accepts only keys of 16,24,32, this is %uECDH encryption abortedECDH.aead_encrypt accepts an iv of 12 bytes minimum, this is %uzenroom.ecdhecdh class expectedkeygenpubgenaead_encryptaead_decryptaesgcm_encryptaesgcm_decryptaes_encryptaes_decryptcheckpubpubchecksign_hashedverify_hashedpublic_xypubxyctr_processgcm_decryptgcm_encryptAES.ctr_process accepts only keys of 16 or 32 bytes, this is %uAES-CTR process abortedAES.ctr_process accepts an iv of 12 bytes minimum, this is %ugcm_encryptgcm_decryptctr_processctrC$LuaVersion: Lua 5.3.6 Copyright (C) 1994-2020 Lua.org, PUC-Rio $$LuaAuthors: R. Ierusalimschy, L. H. de Figueiredo, W. Celes $?(*no name),,************(&$" globalupvalueconstant_ENV (%s '%s')(*temporary)(*vararg)=?Lua=[C]for iteratormetamethodhookC%s:%d: %sattempt to %s a %s value%sconcatenatenumber%s has no integer representationattempt to compare two %s valuesattempt to compare %s with %serror in error handlingattempt to load a %s chunk (mode is '%s')stack overflowC stack overflowcannot resume non-suspended coroutinecannot resume dead coroutineattempt to yield across a C-call boundaryattempt to yield from outside a coroutineLua  no messageerror in __gc metamethod (%s)too many %s (limit is %d)memory allocation error: block too big.xXnN%.7g-0123456789(null)<\%d>%p%invalid option '%%%c' to 'lua_pushfstring'[string ""]`qATPP\l< at line %d jumps into the scope of local '%s'no visible label '%s' for at line %d<%s> at line %d not inside a loopbreaklabels/gotosC levels%s expected (to close %s at line %d)(for index)(for limit)(for step)(for generator)(for state)(for control)'=' or 'in' expectedlabel '%s' already defined on line %dsyntax errorself or '...' expectedcannot use '...' outside a vararg functionfunction arguments expectedunexpected symbolnot enough memorytable overflowinvalid key to 'next'table index is niltable index is NaNuserdata__nameperform bitwise operation onperform arithmetic on__newindex__mode__idiv__band__bor__shl__shr__unm__bnot__le__callno valuenilbooleanfunctionthreadproto<6-nsU6$sll\D4" TB'__index' chain too long; possible loop'__newindex' chain too long; possible loopstring length overflowget length ofattempt to divide by zeroattempt to perform 'n%%0''for' limit must be a number'for' step must be a number'for' initial value must be a numberf_G.Sl%s:%d: bad argument #%d (%s)ncalling '%s' on bad self (%s)bad argument #%d to '%s' (%s)not enough memory for buffer allocationstack overflow (%s)stack traceback: ...Slnt %s:%d: in function '%s'%s '%s'main chunkfunction <%s:%d> (...tail calls...)value expectedbuffer too largeLUABOXlight userdata%s expected, got %sinvalid option '%s'number has no integer representationobject length is not an integer'__tostring' must return a string%I%f%s: %ptoo many upvaluescore and library have incompatible numeric typesmultiple Lua VMs detectedversion mismatch: app. needs %f, Lua core provides %ftoo many arguments to resumetoo many results to resumethread expectedrunningsuspendeddeadcreateresumestatusyieldisyieldablenil or table expectedlua_debug> cont =(debug command)invalid upvalue indexLua function expectedflnStu>%sinvalid optionshort_srclinedefinedlastlinedefinedcurrentlinenupsnparamsisvarargnamewhatistailcallactivelinesfunclevel out of rangeexternal hooklinecounttail callgetuservaluegethookgetinfogetlocalgetregistrygetmetatablegetupvalueupvaluejoinupvalueidsetuservaluesethooksetlocalsetmetatablesetupvaluetracebackwrong number of argumentsinterval is emptyinterval too largepimaxintegerminintegerabsacosasinatanceilcosdegexptointegerfmodultlogminmodfradrandomseedsinsqrttani c_@<8e5500;dsni`PDDnhrJJR{b,\Vresulting string too largevalue out of rangeunable to dump given functionstring slice too longtoo many capturesinvalid capture index %%%dunfinished capturepattern too complexinvalid pattern capturemalformed pattern (missing arguments to '%%b')missing '[' after '%%f' in patternmalformed pattern (ends with '%%')malformed pattern (missing ']')^$*+?.([%-string/function/table expectedinvalid use of '%c' in replacement stringinvalid replacement value (a %s)integral size (%d) out of limits [1,%d]missing size for format option 'c'invalid format option '%c'invalid next option for option 'X'format asks for alignment not power of 2format result too largevariable-length formatinitial position out of stringdata string too shorttoo many results%d-byte integer does not fit into Lua Integerinteger overflowunsigned overflowstring longer than given sizestring length does not fit in given sizestring contains zeros0x%x-+ #0invalid format (repeated flags)invalid format (width or precision too long)\%d\%03d%avalue has no literal forminvalid option '%%%c' to 'format'bytechardumpgmatchgsublowerreppackpacksizeunpacktoo many results to unpackposition out of boundsinvalid value (%s) at index %d in table for 'concat'wrong number of arguments to 'insert'too many elements to movedestination wrap aroundinvalid order function for sortingarray too biginsert[--][-]*position out of rangeinitial position is a continuation bytefinal position out of string%Uout of rangeinvalid UTF-8 codecharpatternoffsetcodepointcodesbit32constantscontrol structure too longopcodesfunction or expression needs too many registers #w%|Uo='%c''%s'lexical element too long%s near %schunk has too many linescommentunfinished long %s (starting at line %d)PpEemalformed numberinvalid long string delimiterunfinished stringhexadecimal digit expectedmissing '{'UTF-8 value too largemissing '}'invalid escape sequencedecimal escape too largeandelseifforgotoifnotorwhile//..==>=<=~=<<>>:: index out of rangebase out of range table or string expectedtoo many nested functionsreader function must return a stringbt=(load)__metatablecannot change a protected metatable__pairsassertion failed!Lua 5.3_VERSIONstoprestartsetpausesetstepmulisrunningassertcollectgarbageipairsloadstringpairspcallrawequalrawlenrawgetrawsettonumberxpcallfield cannot be negativewidth must be positivetrying to access non-existent bitsarshiftbandbnotborbxorbtestextractlrotatelshiftrrotatershift%x,%x)%01xInfinityy_:HjhN U ҙ(>\^4 iNJl(0 x( w# 4 Qqqs2#wR]~+*c U'$4?ij$kY{:A4k> !FnPMpq=D Hz(nI "/+&h |vAirYXUUx4JQ"E> e l W ;'AUH? "V ņ8 h`M}X (/s: H;U 3e sJ Pd2 GT@z:e _#l;cOzJgO ]=h`o v;M 1#c" ,nMhp%c6GoS x+j bAbX{P Ü pKwdf]4  }ThD ]Fm1'Y GQcg)) '8!.m,M 8STs e jv.,r迢KfpK£Ql$օ5pjl7LwH'4 9JNOʜ[o.htocxxȄnjlPxq"(ט/Be#D7q/;Mۉ۵8H[V9YO?m^BؾopE[N1$} Uo{t]r;ހ5%ܛ&itJi%O8GՌƝew̡ $u+Yo,-ntJAܩ\SڈvfRQ>2-m1?!'Y= % GoQcpn g))/F '&&\8!.*Zm,M߳ 8ScTs ew< jvG.;5,rdL迢0BKfpK0TQlReU$* qW5ѻ2pjҸSAQl7LwH'Hᵼ4cZų 9ˊAJNscwOʜ[o.h]t`/CocxrxȄ9dnj(c#齂lPyƲ+SrxqƜa&>'!Ǹ}xnO}orgȢ}c ?G5 q}#w($@{2 ˾L*~e)Y:o_XGJDl  3U.r5_8Hs "f4\7Y&jp1S BQ6Z){ 9K|$lR2Kh3d4Lqi}'jMr xe/!$E5ڎ۽6Δ\@F8f0b%"~nHãB:k(T=+y ^NԬsWXPtO,uz Y_Q oIC-v{̻>Z`;RlU)a7?[S9fHa5WiَU(ߌ BhA-Tcc||ww{{ kkooT`00PggV++}bMvvE@}}YYGG Ag_E#Srr[u=L&&jl66Z~??AOh44\Q4qqsb11S*? RF##e^0(7 / $6=&N''iuu X,,t4.6-nnZZ[RRv;;Ma}R)){>^//qSSh,@ `yȶ[[jjFgr99KJJޘLL԰XXJk*OCCŚMMf33UEEPPx<!KKa pp|>>BqffHHaaj55_WWiX:''8+"3iip3-<" IUUP((xzY  e1BBhhAA)Z--w{˨TTm,:QP~AeS:'^;kEXK 0UvmvL%O*&5DbޱZI%gE]/uLFk_mzRYԾ-Xt!Ii)Du‰jyxX>k'qݾO f}:cJ1Q3`bSEdwk+pHhXElR{s#rKWfU*(/{70(#j\+yNie4bĦ4.SU2u 9@`^qnQ>!=>MFTq]o`P$ֽ闉@CgٞwB[8yۡ| G|B 2+HplZrN8V=6-9' dh\![T$6.: gWOa ZwKi⓺ *<"C ǭ-WuLݻ`&\rDf;[~4C)v#ܶhc1Bc"@ J$}һ=2)m/Kܲ0 Rw+lpHGd"Ġ?V},"3IN8ʢ 6ϥz(ڷ&?,:Px j_̛T~Fbظ.9^ï]iГ|o-%Ȭ;}cn;{&x nY욷One~!Jo6 )|1*?#1ƥ05ftN7ʦа3JAP/vM֍CM̪MTߞѵLj,FeQ^5]ts A.gZRV3mGa7 zY<Ω'a5zG8$4,£@_r% (Ky xZݨ31Y'_`QJ -zɜ;M*:x>:@;hDx;D;E;F<GX<I<(L<pL=L$=LD=`Mp=M=8N=HN=N=HQ$>@U?xU(?V\?V?@W?W?HX$@XX@hY@Y@ZA [q?r@(rAPrBxr(Cr8DrErFsxGDsI|sJsKsLtM,tOxtPthQtSuS4uTHuT\uUuUuVu8WvHXPvhXdvxXxvXv8Zv0\v(]v _0wbwdw@dwHdwPdxXdxd(x8flxgxPlxl$y0m@yn`y`nynynyXoyoy(q0z rXzrzPszxtz0wP{w{Hx{(y |zH|~|}؀D}Hd}Px}}x}|~~~XXГ$HLȔ|؀` 00p@Ht؝Ԃh\X4H\pX,0TȹЅ(X`0tԆdxćP؇0(ppȈ88PЉ8,`xP ؍X0t(`08l  @ T xP Ȑ  xp БxLp  0@X4THx( !ؔ#'*`*t8+,Ė.ؖ.P/4/HP0p1246X7@8X9:8<>ԙHACH`GHH8I`I$Kpmmmn8odprr@s<Xtxu`u؝u`v@wp@ww̞@x{L`{|}ȟ}0~~@~Th@<tءX @8xH H`x L8Ћ(hp(Xԥ$АH(lВ<@``Ȕȧh dȨ `(xܩ(Txئ8x,Pt@xܫ(`xp4(XȭP8d0H(0Pht(įXxH(tغȻܱH|ȲX(08HpXPPHLh0@T|ܷ L̸,`Tx 0 عx (PxhĻ@HHļ8ܼ ("``$x%Ƚ%ܽ && X' h(Lp)x)*`*о+h-<(.T.h/1Կ3608l:;<=H@|@CE`G$HlM8MM(`NTNhOP`R0S,Wp\(p8pqq(qTrxrrxsuvXvvw`w@wlxy@zz({hx| }}(~$~T 8؁\ЂȃX,lh8@`h|ȇXȈ X8xL`t (H`x(<8P`dx0DXlȓp` (h$ИP0x`0h LЛ|H8ȟxP0ȢhX,0xȨPX(XPd`8,pPȮx@px4``ȱ(0в0txP0X H,0`h(hXؾ0p@XX8hhP,X $T`@H(@TP@(dx( Tx$xD(ppX|@(h0@(  P  ( Tp p(L|  `4h8(|##$#8#\x%@' *h,,,.@ /l`///(0X0<0`00181p11D(2hh22203 3@5(6h667$07H7xH889;LX;x;;;(<X<8<\<<=0=p==8=\X>>>?X?(?P?x@A0B pB0 C`CDDE8FDXH(NhNN@Nh8OxO PXPP8QhQRST<HUUV0W<WhXHYx_<fgxiHj,j`0kko8pHprru,pxt@z(|}d@,@@Tȁ8hp  4H\0pXH؄8((<`tPЍ`,@TАh8ȑ X( < ВP d  @  `  H | 8 p   D t 8 ț 0 0 (p  8 ȡ УH `l ؤ  x  ($PtH 0D|xH,@Px8 00Юl0( (@@P$@PHdx ػPHx\x$8L0@`0@DXlx@HxP@Hdxp@(P(8P$\ X,X X,\0zRx x,,x8 @xHA BNdy|xlA` CDB^ BNAAAAAA` C AI B cA AL A ALA AAAA {A Cg @L|tA CXDdmT Ap B C CCC A X|\~,`~A DW A K PA DN( H<|AAZYBRQHXWBVUCPOFTSHN HA 4A ^HHADJICGHG AA ZAAJIOAHGJIpA Z<B0L@4A@BBC A D A xA DkD0pA@CElBAA@PIAA@<X4A CdAA YAA T$P8A CfCA I AA F AA FAA T|08A CfCA I AA F AA FAA \PAP C[OBBAP H AAA AF AA FAAP \4PAP C[OBBAP H AAA AF AA FAAP ,A0DQ A O` 0\ A"!U YAA "!NB ( 8A"!U XA A B $8ܥ4A"!B } A (`A$#J"!G a(A"!U XA A B (4A"!B r A 8((A0BCx A H A 4A0BI<D(xA CJBA FAA  `DF BH8AFHGBFECDCEBF A 0 AF0<A MH$PA0CBM A K A K A K0pA Ba A N A lA@BIQCA@N BA |BA@C A Gq, A BQ A K4D @A0DBR A L|  A A Fb @$A G HT P ȱ$( ܱ< رXP td x   ( pA43B21D0/Tp ķABCC G AAA EC CH HBAAAAACpT LGB OCCD zAAACC  AAAA T $Ap B Q \CAp  F AA F AA D T4 AA A C BCD  A m A T AP A BBBx A ^ A  X@ d0AFF O Q ^,< PAp C D t A ,l AC B B ^  09, A0BCf A L` fD` \$hpA$#B"!CC EFsFA"! $#J B xl`TH<40xA0E B AJAA0A 4pdB U A J A \X AB C FM A F A C Q A L A pA ZHAD@Ap B B Cc A BPAAp  PNKAp  ABBـAp B B Cc A BPAAp  PNKAp  ABB8tA"![t$A` B EXccAIA`  NAADSUAtA` B EXccAIA`  NAADSUAt A` B EScdAIA`  NAADSUAXtA"![<@AP BX A RKRCAtA` B EScdAIA`  NAADTUA$dtA DW,8 A@E_ A , A@Eg A T dA@DEr AA AEA@G AA IAHD A` G C A R A 0 lAP Fo A $HDA DK h\A BS$AG(0dA0DK A G \PA EM0A0CV A Ehd0tA0BV A V A BAXWBTSBRQK A AUVCNFOPl CAAA SBADAVUTSRQPONXW^BVUTSRQPONXWI AAA _ AAA c AAA F AAA I AAA GAA04AK0HA DN A J A 8HB BYC C A 0A DN A J A $l\A0BCP,DU A F A F0A DM A J A <DxA CPBA CAA 0A DM A J A 8$A0CBRAAA0B0A DM A J A 4(A0C\ A M A L`\AD E C ^ BAA T BAA BM,AP DBHT HA 4dA DP A M A M4A@EC A M A PPD A0DDS DA J AA KAA0MTAP EKHBRHFAAP H A FH0A DY A O A d0t @AP EI] EA IAAP HAP D4L!A0EV A H A H!A0DJKAA0G A FGA4H"A0ER A H A ,T"A0DU A G4#A0F[ A H A D#A@BBT A | A N A 0&|A CL A E A ,84'A0D[ A ,h(AP CDb A ,)tA CJ A M@)A0CJU AA DJ A E A *AP CBIHI|HCAAP HEHDAP HS AHA PHGAP HBHHHW AHA 4,A0CB A [ A 0/8A0CBo A W00 A@CCs A <P1hAP EBHII HIA ,2tA CJ A M,2A0DX A 4|3A0Db A G A 4( D4TA0Dz A L A @` d5 A0CBd A F A P4 06A0DY A F A ( 6A0DW A H!7 AP DLOD A H A F A DT!7A0CIOAA0E A OD!h8A0CJSAA0E A O(!9A0D] A ("9A0D] A \<"p:A@Et A J A J A S A 0";A0BBO A Z,"TpA BBCS,#x>xA BL A M$ $>hA CM A $4$?dA BM A $\$@?A CT A ,$?hA BI A L@$?A0CINAA0K A H,$|@hA BI A LD(%@PA0EBU A i A m A 0p%BhA0DBH A I(%BXA CF A J(%CA0DY A $%CdA CL A 0$&DA0BBK A N4X&LDA0CBV A H A 0& E A0CBT A g0&E A0CBT A g,&FA CN A X,('DGA CN A X,X'GA CN A X'DHAE$'DHtA CP A $'HxA CQ A ,'HtA BQ A G@((,I(A0CJPAA0Q A HH0l(JA0DQ A [0(JABHGBFECDCZ(KAE$(K|A CS A ,)`KhA BI A L@L)KA0CIIAA0K A H,)$LhA BI A L4)\LA0DP A H A 0)LhA0DBH A I(,*MXA CF A J@X*DM(A0CJPAA0Q A HH(*(NA0DY A (*NAp D V A (*`OAp D V A ( +OAp D V A (L+PAp D V A (x+QAp D V A (+QAp D V A 0+DRA0DP A Z$,RdA CL A ,,,SA0C_ A 0\,SA0BBK A N0,DT A0CBT A g0, U A0CBT A g0,U A0CBT A g,,-VA CN A X,\-XWA CN A X,-WpABHGBFECDS4-X<A"!B DU A L A - YA Dm$.YA CZ A @.A0DY A O A ` A I A I A I A I A I(>hA0/C.-C,R>pP>pA ZD`p>ABB C GC A T\`BA0BBR A i A L A N A `0D8A B`HDxA@DFD`DAP BCF^ A j A D=D<;G@?F:9R A CHȺ4AF@?D>=E:9G<;D87V A C(PA BF A I(@PA BF A I lPC BM 48A BJ H4A BI,ػ\\A BG A K @A BL ,8A BJ PLA0BOLtA BBCCCDDļH AABCC~}C|{Cz]0 A&%B$#C"!C _ @, ,A BGXd8 AAECC}~C{|CzTAAAAAACL XA CBCECCA AFDJCCdAAAABA AEBBAA CA BA ̾,A BG<AAB~}CC|{CzyZ@0,A ABBBB`DtHA ABCCC@ A (A CE`ABBDCBCX A K DPA BP(h<|Ap C C W(xAp B C W$lA0BCT0$<AAdcB^CbaD`_CT0B0A0BG (>0A0BG L >$A BE p$>$A BE (>8C BG <>$A BE @>4A` B I,T>ABCBW 0>4A BI$T><A0BCH(|>HABDJ$><A0BCH$?<A0BCH0?A BCCb@,?ABhgBfeD^CdcbaD`_Y A (p AABC\ pA@A BL A,A BG(ApACDS A$A BE,4AABCCa(d`BdABCR(BdABCR,BA0/B.-C,+C*pHCpABBI A BA AA FA(8DPAp C D K(dD@A BE A F(D@A BE A FE,DHA BF A G E0A0BG $E$A BE HE(A BF l E8C BG 4E$A BE 8E$A BE$=v H@A BL H@A BL,8HA&%B$#C"!D a0LHA.-B,+C('C*)a 4I@A BL,PIA65B21C43C0m0JAAFEBDCCBAD@i$JlA"!B WL0J A ABCCCDl A XLA ABHBCDBC HA $0R<A0BCH$HR,A BG$,PRLA0BCL$TxRLA0BCL(|R@A BE A F0RABCC _ (S8A BJ =E87D43F<;:965 A @(4_\ACFEC>=C<;HDCBA@? A $lPf<ABKLhf`A ABBBE0xhA*)B('B&%C$#k0i\A0BF A H A C,L@iFP CN A G(|iAC D ^X jAABHICDBCCHI,m\AD B O44mA$#B"!B C_ A 0lpnA('D$#B&%C"p A ,DoA&%B"!D$#e A DoABlkEdcDjiChgEfebaj A D\rAAbaBXWC`_C^]C\[CZYp A P`tAAHGB@?DFEBDCCBAC>X A H A LpvADXWBRQCPOGVUCTSZ A G A HxA87D43I21F65F0/Q A @HPtyA87D65I21G43D0/T A Bz, {40{,(L{`A0BCQ{<{0,{0(@{`A0BCQl| $|| $|P`|0||p| || | | 4|(H|(\|(p|(|$|4$}hA0BCS$X}A0BC\}\APU (AMaL`ld$tTA0BCN(pA0BCU4ą@`,@@4@(T`dA` BD Q$\A0BCP Ԉ0A BH 0A BH \A BS(<(T4<x4(PAP CP A K,|A` C ` A xtAp C X,̊AC ` A 0DABB K [C04ЋABCBm<ht<A,+B*)B('C&%B$#^"aE8t8ABCBCBpt8 8A BJ,0A@BCCX4`ABCC C a,ABCCZ(dABCR$ PA` B CM<HA$#BB"!B CM A H\tA('B&%C$#C"!C f A i,ܓA$#B"!C C\ DA B_4ABCCCt 4A B_(XtA@BBW8H lTA` E N(dACDP$ܗDAB M(\AD C N <0,A BG `<4AP BI$PXA0BCO$LA0BCL (A BF 0AP CG40ADB R LE A J (hhABCS$șhAD O A $dAC O A 0H`A0BCL A Dt4,hA` CC Y A E@dКABCB U A Z$tHA` B DJ$xA` C DU 4AP BI8AApoBnmClkCjiChgZ$X\`A` CC P(lAD C R,؝AC D Y,0tA@GT xDU<,\A*)S('&%$#"! ll\D(A0BD`LD(tA0BD`<Pܦ8d0xA@BCCc$A Bd A 0A0BD` A H(,A Bd A 4t(HA43B0B21]DtxxA<;C:9B65L A A4D78@AD<(ԫLA CI A DdLH$ X8 ACI C  HbAKAAAC@A  A $A  A LAP CDd A u A R\AP Ek A CqAAP FNx|P@L$|lD0BCO ļLD BK` > > > > (> 0> 8> @> H> P> `> h> p> x> > > > > > > > > > > P> > > > > > ? ? ? ? ? (? 0? 8? @? H? P? X? `? h? p? x? ? h ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @ @ @ @ @ (@ 0@ 8@ @@ H@ P@ X@ `@ h@ p@ x@ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ A A A A A (A 0A 8A @A HA PA XA ` `A hA pA xA A A A A A A A A A A A A A A A A B B B B B (B 0B 8B @B HB PB XB `B hB ppB xB B B B B B B B B B - HHI pXI hI h `p@J PJ H= X`J phJ  l h0l @l Pl hXl hl @ xl y y y y y y y z z z 0z @z Pz Xz `z hz pz xz z z z z z z z z z z z z z z z z { { { { ({ 0{ 8{ @{ P{ `{ h{ p{ x{ ` X p X X ^ ^ ^ Xi k `i x   X     hi  X      Xh P     `E `G 0E PFPB H C( C 0 0 HJ I UȆ OІ PW H I L N M0 XI@ YH TX Hh Lx M Hd Hb b a @f( a0 \8 Ha@ c( eP dX a` `@X P_h ^p cx [@ 0] ] \ \ H\= b؇  Xp mȏ nx ؍ Џ 8m؏ Y g jH$  PiW hW ho> h ؜  X  p Ю / h& 6   x Y  HБ  | n    H  ( 0 "  8 @ 0 0 0= p> H P X ` h p x Ȗ ( p 8 0 @ P ` 3h X/ . 1x +" - -' + 2 3 H+ * * 8*h3 H'X 1Ș (H '= &ؘ P0 @ 6H @:P h6X p9` 8h X8p :x 9 5(0 `7 6 58H8H4@w xHP@I  Xf`0 h[ ;U hF Dpxo   />/ oo0oopo +@أ 0 P$ 3p `Т bX 33`p20yP'% X &hwt p 0C 3- *3w y   B H (9K`` p O h .ء 4>`43ܡ x FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2,0123456789ABCDEFXP0123456789abcdefxp000102030405060708091011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798998@HPX`h@w xHP Xf`0 h[ ( 0 8 ~ ~ t t  q q  g g ( p^ x^ 8 8K @K H 7 7 X   h  x     ԏ ؏ lz pz j j D D h6 p6 T% X%     0 D H @ P ` h `   x ̆ І Ti Xi 4! 8! hpX x   X` bb RR0 <<@ (P hp` p    PQ     hpX =B @X 0"X !W H<W X9X 8 Y  Y  Y (Y 0Y @Y PY @`Y pY PY pY pY `Y @Y Y X X X P p X pW @(X Y Y 6Y 5Z 4Z 3(Z 30Z p2@Z ;PZ 1XZ p$@ HX -PX p,`X 8+hX P(hZ x%xZ W H<W X9W x8W 7W X 6X 5X 4X 84 3pT ; X 3 p2(X 10X 08X `/@X .HX -PX p,`X 8+hX P(X x%X p$X #X 0"X !X 0X X 6X B ^ B(^ B] hF8) ?8^ 8A@^ @P^ @ XIW HH^ PGX^ x?h^ ?] K K hJ] hF] hFpT (O XI] Mw L^ XIW HH^ HH^ PG^ PG0X EX EX @EX NX R@^ `RP^ `R8^ Q ^ (Q(^ (Q* [# [` [u [] `a `] [] [pT Z` Z` @Y` X` W` W` @V _^ _W ^^ ^0X pUX pU^ ]^ ]X SX HTX @Z i f0X { W ^ h|j j xi xi yHi Pyi hwi ui ti si Pqj 8@ pfi Xpi hmi 8li kj c@X epT W hPi ~^ ^ ^ h|Xi `i xX {hi zpi 0zX @xi yHi Pyi  X Pyi i hwi ui ti si Pqi Xpi @ni hmi 8li kX @kX hi X ppT p0X 8^ i (k `0X 8^ i (k `pT pk P^ X 8X k PX pT n n تn تn xn xn `pT H-  n n n n تn تn xn xX Xr `r hr xr r r r r 3 r r X^ 4 h ػr @r `s 0s 0 X (s s t t GCC: (Debian 8.3.0-6) 8.3.08Tt p0  > hF F KD`  px+-/2IETH UE`KH LU LUH hFHDH tFHLH VH KPJ@Epp HEI II!J*J3J;CJXX J<(JF90J,8JG@JEREȫE YH `Ud `Uf UE2y UIExx VEppE EIH Z Z \, \; ^PEE2I2V2`2i2Epzж E EحEP H 0PE5=E3EȾE8 H  (EpE H E  E3E*(*0G@*0EE [EhE`4E nH Жz Ж E   E E H K`@E   @ @ A . EE E H EB E H EC E H EC C C E@D EX H ExD E( H P- PdED E@G E 4H = G `O X e @o HExG yxG G G Ep EG E H p p X d   HlEpI *pI 8I E]E(F(`EI E0 YH EpJ EJ E `H EJ mJ E(9E{EJ EX H    8     \    @   ` p% P@1 < @H T : @` !f 0"& #to p${ x% P( 8+8 p,  -h] .t5 `/ 0 1T p2  3 84 4  5 6 7 x8V X9 ;t}8 H<H% =tEL .L <L J L X8L fHL tXL hL xL L L L L L L L L L M *(M 8@M FHM TPM bXM p`M ~hM xM M M M M M M M M  M  N & N 4 N E09E0N E B H ?L  ?xV  x?hc  ?dm  @h{  8A  Bh  BP  E  hFd  PG  HH   XI   hJ  K  K  Lt  Mx  N(  (OEZ  Z % Z 3 Z A Z O Z ] Z k Z y Z [ [   [ 0[  8[  @[  H[ P[ `[ p[  [  [ ! [ / [ E>EE = H PH  (QhZ  Qe  `Rht  R  HT(  pU  @V  W  W  X  @Y  Z  Z  [d  [  ]   ^   _   `,  `aEp^ 8 p^ F ^ T ^ b ^ p ^ ~ ^ ^ ^ ! ^ _ _  _ 0_ @_ P_ `_ p_  _ _  _ & _ _ 4 _ E@E_ E_ Ex B H bL  b<Z  cf  eq  pfp|  fD  kh  8l0  hm  @n  Xp  Pq`  s   t   ux  hw Pyt  yd 0z z% {, h|4 ~$J 8V ] x4e hm u }   < @( hx tE` ` ` ` ` ` a a + a 90a G@a UPa c`a qpa a a a a a <a a a a a b  b b ' b 5(b C0b Q8b _@b mXb {pb b b b E BEb Eb E` H Ȕ p p 8 P  ` (  E j  j 0j $@j 2Pj @`j Npj \xj jj xj j j EEEj Ej EH H   ` h@ tEk k EEk E H ` `  * x`6 ت@ J T ^ hk El yl l l l l l l m m  m EFE0m E@N E H pEo o Eo E &H (1 0t= I `x` ػp ~ @   D  EPo Po `o po o o $o 2o @o No \o jp E0HEE xH    E s  s 0s @s EIEE H XE H (  E t  t EpEH! H    p Et Et E+ 'H %- &6 h/J h38a 4Q h5pE8v E. rH (?z (?  8@EPw E3 H (HE4 H L L M Ml @O P hR8 S Ut \ E`w E5 H (pEw E`: #H q- q6 rEw Fw Ex E: QEy E Ey \H f 8u ȁx @ ȃH |  x  (`  0  , = h" 2 (: ȹB PM Y 8j E{ s{ *E{ E{ EX= |H  8 XEp~ ExD H E~ EF H   xE~ ~ E~ EG H E  EE  EhK H  E E EL !H "EPP (H 0#2 0#< H$O `%D^ (h )P% p6E EPEP nH Cy C0 C0 D 0E0 `ET E PF `G HhE  E E@Z H H H  Hd  XIP0 IP@ IPP HJ0Y xK_ L|m L{ M M N0 OL T U PW Y`E4 4 E@!@!(p!E8 E[ H [ [@ \@ H\4  \P* \43 ](C 0]hO ^X P_a `j aHs Ha4| a4 aX b4 Hb4 b c cd Hdx d e @fE""E E_ H g g8 g  h h! Pi) j3 k? 8mF PQ mZ nc hok Xpt xq` rd @u |    E  h P  ؜4 E@$@$ EpEc H    Ю h ' / p7 = `@ E`%E`%E Ek OH HZ HXe n  y H l xE  E%I%pE@ En H 0Ep*p*EEo H  x  <    |  H  E & E Ep .E 7H p> @G 8U ^ n  x  `XE EP&P&(Eu Ew H & &d '8 H' (0 8*\ *P *` H+P +T .P) +`3 P,B -\L .W X/k P0w 2T 1 1d 2 3 3E  E''H'pE E{ H 5 5| 5x 6L h64 6 `7( X8/ 85 p9: 9HA @:G :E@)Q@)E Eh XH ;e = E E H ` `HE H 8l 8lL lL (n( Ȅ`E E@ H EH E E H .  <E A H мO  мLa  8(t  XE E H 8  8pE8 H pEХ H E H (  (L  xL  (! `E Eа *!H $Eض ;!EТ Q!E g!H 84t! 06 E E@ !H hY hYHE( H d! dt! 0f! g\E ! ! ! E !H r! rt! sE |H u" udE@ "@ "@ "@ @" " %" ," E 2"H 8" LE E8 A"H hE O"H 0E( ^"H `d" `k" HE( t"H E YE` "` " `" &(" H" zp" H0" st" @h," P| # l# ""# pt-# ?# 8 N# x\# h# `w# 8t4# -# P# P\# 5# pT# 08# h"# (# xyd# X# X $ "P$ $ 0{/$ T8$ (D$ Q$ %\$ h$ D}$ i\$ D$ xj$ ,$ ($ $ h!X$ X$`$ @% L% $'% T3% <@H% H|X% hb% g4p% @D~% % (T% % xX% "H% 8;% (p% `% % x\& & ! & p61& ,X=& J& X`[& h@k& "(|& H& ,& %|& Kh& (H4& t & Xv& JD& 8& x#l' 'x&' p4' #pD' JO' `' pXi' x' h' p' y' h ' ' $' `' ' H' ' ' 8( #`"( Hq0( '(B( XnN( 5[( ptk( {( ( ( J( ph(( )( d(+( p( p( 00( `) hl) (&X) ($') P1) 0q=) J) Z)pm) `Hx~) ) ) ) ) ) )-) T) L) +* p'p$* 1* XI@* 0v(O* h0`* hLl* Xv* @F* P* $g+ hF* * * H F* p* P?(* A`* = +Xi q+'+ @7+ G+ PV+ a+ m++ 0+أ (+ hl+ t+ P + 4+ +X, `u, #, HI6, 8A,R, Pe, <t, P6, 8p, v<,~ eI, ,, 8, 4, B, &|- L- p^d"- 0/- d8- Q-b-v- - - H$-Ti - (e- 0-b-g - H.0 8. X%. H5. D. @@U. b4e. n. (F0}. p7(. . . ,.P. b,. ,B 2. . ]/ "/ @$6/ $V/ d/ aDs/ |/ <///I/ X/ 0F/ P3/ q 0 Ht0 0 820 Ȗ;0 (;dI0 L8Y0 a0s0t }0 (G40 (0 0 > 0 Ld0 x0 x0 h1H 1 ?1 hL&10 31 PXPE1V1 8g1 'u1 pp1h1 11 <$U 13p1 (n11 H1  2 0P2#2"W>2K2 h]2 l2pn2 X$2 [,2 2X% 2 $2 x>2  |2 72 wH2 (\(3 3 P33  =3P3 E\^3~ o3 3 3 A3 ,3 H@3 8_3 83 `g3 @4 4 x?(.4 @ 74 8P?4 ЇlJ4`c8Q4 _4 n4 ]w4 \44$4 p4I4 mD4 p\4 D4Т (5 q 5 5 .5 \B5 VT5t  Z5 f5 ?T{5(t 5 84,5< 5 5 P5 5 X6 5 h5 (}\6 ,6 pl$676 K<G6h^6 u*n6Q 4\6 H6 h6 6 J6 `6 6 Pw 67 XV"7 |.7`I:7 @klG7 HhHU7 i4c7 8t7 XH7 N7 c07 bp7 7 XT87 H47 887 J7 (1+D8 Xp8 0(N x(8 x48 h<F8 PXW8 0 b8n8 8y8 8 GT8 h8 x9`8 8 L8 8<8 x839 Gp9.9 P8t>9j aK9 Z9 H<j93s9 9 <99 9 `B9 p@9 ^ 9 9T9 : U: 23-: `$8: 06 I: pZD[:n: eh: P: 4: p2:: @ h : p@: : ); 60; xh"; (h,; 09; (@L; a; 0ypl;~; |; Xt; P'; d;P; k; ; X; 0; , < t< 0P'< p8< 4B< \L< pH^< (<n< z< < XF0<` X< h[\< < pL)< < 0t<< h9\ = O = Xl1= І ;=QQOY= Po,h= Px== 04= (=lz = `= p50== %= >> f'> 7>K> H]> m8m> >4! > 50> h>> (>X > <> $ ?؏ ? 0(? `,7? XC?T% S? ?d? j`r? ?  ? $? `G4? \? 0U? ? 0? hp@@ 7h&@RH@ @<X@ F<i@ x@ @ (@ @_@ &@@ Dh@ O@@ H[4A L%A ;,8A hwBA ?4RA >0eAP 8vA  A A A @4A 6A /@A pA A h0A  Bt B cX.B 7Bp 8HB =`^BuB B BBB2B 8tB hxB C ? C $#C5C|[CC 0nPC (bC $tC @,C 0C ^hC ;C \CC i0C (C 8DD !D x"+D B`;D Xf`ID ;XWD  TgD 0yD 0:D D plLD Dx^ | D (mD {D (D 8Zt Ey /E yUx2E <CE @RSE (pcE rE HyE P E [XE X#; @eE x?dEC E E E N<E hF xHXF T+F 04F 8EF XF OjF ysF t}F3F2F tFg F -F *Fp6 ;F G X=0G /GAG 4JG h<[G MtiG BxG h0G3_G XG wHG`G 8G 8G ` G 7 G f H Ȕh+pz dH ` d$H p84H BH 8QHZH L@jH 4tH `H 0>PH :H H P\0H H ( H @LII*I `H;I FCI 0RI ZI hgI 4,{Ij I I XI 8I <I h$\I I 8 JD N%J )J 83Jg @J N4QJ ^J $nJ |J  J PJJ HJ l@J JRJK K y<%K H(7K ?$4 (GK N4WK haK (rK <K :LK p,`K  KK K ZdK 8K kDL |L +%L?L INL ؐ<ZL hfL |xL L E@LL \L 5`L HL PL M }M p!M 403M hDMVM 7`eM h8xM <4MM ^|M @MM M (7`M3N :N ShN 8&N P8-N @BN 8TN  2eNxN NN `N pN X8B UN AN 4N N pDN @8 O QO %O q0O p\85O u<@O $PO8! H_O rO x{O hO ppO O O qO DO 24O _O8K  P ^`P V/P BP@ RPԏ K ȊbP̆ wP (1 (PPP /HP P P :PB ;P `XP WdQQ7 'Q 89S 0  CS ehQSS2[S 6 KT oS dS clS3S TS HdS  SD S S >T 02TT VlT 5-T p8T ؋0BT >ST _T `M\mT~TT HZtT PT <T T dT N8T XI,hU  U (p2U H?UONU_U PPqU` U 8b\U QU aUUD JU XcLU 0Uh6 V @ V F\0V PuL:V @BMV P7 \V (rnV o}V m,V V @V M0V V `PtVV <V XW oW `pW 0>,W %29W` 8GW JVW D_W ('jW 0vWW W ؎W X<,W a4W N\W (W \W X P8X @,X Rt?X OX 4_X YqX pX :X dX <X X еxX ,X PCEMXX  Yp Y @k*Y O6Y (KYp$^Y tY Y 5<Y Y \Y pdY XYY 8Z TZ $Z S<4Z 8,GZ (ZZ 4jZ PN8~Z axZ Z klZ @EXZ pZ 0Z r|Z (hZ _[ ?([7 ~$[ Xt=[ I[3S[ \h[  {[[ `3[ [[h 8[ 05<[ @[ XPd\  \ . 0 5\ sxD\ 8 O\ +4a\ ]hu\p^ \ h\ p\ \\ p`t\h \ 8$\ء  ] 4] P'] Pp6] P|?] >pM] nZ] g] y]]`4] `t] k] l](-] t] 4`]^ J` ^ c(/^ 0vD^ <`Y^ YTj^ N|^q ^ 87^ ^I^ ^ d^ ;x^ 8I^ $_( _ h$_8_ @K_3V_ a_ fo_ tz__ 7(_ _ `_ 0O|_ *h_ @_`  X` @/` h44B`  T` (j` (Gdz` m` XW` 0d` *`@K /` Z\` X ` Ga [L"a <<3a x6PEaGaZa pHla >|aaa 7a > a ЉLa 5pa xhaܡ a b Pb(b x3b oEb pTb 3bbvb hb Ub p$bb b b b b c Dc Ћ'c8c M0Gc ^c Poc cІ 4c c Xc c @c \c 8c (=0d 0aTd d+d ($;d hsPd <ad $td SXdd (?( d ld ld edd d U8dx d (e Hl#e \:ebIe \e `c`me xe!e `(e @e xLFae Pee e Xe pw f `@f $f @.f X;fpIfI Yf @igf `@$uf >f ff p8hff 7(f 7(fx (g  g `Edg @/usr/lib/gcc/aarch64-linux-gnu/8/../../../aarch64-linux-gnu/Scrt1.o$d$x/usr/lib/gcc/aarch64-linux-gnu/8/../../../aarch64-linux-gnu/crti.ocall_weak_fn/usr/lib/gcc/aarch64-linux-gnu/8/../../../aarch64-linux-gnu/crtn.ocli.czscript.6638__func__.6581strict_filterconffilescriptfilesideloadkeysfiledatafilesidescriptintrospectstrictcrtstuff.cderegister_tm_clones__do_global_dtors_auxcompleted.8216__do_global_dtors_aux_fini_array_entryframe_dummy__frame_dummy_init_array_entryzenroom.cstbsp__clamp_callbackstbsp__count_clamp_callbackzen_init_pmainzen_lua_panicstbsp__commahexu.5919hex.5918stbsp__digitpair__func__.6226__func__.6625__func__.6638__func__.6646zen_error.cpfxlua_functions.czen_lua_findtable.constprop.0lua_modules.c__func__.5247__func__.5254__func__.5261custom_require_restricted.5282custom_require.5281lualibs_detected.clua_shims.cgetSiolibflibencoding.chextablehexesasciitablealpha_U64alpha_b45b45tablebase58.crmd160.csegwit_addr.c__PRETTY_FUNCTION__.4186charset_revzen_memory.cmutt_sprintf.cfmtintzen_io.czen_fatalzen_actzen_warnzen_printerrzen_writezen_print__func__.6242__func__.6230__func__.6278custom_print.6313custom_iowrite.6314zen_parse.clua_trim_quoteslua_trim_spaceslua_unserialize_jsonlua_parse_prefixlua_strcasecmp__func__.5330__func__.5364custom_parser.5406repl.czen_config.c__func__.5204curconfzen_octet.clua_is_url64lua_is_base64lua_is_base58lua_is_hexlua_is_binfrom_segwit_addressnew_randomfrom_mnemonicfrom_binfrom_hexfrom_rawlenfrom_stringfrom_base58from_url64from_base45from_base64from_numberxor_nconcat_nto_mnemonicto_segwit_addresspopcount_hamming_distancebitshift_hamming_distanceentropy_bytefreqentropyto_binto_arrayto_stringto_base45to_base58to_url64to_base64filloctetnewoctet__func__.7783__func__.7791__func__.7979__func__.8177__func__.8015__func__.7956__func__.7913__func__.7946__func__.8114__func__.7811__func__.8089__func__.7857__func__.8027__func__.8166__func__.8009__func__.7994__func__.8229__func__.8243__func__.8183__func__.8198__func__.8171__func__.8106__func__.8155__func__.8094__func__.8068__func__.8083__func__.8055__func__.8047__func__.8040__func__.8033__func__.7848__func__.8131__func__.8147__func__.7819__func__.8078__func__.8123__func__.7841__func__.7827zen_ecp.cecp_primeecp_validateecp_orderecp_generatorecp_mapitecp_get_infinitylua_new_ecpecp_eqecp_isinfecp_mulecp_subecp_addecp_doubleecp_negativeecp_affineecp_get_yecp_get_xecp_outputecp_octet__func__.6687__func__.6609__func__.6598__func__.6552__func__.6588__func__.6603__func__.6593__func__.6579__func__.6568__func__.6659__func__.6621__func__.6564__func__.6652__func__.6633__func__.6626__func__.6640__func__.6615__func__.6681__func__.6675__func__.6692__func__.6669zen_ecp2.cecp2_get_infinityecp2_mapitecp2_generatorlua_new_ecp2ecp2_outputecp2_eqecp2_get_ziecp2_get_zrecp2_get_yiecp2_get_yrecp2_get_xiecp2_get_xrecp2_octetecp2_isinfecp2_millerloopecp2_mulecp2_subecp2_addecp2_negativeecp2_affine__func__.6556__func__.6602__func__.6651__func__.6584__func__.6578__func__.6572__func__.6699__func__.6632__func__.6685__func__.6678__func__.6671__func__.6664__func__.6657__func__.6607__func__.6589__func__.6644__func__.6619__func__.6612__func__.6596zen_big.c_compare_bigslua_biginfolua_bigmaxbig_randombig_from_decimal_stringbig_paritybig_montybig_jacobibig_modpowerbig_modinvbig_modsubbig_modnegbig_modsqrbig_moddivbig_modmulbig_bytesbig_bitsbig_ltebig_ltbig_eqbig_mulbig_to_decimal_stringbig_modrandnewbigbig_divbig_modbig_sqrbig_subbig_addbig_to_fixed_octetbig_to_intbig_concatbig_to_hexluabig_to_octet__func__.7595__func__.7645__func__.7850__func__.7689__func__.7604__func__.7961__func__.7886__func__.7948__func__.7865__func__.7954__func__.7828__func__.7940__func__.7932__func__.7923__func__.7910__func__.7629__func__.7624__func__.7798__func__.7784__func__.7855__func__.7723__func__.7844__func__.7653__func__.7609__func__.7902__func__.7893__func__.7880__func__.7816__func__.7805__func__.7668__func__.7700__func__.7767__func__.7752__func__.7761__func__.7747zen_fp12.cfp12_from_octetfp12_to_octetfp12_eqfp12_powfp12_invfp12_sqrfp12_mul__func__.6199__func__.6222__func__.6206__func__.6216__func__.6228__func__.6234__func__.6211__func__.6248__func__.6261__func__.6255__func__.6241zen_random.crng_int32rng_uint16rng_uint8rng_rr256__func__.6239rng_base.6266zen_hash.cmnemonic_to_seed_feed.isra.1lua_new_hashhash_pbkdf2hash_kdf2hash_hmachash_yeldhash_feedhash_processhash_to_octet__func__.6264__func__.6283__func__.6277__func__.6371__func__.6364__func__.6356__func__.6350__func__.6344__func__.6337__func__.6331zen_ecdh_factory.c__func__.6031zen_ecdh.cecdh_pub_xyecdh_pubgenecdh_dsa_verify_hashedecdh_dsa_verifyecdh_pubcheckecdh_dsa_sign_hashedecdh_dsa_signecdh_keygenecdh_sessionecdh_aead_decryptecdh_aead_encrypt__func__.7239__func__.7218__func__.7291__func__.7281__func__.7224__func__.7266__func__.7254__func__.7212__func__.7229__func__.7311__func__.7301zen_aes.cctr_processgcm_decryptgcm_encrypt__func__.6214__func__.6204__func__.6194randombytes.ccortex_m.clapi.cf_callversion.4949ldebug.cgetobjname.part.7varinfoldo.cf_parserluaD_precall.part.2unrollluaD_rawrunprotected.constprop.4ldump.cDumpStringDumpFunctionlfunc.clgc.cGCTMdothecallreallymarkobject.part.1freeobjclearkeys.constprop.9clearvaluestraverseephemeronpropagatemarksinglesteplmem.clobject.cintarithnumarith.isra.0log_2.6311lopcodes.clparser.cerror_expectedchecklimit.part.8new_localvarnewupvalue.isra.9singlevarauxclosegoto.isra.16adjust_assign.isra.18leaveblockclose_func.isra.19gotostatsinglevarstatementsuffixedexptest_then_blocksubexprforbodyassignmentconstructorrecfield.isra.20funcargsprioritylstate.cf_luaopenclose_statelstring.cltable.cmainposition.isra.4auxsetnodedummynode_ltm.cudatatypenameluaT_eventname.4873lvm.cluaV_tointeger.constprop.8lzio.clauxlib.cfindfieldpushglobalfuncnameluaL_findtableresizeboxboxgclcorolib.cluaB_yieldableluaB_yieldauxresumeluaB_corunningluaB_cocreateluaB_auxwrapluaB_costatusluaB_coresumeluaB_cowrapco_funcsldblib.cdb_getregistrydb_setmetatabledb_setuservaluedb_getmetatabledb_getuservaluedb_debughookfdb_getupvaluedb_setupvaluedb_upvalueiddb_tracebackdb_upvaluejoindb_getinfodb_setlocaldb_gethookdb_getlocaldb_sethookHOOKKEYhooknames.4827dbliblmathlib.cmath_radmath_degmath_tanmath_sqrtmath_sinmath_randomseedmath_randommath_minmath_maxmath_logmath_ultmath_expmath_cosmath_atanmath_asinmath_acosmath_typemath_modfmath_tointmath_absmath_fmodmath_floormath_ceilmathliblstrlib.cstr_lenwriterstr_upperstr_reversestr_repstr_lowermatch_classgmatchgmatch_auxstr_charstr_dumpstr_substr_bytepush_capturesmatchbracketclassstr_find_auxstr_matchstr_findstr_gsubgetoptionstr_packsizegetdetailsstr_unpackstr_packstr_formatstrlibltablib.cchecktab.part.0tremovetconcattinserttmoveauxsorttab_funcslutf8lib.citer_codesiter_auxbyteoffsetutflenutfcharcodepointlimits.4747linit.cloadedlibslcode.caddkremovevaluespatchlistauxluaK_codeconstfolding.isra.11discharge2regexp2regjumponcondcodebinexpvalef.6747lctype.cllex.clexerrorinclinenumberskip_sepesccheck.part.4read_long_stringread_numeral.isra.5llexluaX_tokenslbaselib.cluaB_typeluaB_tostringluaB_selectluaB_tonumberluaB_rawsetluaB_rawgetluaB_rawlenluaB_rawequalluaB_ipairsipairsauxluaB_nextgeneric_readerluaB_loadluaB_errorluaB_collectgarbageluaB_xpcallfinishpcallluaB_setmetatableluaB_getmetatableluaB_pairsluaB_pcallluaB_assertoptsnum.4846opts.4845base_funcslbitlib.cb_rshiftb_lshiftb_rrotb_notb_arshiftb_replaceb_testb_xorb_orb_lrotb_andb_extractbitlibbig_384_29.cBIG_384_29_rcopy.localalias.0fp_BLS381.clogb2ecp_BLS381.cECP_BLS381_cswapECP_BLS381_cmoveECP_BLS381_selectECP_BLS381_mul.part.2ecdh_BLS381.crom_curve_BLS381.crom_field_BLS381.cfp12_BLS381.cFP12_BLS381_selectecp2_BLS381.cECP2_BLS381_cmoveECP2_BLS381_selectECP2_BLS381_mul.part.1pair_BLS381.cPAIR_BLS381_linefp2_BLS381.cfp4_BLS381.cecp_SECP256K1.cECP_SECP256K1_cswapECP_SECP256K1_cmoveECP_SECP256K1_selectECP_SECP256K1_mul.part.2ecdh_SECP256K1.crom_curve_SECP256K1.crom_field_SECP256K1.cbig_256_28.cBIG_256_28_rcopy.localalias.2fp_SECP256K1.cHASH256_transformHASH512_transformSHA3_transformK_256K_512RCrand.csbrand.part.0fill_poolproductptabltabrcofbsubftablertablerbsuboct.cchar2intpbc_support.cecdh_support.cgcm.cgf2mulGCM_wrapelf-init.oS__FRAME_END__luaS_hashlongstrluaX_lookaheadluaS_clearcacheluaO_pushfstringluaV_lessthanluaO_int2fbluaC_upvalbarrier_luaK_goiffalseluaC_stepluaV_executeluaO_arithluaK_exp2anyregupluaV_finishsetluaE_shrinkCIluaH_getstrluaK_setoneretluaO_ceillog2luaD_poscallluaH_resizearrayluaS_removeluaD_callluaV_modluaH_newluaZ_initluaV_shiftlluaO_utf8escluaS_eqlngstrluaK_goiftrueluaZ_fillluaH_getluaO_pushvfstringluaV_divluaK_posfixluaK_setlistluaD_throwluaK_exp2RKluaS_createlngstrobjluaC_checkfinalizerluaK_reserveregsluaC_freeallobjectsluaD_hookluaE_setdebtluaT_callTMluaG_errormsgluaG_traceexecluaT_objtypenameluaV_finishgetluaX_syntaxerrorluaE_freeCIluaD_protectedparserluaF_initupvalsluaT_initluaC_barrier_luaE_extendCIluaH_getnluaK_exp2anyregluaV_tointegerluaS_newudataluaG_typeerrorluaD_pcallluaM_growaux_luaT_callorderTMluaK_nilluaV_lessequalluaH_newkeyluaG_runerrorluaD_callnoyieldluaD_inctopluaO_chunkidluaH_getshortstrluaK_checkstackluaG_concaterrorluaV_concatluaH_resizeluaX_setinputluaF_getlocalnameluaF_newCclosureluaO_fb2intluaO_str2numluaF_newprotoluaK_concatluaG_tointerrorluaK_stringK__init_array_endluaV_equalobjluaG_ordererrorluaF_closeluaK_patchtohereluaH_setluaK_patchlistluaK_jumpluaK_intKluaO_tostringluaC_barrierback_luaK_codeABxluaV_objlenluaK_prefixluaK_infixluaH_nextluaH_getintluaK_indexedluaK_dischargevarsluaG_opinterrorluaM_realloc_luaD_reallocstackluaC_fullgcluaD_precallluaK_patchcloseluaK_setreturnsluaS_newlstrluaK_getlabelluaF_freeprotoluaC_fixluaD_growstackluaK_codek_DYNAMICluaX_initluaY_parserluaT_trybinTMluaT_gettmbyobjluaH_freeluaX_nextluaK_storevarluaK_selfluaM_toobigluaK_codeABCluaE_freethread__init_array_startluaF_newLclosureluaS_resizeluaK_fixlineluaH_setint__GNU_EH_FRAME_HDRluaV_tonumber_luaK_ret_GLOBAL_OFFSET_TABLE_luaT_gettmluaX_token2strluaD_shrinkstackluaD_rawrunprotectedluaG_addinfoluaF_findupvalluaO_hexavalueluaC_upvdeccountluaC_newobjluaS_initluaU_dumpluaK_exp2nextregluaX_newstringluaV_finishOpluaK_exp2valluaS_newCURVE_W_BLS381BIG_384_29_subBIG_384_29_mulBIG_384_29_rcopycrypto_credentialmemcpy@@GLIBC_2.17__libc_csu_finiCURVE_BB_BLS381_ecp2_to_octetluaopen_ioRMD160_initmemmove@@GLIBC_2.17lua_checkstackModulus_SECP256K1OCT_copyECP_BLS381_rawoutputECP_SECP256K1_toOctetFP2_BLS381_conjzen_conf_parsezenroom_big_lenECP_BLS381_toOctetlua_gettopBIG_256_28_doutputFrb_BLS381zenroom_json_lenzencode_exec_tobufECP_BLS381_subBIG_256_28_copysegwit_addr_decodeECP_BLS381_dblzencode_datab45encodestrlen@@GLIBC_2.17CURVE_Cof_BLS381lua_absindexluaL_openlibluaL_wherelua_settopFP_SECP256K1_sqrlua_getlocalOCT_randcrypto_schnorr_signatureexit@@GLIBC_2.17_setjmp@@GLIBC_2.17zencode_when_lenMConst_SECP256K1FP2_BLS381_reducecrypto_credential_len_bitsizeRMD160_compresszenroom_common_lenzenroom_ecdhlua_getstackCURVE_Gx_BLS381ECP_BLS381_cfpFP12_BLS381_powB64decoded_lenFP12_BLS381_conjFP_BLS381_rcopyHASH_ALLBIG_256_28_incBIG_256_28_addAES_GCM_DECRYPT_ITM_deregisterTMCloneTableluaL_tracebackafterFP_BLS381_copyFP4_BLS381_div2ECP_SECP256K1_setxBIG_384_29_invmod2mFP4_BLS381_powFP2_BLS381_from_BIGECP_SECP256K1_KEY_PAIR_GENERATElua_tobooleanFP_BLS381_redcOCT_jintFP4_BLS381_cmovestrnlen@@GLIBC_2.17zencode_bitcoin_len__bss_start__BIG_384_29_jacobiBIG_384_29_shlluaL_pushresultsizezenroom_ecp2BIG_256_28_dnbitswarningECP_SECP256K1_copyGET_TIMEluaL_callmetaBIG_256_28_sdivbig_dupzencode_array_lenstats_lenBIG_256_28_compecdh_destroyzen_memory_reallocBIG_384_29_sducopyBIG_384_29_toByteszen_memory_managerOCT_joctetlua_touserdatazenroom_msgpackluaL_setfuncsmhashitzenroom_hashBIG_384_29_modnegexpf@@GLIBC_2.27CURVE_Pxa_BLS381luaL_argerrorecdh_initzenroom_octet_lenFP12_BLS381_invzencode_ethereum_lenluaL_tolstringlualibsHASH384_processtanf@@GLIBC_2.17lua_pushcclosurerng_allocAES_endftell@@GLIBC_2.17__cxa_finalize@@GLIBC_2.17zenroom_jsonFP12_BLS381_ssmulGCM_add_headerZmnemonic_check_and_bitsFP_SECP256K1_copylerrorzencode_w3cluaL_loadbufferxBIG_256_28_shlFP2_BLS381_invBIG_256_28_zeroAES_resetFP_SECP256K1_zeroclock_gettime@@GLIBC_2.17BIG_384_29_doutputlua_closestderr@@GLIBC_2.17BIG_256_28_orzencode_data_lenECP_SECP256K1_rawoutputECP_BLS381_PUBLIC_KEY_VALIDATEBIG_256_28_shrECP2_BLS381_infecp_newFP_SECP256K1_normCURVE_Bnx_BLS381FP_BLS381_imulECP_BLS381_SP_DSA_NOHASHo_newBIG_384_29_dsublua_nextbuf2hexOCT_outputbeforezenroom_benchlua_tointegerxecp2_duppush_octet_to_hex_stringfork@@GLIBC_2.17zencode_arraylua_tolstring_edataHASH512_processOCT_xorBIG_256_28_splitCURVE_Gy_SECP256K1KECCAK_hashECP2_BLS381_frobFP12_BLS381_pow4FP_SECP256K1_reduceBIG_384_29_randomstatslua_getinfoBIG_256_28_fromByteslua_identBIG_256_28_iszilchcrypto_elgamalECP_SECP256K1_mapitFP2_BLS381_times_iOCT_padBIG_256_28_dcopyFP4_BLS381_sqrECP_BLS381_addECP_SECP256K1_negHASH384_initoptarg@@GLIBC_2.17BIG_256_28_ddivzencode_dictionary_lencrypto_ethereum__ctype_tolower_loc@@GLIBC_2.17FP12_BLS381_sqrECP2_BLS381_rhszen_load_stringBIG_256_28_dmodnew_octet_from_bigsemver_lenAES_getreglocaleconv@@GLIBC_2.17BIG_256_28_invmod2mOCT_fromHexzenroom_bigFP_BLS381_qrFP_BLS381_subFP_BLS381_oneluaL_checkoptionBIG_384_29_dshlBIG_256_28_parityFP_BLS381_outputluaopen_ecp2U64encodeBIG_384_29_sdivluaL_refFP4_BLS381_copyBIG_384_29_dshrlua_createtableluaopen_bigFP2_BLS381_from_BIGslua_versionECP_SECP256K1_sublua_pushvfstringlua_rawset__bss_end__Fra_BLS381OCT_chopBIG_384_29_fromBytesOCT_compluaL_checknumberlua_gethookmnemonic_to_bitsFP4_BLS381_invcrypto_elgamal_lenlua_xmoveANSI_REDBIG_384_29_fromBytesLenfclose@@GLIBC_2.17luaL_optlstringzencode_keysFP2_BLS381_negECP2_BLS381_mulEXITCODEsystem_reallocFP4_BLS381_addtimetable_lenstb_c_lexer_get_locationBIG_256_28_ssnFP2_BLS381_iszilchz_set_separatorsluaL_optnumberfopen@@GLIBC_2.17BIG_256_28_mod2mluaL_pushresultrepl_flushBIG_256_28_rcopyFP_SECP256K1_redcmalloc@@GLIBC_2.17FP_BLS381_equalsmnemonic_from_dataFP12_BLS381_zeroECP_SECP256K1_ECIES_DECRYPToptind@@GLIBC_2.17lua_rawgetiluaS_hashbech32_encodeluaL_fileresultBIG_256_28_dsucopyhash_argdbig_initzen_lua_initFP4_BLS381_isunityECP_SECP256K1_pinmulz_snprintfsqrtf@@GLIBC_2.17ECP2_BLS381_generatorOCT_ncompECP_SECP256K1_SP_DSAbig_newzencode_lenHASH256_hashECP2_BLS381_mapitlua_setlocalehashitFP2_BLS381_div2zen_write_outluaL_openlibsFP12_BLS381_frobo_destroyrepl_readFP4_BLS381_equalsFP4_BLS381_imulluai_ctype_ECP2_BLS381_setBIG_256_28_decluaT_typenames_luaopen_debugstatemachinelua_setfieldlua_gcECP2_BLS381_getstrncmp@@GLIBC_2.17BIG_256_28_mulBIG_256_28_randomnumFP4_BLS381_xtr_Dset_color__libc_start_main@@GLIBC_2.17ECP_BLS381_influa_pushintegerstdout@@GLIBC_2.17FP4_BLS381_conjtodayinit_lenECP2_BLS381_dblBIG_256_28_cmovehdwallet_lenECP_SECP256K1_PUBLIC_KEY_VALIDATEhash_destroymemset@@GLIBC_2.17luaopen_mathzen_memory_freestrpbrk@@GLIBC_2.17BIG_256_28_outputECP_BLS381_copyzencode_reflow_lencrypto_bitcoin_lenBIG_256_28_dcmovelua_isnumbergetopt@@GLIBC_2.17CURVE_Order_SECP256K1MConst_BLS381zen_exitcodeFP4_BLS381_from_FP2zenroom_ecpzencode_tracebacklua_pushthreadrandombyteszencode_w3c_lenluaL_getsubtableFP_BLS381_invECP_BLS381_VP_DSA_NOHASHnopB64encoded_lenBIG_256_28_dcompBIG_384_29_moddivBIG_256_28_moddivluaopen_stringFP4_BLS381_from_FP2sSHA3_hashlog10f@@GLIBC_2.17luaL_checklstringcrypto_lagrange_interpolation_lenFP2_BLS381_pmulBIG_256_28_dnormluaT_callbinTMOCT_frombase64ECP2_BLS381_mul4FP_SECP256K1_negECP_SECP256K1_SVDP_DHlogf@@GLIBC_2.27ecp_argBIG_256_28_modmulfmodf@@GLIBC_2.17FP_SECP256K1_rcopyFP12_BLS381_from_FP4sBIG_384_29_iszilchz_sprintfBIG_384_29_pmulBIG_384_29_dsucopyCURVE_Cru_BLS381lua_setallocflua_pushvaluelua_pushfstringAMCL_HMACBIG_256_28_sdcopyluaL_prepbuffsizeECP_SECP256K1_rhslua_tonumberxlua_gettableFP2_BLS381_sqrCURVE_A_SECP256K1FP_BLS381_cswaplua_setiCURVE_Pyb_BLS381BIG_384_29_drawoutputstrcasecmp@@GLIBC_2.17lua_setglobalPAIR_BLS381_aterealloc@@GLIBC_2.17__ctype_toupper_loc@@GLIBC_2.17__data_startECP_BLS381_outputFP_BLS381_div2CURVE_SB_BLS381BIG_384_29_oneFP4_BLS381_onestdin@@GLIBC_2.17zconf_rngseedHASH512_hashFP2_BLS381_outputFP4_BLS381_reduceECP_SECP256K1_infECP_SECP256K1_ECIES_ENCRYPTFP_SECP256K1_mulo_dupECP_SECP256K1_addstrerror@@GLIBC_2.17_octet_to_bigGCM_finishRMD160_finishzencode_ethereumlua_loadluaZ_readBIG_256_28_fshrFP_BLS381_addluaopen_bit32lua_newuserdataECP_SECP256K1_dblluaL_checkintegerlua_setmetatableluaC_runtilstatezen_write_err_vazencode_debugHASH512_initAES_ecb_encryptECP_BLS381_pinmulcli_free_buffersluaP_opmodesECP_BLS381_ECIES_DECRYPTFP2_BLS381_cmoveBIG_384_29_dmodFP2_BLS381_sqrtGCM_add_cipherb58enclua_rawsetiFP_SECP256K1_cswapzencode_petitionBIG_256_28_fshlb58digits_mapAES_GCM_ENCRYPT__gmon_start__BIG_384_29_dnormlua_setuservalueluaopen_coroutineFP12_BLS381_smulfp12_argCURVE_Pxb_BLS381FP4_BLS381_times_iBIG_384_29_outputzen_initU64decodeANSI_YELLOW__dso_handlezen_write_errzenroom_ecdh_lenECP_SECP256K1_VP_DSA_NOHASHECP_SECP256K1_SP_DSA_NOHASHzencode_hashfseek@@GLIBC_2.17BIG_384_29_dcmovePAIR_BLS381_fexpabort@@GLIBC_2.17GCM_initFP4_BLS381_nconj_ecp_to_octetBIG_384_29_sqrlua_dumpANSI_RESETlua_newstatez_vsnprintf_IO_stdin_usedPAIR_BLS381_millerCURVE_Gy_BLS381ECP_SECP256K1_mul2BIG_256_28_sducopyFP_BLS381_normfp12_newlua_getupvalueFP12_BLS381_onelua_getglobalRMD160_processhdwalletBIG_384_29_normzen_unsetOCT_jstringBIG_384_29_dscopyBIG_256_28_sqrcrypto_schnorr_signature_lenFP_SECP256K1_outputzen_add_randomECP_SECP256K1_outputOCT_output_stringfeof@@GLIBC_2.17puts@@GLIBC_2.17FP_SECP256K1_subecp_duplua_pushnumberlua_lenlua_settableBIG_256_28_diszilchzencode_keys_lenECP_BLS381_mul2AMCL_AES_decryptPAIR_BLS381_G1mulFP4_BLS381_pmulECP_SECP256K1_generatorFP4_BLS381_xtr_pow2Modulus_BLS381zencode_givenzen_memory_allocb45decodezencode_dp3tBIG_384_29_dcompzencode_thenlua_pushbooleanlua_topointermutt_vsnprintfFP12_BLS381_outputmemcmp@@GLIBC_2.17FP4_BLS381_subECP_BLS381_isinffunccrypto_lagrange_interpolationacosf@@GLIBC_2.17ECP2_BLS381_toOctetz_vsprintfPAIR_BLS381_GTpowBIG_384_29_imulBIG_384_29_compOCT_jbyteR2modp_SECP256K1FP4_BLS381_qmulluaL_optintegerluaL_checkstacklua_fatalstrcmp@@GLIBC_2.17zen_require_overrideFP_SECP256K1_nresBIG_256_28_smulHASH256_process__libc_csu_initluaL_testudata__ctype_b_loc@@GLIBC_2.17BIG_256_28_modOCT_xorbytelua_atpanicECP_SECP256K1_getzencode_then_lenBIG_256_28_normstrtol@@GLIBC_2.17ECP_BLS381_mulBIG_256_28_drawoutputFP2_BLS381_subrepl_promptCURVE_Cof_I_SECP256K1zen_teardownPAIR_BLS381_nbitsluaL_buffinitsizeFP12_BLS381_usqrfread@@GLIBC_2.17luaL_checktypelua_stringtonumberBIG_384_29_isunitycrypto_petition_lenz_vsprintfcblua_pushlightuserdatastrtof@@GLIBC_2.17lua_getallocfluaL_checkudataANSI_MAGENTAlua_isyieldableecp2_argzencode_execPBKDF2FP2_BLS381_rawoutputECP_SECP256K1_cfpECP_BLS381_mapitzencode_verify_lenlua_getuservaluefree@@GLIBC_2.17lua_rawgetECP2_BLS381_setxzenroom_execluaL_gsubFP2_BLS381_onezenroom_bench_lenBIG_384_29_montylua_rotateBIG_256_28_jacobib58tobinSHA3_shakeECDHRAND_cleanFP2_BLS381_normcrypto_bitcoinCURVE_Cof_I_BLS381lua_copyluaopen_hashlua_pushlstringlua_iscfunctionRMD160_hashECP_BLS381_setxzen_add_functionluaL_addstringBIG_384_29_dmod2mzencode_random_lenFP_SECP256K1_addBIG_384_29_randomnumECP_BLS381_SVDP_DHCURVE_WB_BLS381zenroom_ecp_lenzencode_secshare_lenFP12_BLS381_tracestrncasecmp@@GLIBC_2.17__end__luaL_checkanyo_argsemverlua_yieldkb58digits_orderedBIG_256_28_dmod2mBIG_384_29_modsqrlog2@@GLIBC_2.17zencode_http_lenFP12_BLS381_from_FP4BIG_384_29_splitbig_argFP12_BLS381_toOctetruntime_random256lua_newthreadluaopen_aesFP2_BLS381_addFP_BLS381_nresSHA3_initstrspn@@GLIBC_2.17zen_exec_zencodesystem_allocFP2_BLS381_copyBIG_384_29_mod2mCURVE_B_SECP256K1lua_rawequalFP12_BLS381_isunityBIG_256_28_pmulGCM_add_plainBIG_384_29_bitAES_ecb_decryptzconf_printf__bss_startECP_BLS381_ECIES_ENCRYPTzen_write_out_vaBIG_384_29_pxmulAES_CBC_IV0_DECRYPTstrchr@@GLIBC_2.17fp12_destroyBIG_256_28_fromBytesLenlua_callkBIG_384_29_zerolua_errorFP_BLS381_multimetablecrypto_ethereum_lenFP2_BLS381_div_ipFP_SECP256K1_qrANSI_CYANhex2bufECP2_BLS381_addECP_SECP256K1_affinezencode_given_lenECP_SECP256K1_equalsBIG_384_29_sdcopyluaL_addlstringload_fileluaL_getmetafieldlua_rawlenOCT_clearBIG_384_29_dzeroinspect_lenBIG_384_29_orpowf@@GLIBC_2.27fwrite@@GLIBC_2.17BIG_384_29_invmodpsegwit_addr_encodelua_sethookluaopen_utf8FP_BLS381_rawoutputBIG_256_28_bitFP12_BLS381_mulECP_BLS381_KEY_PAIR_GENERATEFP2_BLS381_mul_iplua_tothreadzencode_verifywait@@GLIBC_2.17BIG_256_28_modnegzenroom_cbor_lenFP_BLS381_iszilchBIG_384_29_modFP_SECP256K1_powfflush@@GLIBC_2.17zenroom_msgpack_lenFP_BLS381_cmoveFP2_BLS381_from_FPszencode_hash_lenBIG_384_29_smulBIG_256_28_div3RAND_byteluaL_checkversion_BIG_256_28_oneECP_BLS381_affineECP_BLS381_rhsECP_BLS381_negHASH_IDECP_SECP256K1_setBIG_384_29_declua_typenameBIG_384_29_dnbitsstrcpy@@GLIBC_2.17ECP2_BLS381_subis_base45SHA3_processmutt_snprintfluaL_pushmodulezencode_whenR2modp_BLS381BIG_384_29_ssnecdh_addluaL_errorlua_rawgetpstrncat@@GLIBC_2.17AMCL_AES_encryptzen_add_classBIG_384_29_diszilchFP_SECP256K1_oneBIG_384_29_div3lua_isuserdatafp12_dupvsprintf@@GLIBC_2.17ECP2_BLS381_copyBIG_256_28_dshlBIG_256_28_invmodplua_tocfunctionzen_exec_scriptcli_alloc_buffersFP2_BLS381_mulinspectrepl_writeFP2_BLS381_imulstatemachine_lenFP12_BLS381_fromOctetFP12_BLS381_normBIG_256_28_dshrmemchr@@GLIBC_2.17lua_pushnilCURVE_B_I_SECP256K1big_destroyluaopen_ecpFP4_BLS381_from_FP2Hzencode_dictionaryECP2_BLS381_fromOctetECP2_BLS381_equalsluaL_loadstringECP2_BLS381_outputFP12_BLS381_equalsFP2_BLS381_div_ip2luaopen_tableatan2f@@GLIBC_2.17CURVE_B_BLS381FP2_BLS381_isunitystb_c_lexer_initBIG_384_29_ddivFP12_BLS381_reduceFP12_BLS381_compowECP2_BLS381_negBIG_256_28_lastbitsFP_SECP256K1_div2lua_upvaluejoinHASH256_initecp_destroyECP_BLS381_SP_DSAECP2_BLS381_isinfECP_BLS381_getecdh_argFP_SECP256K1_imulBIG_384_29_daddzencode_httpBIG_256_28_dfromBytesLensystem_freeANSI_BLUEECP_BLS381_generatorFP4_BLS381_xtr_powsrand@@GLIBC_2.17luaL_addvaluePAIR_BLS381_double_atestrstr@@GLIBC_2.17CURVE_Order_BLS381BIG_256_28_cswapECP_SECP256K1_isinfBIG_256_28_modsqrFP4_BLS381_xtr_AECP_SECP256K1_VP_DSAAMCL_RAND_seedlua_concatluaL_setmetatableFP_SECP256K1_equalszencode_debug_lenFP4_BLS381_mulsha256_rawluaopen_fp12vsnprintf@@GLIBC_2.17BIG_384_29_dfromBytesLenzenroom_cborBIG_256_28_imulCURVE_B_I_BLS381luaopen_baseFP4_BLS381_negECP_BLS381_setecp2_newluaopen_octetHASH384_hashluaP_opnamesECP_BLS381_VP_DSAstrcoll@@GLIBC_2.17zen_extensionsstb_c_lexer_get_tokenFP_BLS381_sqrtOCT_toHexzencode_reflowluaopen_ecdhBIG_256_28_rawoutputlongjmp@@GLIBC_2.17BIG_384_29_fshrFP_BLS381_zeroECP_BLS381_fromOctetBIG_384_29_rawoutputFP_SECP256K1_modBIG_256_28_randomzenroom_ecp2_lenBIG_256_28_dzerolua_type__TMC_END__zencode_petition_lenFP_BLS381_reduceluaL_lenBIG_384_29_shrFP2_BLS381_zerozenroom_hash_lenFP4_BLS381_isrealstrncpy@@GLIBC_2.17FP4_BLS381_iszilchANSI_GREENlua_statusFP_BLS381_negzen_add_iofrexpf@@GLIBC_2.17BIG_256_28_dsublua_upvalueidECP2_BLS381_affineBIG_384_29_nbitsluaL_execresultPAIR_BLS381_G2mulasinf@@GLIBC_2.17_ITM_registerTMCloneTableFP4_BLS381_outputBIG_256_28_isunitymnemonic_wordlistECP2_BLS381_outputxyzBIG_384_29_fshlECP_BLS381_equalsBIG_384_29_modmulFP_SECP256K1_sqrtluaL_newmetatablezencode_randomFP_SECP256K1_iszilchECP_SECP256K1_outputxyzBIG_256_28_nbitsFP_SECP256K1_cmoveBIG_384_29_cswapBIG_256_28_dscopyvfprintf@@GLIBC_2.17FP2_BLS381_equalsBIG_384_29_copy__assert_fail@@GLIBC_2.17__errno_location@@GLIBC_2.17lua_resumeBIG_384_29_dcopyOCT_shlluaL_unreflua_arithCURVE_A_BLS381lua_compareFP12_BLS381_iszilchzencode_ecdhzen_setenvAMCL_SHA3_squeezelua_pushstringluaL_buffinitputchar@@GLIBC_2.17OCT_toStrBIG_384_29_parityFP4_BLS381_zeroprctl@@GLIBC_2.17lua_getmetatablePAIR_BLS381_initmpFP12_BLS381_pinpowzen_requireECP_SECP256K1_fromOctetzen_add_parseOCT_emptyzencode_ecdh_lenBIG_384_29_inczencode_credential_lenFP12_BLS381_copylua_gethookcountzencode_secsharelua_setupvaluelua_getiAES_CBC_IV0_ENCRYPTFP2_BLS381_powECP_SECP256K1_mulCURVE_Pya_BLS381BIG_384_29_cmoveFP_BLS381_modhash_newsyscall@@GLIBC_2.17FP4_BLS381_normECP_BLS381_outputxyzBIG_256_28_montyFP2_BLS381_from_FPecp2_destroyzencode_dp3t_lenBIG_384_29_addOCT_jbyteslua_getfieldFP_BLS381_sqrzen_exec_extensionBIG_384_29_lastbitsluaO_nilobject_CURVE_Gx_SECP256K1FP12_BLS381_cmoveFP_SECP256K1_rawoutputzenroom_commonzencode_credentialFP_SECP256K1_invlua_pcallkcrypto_petitionlua_rawsetpFP4_BLS381_rawoutput_fp_to_bigzenroom_exec_tobuffgets@@GLIBC_2.17bech32_decodePAIR_BLS381_anotherAES_initFP4_BLS381_froblua_gethookmaskrepl_loopOCT_tobase64zenroom_octetzencode_bitcoinFP_BLS381_powluaL_requirefpush_buffer_to_octetlua_isintegerlog2f@@GLIBC_2.27BIG_256_28_pxmulferror@@GLIBC_2.17BIG_256_28_daddBIG_256_28_subCURVE_Cof_SECP256K1noticeBIG_256_28_toByteslua_isstring.symtab.strtab.shstrtab.interp.note.ABI-tag.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.data.rel.ro.dynamic.got.got.plt.data.bss.comment88#TT 1tt$Do$N V ^oppko00pz/B>>hFhFFF@KK_DD``0  ( pp xx  N++--//22PII0IJ (g؁