I need different ideas on mine to studying smooth
everything was programmed in accordance to function interchangeably but it could also be changed and even replaced. These is where creativity comes into play, Bitcoin core version 22.0 is exemplary 
Topic: Calculation of a root hash(merkle tree) (Read 73 times)
These is how technology improvise globally.
I need different ideas on mine to studying smooth everything was programmed in accordance to function interchangeably but it could also be changed and even replaced. These is where creativity comes into play, Bitcoin core version 22.0 is exemplary
I need different ideas on mine to studying smooth
everything was programmed in accordance to function interchangeably but it could also be changed and even replaced. These is where creativity comes into play, Bitcoin core version 22.0 is exemplary
I was trying these with most peeps around and i couldn't still resolve in a satisfiable answer
Firstly,
* I'm trying to avoid the 'time-spent' over multiple read operations, downloading the whole block thus, causing bandwidth and also encoding a value to represent a tree,in your own discretion,how best can i store merkle tree ??
Secondly,
*If I'm calculating a root hash and inserting a leaf,does the hashes listed below compulsorily needs to be divided syntactically?
These was the algorithm we got
https://ibb.co/g4HhkPC
Thirdly,
*Since temporary nodes hash are replaced with new ones,how do constant nodes emanate?
**Why are operations still susceptible to temporary nodes instead of making easier p2p transactions with complete binary tree ?(since the complete binary tree updates automatically as block size increases)
Great gurus help out! I'm open to corrections
Is the insertion correct ?
If no,please state your reasons
Once again,I'm open to corrections ,thanks
Trojane💎
Firstly,
* I'm trying to avoid the 'time-spent' over multiple read operations, downloading the whole block thus, causing bandwidth and also encoding a value to represent a tree,in your own discretion,how best can i store merkle tree ??
Secondly,
*If I'm calculating a root hash and inserting a leaf,does the hashes listed below compulsorily needs to be divided syntactically?
These was the algorithm we got
https://ibb.co/g4HhkPC
Thirdly,
*Since temporary nodes hash are replaced with new ones,how do constant nodes emanate?
**Why are operations still susceptible to temporary nodes instead of making easier p2p transactions with complete binary tree ?(since the complete binary tree updates automatically as block size increases)
Great gurus help out! I'm open to corrections
Is the insertion correct ?
If no,please state your reasons
Once again,I'm open to corrections ,thanks
Trojane💎
Jump to: