UkoeHB

Pseudo code for verifying a transaction has sorted TLV format. [enforced_sorted_TLV_extrafield_pseudocode.txt](https://github.com/monero-project/research-lab/files/4494485/enforced_sorted_TLV_extrafield_pseudocode.txt) UPDATE: added sorting, made check_extra_tags_found() O(N). UPDATE2: fixed indexing. Note that to extend types and lengths beyond 254 I...

@rbrunner7 - Merge - membership proof: concise grootle - ownership proof (and proof that key images are correct): merged Seraphis composition proof (one proof for all inputs) - Concise -...

> Are there any wallets that allow for this via gui? This seems to be just a theoretical benefit. (multiple people funding a transaction vs multiple transactions just seems to...

> I think Seraphis-Merge for collaborative funding sounds so interesting. Seraphis-Merge _prevents_ collaborative funding (which Seraphis-Concise/Seraphis-Squashed can do). It allows a bit smaller tx (96 bytes fewer per tx input).

One design concern to keep in mind: Seraphis-Squashed requires range proofs for inputs. This may or may not entail limits on input counts (i.e. the 16-output limit was imposed when...

While GPUs might significantly improve verification times, I have a couple concerns. 1) What is the engineering effort required to implement a GPU verifier? 2) I think the Seraphis upper...

@Rucknium Yes that estimate is based on single-threaded verification.

Here are updated test results as of commit `86b253ebb9a6e47d621cc38e162b252c50b6fd46` (updated with small optimization: combine BP+ and grootle multiexponentiations into one operation). There were two optimizations to grootle proofs: 1) use...

@boogerlad I think the idea is if you spend an output added to the chain in the recent 10 blocks, then if the chain gets reorged, your tx can survive...

Sure they can, the steps are just demonstrating tx chaining (making tx when output you are spending doesn't exist in chain yet).