15:10:26 sarang: suraeNoether both exciting updates :) 15:11:17 Reorganizing a paper is not exciting :( 15:11:20 It is quite dull 15:12:54 the result-updates are the exciting thing :p 15:13:00 and the effort!! 21:44:39 what does the multiexp function do in bulletproofs.cc? 21:46:07 It multiplies, and it accumulates. It's a MAC. 21:46:33 (faster than doing it naively) 21:47:22 could you point me to a naive implementation or explanation so I can get a better grasp of what is being accomplished? 21:48:27 T=0 for n in range(N): T+=a[n]*A[n]; return T 21:55:25 The methods are Straus and a simplified Pippenger algorithm 22:07:41 thanks! 22:08:17 if it multiplies and accumulates, what is the meaning behind the name "multiexp"? 22:16:47 Mutliple exponentiation. 22:17:36 Because a multiplication is just an exponentation in some ways. 22:17:46 Like when you add logs instead of multiplying :) 22:18:07 I *think* it's just historical context. 22:18:47 Multiplying scalar to point in ECC is akin to modexp in RSA. 22:19:02 There might be more to it, I'd be curious. 22:21:08 thanks 23:01:39 Some people prefer multiplicative notation for groups. Others prefer additive notation, and are correct :) 23:02:04 The former leads to exponentiation, the latter to multiplication 23:02:43 I also see the term "multiscalar multiplication" used instead of multiexp 23:23:12 Thanks, I appreciate the lesson :D 23:31:22 Either way, the methods used scale as O(n/log(n))