arXiv subjects

Junchao Chen

Publications and source records attributed to Junchao Chen.

At least 19 recordsLinked to original sources

arXiv2026

Cassandra: Consensus with Partial Progress via Robust Partitionable View Synchronization

Replicated databases and permissioned blockchain systems rely on Byzantine Fault-Tolerant (BFT) consensus to maintain a globally consistent order of transactions across distributed replicas. These protocols preserve safety even under asynchrony, as they commit a transaction only after agreement among a strong quorum of replicas. During network partitions, however, when no strong quorum is reachable, they lose liveness and cannot make useful progress. In this paper, we present Cassandra, a consensus protocol that enables partial progress without sacrificing safety. Cassandra achieves this through a two-tier certification framework that decouples availability from commitment, allowing each partition to extend its own chain and reconcile these chains once the network is restored. To support this, Cassandra introduces a pacemaker that advances views without requiring a strong quorum and calibrates each replica's timeout off the critical path. Our evaluation results show that Cassandra remains competitive with state-of-the-art BFT protocols under stable conditions, sustaining 900K TPS at 16 replicas and 480K TPS at 104 replicas, with latency ranging from 0.31s at 16 replicas to 0.75s at 104 replicas. Under severe partitions, Cassandra maintains non-zero speculative throughput through PoA-backed progress, preserving work that can be reconciled once connectivity is restored.

cs.DC↗

arXiv2025

Integrable discrete massive Thirring model

In this paper, we are concerned with integrable semi- and fully discrete analogues of the massive Thirring model in light core coordinates. By using the Hirota's bilinear approach and the KP reduction method, we propose both the semi- and fully discrete massive Thirring models and construct their multi-bright soliton solutions.

nlin.SI↗

arXiv2025

FairDAG: Consensus Fairness over Multi-Proposer Causal Design

The rise of cryptocurrencies like Bitcoin and Ethereum has driven interest in blockchain database technology, with smart contracts enabling the growth of decentralized finance (DeFi). However, research has shown that adversaries exploit transaction ordering to extract profits through attacks like front-running, sandwich attacks, and liquidation manipulation. This issue affects blockchains where block proposers have full control over transaction ordering. To address this, a more fair transaction ordering mechanism is essential. Existing fairness protocols, such as Pompe and Themis, operate on leader-based consensus protocols, which not only suffer from low throughput caused by the single-leader bottleneck, but also allow adversarial block proposers to manipulate transaction ordering. To address these limitations, we propose a new framework, FairDAG, that runs fairness protocols on top of DAG-based consensus protocols. FairDAG improves protocol performance in both throughput and fairness quality by leveraging the multi-proposer design and validity property of DAG-based consensus protocols. We conducted a comprehensive analytical and experimental evaluation of two FairDAG variants - FairDAG-AB and FairDAG-RL. Our results demonstrate that FairDAG outperforms prior fairness protocols in both throughput and fairness quality.

cs.DB↗

arXiv2024

Did we miss P In CAP? Partial Progress Conjecture under Asynchrony

Each application developer desires to provide its users with consistent results and an always-available system despite failures. Boldly, the CALM theorem disagrees. It states that it is hard to design a system that is both consistent and available under network partitions; select at most two out of these three properties. One possible solution is to design coordination-free monotonic applications. However, a majority of real-world applications require coordination. We resolve this dilemma by conjecturing that partial progress is possible under network partitions. This partial progress ensures the system appears responsive to a subset of clients and achieves non-zero throughput during failures. To this extent, we present the design of our CASSANDRA consensus protocol that allows partitioned replicas to order client requests.

cs.DC↗

arXiv2024

Thunderbolt: Concurrent Smart Contract Execution with Non-blocking Reconfiguration for Sharded DAGs

Sharding has emerged as a critical technique for enhancing blockchain system scalability. However, existing sharding approaches face unique challenges when applied to Directed Acyclic Graph (DAG)-based protocols that integrate expressive smart contract processing. Current solutions predominantly rely on coordination mechanisms like 2PC and require transaction read/write sets to optimize parallel execution. These requirements introduce two fundamental limitations: 1) additional coordination phases incur latency overhead, and 2) pre-declaration of read/write sets proves impractical for Turing-complete smart contracts with dynamic access patterns. This paper presents Thunderbolt, a novel sharding architecture for both single-shard transactions (Single-shard TXs) and cross-shard transactions (Cross-shard TXs) and enables nonblocking reconfiguration to ensure system liveness. Our design introduces 4 key innovations: 1) each replica serves dual roles as a full-shard representative and transaction proposer, employing the Execution-Order-Validation (EOV) model for Single-shard TXs and Order-Execution (OE) model for Cross-shard TXs. 2) we develop a DAG-based coordination protocol that establishes deterministic ordering between two transaction types while preserving concurrent execution capabilities. 3) we implement a dynamic concurrency controller that schedules Single-shard TXs without requiring prior knowledge of read/write sets, enabling runtime dependency resolution. 4) Thunderbolt introduces a nonblocking shard reconfiguration mechanism to address censorship attacks by featuring frequent shard re-assignment without impeding the construction of DAG nor blocking consensus. Thunderbolt achieves a 50x throughput improvement with 64 replicas compared to serial execution in the Tusk framework.

