00:22:48 <m-relay> <9​d74bfb0:monero.social> Just wanted to make sure: wallet->account->address
00:28:29 <m-relay> <9​d74bfb0:monero.social> is there anyway to get the current wallet?
01:40:39 <selsta> what exactly do you want from the wallet?
01:41:09 <selsta> seed, private keys, file name, file location, ...?
05:40:29 <m-relay> <9​d74bfb0:monero.social> I was just trying to know the order of possession
14:48:58 <m-relay> <r​ogu157:matrix.org> Hi,
14:48:59 <m-relay> <r​ogu157:matrix.org> I am a pool operator, and I want to create unique work for all my miners. 
14:49:01 <m-relay> <r​ogu157:matrix.org> Here's the algorithm I currently use:
14:49:03 <m-relay> <r​ogu157:matrix.org> 1. Parse the block template blob.
14:49:05 <m-relay> <r​ogu157:matrix.org> 2. Place unique extra data into the coinbase transaction.
14:49:07 <m-relay> <r​ogu157:matrix.org> 3. Calculate the merkle root.
14:49:09 <m-relay> <r​ogu157:matrix.org> 4. Send the hashing blob to the miner.
14:49:11 <m-relay> <r​ogu157:matrix.org> I apply this approach to all connected miners. 
14:49:13 <m-relay> <r​ogu157:matrix.org> However, if the block contains many transactions from the mempool, calculating the merkle root takes time. 
14:49:15 <m-relay> <r​ogu157:matrix.org> As a result, the last miner receives their work with a latency that can affect our pool's profits because part of the block time is spent on creating the work.
14:49:17 <m-relay> <r​ogu157:matrix.org> I would like to know if there is another way to create unique work assignments or any optimizations for the algorithm we are currently using.
14:51:17 <m-relay> <r​ogu157:matrix.org> And another question:
14:51:19 <m-relay> <r​ogu157:matrix.org> Is it acceptable for the Monero network if we mine empty blocks for a few days to check if there is a profit problem due to the unoptimized work creation in our source code? 
14:51:21 <m-relay> <r​ogu157:matrix.org> This would be just for a few days, and we would revert to normal operations afterward.
14:51:30 <m-relay> <r​ogu157:matrix.org> Hi,
14:51:31 <m-relay> <r​ogu157:matrix.org> I am a pool operator, and I want to create unique work for all my miners.
14:51:33 <m-relay> <r​ogu157:matrix.org> Here's the algorithm I currently use:
14:51:35 <m-relay> <r​ogu157:matrix.org> 1. Parse the block template blob.
14:51:37 <m-relay> <r​ogu157:matrix.org> 2. Place unique extra data into the coinbase transaction.
14:51:39 <m-relay> <r​ogu157:matrix.org> 3. Calculate the merkle root.
14:51:41 <m-relay> <r​ogu157:matrix.org> 4. Send the hashing blob to the miner.
14:51:43 <m-relay> <r​ogu157:matrix.org> I apply this approach to all connected miners.
14:51:45 <m-relay> <r​ogu157:matrix.org> However, if the block contains many transactions from the mempool, calculating the merkle root takes time.
14:51:47 <m-relay> <r​ogu157:matrix.org> As a result, the last miner receives their work with a latency that can affect our pool's profits because part of the block time is spent on creating the work.
14:51:49 <m-relay> <r​ogu157:matrix.org> I would like to know if there is another way to create unique work assignments or any optimizations for the algorithm we are currently using.
14:51:51 <m-relay> <r​ogu157:matrix.org> Thank you!
15:14:50 <sech1> rogu157 Merkle root can be recalculated in O(logN) time, and P2Pool can create work for 10k miners in ~0.01 seconds
15:15:51 <sech1> See https://github.com/SChernykh/p2pool/blob/master/src/block_template.cpp#L1190 for reference