-
A ‘one-kernel transaction’ indicates that its inputs and outputs have not been aggregated yet and can be linked together. The reason for Grin having so many ‘one-kernel transactions’ is due to its low anonymity set. There are not enough transactions that to merge in the stem phase of Dandelion.
-
During the Dandelion Stem Phase, the Beam nodes check whether the merged transactions have at least two kernels. If there are, the nodes will ensure that the transaction has at least two outputs. They will add more decoy outputs to it until there are at least five outputs.
-
To re-broadcast the transaction, it must have at least five outputs.
-
When the node adds dummy UTXOs as inputs to a randomly chosen transaction, the decoys are spent and removed from the blockchain.
-
The Lelantus-MW protocol increases the anonymity set to 100k outputs above.
-
One kernel transactions are transactions not merged with any other transactions. Grin has so many of them because the network is not saturated.
-
Beam’s implementation of Dandelion has an improvement over Grin’s.
-
5
-
By spending them, adding random UTXO’s.
-
Lelantus MW.
-
A one-kernel transaction is a transaction that has not been merged with any other transactions. Grin has so many of these, because the network is not saturated and there are not enough transactions to be merged in the stem phase of Dandelion.
-
Decoy transactions
-
5
-
Adding the dummy UTXOs at a later stage as inputs to a random transaction. This will then spend them and remove them from the blockchain. It also creates a relation between users that are in fact unrelated.
-
Lelantus-MW
-
A one-kernel transaction is aptly named because it is a transaction that has not been merged with any other transaction. If there are no transaction input/output merges - in other words, if the anonymity set is small - then it is easier to see links between senders and receivers.
Grin has so many one-kernel transactions because the Grin network is not saturated; it currently has low adoption and usage. These problems should improve over time, as the network gains traction. -
Beam’s solution to linkability is to use dummy UTXOs. Dummies have a transaction value of zero, but are indistinguishable from normal transactions (I assume because transaction amounts are shielded).
-
“At every step of the Dandelion Stem Phase, Beam nodes check whether the merged transactions (might be only one transaction) have at least 5 outputs.”
If not, the transaction is not re-broadcast. -
Dummy transactions can, at a later stage, be randomly added to other transactions, creating dummy links between senders and receivers. These additions count as spending, hence they are removed from the blockchain, and preventing cluttering.
-
“Lelantus-MW [Lelantus-MimbleWimble] will dramatically increase the anonymity set (100K outputs)”
-
“One-kernel tx” is a tx not merged with others, its inputs and outputs are clearly linked. Grin lacks adoption that is the reason for them having so many of them.
-
Beam uses decoy transactions. They are added by nodes during dandelion stem phase if merged tx’s have less than 5 outputs.
-
Minimum is 5.
-
Adding random UTXOs to spend dummy tx’s.
-
Protocol Lelantus-MW
- A one kernel transaction is a transaction that has not yet merged with any other transactions. Grin has so many of them because the network is not yet saturated meaning that there are not enough transactions to be merged in the stem phase of the dandelion protocol. That will change with increased usage over time.
- Beam’s solution to linkability is use of decoy UTXO’s
- The minimum # of outputs required for beam nodes to rebroadcast a transaction is 5.
- Beam prevents cluttering by eventually spending decoy outputs.
- The protocol that will increase the anonymity set of Beam to more than 100,000 is Lelantus-MW
- A one-kernel transaction is not mixed with other transactions and sender and receiver can be linked. The GRIN network is not saturated and there are not enough transactions to be merged in the stem phase of Dandelion protocol.
- Decoy UTXOs.
- At least 5 outputs.
- By adding random UTXOs to spend the dummy transactions.
- The protocol is Lelantus-MW.
- Grin network is not saturated and there are not enough transactions to be merged in the stem phase.
- Decoy outputs
- 5
- The dummy transactions are acutal UTXO’s that will be spent eventually
- Lelantus-MW
- What is a ‘one-kernel transaction’, and why does Grin have so many of them? — a transaction not merged with other transactions, Grin has so man because not enough outside network has adopted this
- What is Beam’s solution to linkability? — decoy outputs
- What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction? — 5
- How does Beam prevent dummy transactions from cluttering up the blockchain? — random UTXOs spending dummy transactions
- What protocol will increase the anonymity set of Beam to 100,000+? — Lelantus MW
-
What is a ‘one-kernel transaction’, and why does Grin have so many of them?
A one-kernel transaction is a transaction that hasn’t been merged or aggregated with other transactions meaning inputs and outputs are linked. There are a lot of one-kernel transactions because there is not a lot of traffic on the network so not enough to aggregate. -
What is Beam’s solution to linkability?
At the Dandelion phase if there aren’t at least 5 real outputs then Beam adds the rest as dummies or decoy outputs. -
What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction?
5 -
How does Beam prevent dummy transactions from cluttering up the blockchain?
UTXO decoy spending transactions -
What protocol will increase the anonymity set of Beam to 100,000+?
Lelantus MW
• What is a ‘one-kernel transaction’, and why does Grin have so many of them? A one-kernel transaction is a transaction that has not merged. Grin has a large amount of 1-kernel transction broadcast to the network, but the network is not saturated, so not enough transaction to be merged.
• What is Beam’s solution to linkability? Beam uses decoy utxo to suggest to the nodes that a merged transaction has at least 5-outputs.
• What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction? At least 7-outputs.
• How does Beam prevent dummy transactions from cluttering up the blockchain? The decoy outputs are eventually spent, so no permanent clutter is created on the blockchain.
• What protocol will increase the anonymity set of Beam to 100,000+? Lelantus-MW.
1.A transaction not merged with another, inputs and outputs clearly linked.
2.Solution is the use of decoy transactions
3.Should have at least 5 outputs
4.Add random UTXOs
5.Lelantus-MW
. It is a transaction that was not merged with other transactions. Grin does not have enough transactions yet (mainly because of the low number of users).
. Flood the network with dummy transactions.
. Five.
. By spending them, thus « burning » them.
. Lelantus-MW.
1. What is a ‘one-kernel transaction’, and why does Grin have so many of them?
A one kernel transaction is a single transaction, which has no aggregates. Grin has a lot because the blockchain isn’t heavily used.
2. What is Beam’s solution to linkability?
Beam uses decoy outputs of zero value, when a single kernel transaction has been sent into the dandelion stem phase. Additionally the decoy outputs are also added as inputs to other transaction further obscuring the transaction graph
3. What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction?
5 (but is configurable)
4. How does Beam prevent dummy transactions from cluttering up the blockchain?
It spends them as inputs.
5. What protocol will increase the anonymity set of Beam to 100,000+?
Lelantus
-
What is a ‘one-kernel transaction’, and why does Grin have so many of them?
One-kernel transactions are the ones not merged with other transaction, and therefore their input is connected to their output. Grin has so many of them beause the network has few users and there are not enough transactions to be merged. -
What is Beam’s solution to linkability?
Adding decoy outputs if there are less than 5 outputs. -
What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction?
5 -
How does Beam prevent dummy transactions from cluttering up the blockchain?
Spending them at a later random stage. -
What protocol will increase the anonymity set of Beam to 100,000+?
Lelantus-MW
- a one-kernel transaction is a transaction that has not merged with others. Grin has so many because there aren’t enough transactions to be merged
- decoy UTXOs
- 5
- decoy outputs are eventually spent
- Lelantus-MW
1.- These are transactions that havent been merged with other transactions, so their inputs are linked to their outputs.
2.- They use decoy outputs of 0 value, blurring the process of linkability.
3.- 5, but it can be configured.
4.- They are spent as inputs.
5.- Lelantus-MW
-
What is a ‘one-kernel transaction’, and why does Grin have so many of them?
Low network traffic, fewer transactions for an anonymity set -
What is Beam’s solution to linkability?
To use decoy UTXOs to ensure transaction outputs are a minimu of 5 -
What is the minimum number of outputs required for Beam nodes to re-broadcast a transaction?
-
How does Beam prevent dummy transactions from cluttering up the blockchain?
By spending them and clearing them for the chain -
What protocol will increase the anonymity set of Beam to 100,000+?
By adding lelantus protocol
- In Grin a ‘one-kernel transaction’ indicates that a transaction was not merged with any other transactions, and thus the inputs of this transaction are linked to its outputs. The reason Grin has so many one-kernel transactions being broadcast, is that the Grin network is not saturated yet and there are not enough transactions to be merged in the stem phase of the Dandelion protocol. As usage of the Grin network grows over time however, the anonymity should improve significantly, but currently the anonymity set is very low.
- Beam’s solution to transaction linkability relies on the fact that while based on the same Mimblewimble protocol, Beam’s implementation of Dandelion has an important privacy improvement over Grin’s. A technical paper was published in September 2018 by Valdok (a contributor to the development of Beam) on transaction linkability and how Beam is tackling it. The paper describes the concept of decoy (aka Dummy) UTXOs. Note that the feature was implemented in Beam before mainnet launch and the mechanism was discussed with Grin’s developers, which decided not to implement it.
- The minimum number of outputs required for Beam nodes to re-broadcast a transaction is five. If not, decoy outputs are added to the merged transactions, to make sure that the number of outputs is at least five.
- Beam prevents dummy transactions from cluttering up the blockchain by, at a later stage (a randomly chosen block height for each output), the node adding dummy UTXOs as inputs to a random transaction, most likely belonging to a different user, thus spending them and removing them from the blockchain; but also creating a relation between users that are in fact unrelated. Hence the “decoys” name. Since those decoy outputs are eventually spent, the mechanism doesn’t create any permanent clutter on the blockchain.
- The Lelantus-MW protocol will increase the anonymity set of Beam to 100,000+, and will make it almost impossible to build a transactions graph (finding linked transaction inputs and outputs to establish a link between specific peers), if the user choses to use Lelantus-mw transactions from time to time.
- They are are txns that aren’t merged with any other txns. Grin has a lot of them because it’s not widespread, and the network is not saturated.
- BEAM uses decoy txns, which makes building the txn graph entirely probabilistic.
- At least 5 outputs.
- By adding random UTXO’s to random transactions, in order to spend them and get rid of them. This also creates decoy UTXO’s which adds privacy.
- Lelantus.