cs.DB↗

arXiv2023

Data-driven localized waves and parameter discovery in the massive Thirring model via extended physics-informed neural networks with interface zones

In this paper, we study data-driven localized wave solutions and parameter discovery in the massive Thirring (MT) model via the deep learning in the framework of physics-informed neural networks (PINNs) algorithm. Abundant data-driven solutions including soliton of bright/dark type, breather and rogue wave are simulated accurately and analyzed contrastively with relative and absolute errors. For higher-order localized wave solutions, we employ the extended PINNs (XPINNs) with domain decomposition to capture the complete pictures of dynamic behaviors such as soliton collisions, breather oscillations and rogue-wave superposition. In particular, we modify the interface line in domain decomposition of XPINNs into a small interface zone and introduce the pseudo initial, residual and gradient conditions as interface conditions linked adjacently with individual neural networks. Then this modified approach is applied successfully to various solutions ranging from bright-bright soliton, dark-dark soliton, dark-antidark soliton, general breather, Kuznetsov-Ma breather and second-order rogue wave. Experimental results show that this improved version of XPINNs reduce the complexity of computation with faster convergence rate and keep the quality of learned solutions with smoother stitching performance as well. For the inverse problems, the unknown coefficient parameters of linear and nonlinear terms in the MT model are identified accurately with and without noise by using the classical PINNs algorithm.

nlin.PS↗

arXiv2023

Securing Consensus from Long-Range Attacks through Collaboration

Decentralized systems built around blockchain technology promise clients an immutable ledger. They add a transaction to the ledger after it undergoes consensus among the replicas that run a Proof-of-Stake (PoS) or Byzantine Fault-Tolerant (BFT) consensus protocol. Unfortunately, these protocols face a long-range attack where an adversary having access to the private keys of the replicas can rewrite the ledger. One solution is forcing each committed block from these protocols to undergo another consensus, Proof-of-Work(PoW) consensus; PoW protocol leads to wastage of computational resources as miners compete to solve complex puzzles. In this paper, we present the design of our Power-of-Collaboration (PoC) protocol, which guards existing PoS/BFT blockchains against long-range attacks and requires miners to collaborate rather than compete. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.

cs.CR↗

arXiv2022

Deep Runge-Kutta schemes for BSDEs

We propose a new probabilistic scheme which combines deep learning techniques with high order schemes for backward stochastic differential equations belonging to the class of Runge-Kutta methods to solve high-dimensional semi-linear parabolic partial differential equations. Our approach notably extends the one introduced in [Hure Pham Warin 2020] for the implicit Euler scheme to schemes which are more efficient in terms of discrete-time error. We establish some convergence results for our implemented schemes under classical regularity assumptions. We also illustrate the efficiency of our method for different schemes of order one, two and three. Our numerical results indicate that the Crank-Nicolson schemes is a good compromise in terms of precision, computational cost and numerical implementation.

math.NA↗

arXiv2022

Rogue waves in the massive Thirring model

In this paper, general rogue wave solutions in the massive Thirring (MT) model are derived by using the Kadomtsev-Petviashvili (KP) hierarchy reduction method and these rational solutions are presented explicitly in terms of determinants whose matrix elements are elementary Schur polynomials. In the reduction process, three reduction conditions including one index- and two dimension-ones are proved to be consistent by only one constraint relation on parameters of tau-functions of the KP-Toda hierarchy.It is found that the rogue wave solutions in the MT model depend on two background parameters, which influence their orientation and duration. Differing from many other coupled integrable systems, the MT model only admits the rogue waves of bright-type, and the higher-order rogue waves represent the superposition of fundamental ones in which the non-reducible parameters determine the arrangement patterns of fundamental rogue waves. Particularly, the super rogue wave at each order can be achieved simply by setting all internal parameters to be zero, resulting in the amplitude of the sole huge peak of order $N$ being $2N+1$ times the background.Finally, rogue wave patterns are discussed when one of the internal parameters is large. Similar to other integrable equations, the patterns are shown to be associated with the root structures of the Yablonskii-Vorob'ev polynomial hierarchy through a linear transformation.

