--- Log opened Mon Jul 10 00:00:55 2023
00:33 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has quit [Quit: My iMac has gone to sleep. ZZZzzz…]
06:56 -!- preimage [~halosghos@user/halosghost] has joined #secp256k1
08:36 -!- roconnor [~quassel@coq/roconnor] has quit []
08:36 -!- roconnor [~quassel@coq/roconnor] has joined #secp256k1
10:05 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has joined #secp256k1
10:20 < theStack> sage question: is there any guarantee about how the roots() method of a polynomial returns its solutions (if there are any)? there was in-comment sage code finding a nontrivial root of Z(1) via `(1 - (polygen(Z))^3).roots()[1][0]` -- i was wondering how the test writer back then knew that the relevant solution sits at index 1 (maybe just trial and error?!)
10:21 < theStack> (see https://github.com/bitcoin-core/secp256k1/pull/1340#issuecomment-1627884373 ff. for context, thanks a lot for the math explanation below btw, sipa!)
10:21 < sipa> I don't think there are guarantees about the order.
10:21 < theStack> okay
11:51 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has quit [Quit: My iMac has gone to sleep. ZZZzzz…]
12:05 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has joined #secp256k1
13:40 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has quit [Quit: My iMac has gone to sleep. ZZZzzz…]
13:47 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has joined #secp256k1
14:36 -!- tromp [~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl] has quit [Quit: My iMac has gone to sleep. ZZZzzz…]
14:43 -!- preimage [~halosghos@user/halosghost] has quit [Quit: WeeChat 4.0.1]
20:25 -!- HumanGeek [~jerome@82.66.65.160] has quit [Ping timeout: 260 seconds]
20:26 -!- HumanGeek [~jerome@82.66.65.160] has joined #secp256k1
--- Log closed Tue Jul 11 00:00:56 2023