بیشتر شبیه هذیان گویی شده
اما خلاصه چند ساعت تحقیقی بود که امشب روی arbitrum داشتمه
On step proof
L1 - L2 messaging
اما خلاصه چند ساعت تحقیقی بود که امشب روی arbitrum داشتمه
On step proof
L1 - L2 messaging
Hamid list
https://github.com/OffchainLabs/arbitrum/tree/master/docs
#Do
کامل و کن و بخش بریج ها رو هم بخون
کامل و کن و بخش بریج ها رو هم بخون
Forwarded from Lawrenc Labs
Forwarded from Lawrenc Labs
https://monero.stackexchange.com/questions/2158/what-is-moneros-mechanism-for-defending-against-a-double-spend-attack
moero state
The set of key images must then be kept for lookup by miners and other nodes. This is the "unbounded TXO set" that is often mentioned as a cons of using Monero/Cryptonote. Each key image is 32 bytes long.
moero state
The set of key images must then be kept for lookup by miners and other nodes. This is the "unbounded TXO set" that is often mentioned as a cons of using Monero/Cryptonote. Each key image is 32 bytes long.
Monero Stack Exchange
What is Monero's mechanism for defending against a double-spend attack?
The title says it all, but I want to frame the issue two ways, in hopes of a slightly more in-depth answer.
With Bitcoin, the blockchain is transparent. In the "ordinary course of business" in the
With Bitcoin, the blockchain is transparent. In the "ordinary course of business" in the
Hamid list
مدار های zkp سیرکام تورنادوکش https://github.com/tornadocash/tornado-core/tree/master/circuits
Deposit to Merkle tree (leaf(i): hash(k, r)) where k and r are random numbers
withdraw with nullifier => create zk proof that proof you know k and r where the hash of (k,r) is equal to one of the deposit tree leaves, but you don’t want to reveal which leaf, and after that, you send hash(k) as nullifier to store in contract
and contract fist check your zk snark proof and then send you back your funds to a fresh address that you provide in your proof and send it to withdrawal function
withdraw with nullifier => create zk proof that proof you know k and r where the hash of (k,r) is equal to one of the deposit tree leaves, but you don’t want to reveal which leaf, and after that, you send hash(k) as nullifier to store in contract
and contract fist check your zk snark proof and then send you back your funds to a fresh address that you provide in your proof and send it to withdrawal function