nlin.SI↗

arXiv2021

General bright and dark soliton solutions to the massive Thirring model via KP hierarchy reductions

In the present paper, we are concerned with the tau function and its connection with the Kadomtsev-Petviashvili (KP) theory for the massive Thirring (MT) model. First, we bilinearize the massive Thirring model under both the vanishing and nonvanishing boundary conditions. Starting from a set of bilinear equations of two-component KP-Toda hierarchy, we derive the multi-bright solution to the MT model by the KP hierarchy reductions. Then, we show that the discrete KP equation can generate a set of bilinear equations of a deformed KP-Toda hierarchy through Miwa transformation. By imposing constraints on the parameters of the tau function, the general dark soliton solution to the MT model is constructed from the tau function of the discrete KP equation. Finally, the dynamics and properties of one- and two-soliton for both the bright and dark cases are analyzed in details.

nlin.SI↗

arXiv2021

A Review of Particle Detectors for Space-Borne Self-Adaptive Fault-Tolerant Systems

The soft error rate (SER) of integrated circuits (ICs) operating in space environment may vary by several orders of magnitude due to the variable intensity of radiation exposure. To ensure the radiation hardness without compromising the system performance, it is necessary to implement the dynamic hardening mechanisms which can be activated under the critical radiation exposure. Such operating scenario requires the real-time detection of energetic particles responsible for the soft errors. Although numerous particle detection solutions have been reported, very few works address the on-chip particle detectors suited for the self-adaptive fault tolerant microprocessor systems for space missions. This work reviews the state-of-the-art particle detectors, with emphasis on two solutions for the self-adaptive systems: particle detector based on embedded SRAM and particle detector based on pulse stretching inverters.

physics.ins-det↗

arXiv2021

Monitoring of Particle Flux and LET Variations with Pulse Stretching Inverters

This work investigates the use of pulse stretching inverters for monitoring the variation of flux and Linear Energy Transfer (LET) of energetic particles. The basic particle detector consists of two cascaded pulse stretching (skew-sized) inverters designed in CMOS technology, and the required sensing area is obtained by connecting multiple two-inverter pulse stretching cells in parallel, and employing the required number of parallel arrays. The particle strikes are detected in terms of the Single Event Transients (SETs), and the detector provides the information on the SET count rate and SET pulse width variation, from which the particle flux and LET can be determined. The main advantage of the proposed solution is the possibility to sense the LET variations using purely digital processing logic. The SPICE simulations done on IHP 130 nm bulk CMOS technology have shown that the SET pulse width at the output of detector changes by 550 ps over the LET range from 1 to 100 MeVcm2mg-1. The proposed solution is intended to operate as an on-chip particle detector within the self-adaptive multiprocessing systems.

physics.ins-det↗

arXiv2021

A learning scheme by sparse grids and Picard approximations for semilinear parabolic PDEs

Relying on the classical connection between Backward Stochastic Differential Equations (BSDEs) and non-linear parabolic partial differential equations (PDEs), we propose a new probabilistic learning scheme for solving high-dimensional semi-linear parabolic PDEs. This scheme is inspired by the approach coming from machine learning and developed using deep neural networks in Han and al. [32]. Our algorithm is based on a Picard iteration scheme in which a sequence of linear-quadratic optimisation problem is solved by means of stochastic gradient descent (SGD) algorithm. In the framework of a linear specification of the approximation space, we manage to prove a convergence result for our scheme, under some smallness condition. In practice, in order to be able to treat high-dimensional examples, we employ sparse grid approximation spaces. In the case of periodic coefficients and using pre-wavelet basis functions, we obtain an upper bound on the global complexity of our method. It shows in particular that the curse of dimensionality is tamed in the sense that in order to achieve a root mean squared error of order $ε$, for a prescribed precision $ε$, the complexity of the Picard algorithm grows polynomially in $ε^{-1}$ up to some logarithmic factor $ |log(ε)| $ which grows linearly with respect to the PDE dimension. Various numerical results are presented to validate the performance of our method and to compare them with some recent machine learning schemes proposed in Han and al. [20] and Huré and al. [37].

math.NA↗

arXiv2020

