Should Grin implement 2-step TXs

[Neo]

Have you looked into BLS sigs?

That’s probably the coolest thing. You could potentially create non-interactive txs and reduce the kernel size.

BLS signatures implementation (from Chia)

Chia has started a full implementation of BLS signatures: BLS (short for Boney-Lynn-Shacham) is a newer signature scheme based on elliptic curve pairings that has many attractive features. In particular for Grin, BLS signatures can be aggregated non-interactively, including with different messages. This would allow kernels aggregation, perhaps not in every single case (kernels can still be useful for scriptless scripts) but in the great majority of cases. Note that Ethereum is also looking …

Request for Funding: BLS sigs research

I decided to follow @antioch’s advise and break the project into several (pre-requisite) tasks, so I am halting the funding request. Hopefully in the process the community will gain more confidence in my capabilities. I think that the top priorities are: GandalfThePink’s document - I will study the proposal in greater detail, and report. Review the overall security - this requires some research work: read the relevant papers, understand the attacks, verify the claims and understand their appl…

Aggregating BLS signatures

Most of the different discussions in the community on BLS included BLS aggregation with a same message for individual signatures. This scheme is subject to attack, and would likely not be secure for GRIN. But in a paper from two years ago, Dan Boneh actually proved the security of naive signature aggregation if all messages of individual signatures are different. Here is a quotation from the paper in order to make things more precise: “(One of the standard defenses) against the rogue public…