But we already have linear verification for the range proofs so... apparently that's fine.

Tbc, COPZ's DLEq proof dates to mid-November and is a range proof (so BP++) and a few misc ops in a 512-bit field. While I'd have to double check its failure properties (it can randomly fail)...

I think with a salt, it can be made failure-less. While that salt probably reveals bias, I imagine we could randomly select an 8-byte salt? It'd statistically never end up fail and since it's randomly selected, we wouldn't know if it was the first or the second attempt?

To be clear on the tower, as I'm not sure how distributed it's been, I have an impl (no opts) available here: github.com/kayabaNerve/serai/tree/tony/crypto/bulletproof25519 My work on a circuit was: github.com/kayabaNerve/serai/blob/tony/crypto/tony-proof/src/lib.rs

It uses bellman's stub prover/verifier, intended for testing, yet does impl blinding properly. It also does a hash in-circuit. I had yet to make a merkle of it nor build an arbitrary BP impl around bulletproof25519 so this could actually be done. The current lib is too slow to even tests with BPs. I ported my impl of Monero range proofs to it and I believe it takes a couple minutes just to do those .-.

Hi, Everybody

I wanted to say that file size for the block chain is increasing, and it has already become large enough so it should be divided into multiple files.

Is there any plans for that

?

in the future?

* for that ?

this is a better question for #monero since this isn't research related, no there are no plans for this

Any comments about this idea?: old.reddit.com/r/Monero/comments/10…cism_sunday_january_01_2023/j2j4w56

I have a hunch it's not feasible, but it sound intriguing.

not possible