Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Teutsch, Jason"'
Autor:
Teutsch, Jason
Nakamoto consensus, the protocol underlying Bitcoin, has the potential to secure a new class of systems which agree on non-mathematical truths. As an example of this capability, we propose a design for a trustless, data availability oracle. This expo
Externí odkaz:
http://arxiv.org/abs/1910.10694
Autor:
Teutsch, Jason, Reitwießner, Christian
Bitcoin and Ethereum, whose miners arguably collectively comprise the most powerful computational resource in the history of mankind, offer no more power for processing and verifying transactions than a typical smart phone. The system described herei
Externí odkaz:
http://arxiv.org/abs/1908.04756
Ethereum has emerged as a dynamic platform for exchanging cryptocurrency tokens. While token crowdsales cannot simultaneously guarantee buyers both certainty of valuation and certainty of participation, we show that if each token buyer specifies a de
Externí odkaz:
http://arxiv.org/abs/1908.04295
In December 2015, a bounty emerged to establish both reliable communication and secure transfer of value between the Dogecoin and Ethereum blockchains. This prized "Dogethereum bridge" would allow parties to "lock" a DOGE coin on Dogecoin and in exch
Externí odkaz:
http://arxiv.org/abs/1908.03999
We outline a token model for Truebit, a retrofitting, blockchain enhancement which enables secure, community-based computation. The model addresses the challenge of stable task pricing, as raised in the Truebit whitepaper, without appealing to extern
Externí odkaz:
http://arxiv.org/abs/1908.02946
The present paper introduces a practical protocol for provably secure, outsourced computation. Our protocol minimizes overhead for verification by requiring solutions to withstand an interactive game between a prover and challenger. For optimization
Externí odkaz:
http://arxiv.org/abs/1606.05917
The Ku\v{c}era-G\'acs theorem is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-L\"of random real. If the computation of the first $n$ bits of a sequence requires $n+h(n)$ bits of the random oracle,
Externí odkaz:
http://arxiv.org/abs/1602.07113
Autor:
Teutsch, Jason.
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2007.
Source: Dissertation Abstracts International, Volume: 68-02, Section: B, page: 1015. Adviser: Lance J. Fortnow.
Source: Dissertation Abstracts International, Volume: 68-02, Section: B, page: 1015. Adviser: Lance J. Fortnow.
Autor:
Teutsch, Jason, Zimand, Marius
An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective procedure determi
Externí odkaz:
http://arxiv.org/abs/1409.0496
Motivated by an application in network security, we investigate the following "linear" case of Directed Mutlicut. Let $G$ be a directed graph which includes some distinguished vertices $t_1, \ldots, t_k$. What is the size of the smallest edge cut whi
Externí odkaz:
http://arxiv.org/abs/1407.7498