--- Log opened Tue Nov 26 00:00:19 2019 00:01 -!- jonatack_ [~jon@37.164.112.70] has joined #secp256k1 00:04 -!- jonatack [~jon@37.173.132.239] has quit [Ping timeout: 276 seconds] 00:33 -!- reallll [~belcher@unaffiliated/belcher] has quit [Quit: Leaving] 01:36 -!- belcher [~belcher@unaffiliated/belcher] has joined #secp256k1 01:36 -!- belcher [~belcher@unaffiliated/belcher] has quit [Remote host closed the connection] 02:23 -!- jonatack_ [~jon@37.164.112.70] has quit [Quit: jonatack_] 02:23 -!- jonatack [~jon@37.164.112.70] has joined #secp256k1 09:09 -!- andytoshi [~apoelstra@unaffiliated/andytoshi] has joined #secp256k1 11:18 -!- midnightmagic is now known as midnight 12:01 -!- jonatack_ [~jon@37.165.182.12] has joined #secp256k1 12:05 -!- jonatack [~jon@37.164.112.70] has quit [Ping timeout: 265 seconds] 12:38 < gmaxwell> has anyone looked into implementing bulletproofs over secq so that secp calculations are cheap inside it? 12:38 < gmaxwell> the secq prime isn't nicely structured, so arithmetic will be slower. 12:46 < gmaxwell> I suppose this is an advantage of crandall primes... it should be possible to find low trace curves where both the field and the group have cheap arithmetic. I doubt this is ever the case for other kinds of generalized mersenne primes (okay, it would probably be the case that an actual mersenne number would work, but there aren't many of those) 13:37 -!- jonatack_ [~jon@37.165.182.12] has quit [Quit: jonatack_] 13:37 -!- jonatack [~jon@37.165.182.12] has joined #secp256k1 14:19 -!- afk11 [~afk11@gateway/tor-sasl/afk11] has quit [Remote host closed the connection] 14:21 -!- afk11 [~afk11@gateway/tor-sasl/afk11] has joined #secp256k1 15:15 -!- andytoshi [~apoelstra@unaffiliated/andytoshi] has quit [Ping timeout: 265 seconds] 23:59 -!- jonatack [~jon@37.165.182.12] has quit [Read error: Connection reset by peer] --- Log closed Wed Nov 27 00:00:20 2019