注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
新人求米 感谢感谢!
前同事referral三礼拜月之后HR联系
第一轮technical
第一部分
Cryptocurrency "mining" is the operation where a "miner" places "transactions" in a candidate "block". Each block has a fixed size B = 100. At any point in time there is a set of transactions available for mining in an unordered array called the mempool.
A transaction can be described as an object with the following fields:
. Transaction ID
. Fee
. Size
The miner collects all fees from transactions they mine, thus they are incentivized to mine transactions that pay higher fee amounts.
Problem:
第二部分
Let's extend our transaction model by adding a "parent ID" field. A parent ID points to another transaction in the mempool that must be mined in the same block, before the "child" transaction can be mined. If a transaction has no parent ID, it means its parent has been mined already.
In certain cases, a transaction may not be chosen by miners because of its low fee. A technique known as Child-Pays-For-Parent (CPFP) allows a "child" transaction to pay a higher transaction fee in order to incentivize a miner to select both itself and its parent transaction in the same block. In doing so, the miner can collect the sum of the fees. CPFP can be applied recursively to multiple transactions within the same block, but cycles are not possible.
Problem:
|