Hyoungsung Kim

Hyoungsung Kim, Yong-Suk Park

Automated Market Makers face a geometric dilemma: expanding liquidity depth to reduce execution slippage increases Liquidity Providers' exposure to toxic arbitrage, quantified as Loss-Versus-Rebalancing (LVR). We study the Hybrid Liquidity-Collateral Pool (HLCP), a stylized architecture that aims to partially decouple execution quality from active risk exposure through an N-scaled virtual invariant and a collateral buffer. The analysis first characterizes the geometric divergence between execution slippage and marginal-price deviation, then uses this divergence to motivate a trigger-based collateral injection rule. In a stylized duopoly model, under hyper-saturated background liquidity and non-zero volatility or collateral yield, adopting the HLCP is a Nash equilibrium and Pareto-improving relative to a standard AMM benchmark. Empirically, we examine two settings. Under a stochastic-volatility-with-jumps stress scenario, the trigger policy avoids one-shot total buffer depletion under the imposed control law and simulated shock path. Using 2025 Uniswap V2 data with zero collateral yield, the HLCP exhibits lower realized LVR and higher net LP return than the standard CPMM benchmark in the sample considered.

Hyoungsung Kim, Jehyuk Jang, Sangjun Park et al.

The error-correction code based proof-of-work (ECCPoW) algorithm is based on a low-density parity-check (LDPC) code. The ECCPoW is possible to impair ASIC with its time-varying capability of the parameters of LDPC code. Previous researches on the ECCPoW algorithm have presented its theory and implementation on Bitcoin. But they do not discuss how stable the block generation time is. A finite mean block generation time (BGT) and none heavy-tail BGT distribution are the ones of the focus in this study. In the ECCPoW algorithm, BGT may show a long-tailed distribution due to time-varying cryptographic puzzles. Thus, it is of interest to see if the BGT distribution is not heavy-tailed and if it shows a finite mean. If the distribution is heavy-tailed, then confirmation of a transaction cannot be guaranteed. We present implementation, simulation, and validation of ECCPoW Ethereum. In implementation, we explain how the ECCPoW algorithm is integrated into Ethereum 1.0 as a new consensus algorithm. In the simulation, we perform a multinode simulation to show that the ECCPoW Ethereum works well with automatic difficulty change. In the validation, we present the statistical results of the two-sample Anderson-Darling test to show that the distribution of BGT satisfies the necessary condition of the exponential distribution. Our implementation is downloadable at https://github.com/cryptoecc/ETH-ECC.