pull down to refresh
I wasted way too much time on this, but my second attempt works—I just needed a fifth transaction.
Arrow points from child to parent. Dotted line with ball and socket, the socket is on the side of the replacement.
You have two confirmed UTXOs C1 and C2. Let’s say 20 s/vB is the bottom of the first block.
- You create a large low-feerate transaction
tx_LLwith 100,000 vB at 1 s/vB (fee: 100,000 s). It spends the confirmed outputC1and has an outputtx_LL:0. - You attach a small low-feerate transaction
tx_LSas a child with 100 vB at 1 s/vB (fee: 100 s) by spendingtx_LL:0.
- You RBF
tx_LSwith a high-feerate transaction that spendsC2andtx_LL:0in a new transactiontx_HS.tx_HShas 5000 vB and pays 21 s/vB, but since it spends an output from a low-feerate parent, it’s mining score is only 1.95 s/vB.
- You RBF
tx_LLandtx_HSwithtx_LMthat has 100,000 vB and pays 3.05 s/vB (fee: 305,000 s) by spending the outputsC1andC2. This is permitted, since onlytx_LLis a direct conflict, so the feerate oftx_HSdoes not have to be beat directly.
- You use the new RBFr rules to replace
tx_LMwith a small high feerate transactiontx_RBFrwith 100 vB paying 20 s/vB (fee: 2000 s) that spendsC2and makes it into the top block of the mempool.tx_LMwas not going to be in the next block, andtx_RBFrpays more than 1.25× the feerate oftx_LM. So this is permitted under the new rules.
- You then rebroadcast
tx_LLandtx_LSbecauseC1is no longer being spent.
- You immediately replace both
tx_LSandtx_RBFrwithtx_HS.tx_HShas a feerate of 21 s/vB which is higher thantx_RBFr(20 s/vB) andtx_LS(1 s/vB), and pays more absolute fees than both (105,000 s vs 2000 s + 100 s). But since it’s a child oftx_LLit only has a mining score of 1.95 s/vB.
Repeat 4.–7. to make every node on the network cycle the same five transactions ad nauseam. Roll the locktimes or sequences to make the transaction have a new TXIDs in each iteration, while spending the same UTXOs. The only transaction that is ever in any danger of getting mined is tx_RBFr which costs you 2000 s. If it it does get included in a block, just start over with a new confirmed UTXO as your c2'.
Very healthy numbers 📈
https://m.stacker.news/11356
Then absolutely parabolic 🤣 (due to territories)
https://m.stacker.news/11354
I just wanted to help...
I am always posting on BTC apps githubs feature requests, bugs, improvements...
I just want to help these developers, testing their apps and make them better.
I also write guides and documentation for some apps, and do translations in 4 languages.
All for free.
Only together we can go forward.
Once it was implemented, the value it brings is immense in tying posts together and increasing visibility for older content.
I think you mean the update that @k00b did to our search engine which now uses a neural network to find similar posts with "once it was implemented".
I agree, it's very valuable to find similar posts this way. Kudos to @k00b for that!
But I think with "embedded search", a search while writing a reply was meant.[1] For example, you could simply type / in your reply and a search would popup to find the post you want to link to. Just like you can currently @ and a search for all users shows up. This way, you don't need to stop writing your comment to link to a post. We haven't implemented that yet though.
During my first year on SN I spent a lot of time dredging up old posts to read. It felt like a shame that, at least for me, they were so difficult to find.
It's still a shame that there are no obvious, only abstract rewards for that currently but we will get there, I think. :)
The fear of vegetables is called Lachanophobia