| 00:31:00 | Emcy: | neat gm |
| 01:37:51 | Quanttek: | Quanttek is now known as Quanttek_sleepin |
| 01:41:12 | Quanttek_sleepin: | Quanttek_sleepin is now known as Quanttek |
| 03:56:52 | jcrubino: | jcrubino has left #bitcoin-wizards |
| 09:15:23 | c0rw|away: | c0rw|away is now known as c0rw1n |
| 14:20:28 | whatever: | whatever is now known as Guest90904 |
| 16:41:57 | petertodd: | gmaxwell: thats whwt ive been saying for ages |
| 16:43:25 | petertodd: | gmaxwell: oh, now i get it, very clever. good to do tue same with per txout too |
| 16:44:02 | gmaxwell: | "thats what" the utxo key stuff? or the beacon stuff? :) |
| 16:44:24 | petertodd: | lol, the utxo stuff |
| 16:44:31 | gmaxwell: | ah. |
| 16:44:52 | petertodd: | h(something) is essential for engineerimg reasons anyway |
| 16:45:39 | petertodd: | i can change the stralth prefix stuff to work with h(h(txout)) and do that up in an index or something |
| 16:45:55 | gmaxwell: | perhaps not essential, since self-balancing data structures should be adequate and have acceptable worse case behavior. But it's desirable, I agree. |
| 16:46:36 | gmaxwell: | The encryption part is an additional interesting thing. Seems like it would have some good properties. |
| 17:34:57 | gmaxwell: | petertodd: does your stealth address stuff encode a payment id? |
| 19:00:33 | HaltingState: | gmaxwell, sipa "A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic" has anyone read this paper |
| 19:02:15 | Apocalyptic: | is that an adaptation of the index calculus method ? |
| 19:02:26 | HaltingState: | not sure |
| 19:03:02 | HaltingState: | i dont think index calculus works for discrete log |
| 19:03:13 | Apocalyptic: | huh, it does |
| 19:03:20 | HaltingState: | i remember pho land rho or whatever index calculus for prime factorization |
| 19:03:45 | HaltingState: | ECC is black box to me; i dont remember enough group theory |
| 19:05:23 | HaltingState: | i wonder what happens if you factor the group for a particular curve and why the discrete log problem should be hard |
| 19:08:47 | HaltingState: | ECC2K-108, involving taking a discrete logarithm on a Koblitz curve over a field of 2108 elements. The prize was awarded on 4 April 2000 to a group of about 1300 people represented by Robert Harley. They used a parallelized Pollard rho method with speedup. |
| 19:08:57 | HaltingState: | bitcoin is 256 bit prime |
| 19:13:01 | HaltingState: | this paper is implying that the low characteristic NIST standard curves (characteristic 2) are weak i think |
| 19:48:40 | Apocalyptic: | that was the consensus imo |
| 20:00:05 | michagogo: | 20:16:21 Channel ban set for ajweiss!*@*$##fix_your_connection (+b) by @gmaxwell |
| 20:00:06 | michagogo: | 20:16:27 ← ajweiss was kicked by gmaxwell (greg@wikimedia/KatWalsh/x-0001): ajweiss |
| 20:00:23 | michagogo: | Erm, why kick in a situation like that? Usually people just ban |
| 20:00:32 | michagogo: | And then if the user disconnects again... |
| 20:03:17 | midnightmagic: | he's being proactive. :) |