#dev #scriptrestoration
Took some time off this week, and it was slow anyway. I have ordered a proper power supply for my RPi3 as compiling Bitcoin is crashing it (which bodes badly for actually running the benchmarks!).
After some head-scratching results I have returned to micro-benchmarks. My initial model treated every read and write as the same cost, but I'm investigating alternatives. In particular, the ubiquity of SIMD instructions and write combining in modern processors means some operations are *much* faster than a naive "pull 64 bits into a register, write it out". I wouldn't care about beating the model generally, but:
1. I have to make sure my benchmarks are measuring the right thing, and
2. OP_DUP, OP_EQUALS and the like are so common that if they really are twice as fast as the naive versions on every platform, it's worth considering whether the model should accommodate them explicitly.
So, I'm now breaking them down into micro benchmarks for each case explicitly. There's so much data here, particularly when considering different size operand limits, that I'm going to have to produce a series of graphs to illustrate (and hopefully illuminate!) the results.
Rusty Russell
npub179e…lz4s
2024-06-08 03:30:42
Author Public Key
npub179e9tp4yqtqx4myp35283fz64gxuzmr6n3yxnktux5pnd5t03eps0elz4sPublished at
2024-06-08 03:30:42Event JSON
{
"id": "7e371bf65de7dddcf7e750090f4869cda8b3b618f506139c03ff4d67c4564b37",
"pubkey": "f1725586a402c06aec818d1478a45aaa0dc16c7a9c4869d97c350336d16f8e43",
"created_at": 1717810242,
"kind": 1,
"tags": [
[
"t",
"dev"
],
[
"t",
"scriptrestoration"
]
],
"content": "#dev #scriptrestoration\n\nTook some time off this week, and it was slow anyway. I have ordered a proper power supply for my RPi3 as compiling Bitcoin is crashing it (which bodes badly for actually running the benchmarks!). \n\nAfter some head-scratching results I have returned to micro-benchmarks. My initial model treated every read and write as the same cost, but I'm investigating alternatives. In particular, the ubiquity of SIMD instructions and write combining in modern processors means some operations are *much* faster than a naive \"pull 64 bits into a register, write it out\". I wouldn't care about beating the model generally, but:\n1. I have to make sure my benchmarks are measuring the right thing, and\n2. OP_DUP, OP_EQUALS and the like are so common that if they really are twice as fast as the naive versions on every platform, it's worth considering whether the model should accommodate them explicitly. \n\nSo, I'm now breaking them down into micro benchmarks for each case explicitly. There's so much data here, particularly when considering different size operand limits, that I'm going to have to produce a series of graphs to illustrate (and hopefully illuminate!) the results.",
"sig": "eff51c383a62ea98019872ff6f0bfc187a2a7bfe14bbe9dfe608026dfe68c06cf9691c8497b91590b9e5b7ef783b07d17c51ce255aa145146d99a41ea87d5980"
}