Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Some inquiries about the outputs of a Utreexo run #270

Closed
Shymaa-Arafat opened this issue May 15, 2021 · 7 comments
Closed

Some inquiries about the outputs of a Utreexo run #270

Shymaa-Arafat opened this issue May 15, 2021 · 7 comments

Comments

@Shymaa-Arafat
Copy link

Can u clarify the meaning of each output more?
IMG_20210514_162612
r we getting it right?
no of insertions, deletions, UTXOs in this block, how many trees in the forest, max & min heights?
What is "re", "ow", "total"?
.
If so, I think u probably made some plots/statistics for the 1st 3(add,del, UTXO) with each block?can u guide us to them?
.
Also, from here
https://bitcointalk.org/index.php?topic=5334763.new;topicseen#new
you can read that there was some problems in running the code,

EDIT: Apparently it is using so much resources that it managed to crash my machine and force me to do a power cycle.
Rep
.
can u explain what was done wrong?
.
Thank u for ur time, and sorry if I caused any distraction to ur work.

@kcalvinalvin
Copy link
Member

kcalvinalvin commented May 15, 2021

EDIT: Changed height to hashes ever

I left a reply on the bitcointalk thread as well. Copied over from that reply.

Block 180000 -> The current height it's at
add -> all the added leaves (TXOs)
del -> all the deletions that happened (STXOs)
pol nl -> pollard numLeaves. All the current UTXOs
roots -> Utreexo roots
he -> Hashes ever. All the hashing ever done.
re -> RememberEver. The count of all the leaves remembered through caching. This is stale and we have a newer caching algorithm.

If so, I think u probably made some plots/statistics for the 1st 3(add,del, UTXO) with each block?can u guide us to them?

I assume you're referring to #257? If plots of additions/deletions for a block is what you're looking for, 257 isn't that. We currently don't have any plots of such data.

you can read that there was some problems in running the code,

EDIT: Apparently it is using so much resources that it managed to crash my machine and force me to do a power cycle.
Rep
.
can u explain what was done wrong?
.
Thank u for ur time, and sorry if I caused any distraction to ur work.

Yes that's a known problem #264. We're looking to deprecate that code.

@Shymaa-Arafat
Copy link
Author

Thanks for replying, before I close the issue:

  • what is total?
  • how is height so near to the number of additions (>1.6m) with 10 subtrees & the no of UTXos way less than that ( u said it's the pol no here >0.4m)?
    .
    -Ofcourse I know these plots r not in Get locality plots #257 but I thought maybe u have done them at some stage of the project.
    Thanks for replying

@kcalvinalvin
Copy link
Member

* what is total?

Ah missed that. total is the total time the binary has been verifying the utreexo proofs. You can see how this is calculated here:

utreexo/csn/ibd.go

Lines 42 to 90 in ed904d7

var plustime time.Duration
starttime := time.Now()
// bool for stopping the below for loop
var stop bool
var blockCount int
for ; !stop; c.CurrentHeight++ {
blocknproof, open := <-ublockQueue
if !open {
fmt.Printf("ublockQueue channel closed ")
sig <- true
break
}
err := c.putBlockInPollard(blocknproof, &totalTXOAdded, &totalDels, plustime)
if err != nil {
// crash if there's a bad proof or signature, OK for testing
panic(err)
}
c.HeightChan <- c.CurrentHeight
c.ScanBlock(blocknproof.Block)
if c.CurrentHeight%10000 == 0 {
fmt.Printf("Block %d add %d del %d %s plus %.2f total %.2f \n",
c.CurrentHeight, totalTXOAdded, totalDels, c.pollard.Stats(),
plustime.Seconds(), time.Since(starttime).Seconds())
}
// quit after `quitafter` blocks if the -quitafter option is set
blockCount++
if quitafter > -1 && blockCount >= quitafter {
fmt.Println("quit after", quitafter, "blocks")
sig <- true
stop = true
}
// Check if stopSig is no longer false
// stop = true makes the loop exit
select {
case stop = <-haltRequest:
default:
}
}
fmt.Printf("Block %d add %d del %d %s plus %.2f total %.2f \n",
c.CurrentHeight, totalTXOAdded, totalDels, c.pollard.Stats(),
plustime.Seconds(), time.Since(starttime).Seconds())

how is height so near to the number of additions (>1.6m) with 10 subtrees & the no of UTXos way less than that ( u said it's the pol no here >0.4m)?

Not quite sure what you mean. Are you saying asking why are additions and UTXOs different??

@Shymaa-Arafat
Copy link
Author

Not quite sure what you mean. Are you saying asking why are additions and UTXOs different??

No, I'm asking howcome the no of UTXOs is much less than the tree height?(about quarter the height)

@kcalvinalvin
Copy link
Member

No, I'm asking howcome the no of UTXOs is much less than the tree height?(about quarter the height)

Because the height of the entire forest is O(log N). I encourage you to watch this video and read the paper to get a basic idea of how Utreexo works.

@Shymaa-Arafat
Copy link
Author

There is something wrong here, either u didn't read my previous reply or u r reading/seeing something else than I wrote ...
There's some kind of penetration.
1654444 can never be O(log N), it's O(add) here ... or that's what I am seeing/reading here????

@kcalvinalvin
Copy link
Member

There is something wrong here, either u didn't read my previous reply or u r reading/seeing something else than I wrote ...
There's some kind of penetration.
1654444 can never be O(log N), it's O(add) here ... or that's what I am seeing/reading here????

Ah sorry he is hashes-ever not height. Edited the original reply.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants