Searcharxiv⌕ Search

arXiv subjects

Ricardo Pérez-Marco

Publications and source records attributed to Ricardo Pérez-Marco.

32 records · Page 2Linked to original sources

Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks

The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words. We can avoid computing stationary probabilities on Markov chain, nor stopping times for Poisson processes as in previous analysis. We do apply these techniques to other block withholding strategies in Bitcoin, and then, we consider also selfish mining in Ethereum.

cs.CR↗

Bitcoin Selfish Mining and Dyck Words

We give a straightforward proof for the formula giving the long-term apparent hashrate of the Selfish Mining strategy in Bitcoin using only elementary probabilities and combinatorics, and more precisely, Dyck words. There is no need to compute stationary probabilities on Markov chain nor stopping times for Poisson processes as it was previously done. We consider also several other block withholding strategies.

cs.CR↗

On profitability of selfish mining

We review the so called selfish mining strategy in the Bitcoin network and compare its profitability to honest mining.We build a rigorous profitability model for repetition games. The time analysis of the attack has been ignored in the previous literature based on a Markov model,but is critical. Using martingale's techniques and Doob Stopping Time Theorem we compute the expected duration of attack cycles. We discover a remarkable property of the bitcoin network: no strategy is more profitable than the honest strategy before a difficulty adjustment. So selfish mining can only become profitable afterwards, thus it is an attack on the difficulty adjustment algorithm. We propose an improvement of Bitcoin protocol making it immune to selfish mining attacks. We also study miner's attraction to selfish mining pools. We calculate the expected duration time before profit for the selfish miner, a computation that is out of reach by the previous Markov models.

cs.GT↗

On Profitability of Trailing Mining

We compute the revenue ratio of the Trail Stubborn mining strategy in the Bitcoin network and compare its profitability to other block-withholding strategies. We use for this martingale techniques and a classical analysis of the hiker problem. In this strategy the attacker could find himself mining in a shorter fork, but we prove that for some parameter values it is still profitable to not give up. This confirms previous numerical studies.

cs.CR↗

On profitability of stubborn mining

We compute and compare profitabilities of stubborn mining strategies that are variations of selfish mining. These are deviant mining strategies violating Bitcoin's network protocol rules. We apply the foundational set-up from our previous companion article on the profitability of selfish mining, and the new martingale techniques to get a closed-form computation for the revenue ratio, which is the correct benchmark for profitability. Catalan numbers and Catalan distributions appear in the closed-form computations. This marks the first appearance of Catalan numbers in the Mathematics of the Bitcoin protocol.

cs.CR↗

On quasi-invariant curves

Quasi-invariant curves are used in the study of hedgehog dynamics. Denjoy-Yoccoz lemma is the preliminary step for Yoccoz's complex renormalization techniques for the study of linearization of analytic circle diffeomorphisms. We give a geometric interpretation of Denjoy-Yoccoz lemma using the hyperbolic metric that gives a direct construction of quasi-invariant curves without renormalization.

math.DS↗

Notes on the Riemann Hypothesis

These notes were written from a series of lectures given in March 2010 at the Universidad Complutense of Madrid and then in Barcelona for the centennial anniversary of the Spanish Mathematical Society (RSME). Our aim is to give an introduction to the Riemann Hypothesis and a panoramic view of the world of zeta and L-functions. We first review Riemann's foundational article and discuss the mathematical background of the time and his possible motivations for making his famous conjecture. We discuss some of the most relevant developments after Riemann that have contributed to a better understanding of the conjecture.

math.HO↗

Satoshi Risk Tables

We present Bitcoin Security Tables computing the probability of success p(z,q,t) of a double spend attack by an attacker controlling a share q of the hashrate after z confirmations in time t.

cs.CR↗

On Pareto theory of circulation of elites

We prove that Pareto theory of circulation of elites results from our wealth evolution model, Kelly criterion for optimal betting and Keynes' observation of "animal spirits" that drive the economy and cause that human financial decisions are prone to excess risk-taking.

q-fin.GN↗

Kelly criterion for variable pay-off

We determine Kelly criterion for a game with variable pay-off. The Kelly fraction satisfies a fundamental integral equation and is smaller than the classical Kelly fraction for the same game with the constant average pay-off.

math.PR↗

Unified treatment of Explicit and Trace Formulas via Poisson-Newton formula

We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane of finite order. These formulas simultaneously generalize the classical Poisson formula and Newton formulas for Newton sums. Classical Poisson formulas in Fourier analysis, explicit formulas in number theory and Selberg trace formulas in Riemannian geometry appear as special cases of our general Poisson-Newton formula.

math.NT↗

Poisson-Newton formulas and Dirichlet series

We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane. These formulas simultaneously generalize the classical Poisson formula and Newton formulas for Newton sums. Classical Poisson formulas in Fourier analysis, classical summation formulas as Euler-McLaurin or Abel-Plana formulas, explicit formulas in number theory and Selberg trace formulas in Riemannian geometry appear as special cases of our general Poisson-Newton formula. We also associate to finite order meromorphic functions general Poisson-Newton formulas that yield many classical integral formulas.

math.CV↗

Ergodic solenoidal homology

We define generalized currents associated with immersions of abstract solenoids with a transversal measure. We realize geometrically the full real homology of a compact manifold with these generalized currents, and more precisely with immersions of minimal uniquely ergodic solenoids. This makes precise and geometric De Rham's realization of the real homology by only using a restricted geometric subclass of currents. These generalized currents do extend Ruelle-Sullivan and Schwartzman currents. We extend Schwartzman theory beyond dimension 1 and provide a unified treatment of Ruelle-Sullivan and Schwartzman theories via Birkhoff's ergodic theorem for the class of immersions of controlled solenoids. We develop some intersection theory of these new generalized currents that explains why the realization theorem cannot be achieved only with Ruelle-Sullivan currents.

math.DG↗