01:17:04 <UkoeHB> another milestone: binned reference sets (i.e. the reference set is divided into equal-sized bins, and the members of each bin can be deterministically extracted from {seed, bin index, bin locus (center of the bin within the full element set), rotation factor}) https://github.com/UkoeHB/monero/blob/d69a5b7d8e35600645cbad9ac4bb06cbb6fdfcb1/src/seraphis/tx_validators.cpp#L347
01:34:05 <UkoeHB> One thing to note: the bin member generator seed is a hash of pieces of the enote image (the masked address and masked commitment) to save space (16-32 bytes per input).
01:36:22 <UkoeHB> I couldn't come up with any reasons that would be a problem (the address and commitment masks are randomly generated when you declare to make an input for a specific tx).