Received: from sog-mx-3.v43.ch3.sourceforge.com ([172.29.43.193]
	helo=mx.sourceforge.net)
	by sfs-ml-3.v29.ch3.sourceforge.com with esmtp (Exim 4.76)
	(envelope-from <james@microtrx.com>) id 1Z3U0V-0001kd-Ks
	for bitcoin-development@lists.sourceforge.net;
	Fri, 12 Jun 2015 18:48:47 +0000
X-ACL-Warn: 
Received: from mail-ig0-f178.google.com ([209.85.213.178])
	by sog-mx-3.v43.ch3.sourceforge.com with esmtps (TLSv1:RC4-SHA:128)
	(Exim 4.76) id 1Z3U0T-0004t4-Q3
	for bitcoin-development@lists.sourceforge.net;
	Fri, 12 Jun 2015 18:48:47 +0000
Received: by igbpi8 with SMTP id pi8so18031230igb.0
	for <bitcoin-development@lists.sourceforge.net>;
	Fri, 12 Jun 2015 11:48:40 -0700 (PDT)
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
	d=1e100.net; s=20130820;
	h=x-gm-message-state:mime-version:date:message-id:subject:from:to
	:content-type;
	bh=wFwCVA7QeNbg/o9Jc0nhKZstNB2a2F7o7bb8UvoWs8k=;
	b=mxfD7JjmVY3L72qSMgsV68X75EImOOj39igy51kVaUySAk5t/blbRrAr/46KVYkPm4
	fRoZgAM46JriCSVC/EZx2QTKadIWkkF0ahB+nKzdt3EnLrzIMM5x2EISoehOdu4OOhIx
	3Fc0YnmwL3x1KAjdQcgkk+LjDYP3n1jhjlmE3fCyJyPse2eyFyBq8byqRlVK5qscQknH
	yu30QSy58Y1a0bnkwWhl4yDIb/JYseJDeJHPDlNdjJEFoge6YUOlYo1qHAJOoYstONPK
	CNRm1rPQJVPiCZ3p5unyapjk37ikiT0O40xPLQCBiveZvyylM9uyPwzkiVVViwDNYGZB
	COmA==
X-Gm-Message-State: ALoCoQmafqruBZxnOQ67OKBAupruC0zUI2VLh+qCM6eoMeJlfw2NB0inKEcwirepi+k3Ri9G+QZn
MIME-Version: 1.0
X-Received: by 10.50.29.40 with SMTP id g8mr6029792igh.41.1434133340050; Fri,
	12 Jun 2015 11:22:20 -0700 (PDT)
Received: by 10.107.162.143 with HTTP; Fri, 12 Jun 2015 11:22:19 -0700 (PDT)
Date: Fri, 12 Jun 2015 14:22:19 -0400
Message-ID: <CAN4RR9gRQCEkns21OTCpWmGOftFXbR-cLWuJX805iPjGATmLyQ@mail.gmail.com>
From: James Poole <james@microtrx.com>
To: bitcoin-development@lists.sourceforge.net
Content-Type: multipart/alternative; boundary=047d7bd758b64b6e1005185630bb
X-Spam-Score: 1.0 (+)
X-Spam-Report: Spam Filtering performed by mx.sourceforge.net.
	See http://spamassassin.org/tag/ for more details.
	1.0 HTML_MESSAGE           BODY: HTML included in message
X-Headers-End: 1Z3U0T-0004t4-Q3
Subject: [Bitcoin-development] Bip 32 Question
X-BeenThere: bitcoin-development@lists.sourceforge.net
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: <bitcoin-development.lists.sourceforge.net>
List-Unsubscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
	<mailto:bitcoin-development-request@lists.sourceforge.net?subject=unsubscribe>
List-Archive: <http://sourceforge.net/mailarchive/forum.php?forum_name=bitcoin-development>
List-Post: <mailto:bitcoin-development@lists.sourceforge.net>
List-Help: <mailto:bitcoin-development-request@lists.sourceforge.net?subject=help>
List-Subscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
	<mailto:bitcoin-development-request@lists.sourceforge.net?subject=subscribe>
X-List-Received-Date: Fri, 12 Jun 2015 18:48:47 -0000

--047d7bd758b64b6e1005185630bb
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

Looking at the BIP32 definition, I hit a line that I would appreciate
clarification on.

https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki

Under the section "Private parent key =E2=86=92 private child key" there is=
 a step:

"The returned child key ki is parse256(IL) + kpar (mod n)."

Can someone help me understand what "n" is in the context of this
algorithm?  I very well could be looking right at it, but wanted to double
check if I am missing something.

Thanks,
James

--047d7bd758b64b6e1005185630bb
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Looking at the BIP32 definition, I hit a line that I would=
 appreciate clarification on.<div><br></div><div><a href=3D"https://github.=
com/bitcoin/bips/blob/master/bip-0032.mediawiki">https://github.com/bitcoin=
/bips/blob/master/bip-0032.mediawiki</a><br><div><br></div><div>Under the s=
ection &quot;Private parent key =E2=86=92 private child key&quot; there is =
a step:</div></div><div><br></div><div>&quot;The returned child key ki is p=
arse256(IL) + kpar (mod n).&quot;</div><div><br></div><div>Can someone help=
 me understand what &quot;n&quot; is in the context of this algorithm?=C2=
=A0 I very well could be looking right at it, but wanted to double check if=
 I am missing something.</div><div><br></div><div>Thanks,</div><div>James</=
div></div>

--047d7bd758b64b6e1005185630bb--