Probabilistic representation of integration by parts formulae for some stochastic volatility models with unbounded drift

In this paper, we establish a probabilistic representation as well as some integration by parts formulae for the marginal law at a given time maturity of some stochastic volatility model with unbounded drift. Relying on a perturbation technique for Markov semigroups, our formulae are based on a simple Markov chain evolving on a random time grid for which we develop a tailor-made Malliavin calculus. Among other applications, an unbiased Monte Carlo path simulation method stems from our formulas so that it can be used in order to numerically compute with optimal complexity option prices as well as their sensitivities with respect to the initial values or Greeks in finance, namely the Delta and Vega, for a large class of non-smooth European payoff. Numerical results are proposed to illustrate the efficiency of the method.

math.PR↗

arXiv2019

Rogue waves in the generalized derivative nonlinear Schrodinger equations

General rogue waves are derived for the generalized derivative nonlinear Schrodinger (GDNLS) equations by a bilinear Kadomtsev-Petviashvili (KP) reduction method. These GDNLS equations contain the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation as special cases. In this bilinear framework, it is shown that rogue waves to all members of these equations are expressed by the same bilinear solution. Compared to previous bilinear KP reduction methods for rogue waves in other integrable equations, an important improvement in our current KP reduction procedure is a new parameterization of internal parameters in rogue waves. Under this new parameterization, the rogue wave expressions through elementary Schur polynomials are much simpler. In addition, the rogue wave with the highest peak amplitude at each order can be obtained by setting all those internal parameters to zero, and this maximum peak amplitude at order $N$ turns out to be $2N+1$ times the background amplitude, independent of the individual GDNLS equation and the background wavenumber. It is also reported that these GDNLS equations can be decomposed into two different bilinear systems which require different KP reductions, but the resulting rogue waves remain the same. Dynamics of rogue waves in the GDNLS equations is also analyzed. It is shown that the wavenumber of the constant background strongly affects the orientation and duration of the rogue wave. In addition, some new rogue patterns are presented.

nlin.SI↗

arXiv2018

High-order rogue waves of a long wave-short wave model

The long wave-short wave model describes the interaction between the long wave and the short wave. Exact higher-order rational solution expressed by determinants is calculated via the Hirota's bilinear method and the KP hierarchy reduction. It is found that the fundamental rogue wave for the short wave can be classified into three different patterns: bright, intermediate and dark ones, whereas the rogue wave for the long wave is always bright type. The higher-order rogue waves correspond to the superposition of fundamental rogue waves. The modulation instability analysis show that the condition of the baseband modulation instability where an unstable continuous-wave background corresponds to perturbations with infinitesimally small frequencies, coincides with the condition for the existence of rogue-wave solutions.

nlin.SI↗

arXiv2017

Breather to the Yajima-Oikawa system

The Yajima-Oikawa (YO) system describes the resonant interaction between long and short waves under certain condition. In this paper, through the KP hierarchy reduction, we construct the breather solutions for the YO system in one- and two-dimensional cases. Similar to Akhmediev and Kuznetsov-Ma breather solutions (the wavenumber k_i->ik_i) for the nonlinear Schrodinger equation, is shown that the YO system have two kinds ofbreather solutions with the relations p_{2k-1}->ip_{2k-1}, p_{2k}->-ip_{2k}, q_{2k-1}->iq_{2k-1} and q_{2k}->-iq_{2k}, in which the homoclinic orbit and dark soliton solutions are two special cases respectively. Furthermore, taking the long wave limit, we derive the rational and rational and rational-exp solutions which contain lump, line rogue wave, soliton and their mixed cases. By considering the further reduction, such solutions can be reduced to one-dimensional YO system.

nlin.SI↗

arXiv2017

General high-order rogue waves of the (1+1)-dimensional Yajima-Oikawa system

General high-order rogue wave solutions for the (1+1)-dimensional Yajima-Oikawa (YO) system are derived by using Hirota's bilinear method and the KP-hierarchy reduction technique. These rogue wave solutions are presented in terms of determinants in which the elements are algebraic expressions. The dynamics of first and higher-order rogue wave are investigated in details for different values of the free parameters. It is shown that the fundamental (first-order) rogue waves can be classified into three different patterns: bright, intermediate and dark ones. The high-order rogue waves correspond to the superposition of fundamental rogue waves. Especially, compared with the nonlinear Schodinger equation, there exists an essential parameter αto control the pattern of rogue wave for both first- and high-order rogue waves since the YO system does not possess the Galilean invariance.

nlin.SI↗