--- Log opened Fri Feb 14 00:00:40 2020 01:29 -!- hodlwave1 [hodlwavema@gateway/shell/matrix.org/x-aarguqyrbpedkhnk] has joined #braidpool 02:25 -!- CjS77 [~caylemeis@195.159.29.126] has quit [Quit: Leaving] 02:28 -!- CjS77 [~caylemeis@195.159.29.126] has joined #braidpool 09:49 -!- belcher [~belcher@unaffiliated/belcher] has quit [Ping timeout: 265 seconds] 09:58 -!- belcher [~belcher@unaffiliated/belcher] has joined #braidpool 10:14 < bsm117532> hodlwave hodlwave1 did you see my responses above? 10:52 < hodlwave> Hello! yes I gave them a cursory read through earlier, but I've been busy and need more time to really sit down tp try to parse everything. Hopefully will have time tonight or tomorrow if not. Thanks so much for the detailed explanation :) 10:53 < bsm117532> I need to write that all up, as well as code up the graph->Kirchoff equations and evaluation. 10:53 < bsm117532> That's slightly non-trivial, but a well-trod path in the electronics world. 10:53 < hodlwave> Oh I was planning to attempt a writeup once I've grokked it all but either way :D 10:53 < hodlwave> It's been a while since I met my old friend Kirchoff 10:53 < bsm117532> Also, the bane of every undergraduate physics student. (I used to teach them that...everyone fails the Kirchoff midterm) 10:54 < hodlwave> lol 16:59 -!- belcher [~belcher@unaffiliated/belcher] has quit [Ping timeout: 272 seconds] 19:29 < hodlwave> https://pastebin.com/TnTn52uQ 19:30 < hodlwave> ^ so far so good? 19:54 < hodlwave> Wait, not sure if I'm reading you correctly; are the transaction in B not automatically included in the UTXO set here regardless of how Hash(B) compares to Hash(B')? https://pastebin.com/kdfCKUsE 19:57 < hodlwave> "So any txs on the 2-block side "win" over the other for the purpose of deciding double-spends (and you don't have to fall to luck in that example)" nvm :) 20:26 < hodlwave> Ok so correct me if I'm wrong: to solve the which-tx-is-accepted question, the heaviest chain is calculated using Kirchoff's equations and the lowest hash chooses the winner Tx in the event of a tie 20:33 < hodlwave> If I'm not mistaken, a hasher _wants_ to reference as many valid parents as he can while attempting to mine a share; it doesn't cost him anything extra to so and makes the pool more economical by ensuring that rewards are paid fairly for work rendered. 21:47 < hodlwave> I get that shares are rewarded based on the "effective difficulty" algorithm. It's not super clear how this works in practice if - like you implied - a cohort can always change by high-latency hasher or attacker. 21:48 < hodlwave> It seems like each node would have to recompute everyone else's shares every time the cohort changes. After some agreed upon timeout I guess a cohort would have to be finalized 21:49 < hodlwave> That's enough for today. This system has more layers than an onion :D --- Log closed Sat Feb 15 00:00:39 2020