From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from sog-mx-2.v43.ch3.sourceforge.com ([172.29.43.192] helo=mx.sourceforge.net) by sfs-ml-4.v29.ch3.sourceforge.com with esmtp (Exim 4.76) (envelope-from ) id 1WeEzy-0005VD-Eq for bitcoin-development@lists.sourceforge.net; Sun, 27 Apr 2014 02:39:22 +0000 X-ACL-Warn: Received: from p3plsmtpa06-06.prod.phx3.secureserver.net ([173.201.192.107]) by sog-mx-2.v43.ch3.sourceforge.com with esmtp (Exim 4.76) id 1WeEzw-000101-KU for bitcoin-development@lists.sourceforge.net; Sun, 27 Apr 2014 02:39:22 +0000 Received: from [192.168.1.101] ([190.19.169.149]) by p3plsmtpa06-06.prod.phx3.secureserver.net with id uqfD1n0053DkUH201qfEyM; Sat, 26 Apr 2014 19:39:15 -0700 Message-ID: <535C6DEC.9040505@certimix.com> Date: Sat, 26 Apr 2014 23:39:40 -0300 From: Sergio Lerner User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:17.0) Gecko/20130509 Thunderbird/17.0.6 MIME-Version: 1.0 To: bitcoin-development@lists.sourceforge.net References: <535C587F.90005@certimix.com> <535C60C8.5030605@monetize.io> In-Reply-To: <535C60C8.5030605@monetize.io> X-Enigmail-Version: 1.6 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Spam-Score: 0.0 (/) X-Spam-Report: Spam Filtering performed by mx.sourceforge.net. See http://spamassassin.org/tag/ for more details. -0.0 RCVD_IN_DNSWL_NONE RBL: Sender listed at http://www.dnswl.org/, no trust [173.201.192.107 listed in list.dnswl.org] X-Headers-End: 1WeEzw-000101-KU Subject: Re: [Bitcoin-development] About Compact SPV proofs via block header commitments X-BeenThere: bitcoin-development@lists.sourceforge.net X-Mailman-Version: 2.1.9 Precedence: list List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 27 Apr 2014 02:39:22 -0000 El 26/04/2014 10:43 p.m., Mark Friedenbach escribió: > Sergio, > > First of all, let's define what an SPV proof is: it is a succinct > sequence of bits which can be transmitted as part of a non-interactive > protocol that convincingly establishes for a client without access to > the block chain that for some block B, B has an ancestor A at some > specified height and work distance back, and the cost of creating a > false proof is at least as much work as it claims to represent. Ok. I was thinking with another definition SPV proof. For me a SPV proof is a sequence of bits which can be transmitted as part of a non-interactive protocol that convincingly establishes for a client without access to the block chain that a block B is part of the best-chain. I understand that SPV nodes require SPV proofs as defined in my definition, but I can't realize how to prove that SPV nodes require SPV proofs under your definition. So your definition sounds to me like one possible solution, but not the need. Is your definition something well-established in the community?