The Symmetric Deposit problem is that LPs must deposit the tokens in a pool with a predefined proportion. To remove extra actions, the algorithm in the AMM will automatically simulate the swap on the current pool to balance the amount for LPs. Then, the subsequent procedures like depositing and returning LP tokens are automated too. Because the process is just to simulate a single-sided deposit, we call it Simulated Single Exposure.
Proposition 2. Without loss of generality, giving a pool of A, B, and SEN with the current state {RA,RB,RSEN}, an LP deposits ΔSEN to the pool and receives an amount of LP tokens lpt,
(16) lpt=ΔSEN−(δA+δB),
where δA+δB=3RSEN(RSEN+ΔSEN)2−RSEN.
Proof. Let ΔSEN=δA+δB+δSEN, where the left term is the set of amounts of SEN token to swap for {rA,rB,rSEN} in the simulation. The simulation is depicted by the following table (we use blackboard characters for state owners):
Here we don’t need to swap SEN, thus rSEN=δSEN. By the CPF (see Eq. (33)), we also know:
(17) RA′=RSEN+δARARSEN,
(18) RB′=RSEN+δA+δBRA(RSEN+δA),
And:
(19) rA=RA−RA′=RSEN+δARAδA,
(20) rB=RB−RB′=RSEN+δA+δBRBδB.
To satisfy the symmetric deposit, we have a system of equations: