04:05:17 Isthmus> 2) Block generation/verification: Transactions with the same E should not show up within W range of each other. >>>> so for this, you would need to have a nonce in the tx format to allow for creation of unique E within W range? 04:10:19 oooh ... that condition only arises *because* of a reorg 17:51:55 @gingeropolous kind of - I wouldn't call it a none since it's a deterministic pointer rather than a randomly generated one 17:51:55 Consider the first output in this random transaction: 17:51:55 https://xmrchain.net/tx/2be75fadf28e88cfc3c27dff108901cf08a9c44296c60eada08ca3e442e2b741 17:51:55 Suppose I now generate a new transaction that includes that output in a ring signature. 17:52:16 Under the current protocol, the new transaction would reference `output index: 23625371` 17:52:47 Under the hybrid protocol, it would instead reference `output index: 23625371, E: 364d4f3` 17:53:11 Where that E value is the last few digits of the stealth address of that output a59c181c0c69944fa978d3bb24e0b1548fbe04d18f73143f0757b0215364d4f3 17:53:52 So `E` is not added when the output is *generated* but rather when it is *referenced* 17:54:03 so, adding 28 bits of overhead to each output? 17:55:03 Could probably be fewer than 28 bits. Let me do some back of the envelope calculations... :thinking: 18:05:54 ok, so tx T that references output at index: 23625371, E: 364d4f3 , then gets reorged. 18:33:29 @gingeropolous then in the new chain it might land at index 23625378 instead 18:34:00 So when a node is verifying the transaction that references index: 23625371, E: 364d4f3, it will be able to find it at index 23625378 18:35:30 Let 18:35:30 W be the window size (e.g. in blocks), X represent the max number of ring members in a given block 18:35:54 Sorry, not in a 'given' block. I mean max number of ring members tat would fit in the current max block size 18:36:54 and P be the probability threshold for how often it's acceptable for a collision to occur (resulting in the second transaction waiting a few blocks to be mined 18:37:19 Then the number of bits necessary to achieve P would be log2(W*X/P) I think 18:39:03 W*X/P is a very large number 18:39:48 e.g. if P is 10%, you are evaluating 10*w*X 20:59:52 Hm yea, so 28 bits might not be too far off. That'd be a bit unwieldy