--snip--
Also, one transaction with 3 inputs and 6 outputs is usually smaller than the sum of the size of 3 transactions with 1 input and 2 outputs.
It wouldn't be 3 people funding their own address. The address is chosen at random from all the output addresses. In other words, the computer chooses at random which of the 3 output address the first person sends to, then the computer chooses at random from the two remaining address which address to send to, and the third person send to the last remaining address.
A coinjoin transaction is trustless... Which computer would pick which address? I mean, in order for this to work, each participant would have to send the address they want their "coinjoined" unspent output to fund to a central authority. This central authority would have to send a random address to be funded to each participant.
What if i send my "to-be-funded" address to the central authority. I get a "to-be-funded" address from somebody else in return, but in reality it's an address that belongs to the central authority. I fund said address, but the central authority never funds the address i created: I just got robbed by the central authority....
With respect to the size, 1 input to 1 output is 192 bytes. But 3 inputs to 3 outputs is 556 bytes. And as I am writing this I just realized 556/3 = 185, which is less than 192 bytes ,and therein lies the answer to my question.
I'm glad you figured it out
That's what i meanth when i said "the
sum of the size of 3 transactions..." in my previous post