<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.2 (Ruby 2.6.10) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-bctb-6man-rfc6296-bis-01" category="info" submissionType="IETF" updates="6296" version="3">
  <!-- xml2rfc v2v3 conversion 3.18.2 -->
  <front>
    <title abbrev="RFC 6296bis">RFC 6296bis IPv6-to-IPv6 Network Prefix Translation</title>
    <seriesInfo name="Internet-Draft" value="draft-bctb-6man-rfc6296-bis-01"/>
    <author initials="M." surname="Cullen" fullname="Margaret Cullen">
      <organization>Painless Security</organization>
      <address>
        <email>mrcullen42@gmail.com</email>
      </address>
    </author>
    <author initials="F." surname="Baker" fullname="Fred Baker">
      <organization>Unaffiliated</organization>
      <address>
        <email>fredbaker.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="O." surname="Troan" fullname="Ole Troan">
      <organization>Cisco Systems</organization>
      <address>
        <email>otroan@cisco.com</email>
      </address>
    </author>
    <author initials="N." surname="Buraglio" fullname="Nick Buraglio">
      <organization>Energy Sciences Network</organization>
      <address>
        <email>buraglio@forwardingplane.net</email>
      </address>
    </author>
    <date year="2023" month="November" day="30"/>
    <area>Int</area>
    <workgroup>6MAN</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 47?>

<t>This document describes a stateless, transport-agnostic IPv6-to-IPv6
Network Prefix Translation (NPTv6) function that provides the
address-independence benefit associated with IPv4-to-IPv4 NAT
(NAPT44) and provides a 1:1 relationship between addresses in the
"inside" and "outside" prefixes, preserving end-to-end reachability
at the network layer.</t>
    </abstract>
    <note removeInRFC="true">
      <name>Discussion Venues</name>
      <t>Source for this draft and an issue tracker can be found at
    <eref target="https://github.com/buraglio/rfc6296-bis"/>.</t>
    </note>
  </front>
  <middle>
    <?line 56?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>This document describes a stateless IPv6-to-IPv6 Network Prefix
Translation (NPTv6) function, designed to provide address
independence to the edge network.  It is transport-agnostic with
respect to transports that do not checksum the IP header, such as
SCTP, and to transports that use the TCP/UDP/DCCP (Datagram
Congestion Control Protocol) pseudo-header and checksum <xref target="RFC1071"/>.</t>
      <t>For reasons discussed in <xref target="RFC2993"/> and Section 5, the IETF does not
recommend the use of Network Address Translation technology for IPv6.
Where translation is implemented, however, this specification
provides a mechanism that has fewer architectural problems than
merely implementing a traditional stateful Network Address Translator
in an IPv6 environment.  It also provides a useful alternative to the
complexities and costs imposed by multihoming using provider-
independent addressing and the routing and network management issues
of overlaid ISP address space.  Some problems remain, however.  The
reader should consider the alternatives suggested in <xref target="RFC4864"/> and
the considerations of <xref target="RFC5902"/> for improved approaches.</t>
      <t>The stateless approach described in this document has several
ramifications:</t>
      <ul spacing="normal">
        <li>
          <t>Any security benefit that NAPT44 might offer is not present in
    NPTv6, necessitating the use of a firewall to obtain those
    benefits if desired.  An example of such a firewall is described
    in <xref target="RFC6092"/>.</t>
        </li>
        <li>
          <t>End-to-end reachability is preserved, although the address used
    "inside" the edge network differs from the address used "outside"
    the edge network.  This has implications for application referrals
    and other uses of Internet layer addresses.</t>
        </li>
        <li>
          <t>If there are multiple identically configured prefix translators
    between two networks, there is no need for them to exchange
    dynamic state, as there is no dynamic state -- the algorithmic
    translation will be identical across each of them.  The network
    can therefore asymmetrically route, load share, and fail-over
    among them without issue.</t>
        </li>
        <li>
          <t>Since translation is 1:1 at the network layer, there is no need to
    modify port numbers or other transport parameters.</t>
        </li>
        <li>
          <t>TCP sessions that authenticate peers using the TCP Authentication
    Option <xref target="RFC5925"/> cannot have their addresses translated, as the
    addresses are used in the calculation of the Message
    Authentication Code.  This consideration applies in general to any</t>
        </li>
        <li>
          <t>Unilateral Self-Address Fixing (UNSAF) <xref target="RFC3424"/> Protocol, which
    the IAB recommends against the deployment of in an environment
    that changes Internet addresses.</t>
        </li>
        <li>
          <t>Applications using the Internet Key Exchange Protocol Version 2
    (IKEv2) <xref target="RFC5996"/> should, at least in theory, detect the presence
    of the translator; while no NAT traversal solution is required,
    <xref target="RFC5996"/> would require such sessions to use UDP.</t>
        </li>
      </ul>
      <section anchor="what-is-address-independence">
        <name>What is Address Independence?</name>
        <t>For the purposes of this document, IPv6 address independence consists
of the following set of properties:</t>
        <t>From the perspective of the edge network:</t>
        <ul spacing="normal">
          <li>
            <t>The IPv6 addresses used inside the local network (for
interfaces, access lists, and logs) do not need to be
renumbered if the global prefix(es) assigned for use by the
edge network are changed.</t>
          </li>
          <li>
            <t>The IPv6 addresses used inside the edge network (for
interfaces, access lists, and logs) or within other upstream
networks (such as when multihoming) do not need to be
renumbered when a site adds, drops, or changes upstream
networks.</t>
          </li>
          <li>
            <t>It is not necessary for an administration to convince an
upstream network to route its internal IPv6 prefixes or for it
to advertise prefixes derived from other upstream networks into
it.</t>
          </li>
          <li>
            <t>Unless it wants to optimize routing between multiple upstream
networks in the process of multihoming, there is no need for a
BGP exchange with the upstream network.</t>
          </li>
        </ul>
        <t>From the perspective of the upstream network:</t>
        <ul spacing="normal">
          <li>
            <t>IPv6 addresses used by the edge network are guaranteed to have
a provider-allocated prefix, eliminating the need and concern
for BCP 38 <xref target="RFC2827"/> ingress filtering and the advertisement of
customer-specific prefixes.</t>
          </li>
        </ul>
        <t>Thus, address independence has ramifications for the edge network,
networks it directly connects with (especially its upstream
networks), and the Internet as a whole.  The desire for address
independence has been a primary driver for IPv4 NAT deployment in
medium- to large-sized enterprise networks, including NAT deployments</t>
        <t>in enterprises that have plenty of IPv4 provider-independent address
space (from IPv4 "swamp space").  It has also been a driver for edge
networks to become members of Regional Internet Registry (RIR)
communities, seeking to obtain BGP Autonomous System Numbers and
provider-independent prefixes, and as a result has been one of the
drivers of the explosion of the IPv4 route table.  Service providers
have stated that the lack of address independence from their
customers has been a negative incentive to deployment, due to the
impact of customer routing expected in their networks.</t>
        <t>The Local Network Protection <xref target="RFC4864"/> document discusses a related
concept called "Address Autonomy" as a benefit of NAPT44.  <xref target="RFC4864"/>
indicates that address autonomy can be achieved by the simultaneous
use of global addresses on all nodes within a site that need external
connectivity and Unique Local Addresses (ULAs) <xref target="RFC4193"/> for all
internal communication.  However, this solution fails to meet the
requirement for address independence, because if an ISP renumbering
event occurs, all of the hosts, routers, DHCP servers, Access Control
Lists (ACLs), firewalls, and other internal systems that are
configured with global addresses from the ISP will need to be
renumbered before global connectivity is fully restored.</t>
        <t>The use of IPv6 provider-independent (PI) addresses has also been
suggested as a means to fulfill the address-independence requirement.
However, this solution requires that an enterprise qualify to receive
a PI assignment and persuade its ISP to install specific routes for
the enterprise's PI addresses.  There are a number of practical
issues with this approach, especially if there is a desire to route
to a number of geographically and topologically diverse sites, which
can sometimes involve coordinating with several ISPs to route
portions of a single PI prefix.  These problems have caused numerous
enterprises with plenty of IPv4 swamp space to choose to use IPv4 NAT
for part, or substantially all, of their internal network instead of
using their provider-independent address space.</t>
      </section>
      <section anchor="nptv6-applicability">
        <name>NPTv6 Applicability</name>
        <t>NPTv6 provides a simple and compelling solution to meet the address-
independence requirement in IPv6.  The address-independence benefit
stems directly from the translation function of the network prefix
translator.  To avoid as many of the issues associated with NAPT44 as
possible, NPTv6 is defined to include a two-way, checksum-neutral,
algorithmic translation function, and nothing else.</t>
        <t>The fact that NPTv6 does not map ports and is checksum-neutral avoids
the need for an NPTv6 Translator to rewrite transport layer headers.
This makes it feasible to deploy new or improved transport layer
protocols without upgrading NPTv6 Translators.  Similarly, since
NPTv6 does not rewrite transport layer headers, NPTv6 will not
interfere with encryption of the full IP payload in many cases.</t>
        <t>The default NPTv6 address-mapping mechanism is purely algorithmic, so
NPTv6 translators do not need to maintain per-node or per-connection
state, allowing deployment of more robust and adaptive networks than
can be deployed using NAPT44.  Since the default NPTv6 mapping can be
performed in either direction, it does not interfere with inbound
connection establishment, thus allowing internal nodes to participate
in direct Peer-to-Peer applications without the application layer
overhead one finds in many IPv4 Peer-to-Peer applications.</t>
        <t>Although NPTv6 compares favorably to NAPT44 in several ways, it does
not eliminate all of the architectural problems associated with IPv4
NAT, as described in <xref target="RFC2993"/>.  NPTv6 involves modifying IP headers
in transit, so it is not compatible with security mechanisms, such as
the IPsec Authentication Header, that provide integrity protection
for the IP header.  NPTv6 may interfere with the use of application
protocols that transmit IP addresses in the application-specific
portion of the IP datagram.  These applications currently require
Application Layer Gateways (ALGs) to work correctly through NAPT44
devices, and similar ALGs may be required for these applications to
work through NPTv6 Translators.  The use of separate internal and
external prefixes creates complexity for DNS deployment, due to the
desire for internal nodes to communicate with other internal nodes
using internal addresses, while external nodes need to obtain
external addresses to communicate with the same nodes.  This
frequently results in the deployment of "split DNS", which may add
complexity to network configuration.</t>
        <t>The choice of address within the edge network bears consideration.
One could use a ULA, which maximizes address independence.  That
could also be considered a misuse of the ULA; if the expectation is
that a ULA prevents access to a system from outside the range of the
ULA, NPTv6 overrides that.  On the other hand, the administration is
aware that it has made that choice and could deploy a second ULA for
the purpose of privacy if it desired; the only prefix that will be
translated is one that has an NPTv6 Translator configured to
translate to or from it.  Also, using any other global-scope address
format makes one either obtain a PI prefix or be at the mercy of the
agency from which it was allocated.</t>
        <t>There are significant technical impacts associated with the
deployment of any prefix translation mechanism, including NPTv6, and
we strongly encourage anyone who is considering the implementation or
deployment of NPTv6 to read <xref target="RFC4864"/> and <xref target="RFC5902"/>, and to carefully
consider the alternatives described in that document, some of which
may cause fewer problems than NPTv6.</t>
      </section>
      <section anchor="requirements-terminology">
        <name>Requirements Terminology</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 <xref target="RFC2119"/>.</t>
      </section>
    </section>
    <section anchor="nptv6-overview">
      <name>NPTv6 Overview</name>
      <t>NPTv6 may be implemented in an IPv6 router to map one IPv6 address
   prefix to another IPv6 prefix as each IPv6 datagram transits the
   router.  A router that implements an NPTv6 prefix translation
   function is referred to as an NPTv6 Translator.</t>
      <section anchor="nptv6-the-simplest-case">
        <name>NPTv6: The Simplest Case</name>
        <t>In its simplest form, an NPTv6 Translator interconnects two network
links, one of which is an "internal" network link attached to a leaf
network within a single administrative domain and the other of which
is an "external" network with connectivity to the global Internet.
All of the hosts on the internal network will use addresses from a
single, locally routed prefix, and those addresses will be translated
to/from addresses in a globally routable prefix as IP datagrams
transit the NPTv6 Translator.  The lengths of these two prefixes will
be functionally the same; if they differ, the longer of the two will
limit the ability to use subnets in the shorter.</t>
        <artwork><![CDATA[
               External Network:  Prefix = 2001:0DB8:0001:/48
                   --------------------------------------
                                     |
                                     |
                              +-------------+
                              |     NPTv6   |
                              |  Translator |
                              +-------------+
                                     |
                                     |
                   --------------------------------------
               Internal Network:  Prefix = FD01:0203:0405:/48

                       Figure 1: A Simple Translator
]]></artwork>
        <t>Figure 1 shows an NPTv6 Translator attached to two networks.  In this
example, the internal network uses IPv6 Unique Local Addresses (ULAs)
<xref target="RFC4193"/> to represent the internal IPv6 nodes, and the external
network uses globally routable IPv6 addresses to represent the same
nodes.</t>
        <t>When an NPTv6 Translator forwards datagrams in the "outbound"
direction, from the internal network to the external network, NPTv6
overwrites the IPv6 source prefix (in the IPv6 header) with a
corresponding external prefix.  When datagrams are forwarded in the
"inbound" direction, from the external network to the internal
network, the IPv6 destination prefix is overwritten with a
corresponding internal prefix.  Using the prefixes shown in the
diagram above, as an IP datagram passes through the NPTv6 Translator
in the outbound direction, the source prefix (FD01:0203:0405:/48)
will be overwritten with the external prefix (2001:0DB8:0001:/48).
In an inbound datagram, the destination prefix (2001:0DB8:0001:/48)
will be overwritten with the internal prefix (FD01:0203:0405:/48).
In both cases, it is the local IPv6 prefix that is overwritten; the
remote IPv6 prefix remains unchanged.  Nodes on the internal network
are said to be "behind" the NPTv6 Translator.</t>
        <t>2.2.  NPTv6 between Peer Networks</t>
        <t>NPTv6 can also be used between two private networks.  In these cases,
   both networks may use ULA prefixes, with each subnet in one network
   mapped into a corresponding subnet in the other network, and vice
   versa.  Or, each network may use ULA prefixes for internal addressing
   and global unicast addresses on the other network.</t>
        <artwork><![CDATA[
                  Internal Prefix = FD01:4444:5555:/48
                  --------------------------------------
                       V            |      External Prefix
                       V            |      2001:0DB8:6666:/48
                       V        +---------+      ^
                       V        |  NPTv6  |      ^
                       V        |  Device |      ^
                       V        +---------+      ^
              External Prefix       |            ^
              2001:0DB8:0001:/48    |            ^
                  --------------------------------------
                  Internal Prefix = FD01:0203:0405:/48

               Figure 2: Flow of Information in Translation
]]></artwork>
      </section>
      <section anchor="nptv6-redundancy-and-load-sharing">
        <name>NPTv6 Redundancy and Load Sharing</name>
        <t>In some cases, more than one NPTv6 Translator may be attached to a
   network, as shown in Figure 3.  In such cases, NPTv6 Translators are
   configured with the same internal and external prefixes.  Since there
   is only one translation, even though there are multiple translators,
   they map only one external address (prefix and Interface Identifier
   (IID)) to the internal address.</t>
        <artwork><![CDATA[
               External Network:  Prefix = 2001:0DB8:0001:/48
                   --------------------------------------
                          |                      |
                          |                      |
                   +-------------+        +-------------+
                   |  NPTv6      |        |  NPTv6      |
                   |  Translator |        |  Translator |
                   |   #1        |        |   #2        |
                   +-------------+        +-------------+
                          |                      |
                          |                      |
                   --------------------------------------
               Internal Network:  Prefix = FD01:0203:0405:/48

                      Figure 3: Parallel Translators
]]></artwork>
      </section>
      <section anchor="nptv6-multihoming">
        <name>NPTv6 Multihoming</name>
        <artwork><![CDATA[
            External Network #1:          External Network #2:
         Prefix = 2001:0DB8:0001:/48    Prefix = 2001:0DB8:5555:/48
         ---------------------------    --------------------------
                         |                      |
                         |                      |
                  +-------------+        +-------------+
                  |  NPTv6      |        |  NPTv6      |
                  |  Translator |        |  Translator |
                  |   #1        |        |   #2        |
                  +-------------+        +-------------+
                         |                      |
                         |                      |
                  --------------------------------------
              Internal Network:  Prefix = FD01:0203:0405:/48

      Figure 4: Parallel Translators with Different Upstream Networks
]]></artwork>
        <t>When multihoming, NPTv6 Translators are attached to an internal
   network, as shown in Figure 4, but are connected to different
   external networks.  In such cases, NPTv6 Translators are configured
   with the same internal prefix but different external prefixes.  Since
   there are multiple translations, they map multiple external addresses
   (prefix and IID) to the common internal address.  A system within the
   edge network is unable to determine which external address it is
   using apart from services such as Session Traversal Utilities for NAT
   (STUN) <xref target="RFC5389"/>.</t>
        <t>Multihoming in this sense has one negative feature as compared with
   multihoming with a provider-independent address: when routes change
   between NPTv6 Translators, the translated prefix can change since the
   upstream network changes.  This causes sessions and referrals
   dependent on it to fail as well.  This is not expected to be a major
   issue, however, in networks where routing is generally stable.</t>
      </section>
      <section anchor="mapping-with-no-per-flow-state">
        <name>Mapping with No Per-Flow State</name>
        <t>When NPTv6 is used as described in this document, no per-node or per-
   flow state is maintained in the NPTv6 Translator.  Both inbound and
   outbound datagrams are translated algorithmically, using only
   information found in the IPv6 header.  Due to this property, NPTv6's
   two-way, algorithmic address mapping can support both outbound and
   inbound connection establishment without the need for maintenance of
   mapping state or for state-priming or rendezvous mechanisms.  This is
   a significant improvement over NAPT44 devices, but it also has
   significant security implications, which are described in Section 7.</t>
      </section>
      <section anchor="checksum-neutral-mapping">
        <name>Checksum-Neutral Mapping</name>
        <t>When a change is made to one of the IP header fields in the IPv6
   pseudo-header checksum (such as one of the IP addresses), the
   checksum field in the transport layer header may become invalid.
   Fortunately, an incremental change in the area covered by the
   Internet standard checksum <xref target="RFC1071"/> will result in a well-defined
   change to the checksum value <xref target="RFC1624"/>.  So, a checksum change caused
   by modifying part of the area covered by the checksum can be
   corrected by making a complementary change to a different 16-bit
   field covered by the same checksum.</t>
        <t>The NPTv6 mapping mechanisms described in this document are checksum-
   neutral, which means that they result in IP headers that will
   generate the same IPv6 pseudo-header checksum when the checksum is
   calculated using the standard Internet checksum algorithm <xref target="RFC1071"/>.
   Any changes that are made during translation of the IPv6 prefix are
   offset by changes to other parts of the IPv6 address.  This results
   in transport layers that use the Internet checksum (such as TCP and
   UDP) calculating the same IPv6 pseudo-header checksum for both the
   internal and external forms of the same datagram, which avoids the
   need for the NPTv6 Translator to modify those transport layer headers
   to correct the checksum value.</t>
        <t>The outgoing checksum correction is achieved by making a change to a
   16-bit section of the source address that is not used for routing in
   the external network.  Due to the nature of checksum arithmetic, when
   the corresponding correction is applied to the same bits of
   destination address of the inbound packet, the Destination Address
   (DA) is returned to the correct internal value.</t>
        <t>As noted in Section 4.2, this mapping results in an edge network
   using a /48 external prefix to be unable to use subnet 0xFFFF.</t>
      </section>
    </section>
    <section anchor="nptv6-algorithmic-specification">
      <name>NPTv6 Algorithmic Specification</name>
      <t>The <xref target="RFC4291"/> IPv6 Address is reproduced for clarity in Figure 5.
   ~~~~~~~~~~</t>
      <artwork><![CDATA[
  0    15 16   31 32   47 48   63 64   79 80   95 96  111 112  127
 +-------+-------+-------+-------+-------+-------+-------+-------+
 |     Routing Prefix    | Subnet|   Interface Identifier (IID)  |
 +-------+-------+-------+-------+-------+-------+-------+-------+

        Figure 5: Enumeration of the IPv6 Address {{RFC4291}} ~~~~~~~~~~
]]></artwork>
      <section anchor="nptv6-configuration-calculations">
        <name>NPTv6 Configuration Calculations</name>
        <t>When an NPTv6 Translation function is configured, it is configured
   with</t>
        <ul spacing="normal">
          <li>
            <t>one or more "internal" interfaces with their "internal" routing
    domain prefixes, and</t>
          </li>
          <li>
            <t>one or more "external" interfaces with their "external" routing
    domain prefixes.  </t>
            <t>
In the simple case, there is one of each.  If a single router
 provides NPTv6 translation services between a multiplicity of domains
 (as might be true when multihoming), each internal/external pair must
 be thought of as a separate NPTv6 Translator from the perspective of
 this specification.  </t>
            <t>
When an NPTv6 Translator is configured, the translation function
 first ensures that the internal and external prefixes are the same
 length, extending the shorter of the two with zeroes if necessary.
 These two prefixes will be used in the prefix translation function
 described in Sections 3.2 and 3.3.  </t>
            <t>
They are then zero-extended to /64 for the purposes of a calculation.
 The translation function calculates the one's complement sum of the
 16-bit words of the /64 external prefix and the /64 internal prefix.
 It then calculates the difference between these values: internal
 minus external.  This value, called the "adjustment", is effectively
 constant for the lifetime of the NPTv6 Translator configuration and
 is used in per-datagram processing.</t>
          </li>
        </ul>
      </section>
      <section anchor="nptv6-translation-internal-network-to-external-network">
        <name>NPTv6 Translation, Internal Network to External Network</name>
        <t>When a datagram passes through the NPTv6 Translator from an internal
   to an external network, its IPv6 Source Address is either changed in
   two ways or results in the datagram being discarded:</t>
        <ul spacing="normal">
          <li>
            <t>If the internal subnet number has no mapping, such as being 0xFFFF
    or simply not mapped, discard the datagram.  This SHOULD result in
    an ICMP Destination Unreachable.</t>
          </li>
          <li>
            <t>The internal prefix is overwritten with the external prefix, in
    effect subtracting the difference between the two checksums (the
    adjustment) from the pseudo-header's checksum, and</t>
          </li>
          <li>
            <t>A 16-bit word of the address has the adjustment added to it using
    one's complement arithmetic.  If the result is 0xFFFF, it is
    overwritten as zero.  The choice of word is as specified in
    Sections 3.4 or 3.5 as appropriate.</t>
          </li>
        </ul>
      </section>
      <section anchor="nptv6-translation-external-network-to-internal-network">
        <name>NPTv6 Translation, External Network to Internal Network</name>
        <t>When a datagram passes through the NPTv6 Translator from an external
   to an internal network, its IPv6 Destination Address is changed in
   two ways:</t>
        <ul spacing="normal">
          <li>
            <t>The external prefix is overwritten with the internal prefix, in
    effect adding the difference between the two checksums (the
    adjustment) to the pseudo-header's checksum, and</t>
          </li>
          <li>
            <t>A 16-bit word of the address has the adjustment subtracted from it
    (bitwise inverted and added to it) using one's complement
    arithmetic.  If the result is 0xFFFF, it is overwritten as zero.
    The choice of word is as specified in Section 3.4 or Section 3.5
    as appropriate.</t>
          </li>
        </ul>
      </section>
      <section anchor="nptv6-with-a-48-or-shorter-prefix">
        <name>NPTv6 with a /48 or Shorter Prefix</name>
        <t>When an NPTv6 Translator is configured with internal and external
   prefixes that are 48 bits in length (a /48) or shorter, the
   adjustment MUST be added to or subtracted from bits 48..63 of the
   address.
   This mapping results in no modification of the Interface Identifier
   (IID), which is held in the lower half of the IPv6 address, so it
   will not interfere with future protocols that may use unique IIDs for
   node identification.</t>
        <t>NPTv6 Translator implementations MUST implement the /48 mapping.</t>
      </section>
      <section anchor="nptv6-with-a-49-or-longer-prefix">
        <name>NPTv6 with a /49 or Longer Prefix</name>
        <t>When an NPTv6 Translator is configured with internal and external
   prefixes that are longer than 48 bits in length (such as a /52, /56,
   or /60), the adjustment must be added to or subtracted from one of
   the words in bits 64..79, 80..95, 96..111, or 112..127 of the
   address.  While the choice of word is immaterial as long as it is
   consistent, these words MUST be inspected in that sequence and the
   first that is not initially 0xFFFF chosen, for consistency's sake.</t>
        <t>NPTv6 Translator implementations SHOULD implement the mapping for
   longer prefixes.</t>
      </section>
      <section anchor="prefix-mapping-example">
        <name>/48 Prefix Mapping Example</name>
        <t>For the network shown in Figure 1, the Internal Prefix is FD01:0203:
   0405:/48, and the External Prefix is 2001:0DB8:0001:/48.</t>
        <t>If a node with internal address FD01:0203:0405:0001::1234 sends an
   outbound datagram through the NPTv6 Translator, the resulting
   external address will be 2001:0DB8:0001:D550::1234.  The resulting
   address is obtained by calculating the checksum of both the internal
   and external 48-bit prefixes, subtracting the internal prefix from
   the external prefix using one's complement arithmetic to calculate
   the "adjustment", and adding the adjustment to the 16-bit subnet
   field (in this case, 0x0001).</t>
        <t>To show the work:</t>
        <t>The one's complement checksum of FD01:0203:0405 is 0xFCF5.  The one's
   complement checksum of 2001:0DB8:0001 is 0xD245.  Using one's
   complement arithmetic, 0xD245 - 0xFCF5 = 0xD54F.  The subnet in the
   original datagram is 0x0001.  Using one's complement arithmetic,
   0x0001 + 0xD54F = 0xD550.  Since 0xD550 != 0xFFFF, it is not changed
   to 0x0000.</t>
        <t>So, the value 0xD550 is written in the 16-bit subnet area, resulting
   in a mapped external address of 2001:0DB8:0001:D550::1234.</t>
        <t>When a response datagram is received, it will contain the destination
   address 2001:0DB8:0001:D550::1234, which will be mapped back to FD01:
   0203:0405:0001::1234 using the inverse mapping algorithm.</t>
        <t>In this case, the difference between the two prefixes will be
   calculated as follows:</t>
        <t>Using one's complement arithmetic, 0xFCF5 - 0xD245 = 0x2AB0.  The
   subnet in the original datagram = 0xD550.  Using one's complement
   arithmetic, 0xD550 + 0x2AB0 = 0x0001.  Since 0x0001 != 0xFFFF, it is
   not changed to 0x0000.</t>
        <t>So the value 0x0001 is written into the subnet field, and the
   internal value of the subnet field is properly restored.</t>
      </section>
      <section anchor="address-mapping-for-longer-prefixes">
        <name>Address Mapping for Longer Prefixes</name>
        <t>If the prefix being mapped is longer than 48 bits, the algorithm is
   slightly more complex.  A common case will be that the internal and
   external prefixes are of different lengths.  In such a case, the
   shorter prefix is zero-extended to the length of the longer as
   described in Section 3.1 for the purposes of overwriting the prefix.
   Then, they are both zero-extended to 64 bits to facilitate one's
   complement arithmetic.  The "adjustment" is calculated using those
   64-bit prefixes.</t>
        <t>For example, if the internal prefix is a /48 ULA and the external
   prefix is a /56 provider-allocated prefix, the ULA becomes a /56 with
   zeros in bits 48..55.  For purposes of one's complement arithmetic,
   they are then both zero-extended to 64 bits.  A side effect of this
   is that a subset of the subnets possible in the shorter prefix is
   untranslatable.  While the security value of this is debatable, the
   administration may choose to use them for subnets that it knows need
   no external accessibility.</t>
        <t>We then find the first word in the IID that does not have the value
   0xFFFF, trying bits 64..79, and then 80..95, 96..111, and finally
   112..127.  We perform the same calculation (with the same proof of
   correctness) as in Section 3.6 but apply it to that word.</t>
        <t>Although any 16-bit portion of an IPv6 IID could contain 0xFFFF, an
   IID of all-ones is a reserved anycast identifier that should not be
   used on the network <xref target="RFC2526"/>.  If an NPTv6 Translator discovers a
   datagram with an IID of all-zeros while performing address mapping,
   that datagram MUST be dropped, and an ICMPv6 Parameter Problem error
   SHOULD be generated <xref target="RFC4443"/>.
   Note: This mechanism does involve modification of the IID; it may not
   be compatible with future mechanisms that use unique IIDs for node
   identification.</t>
      </section>
      <section anchor="icmpv6-error-forwarding">
        <name>ICMPv6 error forwarding</name>
        <t>This section describes the processing of ICMPv6 error messages and is similar to
   the ICMP error forwarding specified for IPv4 NATs in <xref target="RFC5508"/>.</t>
        <t>For an ICMPv6 error, both the addresses in the outer IPv6 header and the embedded IPv6 header
   in the ICMPv6 error message must be translated.</t>
        <t>For an ICMPv6 error received from the "outside", the embedded IPv6 header source address
   is translated from the external prefix to the internal prefix. While the outer IPv6 header
   destination address is translated from the external prefix to the internal prefix as normal.
   If the embedded IPv6 source address prefix does not match the external prefix prior to the rewrite,
   the packet MUST be silently dropped.</t>
        <t>For an ICMPv6 error received from the "inside", the embedded IPv6 header destination address
   is translated from the internal prefix to the external prefix. While the outer IPv6 header
   source address is translated from the internal prefix to the external prefix as normal.
   If the embedded IPv6 destination address prefix does not match the internal prefix prior to the rewrite,
   the packet MUST be silently dropped.</t>
        <t>The ICMPv6 forwarding function MUST verify that the length of the embedded pacekt is long enough to contain the whole IPv6 header.</t>
        <t>An ICMPv6 Error message checksum covers the entire ICMPv6 message,
   including the payload.  When an ICMPv6 Error packet is received, if the
   ICMPv6 checksum fails to validate, NPTv6 SHOULD silently drop the
   ICMPv6 Error packet.  This is because NATv6 uses the embedded IPv6 and
   transport headers for forwarding and translating the ICMPv6 Error
   message.  When the ICMPv6 checksum is
   invalid, the embedded IPv6 and transport headers, which are covered by
   the ICMPv6 checksum, are also suspect.</t>
      </section>
    </section>
    <section anchor="implications-of-network-address-translator-behavioral-requirements">
      <name>Implications of Network Address Translator Behavioral Requirements</name>
      <section anchor="prefix-configuration-and-generation">
        <name>Prefix Configuration and Generation</name>
        <t>NPTv6 Translators MUST support manual configuration of internal and
   external prefixes and MUST NOT place any restrictions on those
   prefixes except that they be valid IPv6 unicast prefixes as described
   in <xref target="RFC4291"/>.  They MAY also support random generation of ULA
   addresses on command.  Since the most common place anticipated for
   the implementation of an NPTv6 Translator is a Customer Premises
   Equipment (CPE) router, the reader is urged to consider the
   requirements of <xref target="RFC6204"/>.</t>
      </section>
      <section anchor="subnet-numbering">
        <name>Subnet Numbering</name>
        <t>For reasons detailed in Appendix B, a network using NPTv6 Translation
   and a /48 external prefix MUST NOT use the value 0xFFFF to designate
   a subnet that it expects to be translated.</t>
      </section>
      <section anchor="nat-behavioral-requirements">
        <name>NAT Behavioral Requirements</name>
        <t>NPTv6 Translators MUST support hairpinning behavior, as defined in
   the NAT Behavioral Requirements for UDP document <xref target="RFC4787"/>.  This
   means that when an NPTv6 Translator receives a datagram on the
   internal interface that has a destination address that matches the
   site's external prefix, it will translate the datagram and forward it
   internally.  This allows internal nodes to reach other internal nodes
   using their external, global addresses when necessary.</t>
        <t>Conceptually, the datagram leaves the domain (is translated as
   described in Section 3.2) and returns (is again translated as
   described in Section 3.3).  As a result, the datagram exchange will
   be through the NPTv6 Translator in both directions for the lifetime
   of the session.  The alternative would be to require the NPTv6
   Translator to drop the datagram, forcing the sender to use the
   correct internal prefix for its peer.  Performing only the external-
   to-internal translation results in the datagram being sent from the
   untranslated internal address of the source to the translated and
   therefore internal address of its peer, which would enable the
   session to bypass the NPTv6 Translator for future datagrams.  It
   would also mean that the original sender would be unlikely to
   recognize the response when it arrived.
   Because NPTv6 does not perform port mapping and uses a one-to-one,
   reversible-mapping algorithm, none of the other NAT behavioral
   requirements apply to NPTv6.</t>
      </section>
    </section>
    <section anchor="implications-for-applications">
      <name>Implications for Applications</name>
      <t>NPTv6 Translation does not create several of the problems known to
   exist with other kinds of NATs as discussed in <xref target="RFC2993"/>.  In
   particular, NPTv6 Translation is stateless, so a "reset" or brief
   outage of an NPTv6 Translator does not break connections that
   traverse the translation function, and if multiple NPTv6 Translators
   exist between the same two networks, the load can shift or be
   dynamically load shared among them.  Also, an NPTv6 Translator does
   not aggregate traffic for several hosts/interfaces behind a fewer
   number of external addresses, so there is no inherent expectation for
   an NPTv6 Translator to block new inbound flows from external hosts
   and no issue with a filter or blacklist associated with one prefix
   within the domain affecting another.  A firewall can, of course, be
   used in conjunction with an NPTv6 Translator; this would allow the
   network administrator more flexibility to specify security policy
   than would be possible with a traditional NAT.</t>
      <t>However, NPTv6 Translation does create difficulties for some kinds of
   applications.  Some examples include:</t>
      <ul spacing="normal">
        <li>
          <t>An application instance "behind" an NPTv6 Translator will see a
    different address for its connections than its peers "outside" the
    NPTv6 Translator.</t>
        </li>
        <li>
          <t>An application instance "outside" an NPTv6 Translator will see a
    different address for its connections than any peer "inside" an
    NPTv6 Translator.</t>
        </li>
        <li>
          <t>An application instance wishing to establish communication with a
    peer "behind" an NPTv6 Translator may need to use a different
    address to reach that peer depending on whether the instance is
    behind the same NPTv6 Translator or external to it.  Since an
    NPTv6 Translator implements hairpinning (Section 4.3), it suffices
    for applications to always use their external addresses.  However,
    this creates inefficiencies in the local network and may also
    complicate implementation of the NPTv6 Translator.  <xref target="RFC6724"/> also
    would prefer the private address in such a case in order to reduce
    those inefficiencies.</t>
        </li>
        <li>
          <t>An application instance that moves from a realm "behind" an NPTv6
    Translator to a realm that is "outside" the network, or vice
    versa, may find that it is no longer able to reach its peers at
    the same addresses it was previously able to use.</t>
        </li>
        <li>
          <t>An application instance that is intermittently communicating with
    a peer that moves from behind an NPTv6 Translator to "outside" of
    it, or vice versa, may find that it is no longer able to reach
    that peer at the same address that it had previously used.  </t>
          <t>
Many, but not all, of the applications that are adversely affected by
 NPTv6 Translation are those that do "referrals" -- where an
 application instance passes its own addresses, and/or addresses of
 its peers, to other peers.  (Some believe referrals are inherently
 undesirable; others believe that they are necessary in some
 circumstances.  A discussion of the merits of referrals, or lack
 thereof, is beyond the scope of this document.)  </t>
          <t>
To some extent, the incidence of these difficulties can be reduced by
 DNS hacks that attempt to expose addresses "behind" an NPTv6
 Translator only to hosts that are also behind the same NPTv6
 Translator and perhaps to also expose only the "internal" addresses
 of hosts behind the NPTv6 Translator to other hosts behind the same
 NPTv6 Translator.  However, this cannot be a complete solution.  A
 full discussion of these issues is out of scope for this document,
 but briefly: (a) reliance on DNS to solve this problem depends on
 hosts always making queries from DNS servers in the same realm as
 they are (or on DNS interception proxies, which create their own
 problems) and on mobile hosts/applications not caching those results;
 (b) reliance on DNS to solve this problem depends on network
 administrators on all networks using such applications to reliably
 and accurately maintain current DNS entries for every host using
 those applications; and (c) reliance on DNS to solve this problem
 depends on applications always using DNS names, even though they
 often must run in environments where DNS names are not reliably
 maintained for every host.  Other issues are that there is often no
 single distinguished name for a host and no reliable way for a host
 to determine what DNS names are associated with it and which names
 are appropriate to use in which contexts.</t>
        </li>
      </ul>
      <section anchor="recommendation-for-network-planners-considering-use-of-nptv6">
        <name>Recommendation for Network Planners Considering Use of NPTv6</name>
        <artwork><![CDATA[
  Translation
]]></artwork>
        <t>In light of the above, network planners considering the use of NPTv6
   translation should carefully consider the kinds of applications that
   they will need to run in the future and determine whether the
   address-stability and provider-independence benefits are consistent
   with their application requirements.</t>
      </section>
      <section anchor="recommendations-for-application-writers">
        <name>Recommendations for Application Writers</name>
        <t>Several mechanisms (e.g., STUN <xref target="RFC5389"/>, Traversal Using Relays
   around NAT (TURN) <xref target="RFC5766"/>, and Interactive Connectivity
   Establishment (ICE) <xref target="RFC5245"/>) have been used with traditional IPv4
   NAT to circumvent some of the limitations of such devices.  Similar
   mechanisms could also be applied to circumvent some of the issues
   with an NPTv6 Translator.  However, all of these require the
   assistance of an external server or a function co-located with the
   translator that can tell an "internal" host what its "external"
   addresses are.</t>
      </section>
      <section anchor="recommendation-for-future-work">
        <name>Recommendation for Future Work</name>
        <t>It might be desirable to define a general mechanism that would allow
   hosts within a translation domain to determine their external
   addresses and/or request that inbound traffic be permitted.  If such
   a mechanism were to be defined, it would ideally be general enough to
   also accommodate other types of NAT likely to be encountered by IPV6
   applications, in particular IPv4/IPv6 Translation <xref target="RFC6144"/> <xref target="RFC6147"/>
          <xref target="RFC6145"/> <xref target="RFC6146"/> <xref target="RFC6052"/>.  For this and other reasons, such a
   mechanism is beyond the scope of this document.</t>
      </section>
    </section>
    <section anchor="a-note-on-port-mapping">
      <name>A Note on Port Mapping</name>
      <t>In addition to overwriting IP addresses when datagrams are forwarded,
   NAPT44 devices overwrite the source port number in outbound traffic
   and the destination port number in inbound traffic.  This mechanism
   is called "port mapping".</t>
      <t>The major benefit of port mapping is that it allows multiple
   computers to share a single IPv4 address.  A large number of internal
   IPv4 addresses (typically from one of the <xref target="RFC1918"/> private address
   spaces) can be mapped into a single external, globally routable IPv4
   address, with the local port number used to identify which internal
   node should receive each inbound datagram.  This address-
   amplification feature is not generally foreseen as a necessity at
   this time.</t>
      <t>Since port mapping requires rewriting a portion of the transport
   layer header, it requires NAPT44 devices to be aware of all of the
   transport protocols that they forward, thus stifling the development
   of new and improved transport protocols and preventing the use of
   IPsec encryption.  Modifying the transport layer header is
   incompatible with security mechanisms that encrypt the full IP
   payload and restricts the NAPT44 to forwarding transport layers that
   use weak checksum algorithms that are easily recalculated in routers.</t>
      <t>Since there is significant detriment caused by modifying transport
   layer headers and very little, if any, benefit to the use of port
   mapping in IPv6, NPTv6 Translators that comply with this
   specification MUST NOT perform port mapping.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>When NPTv6 is deployed using either of the two-way, algorithmic
   mappings defined in this document, it allows direct inbound
   connections to internal nodes.  While this can be viewed as a benefit
   of NPTv6 versus NAPT44, it does open internal nodes to attacks that
   would be more difficult in a NAPT44 network.  From a security
   standpoint, although this situation is not substantially worse than
   running IPv6 with no NAT, some enterprises may assume that an NPTv6
   Translator will offer similar protection to a NAPT44 device.</t>
      <t>The port mapping mechanism in NAPT44 implementations requires that
   state be created in both directions.  This has lead to an industry-
   wide perception that NAT functionality is the same as a stateful
   firewall.  It is not.  The translation function of the NAT only
   creates dynamic state in one direction and has no policy.  For this
   reason, it is RECOMMENDED that NPTv6 Translators also implement
   firewall functionality such as described in <xref target="RFC6092"/>, with
   appropriate configuration options including turning it on or off.</t>
      <t>When <xref target="RFC4864"/> talks about randomizing the subnet identifier, the
   idea is to make it harder for worms to guess a valid subnet
   identifier at an advertised network prefix.  This should not be
   interpreted as endorsing concealment of the subnet identifier behind
   the obfuscating function of a translator such as NPTv6.  <xref target="RFC4864"/>
   specifically talks about how to obtain the desired properties of
   concealment without using a translator.  Topology hiding when using
   NAT is often ineffective in environments where the topology is
   visible in application layer messaging protocols such as DNS, SIP,
   SMTP, etc.  If the information were not available through the
   application layer, <xref target="RFC2993"/> would not be valid.</t>
      <t>Due to the potential interactions with IKEv2/IPsec NAT traversal, it
   would be valuable to test interactions of NPTv6 with various aspects
   of current-day IKEv2/IPsec NAT traversal.</t>
    </section>
    <section anchor="acknowledgements">
      <name>Acknowledgements</name>
      <t>The checksum-neutral algorithmic address mapping described in this
   document is based on email written by Iljtsch van Beijnum.</t>
      <t>The following people provided advice or review comments that
   substantially improved this document: Allison Mankin, Christian
   Huitema, Dave Thaler, Ed Jankiewicz, Eric Kline, Iljtsch van Beijnum,
   Jari Arkko, Keith Moore, Mark Townsley, Merike Kaeo, Ralph Droms,
   Remi Despres, Steve Blake, and Tony Hain.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC4193" target="https://www.rfc-editor.org/info/rfc4193" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4193.xml">
          <front>
            <title>Unique Local IPv6 Unicast Addresses</title>
            <author fullname="R. Hinden" initials="R." surname="Hinden"/>
            <author fullname="B. Haberman" initials="B." surname="Haberman"/>
            <date month="October" year="2005"/>
            <abstract>
              <t>This document defines an IPv6 unicast address format that is globally unique and is intended for local communications, usually inside of a site. These addresses are not expected to be routable on the global Internet. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4193"/>
          <seriesInfo name="DOI" value="10.17487/RFC4193"/>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC4291" target="https://www.rfc-editor.org/info/rfc4291" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4291.xml">
          <front>
            <title>IP Version 6 Addressing Architecture</title>
            <author fullname="R. Hinden" initials="R." surname="Hinden"/>
            <author fullname="S. Deering" initials="S." surname="Deering"/>
            <date month="February" year="2006"/>
            <abstract>
              <t>This specification defines the addressing architecture of the IP Version 6 (IPv6) protocol. The document includes the IPv6 addressing model, text representations of IPv6 addresses, definition of IPv6 unicast addresses, anycast addresses, and multicast addresses, and an IPv6 node's required addresses.</t>
              <t>This document obsoletes RFC 3513, "IP Version 6 Addressing Architecture". [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4291"/>
          <seriesInfo name="DOI" value="10.17487/RFC4291"/>
        </reference>
        <reference anchor="RFC2526" target="https://www.rfc-editor.org/info/rfc2526" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2526.xml">
          <front>
            <title>Reserved IPv6 Subnet Anycast Addresses</title>
            <author fullname="D. Johnson" initials="D." surname="Johnson"/>
            <author fullname="S. Deering" initials="S." surname="Deering"/>
            <date month="March" year="1999"/>
            <abstract>
              <t>This document defines a set of reserved anycast addresses within each subnet prefix, and lists the initial allocation of these reserved subnet anycast addresses. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2526"/>
          <seriesInfo name="DOI" value="10.17487/RFC2526"/>
        </reference>
        <reference anchor="RFC4443" target="https://www.rfc-editor.org/info/rfc4443" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4443.xml">
          <front>
            <title>Internet Control Message Protocol (ICMPv6) for the Internet Protocol Version 6 (IPv6) Specification</title>
            <author fullname="A. Conta" initials="A." surname="Conta"/>
            <author fullname="S. Deering" initials="S." surname="Deering"/>
            <author fullname="M. Gupta" initials="M." role="editor" surname="Gupta"/>
            <date month="March" year="2006"/>
            <abstract>
              <t>This document describes the format of a set of control messages used in ICMPv6 (Internet Control Message Protocol). ICMPv6 is the Internet Control Message Protocol for Internet Protocol version 6 (IPv6). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="89"/>
          <seriesInfo name="RFC" value="4443"/>
          <seriesInfo name="DOI" value="10.17487/RFC4443"/>
        </reference>
        <reference anchor="RFC4787" target="https://www.rfc-editor.org/info/rfc4787" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4787.xml">
          <front>
            <title>Network Address Translation (NAT) Behavioral Requirements for Unicast UDP</title>
            <author fullname="F. Audet" initials="F." role="editor" surname="Audet"/>
            <author fullname="C. Jennings" initials="C." surname="Jennings"/>
            <date month="January" year="2007"/>
            <abstract>
              <t>This document defines basic terminology for describing different types of Network Address Translation (NAT) behavior when handling Unicast UDP and also defines a set of requirements that would allow many applications, such as multimedia communications or online gaming, to work consistently. Developing NATs that meet this set of requirements will greatly increase the likelihood that these applications will function properly. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="127"/>
          <seriesInfo name="RFC" value="4787"/>
          <seriesInfo name="DOI" value="10.17487/RFC4787"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="GSE">
          <front>
            <title>GSE - An Alternate Addressing Architecture for IPv6</title>
            <author initials="M." surname="O'Dell">
              <organization/>
            </author>
            <date year="1997" month="February"/>
          </front>
        </reference>
        <reference anchor="NIST">
          <front>
            <title>Draft NIST Framework and Roadmap for Smart Grid Interoperability Standards, Release 1.0</title>
            <author initials="" surname="NIST">
              <organization/>
            </author>
            <date year="2009" month="September"/>
          </front>
        </reference>
        <reference anchor="RFC1071" target="https://www.rfc-editor.org/info/rfc1071" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.1071.xml">
          <front>
            <title>Computing the Internet checksum</title>
            <author fullname="R.T. Braden" initials="R.T." surname="Braden"/>
            <author fullname="D.A. Borman" initials="D.A." surname="Borman"/>
            <author fullname="C. Partridge" initials="C." surname="Partridge"/>
            <date month="September" year="1988"/>
            <abstract>
              <t>This RFC summarizes techniques and algorithms for efficiently computing the Internet checksum. It is not a standard, but a set of useful implementation techniques.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="1071"/>
          <seriesInfo name="DOI" value="10.17487/RFC1071"/>
        </reference>
        <reference anchor="RFC2993" target="https://www.rfc-editor.org/info/rfc2993" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2993.xml">
          <front>
            <title>Architectural Implications of NAT</title>
            <author fullname="T. Hain" initials="T." surname="Hain"/>
            <date month="November" year="2000"/>
            <abstract>
              <t>This document discusses some of the architectural implications and guidelines for implementations of Network Address Translation (NAT). This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2993"/>
          <seriesInfo name="DOI" value="10.17487/RFC2993"/>
        </reference>
        <reference anchor="RFC4864" target="https://www.rfc-editor.org/info/rfc4864" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4864.xml">
          <front>
            <title>Local Network Protection for IPv6</title>
            <author fullname="G. Van de Velde" initials="G." surname="Van de Velde"/>
            <author fullname="T. Hain" initials="T." surname="Hain"/>
            <author fullname="R. Droms" initials="R." surname="Droms"/>
            <author fullname="B. Carpenter" initials="B." surname="Carpenter"/>
            <author fullname="E. Klein" initials="E." surname="Klein"/>
            <date month="May" year="2007"/>
            <abstract>
              <t>Although there are many perceived benefits to Network Address Translation (NAT), its primary benefit of "amplifying" available address space is not needed in IPv6. In addition to NAT's many serious disadvantages, there is a perception that other benefits exist, such as a variety of management and security attributes that could be useful for an Internet Protocol site. IPv6 was designed with the intention of making NAT unnecessary, and this document shows how Local Network Protection (LNP) using IPv6 can provide the same or more benefits without the need for address translation. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4864"/>
          <seriesInfo name="DOI" value="10.17487/RFC4864"/>
        </reference>
        <reference anchor="RFC5902" target="https://www.rfc-editor.org/info/rfc5902" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5902.xml">
          <front>
            <title>IAB Thoughts on IPv6 Network Address Translation</title>
            <author fullname="D. Thaler" initials="D." surname="Thaler"/>
            <author fullname="L. Zhang" initials="L." surname="Zhang"/>
            <author fullname="G. Lebovitz" initials="G." surname="Lebovitz"/>
            <date month="July" year="2010"/>
            <abstract>
              <t>There has been much recent discussion on the topic of whether the IETF should develop standards for IPv6 Network Address Translators (NATs). This document articulates the architectural issues raised by IPv6 NATs, the pros and cons of having IPv6 NATs, and provides the IAB's thoughts on the current open issues and the solution space. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5902"/>
          <seriesInfo name="DOI" value="10.17487/RFC5902"/>
        </reference>
        <reference anchor="RFC6092" target="https://www.rfc-editor.org/info/rfc6092" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6092.xml">
          <front>
            <title>Recommended Simple Security Capabilities in Customer Premises Equipment (CPE) for Providing Residential IPv6 Internet Service</title>
            <author fullname="J. Woodyatt" initials="J." role="editor" surname="Woodyatt"/>
            <date month="January" year="2011"/>
            <abstract>
              <t>This document identifies a set of recommendations for the makers of devices and describes how to provide for "simple security" capabilities at the perimeter of local-area IPv6 networks in Internet-enabled homes and small offices. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6092"/>
          <seriesInfo name="DOI" value="10.17487/RFC6092"/>
        </reference>
        <reference anchor="RFC5925" target="https://www.rfc-editor.org/info/rfc5925" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5925.xml">
          <front>
            <title>The TCP Authentication Option</title>
            <author fullname="J. Touch" initials="J." surname="Touch"/>
            <author fullname="A. Mankin" initials="A." surname="Mankin"/>
            <author fullname="R. Bonica" initials="R." surname="Bonica"/>
            <date month="June" year="2010"/>
            <abstract>
              <t>This document specifies the TCP Authentication Option (TCP-AO), which obsoletes the TCP MD5 Signature option of RFC 2385 (TCP MD5). TCP-AO specifies the use of stronger Message Authentication Codes (MACs), protects against replays even for long-lived TCP connections, and provides more details on the association of security with TCP connections than TCP MD5. TCP-AO is compatible with either a static Master Key Tuple (MKT) configuration or an external, out-of-band MKT management mechanism; in either case, TCP-AO also protects connections when using the same MKT across repeated instances of a connection, using traffic keys derived from the MKT, and coordinates MKT changes between endpoints. The result is intended to support current infrastructure uses of TCP MD5, such as to protect long-lived connections (as used, e.g., in BGP and LDP), and to support a larger set of MACs with minimal other system and operational changes. TCP-AO uses a different option identifier than TCP MD5, even though TCP-AO and TCP MD5 are never permitted to be used simultaneously. TCP-AO supports IPv6, and is fully compatible with the proposed requirements for the replacement of TCP MD5. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5925"/>
          <seriesInfo name="DOI" value="10.17487/RFC5925"/>
        </reference>
        <reference anchor="RFC3424" target="https://www.rfc-editor.org/info/rfc3424" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.3424.xml">
          <front>
            <title>IAB Considerations for UNilateral Self-Address Fixing (UNSAF) Across Network Address Translation</title>
            <author fullname="L. Daigle" initials="L." role="editor" surname="Daigle"/>
            <author>
              <organization abbrev="IAB">Internet Architecture Board</organization>
            </author>
            <date month="November" year="2002"/>
            <abstract>
              <t>As a result of the nature of Network Address Translation (NAT) Middleboxes, communicating endpoints that are separated by one or more NATs do not know how to refer to themselves using addresses that are valid in the addressing realms of their (current and future) peers. Various proposals have been made for "UNilateral Self-Address Fixing (UNSAF)" processes. These are processes whereby some originating endpoint attempts to determine or fix the address (and port) by which it is known to another endpoint - e.g., to be able to use address data in the protocol exchange, or to advertise a public address from which it will receive connections. This document outlines the reasons for which these proposals can be considered at best as short term fixes to specific problems and the specific issues to be carefully evaluated before creating an UNSAF proposal. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3424"/>
          <seriesInfo name="DOI" value="10.17487/RFC3424"/>
        </reference>
        <reference anchor="RFC5996" target="https://www.rfc-editor.org/info/rfc5996" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5996.xml">
          <front>
            <title>Internet Key Exchange Protocol Version 2 (IKEv2)</title>
            <author fullname="C. Kaufman" initials="C." surname="Kaufman"/>
            <author fullname="P. Hoffman" initials="P." surname="Hoffman"/>
            <author fullname="Y. Nir" initials="Y." surname="Nir"/>
            <author fullname="P. Eronen" initials="P." surname="Eronen"/>
            <date month="September" year="2010"/>
            <abstract>
              <t>This document describes version 2 of the Internet Key Exchange (IKE) protocol. IKE is a component of IPsec used for performing mutual authentication and establishing and maintaining Security Associations (SAs). This document replaces and updates RFC 4306, and includes all of the clarifications from RFC 4718. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5996"/>
          <seriesInfo name="DOI" value="10.17487/RFC5996"/>
        </reference>
        <reference anchor="RFC2827" target="https://www.rfc-editor.org/info/rfc2827" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2827.xml">
          <front>
            <title>Network Ingress Filtering: Defeating Denial of Service Attacks which employ IP Source Address Spoofing</title>
            <author fullname="P. Ferguson" initials="P." surname="Ferguson"/>
            <author fullname="D. Senie" initials="D." surname="Senie"/>
            <date month="May" year="2000"/>
            <abstract>
              <t>This paper discusses a simple, effective, and straightforward method for using ingress traffic filtering to prohibit DoS (Denial of Service) attacks which use forged IP addresses to be propagated from 'behind' an Internet Service Provider's (ISP) aggregation point. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="38"/>
          <seriesInfo name="RFC" value="2827"/>
          <seriesInfo name="DOI" value="10.17487/RFC2827"/>
        </reference>
        <reference anchor="RFC1624" target="https://www.rfc-editor.org/info/rfc1624" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.1624.xml">
          <front>
            <title>Computation of the Internet Checksum via Incremental Update</title>
            <author fullname="A. Rijsinghani" initials="A." role="editor" surname="Rijsinghani"/>
            <date month="May" year="1994"/>
            <abstract>
              <t>This memo describes an updated technique for incremental computation of the standard Internet checksum. It updates the method described in RFC 1141. This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="1624"/>
          <seriesInfo name="DOI" value="10.17487/RFC1624"/>
        </reference>
        <reference anchor="RFC5508" target="https://www.rfc-editor.org/info/rfc5508" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5508.xml">
          <front>
            <title>NAT Behavioral Requirements for ICMP</title>
            <author fullname="P. Srisuresh" initials="P." surname="Srisuresh"/>
            <author fullname="B. Ford" initials="B." surname="Ford"/>
            <author fullname="S. Sivakumar" initials="S." surname="Sivakumar"/>
            <author fullname="S. Guha" initials="S." surname="Guha"/>
            <date month="April" year="2009"/>
            <abstract>
              <t>This document specifies the behavioral properties required of the Network Address Translator (NAT) devices in conjunction with the Internet Control Message Protocol (ICMP). The objective of this memo is to make NAT devices more predictable and compatible with diverse application protocols that traverse the devices. Companion documents provide behavioral recommendations specific to TCP, UDP, and other protocols. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="148"/>
          <seriesInfo name="RFC" value="5508"/>
          <seriesInfo name="DOI" value="10.17487/RFC5508"/>
        </reference>
        <reference anchor="RFC6204" target="https://www.rfc-editor.org/info/rfc6204" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6204.xml">
          <front>
            <title>Basic Requirements for IPv6 Customer Edge Routers</title>
            <author fullname="H. Singh" initials="H." surname="Singh"/>
            <author fullname="W. Beebee" initials="W." surname="Beebee"/>
            <author fullname="C. Donley" initials="C." surname="Donley"/>
            <author fullname="B. Stark" initials="B." surname="Stark"/>
            <author fullname="O. Troan" initials="O." role="editor" surname="Troan"/>
            <date month="April" year="2011"/>
            <abstract>
              <t>This document specifies requirements for an IPv6 Customer Edge (CE) router. Specifically, the current version of this document focuses on the basic provisioning of an IPv6 CE router and the provisioning of IPv6 hosts attached to it. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6204"/>
          <seriesInfo name="DOI" value="10.17487/RFC6204"/>
        </reference>
        <reference anchor="RFC6724" target="https://www.rfc-editor.org/info/rfc6724" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6724.xml">
          <front>
            <title>Default Address Selection for Internet Protocol Version 6 (IPv6)</title>
            <author fullname="D. Thaler" initials="D." role="editor" surname="Thaler"/>
            <author fullname="R. Draves" initials="R." surname="Draves"/>
            <author fullname="A. Matsumoto" initials="A." surname="Matsumoto"/>
            <author fullname="T. Chown" initials="T." surname="Chown"/>
            <date month="September" year="2012"/>
            <abstract>
              <t>This document describes two algorithms, one for source address selection and one for destination address selection. The algorithms specify default behavior for all Internet Protocol version 6 (IPv6) implementations. They do not override choices made by applications or upper-layer protocols, nor do they preclude the development of more advanced mechanisms for address selection. The two algorithms share a common context, including an optional mechanism for allowing administrators to provide policy that can override the default behavior. In dual-stack implementations, the destination address selection algorithm can consider both IPv4 and IPv6 addresses -- depending on the available source addresses, the algorithm might prefer IPv6 addresses over IPv4 addresses, or vice versa.</t>
              <t>Default address selection as defined in this specification applies to all IPv6 nodes, including both hosts and routers. This document obsoletes RFC 3484. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6724"/>
          <seriesInfo name="DOI" value="10.17487/RFC6724"/>
        </reference>
        <reference anchor="RFC5389" target="https://www.rfc-editor.org/info/rfc5389" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5389.xml">
          <front>
            <title>Session Traversal Utilities for NAT (STUN)</title>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/>
            <author fullname="R. Mahy" initials="R." surname="Mahy"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="D. Wing" initials="D." surname="Wing"/>
            <date month="October" year="2008"/>
            <abstract>
              <t>Session Traversal Utilities for NAT (STUN) is a protocol that serves as a tool for other protocols in dealing with Network Address Translator (NAT) traversal. It can be used by an endpoint to determine the IP address and port allocated to it by a NAT. It can also be used to check connectivity between two endpoints, and as a keep-alive protocol to maintain NAT bindings. STUN works with many existing NATs, and does not require any special behavior from them.</t>
              <t>STUN is not a NAT traversal solution by itself. Rather, it is a tool to be used in the context of a NAT traversal solution. This is an important change from the previous version of this specification (RFC 3489), which presented STUN as a complete solution.</t>
              <t>This document obsoletes RFC 3489. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5389"/>
          <seriesInfo name="DOI" value="10.17487/RFC5389"/>
        </reference>
        <reference anchor="RFC5766" target="https://www.rfc-editor.org/info/rfc5766" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5766.xml">
          <front>
            <title>Traversal Using Relays around NAT (TURN): Relay Extensions to Session Traversal Utilities for NAT (STUN)</title>
            <author fullname="R. Mahy" initials="R." surname="Mahy"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/>
            <date month="April" year="2010"/>
            <abstract>
              <t>If a host is located behind a NAT, then in certain situations it can be impossible for that host to communicate directly with other hosts (peers). In these situations, it is necessary for the host to use the services of an intermediate node that acts as a communication relay. This specification defines a protocol, called TURN (Traversal Using Relays around NAT), that allows the host to control the operation of the relay and to exchange packets with its peers using the relay. TURN differs from some other relay control protocols in that it allows a client to communicate with multiple peers using a single relay address. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5766"/>
          <seriesInfo name="DOI" value="10.17487/RFC5766"/>
        </reference>
        <reference anchor="RFC5245" target="https://www.rfc-editor.org/info/rfc5245" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5245.xml">
          <front>
            <title>Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols</title>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/>
            <date month="April" year="2010"/>
            <abstract>
              <t>This document describes a protocol for Network Address Translator (NAT) traversal for UDP-based multimedia sessions established with the offer/answer model. This protocol is called Interactive Connectivity Establishment (ICE). ICE makes use of the Session Traversal Utilities for NAT (STUN) protocol and its extension, Traversal Using Relay NAT (TURN). ICE can be used by any protocol utilizing the offer/answer model, such as the Session Initiation Protocol (SIP). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5245"/>
          <seriesInfo name="DOI" value="10.17487/RFC5245"/>
        </reference>
        <reference anchor="RFC6144" target="https://www.rfc-editor.org/info/rfc6144" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6144.xml">
          <front>
            <title>Framework for IPv4/IPv6 Translation</title>
            <author fullname="F. Baker" initials="F." surname="Baker"/>
            <author fullname="X. Li" initials="X." surname="Li"/>
            <author fullname="C. Bao" initials="C." surname="Bao"/>
            <author fullname="K. Yin" initials="K." surname="Yin"/>
            <date month="April" year="2011"/>
            <abstract>
              <t>This note describes a framework for IPv4/IPv6 translation. This is in the context of replacing Network Address Translation - Protocol Translation (NAT-PT), which was deprecated by RFC 4966, and to enable networks to have IPv4 and IPv6 coexist in a somewhat rational manner while transitioning to an IPv6 network. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6144"/>
          <seriesInfo name="DOI" value="10.17487/RFC6144"/>
        </reference>
        <reference anchor="RFC6147" target="https://www.rfc-editor.org/info/rfc6147" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6147.xml">
          <front>
            <title>DNS64: DNS Extensions for Network Address Translation from IPv6 Clients to IPv4 Servers</title>
            <author fullname="M. Bagnulo" initials="M." surname="Bagnulo"/>
            <author fullname="A. Sullivan" initials="A." surname="Sullivan"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="I. van Beijnum" initials="I." surname="van Beijnum"/>
            <date month="April" year="2011"/>
            <abstract>
              <t>DNS64 is a mechanism for synthesizing AAAA records from A records. DNS64 is used with an IPv6/IPv4 translator to enable client-server communication between an IPv6-only client and an IPv4-only server, without requiring any changes to either the IPv6 or the IPv4 node, for the class of applications that work through NATs. This document specifies DNS64, and provides suggestions on how it should be deployed in conjunction with IPv6/IPv4 translators. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6147"/>
          <seriesInfo name="DOI" value="10.17487/RFC6147"/>
        </reference>
        <reference anchor="RFC6145" target="https://www.rfc-editor.org/info/rfc6145" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6145.xml">
          <front>
            <title>IP/ICMP Translation Algorithm</title>
            <author fullname="X. Li" initials="X." surname="Li"/>
            <author fullname="C. Bao" initials="C." surname="Bao"/>
            <author fullname="F. Baker" initials="F." surname="Baker"/>
            <date month="April" year="2011"/>
            <abstract>
              <t>This document describes the Stateless IP/ICMP Translation Algorithm (SIIT), which translates between IPv4 and IPv6 packet headers (including ICMP headers). This document obsoletes RFC 2765. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6145"/>
          <seriesInfo name="DOI" value="10.17487/RFC6145"/>
        </reference>
        <reference anchor="RFC6146" target="https://www.rfc-editor.org/info/rfc6146" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6146.xml">
          <front>
            <title>Stateful NAT64: Network Address and Protocol Translation from IPv6 Clients to IPv4 Servers</title>
            <author fullname="M. Bagnulo" initials="M." surname="Bagnulo"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="I. van Beijnum" initials="I." surname="van Beijnum"/>
            <date month="April" year="2011"/>
          </front>
          <seriesInfo name="RFC" value="6146"/>
          <seriesInfo name="DOI" value="10.17487/RFC6146"/>
        </reference>
        <reference anchor="RFC6052" target="https://www.rfc-editor.org/info/rfc6052" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6052.xml">
          <front>
            <title>IPv6 Addressing of IPv4/IPv6 Translators</title>
            <author fullname="C. Bao" initials="C." surname="Bao"/>
            <author fullname="C. Huitema" initials="C." surname="Huitema"/>
            <author fullname="M. Bagnulo" initials="M." surname="Bagnulo"/>
            <author fullname="M. Boucadair" initials="M." surname="Boucadair"/>
            <author fullname="X. Li" initials="X." surname="Li"/>
            <date month="October" year="2010"/>
            <abstract>
              <t>This document discusses the algorithmic translation of an IPv6 address to a corresponding IPv4 address, and vice versa, using only statically configured information. It defines a well-known prefix for use in algorithmic translations, while allowing organizations to also use network-specific prefixes when appropriate. Algorithmic translation is used in IPv4/IPv6 translators, as well as other types of proxies and gateways (e.g., for DNS) used in IPv4/IPv6 scenarios. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6052"/>
          <seriesInfo name="DOI" value="10.17487/RFC6052"/>
        </reference>
        <reference anchor="RFC1918" target="https://www.rfc-editor.org/info/rfc1918" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.1918.xml">
          <front>
            <title>Address Allocation for Private Internets</title>
            <author fullname="Y. Rekhter" initials="Y." surname="Rekhter"/>
            <author fullname="B. Moskowitz" initials="B." surname="Moskowitz"/>
            <author fullname="D. Karrenberg" initials="D." surname="Karrenberg"/>
            <author fullname="G. J. de Groot" initials="G. J." surname="de Groot"/>
            <author fullname="E. Lear" initials="E." surname="Lear"/>
            <date month="February" year="1996"/>
            <abstract>
              <t>This document describes address allocation for private internets. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="5"/>
          <seriesInfo name="RFC" value="1918"/>
          <seriesInfo name="DOI" value="10.17487/RFC1918"/>
        </reference>
      </references>
    </references>
    <?line 906?>

<section anchor="why-gse">
      <name>Why GSE?</name>
      <t>For the purpose of this discussion, let us oversimplify the
   Internet's structure by distinguishing between two broad classes of
   networks: transit and edge.  A "transit network", in this context, is
   a network that provides connectivity services to other networks.  Its
   Autonomous System (AS) number may show up in a non-final position in
   BGP AS paths, or in the case of mobile and residential broadband
   networks, it may offer network services to smaller networks that
   cannot justify RIR membership.  An "edge network", in contrast, is
   any network that is not a transit network; it is the ultimate
   customer, and while it provides internal connectivity for its own
   use, it is a consumer of transit services in other respects.  In
   terms of routing, a network in the transit domain generally needs
   some way to make choices about how it routes to other networks; an
   edge network is generally quite satisfied with a simple default
   route.</t>
      <t>The <xref target="GSE"/> proposal, and as a result this proposal (which is similar
   to GSE in most respects and inspired by it), responds directly to
   current concerns in the RIR communities.  Edge networks are used to
   an environment in IPv4 in which their addressing is disjoint from
   that of their upstream transit networks; it is either provider
   independent, or a network prefix translator makes their external
   address distinct from their internal address, and they like the
   distinction.  In IPv6, there is a mantra that edge network addresses
   should be derived from their upstream, and if they have multiple
   upstreams, edge networks are expected to design their networks to use
   all of those prefixes equivalently.  They see this as unnecessary and
   unwanted operational complexity and, as a result, are pushing very
   hard in the RIR communities for provider-independent addressing.</t>
      <t>Widespread use of provider-independent addressing has a natural and
   perhaps unavoidable side effect that is likely to be very expensive
   in the long term.  With widespread PI addressing, the routing table
   will enumerate the networks at the edge of the transit domain, the
   edge networks, rather than enumerate the transit domain.  Per the BGP
   Update Report of 17 December 2010, there are currently over 36,000
   Autonomous Systems being advertised in BGP, of which over 15,000
   advertise only one prefix.  There are in the neighborhood of 5000 ASs
   that show up in a non-final position in AS paths, and perhaps another
   5000 networks whose AS numbers are terminal in more than one AS path.
   In other words, we have prefixes for some 36,000 transit and edge
   networks in the route table now, many of which arguably need an
   Autonomous System number only for multihoming.  The vast majority of
   networks (2/3) having the tools necessary to multihome are not visibly
   doing so and would be well served by any solution that gives
   them address independence without the overhead of RIR membership and
   BGP routing.</t>
      <t>Current growth estimates suggest that we could easily see that be on
   the order of 10,000,000 within fifteen years.  Tens of thousands of
   entries in the route table are very survivable; while our protocols
   and computers will likely do quite well with tens of millions of
   routes, the heat produced and power consumed by those routers, and
   the inevitable impact on the cost of those routers, is not a good
   outcome.  To avoid having a massive and unscalable route table, we
   need to find a way that is politically acceptable and returns us to
   enumerating the transit domain, not the edge.</t>
      <t>There have been a number of proposals.  As described, Shim6 moves the
   complexity to the edge, and the edge is rebelling.  Geographic
   addressing in essence forces ISPs to "own" geographic territory from
   a routing perspective, as otherwise there is no clue in the address
   as to what network a datagram should be delivered to in order to
   reach it.  Metropolitan Addressing can imply regulatory authority
   and, even if it is implemented using internet exchange consortia,
   visits a great deal of complexity on the transit networks that
   directly serve the edge.  The one that is likely to be most
   acceptable is any proposal that enables an edge network to be
   operationally independent of its upstreams, with no obligation to
   renumber when it adds, drops, or changes ISPs, and with no additional
   burden placed either on the ISP or the edge network as a result.
   From an application perspective, an additional operational
   requirement in the words of the Roadmap for the Smart Grid <xref target="NIST"/> is
   that
~~~~~~~~~~
      "...the network should provide the capability to enable an
      application in a particular domain to communicate with an
      application in any other domain over the information network, with
      proper management control as to who and where applications can be
      inter-connected."
~~~~~~~~~~
   In other words, the structure of the network should allow for and
   enable appropriate access control, but the structure of the network
   should not inherently limit access.</t>
      <t>The GSE model, by statelessly translating the prefix between an edge
   network and its upstream transit network, accomplishes that with a
   minimum of fuss and bother.  Stated in the simplest terms, it enables
   the edge network to behave as if it has a provider-independent prefix
   from a multihoming and renumbering perspective without the overhead
   of RIR membership or maintenance of BGP connectivity, and it enables
   the transit networks to aggressively aggregate what are from their
   perspective provider-allocated customer prefixes, to maintain a
   rational-sized routing table.</t>
    </section>
    <section anchor="verification-code">
      <name>Verification Code</name>
      <t>This non-normative appendix is presented as a proof of concept; it is
   in no sense optimized.  For example, one's complement arithmetic is
   implemented in portable subroutines, where operational
   implementations might use one's complement arithmetic instructions
   through a pragma; such implementations probably need to explicitly
   force 0xFFFF to 0x0000, as the instruction will not.  The original
   purpose of the code was to verify whether or not it was necessary to
   suppress 0xFFFF by overwriting with zero and whether predicted issues
   with subnet numbering were real.</t>
      <t>The point is to</t>
      <ul spacing="normal">
        <li>
          <t>demonstrate that if one or the other representation of zero is not
    used in the word in which the checksum is updated, the program
    maps inner and outer addresses in a manner that is,
    mathematically, 1:1 and onto (each inner address maps to a unique
    outer address, and that outer address maps back to exactly the
    same inner address), and</t>
        </li>
        <li>
          <t>give guidance on the suppression of 0xFFFF checksums.  </t>
          <t>
In short, in one's complement arithmetic, x-x=0 but will take the
 negative representation of zero.  If 0xFFFF results are forced to the
 value 0x0000, as is recommended in <xref target="RFC1071"/>, the word the checksum
 is adjusted in cannot be initially 0xFFFF, as on the return it will
 be forced to 0.  If 0xFFFF results are not forced to the value 0x0000
 as is recommended in <xref target="RFC1071"/>, the word the checksum is adjusted in
 cannot be initially 0, as on the return it will be calculated as
 0+(~0) = 0xFFFF.  We chose to follow <xref target="RFC1071"/>'s recommendations,
 which implies a requirement to not use 0xFFFF as a subnet number in
 networks with a /48 external prefix.</t>
        </li>
      </ul>
      <artwork><![CDATA[
  /*
   * Copyright (c) 2011 IETF Trust and the persons identified as
   * authors of the code.  All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions
   * are met:
   *
   * - Redistributions of source code must retain the above copyright
   *   notice, this list of conditions and the following disclaimer.
   *
   * - Redistributions in binary form must reproduce the above
   *   copyright notice, this list of conditions and the following
   *   disclaimer in the documentation and/or other materials provided
   *   with the distribution.
   *
   * - Neither the name of Internet Society, IETF or IETF Trust, nor
   *   the names of specific contributors, may be used to endorse or
   *   promote products derived from this software without specific
   *   prior written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
   * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
   * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
   * DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
   * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
   * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
   * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
   * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
   * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
   * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
   * POSSIBILITY OF SUCH DAMAGE.
   */
  #include "stdio.h"
  #include "assert.h"
  /*
   * program to verify the NPTv6 algorithm
   *
   * argument:
   *    Perform negative zero suppression: boolean
   *
   * method:
   *    We specify an internal and an external prefix.  The prefix
   *    length is presumed to be the common length of both and, for
   *    this, is a /48.  We perform the three algorithms specified.
   *    The "datagram" address is in effect the source address
   *    internal->external and the destination address
   *    external->internal.
   */
  unsigned short  inner_init[] = {
      0xFD01, 0x0203, 0x0405, 1, 2, 3, 4, 5};
  unsigned short  outer_init[] = {
      0x2001, 0x0db8, 0x0001, 1, 2, 3, 4, 5};
  unsigned short  inner[8];
  unsigned short  datagram[8];
  unsigned char   checksum[65536] = {0};

  unsigned short  outer[8];
  unsigned short  adjustment;
  unsigned short  suppress;
  /*
   * One's complement sum.
   * return number1 + number2
   */
  unsigned short
  add1(number1, number2)
      unsigned short  number1;
      unsigned short  number2;
  {
      unsigned int    result;

      result = number1;
      result += number2;
      if (suppress) {
          while (0xFFFF <= result) {
              result = result + 1 - 0x10000;
          }
      } else {
          while (0xFFFF < result) {
              result = result + 1 - 0x10000;
          }
      }
      return result;
  }

  /*
   * One's complement difference
   * return number1 - number2
   */
  unsigned short
  sub1(number1, number2)
      unsigned short  number1;
      unsigned short  number2;
  {
      return add1(number1, ~number2);
  }

  /*
   * return one's complement sum of an array of numbers
   */
  unsigned short
  sum1(numbers, count)
      unsigned short *numbers;
      int             count;
  {
      unsigned int    result;

      result = *numbers++;
      while (--count > 0) {
          result += *numbers++;
      }

      if (suppress) {
          while (0xFFFF <= result) {
              result = result + 1 - 0x10000;
          }
      } else {
          while (0xFFFF < result) {
              result = result + 1 - 0x10000;
          }
      }
      return result;
  }

  /*
   * NPTv6 initialization: Section 3.1 assuming Section 3.4
   *
   * Create the /48, a source address in internal format, and a
   * source address in external format.  Calculate the adjustment
   * if one /48 is overwritten with the other.
   */
  void
  nptv6_initialization(subnet)
      unsigned short  subnet;
  {
      int             i;
      unsigned short  inner48;
      unsigned short  outer48;

      /* Initialize the internal and external prefixes. */
      for (i = 0; i < 8; i++) {
          inner[i] = inner_init[i];
          outer[i] = outer_init[i];
      }
      inner[3] = subnet;
      outer[3] = subnet;
      /* Calculate the checksum adjustment. */
      inner48 = sum1(inner, 3);
      outer48 = sum1(outer, 3);
      adjustment = sub1(inner48, outer48);
  }

  /*
   * NPTv6 datagram from edge to transit: Section 3.2 assuming
   * Section 3.4
   *
   * Overwrite the prefix in the source address with the outer
   * prefix and adjust the checksum.
   */
  void
  nptv6_inner_to_outer()
  {
      int             i;

      /* Let's get the source address into the datagram. */
      for (i = 0; i < 8; i++) {
          datagram[i] = inner[i];
      }

      /* Overwrite the prefix with the outer prefix. */
      for (i = 0; i < 3; i++) {
          datagram[i] = outer[i];
      }

      /* Adjust the checksum. */
      datagram[3] = add1(datagram[3], adjustment);
  }

  /*
   * NPTv6 datagram from transit to edge: Section 3.3 assuming
   * Section 3.4
   *
   * Overwrite the prefix in the destination address with the
   * inner prefix and adjust the checksum.
   */
  void
  nptv6_outer_to_inner()
  {
      int             i;

      /* Overwrite the prefix with the outer prefix. */
      for (i = 0; i < 3; i++) {
          datagram[i] = inner[i];
      }

      /* Adjust the checksum. */
      datagram[3] = sub1(datagram[3], adjustment);
  }

  /*
   * Main program
   */
  main(argc, argv)
      int             argc;
      char          **argv;
  {
      unsigned        subnet;
      int             i;

      if (argc < 2) {
             fprintf(stderr, "usage: nptv6 supression\n");
             assert(0);
         }
         suppress = atoi(argv[1]);
         assert(suppress <= 1);

         for (subnet = 0; subnet < 0x10000; subnet++) {
             /* Section 3.1: initialize the system */
             nptv6_initialization(subnet);

             /* Section 3.2: take a datagram from inside to outside */
             nptv6_inner_to_outer();

             /* The resulting checksum value should be unique. */
             if (checksum[subnet]) {
                  printf("inner->outer duplicated checksum: "
                         "inner: %x:%x:%x:%x:%x:%x:%x:%x(%x) "
                         "calculated: %x:%x:%x:%x:%x:%x:%x:%x(%x)\n",
                         inner[0], inner[1], inner[2], inner[3],
                         inner[4], inner[5], inner[6], inner[7],
                         sum1(inner, 8), datagram[0], datagram[1],
                         datagram[2], datagram[3], datagram[4],
                         datagram[5], datagram[6], datagram[7],
                         sum1(datagram, 8));
          }

          checksum[subnet] = 1;

          /*
           * The resulting checksum should be the same as the inner
           * address's checksum.
           */
          if (sum1(datagram, 8) != sum1(inner, 8)) {
              printf("inner->outer incorrect: "
                     "inner: %x:%x:%x:%x:%x:%x:%x:%x(%x) "
                     "calculated: %x:%x:%x:%x:%x:%x:%x:%x(%x)\n",
                     inner[0], inner[1], inner[2], inner[3],
                     inner[4], inner[5], inner[6], inner[7],
                     sum1(inner, 8),
                     datagram[0], datagram[1], datagram[2], datagram[3],
                     datagram[4], datagram[5], datagram[6], datagram[7],
                     sum1(datagram, 8));
          }

          /* Section 3.3: take a datagram from outside to inside */
          nptv6_outer_to_inner();

          /*
           * The returning datagram should have the same checksum it
           * left with.
           */
          if (sum1(datagram, 8) != sum1(inner, 8)) {
              printf("outer->inner checksum incorrect: "
                     "calculated: %x:%x:%x:%x:%x:%x:%x:%x(%x) "
                     "inner: %x:%x:%x:%x:%x:%x:%x:%x(%x)\n",
                     datagram[0], datagram[1], datagram[2], datagram[3],
                     datagram[4], datagram[5], datagram[6], datagram[7],
                     sum1(datagram, 8), inner[0], inner[1], inner[2],
                     inner[3], inner[4], inner[5], inner[6], inner[7],
                     sum1(inner, 8));
          }

          /*
           * And every octet should calculate back to the same inner
           * value.
           */
          for (i = 0; i < 8; i++) {
              if (inner[i] != datagram[i]) {
                  printf("outer->inner different: "
                         "calculated: %x:%x:%x:%x:%x:%x:%x:%x "
                         "inner: %x:%x:%x:%x:%x:%x:%x:%x\n",
                         datagram[0], datagram[1], datagram[2],
                         datagram[3], datagram[4], datagram[5],
                         datagram[6], datagram[7], inner[0], inner[1],
                         inner[2], inner[3], inner[4], inner[5],
                         inner[6], inner[7]);
                  break;
              }
          }
      }
  }

]]></artwork>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAKC/aGUAA+19a3PbVpbgd/6KO+qaaikhaUmWZFue9AwtyQ6nbUkjSsmk
enunQBIU0QYBNgBKZhLPb5/zvA8ApB07vbVbtaruWCKB+zj33PN+9Hq9TpVU
aXxqdm5en5mTwxcn46Q0w+uHk16V9/BfcxlXj3nx3lwX8Sz5YG6LKCvTqEry
bKcTjcdF/HBqvJc703ySRQsYclpEs6o3nlTj3skiynrFbILP9OCh3v5Bp1yN
F0lZwjjVegmPDy9uX3eSZXFqqmJVVof7+y/2DztREUfwXVZ1Hu9Pzcm7wWXn
/SN9EBdZXPXOcZLOJKpOTZLN8s5qOY2quDyl5XQ60aqa58VpxxjTw/8YeAq+
fNc3Z6s0jTP+jNf7LiruYboq+CovYNrrKMnSuCzNKJ6siqRa83fxIkrSU7Mo
JvTC0eG/3eMn/Um+qE/4um9eRe/jwp/vdRFP/U9pqrssms2SNIFNTINZZvD0
GB/uJ3E12zzTVR+OKI+CnV2lsf8hTXSWlJPcjNZlFS/KYKa8wkf/bYIPtM1w
CXtZFdF9muT+JJfJ5H3tC5roIouL+7UZTZI4m8Sl4lMw5Vhe+7dZXjxGxTTJ
7pdplMV9OOJOBw+2WADKPcR0kubN6IJ/MUbQFz4xPTPIzCBFxADomcF0WsCZ
wVBmUEzmSRVPqlURGxiLEFwG8DAkwI+rP57HaSofI07BgcXjYhUVa3Pw4sUz
+uZyOLqtrYQQkr6AAwbA0N2Jsqm5yaPpIlrS/KNFVFTmTZFMGZPzZVxEYzj2
CgBVwdMAg7JrbuI0jsrYHPT3N6xWTgRmC1Y6ipdwrOO4MHiNOp1er2eicVkV
0QTgeTuHOw7XdLWIs8pM43JSJGM4mciUFbyOmN6FSwj3fJkXVS+6z/KySiYB
WehsJgtm9/L69uFkz8xW2YQ+qOZRZZZF/pDAZPBX3In4cHpJNo2XMfwHUMOM
4wzGqkxUlvmEboB5TKo5znsk8x6Zy8FtZ/dycH17dLRHcLXjRubg9MAUMa+i
nCdLGLF6jOPMyHTwUJLR/DsAN3hph0bYyVcV/7WkzcSwffitjIsHxB5YHs4O
/8Dg0WQuB9WBPcFQJhNApNEaLifDepFMp2nc6fzB4PkW+XRFgPgs0G+jvp1t
YO7ieMl9BmCrcgWLbr0TQBq+x6XH03u7/j4stTKwupaDx1PowChLuEL0rj5S
8tFOc5PllZnM48n7crWgsYfXZh5H07jomnI1mcOhdkZnt9ddgnjLGCvAc3zv
9uz6yd359ZPzs7Nrs3seVdE9XKPOWZ7dxyXtG34FkKYAkrzKJ3m6Z5ZlvJrm
PZ6PJrBL+eWXfwXmdLD/7ODjRzic13D54BBLwA8zBQK3AqSYIlLwc4cvXjz9
+JFGAFJPsx13eTvAnWCfcFSwU4AF0MUFYgR+h0vPZ/aohPAEVwKIzzzL0xwI
odKffufHeQz0qPIeA/Ani2UaI3bE066Z54/xA4KwQrxB+CezZELPdjy8X8Do
UZaUCwblPCrNLH5EUDjCF6WIEmMYmwCedRYwebp28yGqR7iaaYLjw/OEkrNV
unFneQFoBdCi/cA9eUiKPMOxGJmitMz96wlwwtEiIdFAzgUROwBNWMUHmBgf
xPMDxCNY5Hg+47VZrNIqmecLXOWKiLoMXPQ81K4U3WkzcjwFXG/9Wy8ryCPR
PW0bYF6u4rIDB5gDqNMIafLoWgcCoEeTGPYzyhexg2CBjCuzBwTf38I2CkbA
cp6vUtwD0ZiCFuFtGsZc3SMy+5h39PzkiDGvg4/ru0zKELv4sWOQieAxxCEA
DkAAxoiW8AvQpbjsI4GJPVKiX1lKM2UC6BMhxJYSNxGlHbhpFsHK007nG2Cp
a/iWpR5LoAnLmAYDqbufV7DAGWw0odvBtBMhK/KGIULVBeBP8GhgdXgc3s2J
zCwp4scoTREh8nEV0Srh7GUAmRgwYkZEDmQhADmw+/hDhJiDgzCVcSPhHnXX
HWWWAsaT/ReHRA++AfGklbrj68ID8CLC8cGh3s/5LAU1YPU6suUndbIKVAZB
AxeyyBeNtx3rUSGiSZWJZeAh4U3VsyEMgNPVD2DtMAscYamCAuwnh9EKnIcQ
SEVmZlSOJRIUhjOcGqgRCMB81xCqCV4pmCEFOgEYOUvuVyizMpe0hCsvSntM
zG5h6bqBsisDE27Ap/A+rh0+XOBhxx+QdN3rQU/XIEwCxyEUBrCXwdvBtwb4
LN+s+xywcw5fKBA9ivqYACqMva2YaFLkAH48awQLLoSvry5ZRplEGU8Oy4VZ
yjUQ/KoQaCBNgfWlINPBdQegMV+bgTTbQzKip7DIGdMXxEPhJSY3BPNRQqw4
JP8owrQJFi1grETKNosckGxtkJmabIViHxx4Icdv+axZRiiPAhLwkQOjhZtN
CpiwYBQuGUoA3WWMwzCpFb5sBu4B5EA8+9WS1q706fAY6BPADgnBPHogpp54
6GY3TNeKpUEBln0EkXBVKrECahiloGIxjPjIzDt4MrJoEy4MJIRprDcnoKR8
ZVgMvAeaglwRkDDK1giRuyzBdeGHozid9ZTdvU4+IBR27y5Hg9d7stOnR4dI
sFUI6ZrHeTKZe9d4OHhlrJwAe7oHolbyyQK7SvM1UV/YDrNQj3vaQSKUqfB2
lO72hvd2sPRogjss+/Sf47W5kCtm12p+gKNFaBzKTLvDP188HO7ZM3xxAjtj
LtZFbEQtpJLDyIs1CpoViYLzWIj9RE9CjsfRhpcIGKAlgLUguuMXcD1KlC7y
dKVYX8R/XyFR78oov/zi1vFIzFSeYCrv0DYnFgLyIkDjDyBt/4gwgwH16Iae
1PuvLP7RolcFShYlL9fjhl0WZZRGB0IzYRKIJR3Z4yxP0/wRQV7GdJBL0uNQ
hgHW+VrpPXxEgjOKO/KmT+GJyxL58WeOS70AiLz0Upoj9VKisAtUqUMsDU56
BiIKENpogvzVpLhIpkcgcJZ7Kp4L0QBqiC8WMZMKnIRXdZ/mY5ISkbrvxvAi
KGKsTyDFRkCDICb3NeBxeF8Zx6b9z91OMMBv2Q0sBWkpYKPwtyXotXFEZgpl
OmZXdA5APuBHnvD4aWjQG6CPgdyMy4e5p3Cu8A9MrLexbU7eOetQPAGuH80F
xKtRCYUFJKiEs0qQI0Y9EBNgy4yOasECjxCjMST60J2GAyLAqqaKqyJpkKgG
0rLpA+JgGbtHgPolKCiSCBICzUEMhid+klS8kTu2eIG09xhlFV21HCj9IvnZ
SdTK763A0HoWQsThdtCBwh3wzmODeBDhCK/eXFv5gC0BJDPWlt7fftfqj8N9
g6HxpFrwk/G7idz3K+CdAH9GGWRryrOcGgJyQT4howUDvmviFMCVOWmXdsfa
DRx6oQwU9/sKuOvT56qFPj98BoQPXiMiNEtQd/A1GnvGwkJUYlmVFWgpRU8V
RYsCpBis8Bq1ETYULgPJXyW0ABDdjjtRUPmBGE8qlgsB0wFB6IB2yUiQkIyE
SGsRQt/d69pdOJaGyuHjPE9jEcRYxGdEaDNf4ILHZNeBHSYLvGNTRPFClWsy
E/lsNkF9d5qsFj08wDQq7uNeCag8NahpFzBKGXsiK1zKdIVWyNo4ZQetkd47
pWrcgHBwATJQHFDUxhVYxGhRTzukVQLZQ8Slp3fKR9BkWNvc2WP9GbdJOrTs
1dsjHow7DyJjE1RQF7GIfzNzE9+zGm/hjJ/AcazN7s3wZg+V7sUqI527Cyws
fk94avUvvH0gV+VZvshXpViKzaXIl6iotu7QmdDwnOloYcdw4d2p5Znezg5v
qbSM8QNAuvTEPIIN08AqGhOCjNAsN4ktfMsOQZ90gikfB7HLaPKedMs2jFdl
LCk6emlKH6uy+J7tE0idM7VUODwAnrCyxgvQy6IJCQA6liWQsB+4G1aQBTnY
4xaI6W+JqTsjX16J2YkkIDEKOHuhWKwYqCRDd4iWLCuUkVNUKFXykaNb7/AZ
qOqOdipS3PvGnwPvF8n9qgrIKJGMQtoQqFGgNCXxg6OUZYK0PMpiQJGOaPMi
RzjSinI3aGFZjmYg4d3CYGkyoovxB2ZvHSEoyQNq4YhDIJb/faWgGthRd+/e
DkqUWf8Jd3FAhjuiGGnasbxScJzpGmz5+9CgpiIo6m10jRZxTOjTEXmTwO7R
oQCNunjrItw1SFBoBRtdW0ECTr8DMyF5nkxWBV4HAIFg9TwnmYbwGr86/550
seKB/hqw4CNmzs5bFIDM7uDsLRJPNW/I/WJubrdbsjtHzrBAw5rV2ok+N87G
miVw8aQse4KRJxWNWQ2W94MzAkDOVqQUx4D+BcmAt864I+JKC6nYvR7ueUsJ
yF3H2cgiNnFGLO/DVDNcpmdKCb0I3sn1OxvOW55RQPkU3fx9FaWoTqPwBSIc
3P1OZK6HIgwTQpDbAc5qFU1ZNkPgwfOo4OExW/5LJ0zslKx6bpY/ljSk1eWI
74n5JRIlnlUKIC1oc+iwmVLFoMTZ9kDO8HjuzMlTkfJRFSM7KB56g9/H+X0R
Ledi02DD/BKt1PLJlIhzTFe1VA0XKUEJVA5kQVKkH/L0AZWjHN12LOzQIsWm
iLAp3RLQEqEmTaQB2T2IjQAKZhsMh9IztBJtp0s2xZXHBRIan//SXDXW6/FS
ErPneV7GqixaLxJe62VUVCTZl6sxnB2QegZFCgo9X9bEu14qEuI5x9EUJS+r
c8Nz2zi+2JFZSyV7qOru4k3q8Ieeubwk07wIjItlnKakayoOe9TKXoTOppuA
DIicDixgbXO/dZiEWAHPUgjfUmVde0LRFDJ8jB2n/uOEgHUPeUIXeRFla31H
MLru7RO7clQCrsCVAzToCsDIojtLxMHFMhpeF5i69xitu9br08viFSwh7XY8
42Dr+pmKgro2J3adlrEQr1k0UTs3za2uH4MuXHZb4ZtoYKpNypstO1biF/WP
x3GuEyYwjwWxQWukY+Mse7JASCAT1iJ6H5PQPYsjAogTRmCGR+M7A2ojoYxG
Np/SGiBXy3v08aBsW1sRkqERqCwgHqcAzRKFn05t+59YsR4Vc5K8Yk48Q4pE
hwuIVqyXPuYg60Bn4TJakzUVEJWQZBKV1qEBpx6hBMljK/LCSSxxG877hTb7
FXm1vHOHjeSyC89iXTcDoDuHxF6g6z2UVBCq+LuyuhxYkhil1ewTmvEWyB+B
bIEMyKLvNFqS5OjEdHS7iSDF78LcTECsTCZG4camdbP8egdWhjERLFnGCUkB
fGMJqVFB0xOrnUCSjfNVNu24fQH/QNk6Kecs2lagKbpNOuJH4ht6loFmJpNk
CcBAZYinNdcxAKvKe/iv75lwiEeEynNZMIKitXxOxBS0Arjc09KiAFHqjeMC
bgzUK8MwQioZIVefwRUsYEvExIWewKDKkYBWlBZGHYSRauqxL6VtcJ62RSd0
gJ+QNTvws5F8zS7lvhJ94ZelGO0RwtZTjlou42hSIdbiEsWYRFur6O4LcxWX
nEX+0vnZWXGCR+p28e/FIe/HY9AB39NYS6t+dNQAYNdmN7CI1nWU8j157oA8
0sNKGW5sAVsaXntCnxiHvPes9UJlBacLYnQLhQNYOSFANAAJSKwVSaLE+Tqe
edy8JTr1Bg4Ozx8E6rdvQH0ABCHGNckL4XfVvGCcIrzpTGPUNkXcLpk6GnyX
IDG2XNa6teqrqvIOG/N03Baq64nLZYx+mip2Fw9VbdWOnFFvUsSkrlnXOdsZ
zy9Hm/RUz6rSvNROUZJDrWkW9KBIO25leoxdMfLbZfK4SlzZouA24TmDWmYm
vTJaxDyI+HE6M4Szni7aEyzuhGR4pwTYVwiHHZFY6aBgyo4Hqso6KK1jk1VE
ZjggMaKJwTMfiNrasA6O46ioOZn6nasMBWJ0W+ChRgY0VbeWD2RDLVs1Stps
VHX4ZVGG7OioC5lFUgqm4Fpg5Jdqv2djg3oSO6za4BOINKiKlmpTJz2AdUUx
CrMXmsMlyNwq9hlaOWMsEupCArgijPC4YnAwogARmnZFFg3M3LCS6BHVGlpP
wmagRTSN1b9FkGYhFzctck2EJC5H7R/Wr/qTuG1YMUoeogkpPEmlMQEveUFZ
urY+apxDfMAd53lEsor8xobLtMlnnu4Md9i+TAhdMNwShMMAjqkrfJzEWwII
a8q9cpIvXRAWxzGKQIcLENYtJrfIaUI4BdpbmG2C3jNRubkT3QOqiFzOSEVG
eubZZIFmLBZ1ErVWMu3C/aAwJPKCs9Gqyc2YUPgXCrdU8/jjuVrGE1hLOdAD
KdYjmuSKHPS7NUp9OUZ44jmvcduP89x4vlk1kNtYJHH1FrWliBSHcjMIDL6J
DPFHnIYYIGOjzCYAATJOdDZH49RiYyieTb2BqOjizKz6IiFhgw+HVwUBVbw6
0fBunOpVmtu4gCtB0V/kfEAK8z5eI+MBaWfn3d3oFmgV/Wsur+j3m4v/uBve
XJzj76PvB2/f2l/4CRwG/r66eyuP4G/u5bOrd+8uLs/5/XeDn3YYIDtX17fD
q8vB2x0NA8JxrHkxYlvBWHgPHLqYXwIIYaz34cHBC7G84a8USmP12qsHtNDG
j7RXJzSMYz+2zXiBY2wHYyl8SdfC983gKIp/6Krn6+U5wXCFFM1Bn6mIoIKU
jTDgWfC+2gmJIumaPCLQRHccwOq85LDGcBvmbu3kw1f1T+nIRzQVaAdnoNp0
OsOMTEelfoq0odtKiOg0rJ/FC67ppEmG7goxqAsxoOXsKJPecXEk8DAQlApD
xXjh6NifqRvBt8ySVcYn5KDGTPMF0Sjx3vAx2KshsyqLd7MSVQnshRJ8KqZE
9U70QZoPDaQmZwbTML8QPSfOGpoxow6vvMu+cg3TcQ45XnsevKkBQo45dKr8
CY/nS6mRLFhGRWeEh3+ebFp2BPNo8Q204Oufxtl9NVe/BxqnHnMn2+GaOuPY
YhzNqmKR8vu1hJZ1JToAuHZhwy9gNBoE9RrRvCSuTaxg5WoM4LQyVDkHWZvC
l//b/nRclDn/XKj8Jv6KU6PR399hnPnB6f75q+en+/jbk6Pn9bfxp/dZP21v
Nn9+/X0e+zaY+ttPPP0r/ZcP9dNjw9PeNf59V6JTfMVjX3Yaw2wzFrw+Ryw4
3H96un+0f0xYsGl9r0m0MgenQI+ZMvphxT4W6pOIpI/toppP1fzgQ/SjCqOT
SNFuO0mhIEniH1u9TR2WOdjZRHKIxroGo9JApL04b7f1bwVTNmlKLSyhMQmS
gA5rRh2MIM9aASJ5NKWjSnrTMeKULEA7Hc9gZI28DchoqsCH8HPRCsh8QxbB
Uv21JyA0rYqJpY67MjF9xcaEPeYKUYe07nIJcj57SwMlt4/hXLA/t4WI1Vfc
mfWpYioH78e07ae+bt2P7rNj92PXOMU8g4xFUNkDqguy0SrO2ldvIWdXf2fj
8SxlRxTOdOXThCWVaAyDd0WO8DiJWUaMA2I5aOMnHYGunqoPBEKX8CyaF3Sv
oxywscMAfjpCk9Dv9VGWiTI1Ldr1d0U9b4CzbZDty6gBt3UjtIxxjuJGRDYJ
Np+52DlfZqwkUNCb7aU4fhd5FQfPcrB/aYAbS5AbsAAycGyQUDqkd2EmAYvT
O+MYJKvpTrtE0Okc9g+tfU1jqsjeKSS29ERpNACrYYBjlryga9KKq7hB/1DC
YKDgQAQja5VG2ZyCKNlQIMEbbK1HqZolBcRZFDO9GGk0SdM1JFEyvAzuJScr
2puGJBGNajgIBYOiMQHkGJrOZWg0lxXarlyqBw6Eg4pISdaksgojEBrr2C7r
+IwuZG9H8HN6DD8bhJyvk3F+CLg2/2PlLkkC+w2vuot2Aj+bxLLgbSeGfMsf
/O9PvvKrFYl+/Q2vnJNl9fNf+eTCanByM7mf+itNQvTJV/Dni894A05tF5lE
ADo8Na/T/JFzOSQjNidm4mWaBTjtfM038RQoc4R2I7wob9HTNppHFKbSoXWx
qUMoJ/myyKiBd74hXYg6H+iSXsgnsTLL6WT1T5kWkY9CZmlYwilkBcapR61Y
i7BvE6+zprj03Wc8EJn5QLoiW58DEpCah5gyjISt1hNfPEchUUxSt9g4IaPV
bdlmV5XBTHJ6MYzZDCntZJZwRsjucHi+t1cXQXSI/+uVr183fPw7vVLTfzZ8
3Pamoz/BnLWPN7zpa2gbPt7wpvnDQWOf9PHhP2if9clqH/9Or3wZnvw+aqES
C6y5UGBEY+rThw3E7Z0LJw+ukD9w/frA2Z1u+/bQy7Hfcs82fN0UD7ZAcvvX
mw/1t6PBb3jji5H0i+/iF1/FL76JX3sR/6EH8FmXsI4dX3YJ5dIdtV86ZsHn
ZGtEI8SdJlRY5aTGtX6spdxsYPSh+JA5jdxsFySOuma8YmeFmJV5iKmukNKT
amp/+ZnShyd64DAbpA9h9bgMO+tmcUQEiE0yBgYJdJ2EYb9vestJhPDFDJAm
VJhAL3qeNWUKdHeIp9e5sBsJXAkqt5GNLKvIYRWLQ6Eh6pBeTQlL7PPEgCC2
uJQcm19qKIoZcaYeglnS/u4qtEMnosxhHCbuanR7d7knHrynz9mhBJ97lN0m
rpdxVnIKCOujEqk/iyMq7xKVGgfEwiNpqt4wbLvZGqt5yjlgErzr8pNV025g
TjeIj3QZ0qirS/pSqYJpa6KX5JXZnNWIjIM2zTGi5HQvwdstGc+canJgCDsl
vMVpquNI8JDNQmBrRAR49jfJt8MQTK/MBMDY2gUeCWU1kwGGkoRZEIBLzsVg
HvxOItM4eDM31wBU0lNGGC7nKIKN4SSrRd2rWMvCzPJGIB654HBczv6muEiO
2XOJwi3elle5C3ojxzQM44xlgWnRO0AvfhB3rO59FP85T9HpXzMaqWnkhLnP
NfiGiglQcuhaCM8f6Rxt5Kofp6rXzA/5K1dLCrYk041dvmxHd7cppC+IwLMh
qQS9OIsyCnRRgw4ZbwjAklhIf/QwzYoAgOVTAPN+fsCcIBd85jCObDFB0IHE
prITHxOYJCLPRlYhHU2kXAjcaxzBf9/GuvkFEDSeBs8tQCSt2/JM0PNMw3Mv
JTxX8NUhZqR3NNHAlNxLUXIhcAbUuHRa+kdNvumg+IwtPGMzUMOhLDHf6yo1
sK/Q+Dp8e4CtqN6U65VkD1GaTPs4xmt4cIUBjIirxEwnHH2AyRqyO4m0A8ID
mPLAWR02n9cmiZVSfsovoWMr6LC3VPK5yCmK5KYnUdm8GZpMuZKOASuFuyDF
eE4wc55KqnQJ+PKMvMrB/kRv116UJDEZG5nZ2IM3DEfI4lo4pk8KyETvucIN
R4ERbIq1t97I4+UHWKWOBAk+k9pcJA3ohH0b0xFG6rrLsa36CqdOC4qy6MOh
6xovxnkvktW29mDvwkZdlBMOwGS6it1K2ZbdjqbE6QL48RXWkgs2QplGU9yw
2GLfsgTMRxdCTawgo3nTmpfE92y64sgfL6rIpf256A425eSzGabZj73BcjHo
ImqUwatO+iGqJAGDTCvrN6tWf6q5NXuTsQSGkNy78+s9V5ZCwfMpYCM9JQou
l67dnIWsxW6HxnQOFSF6lGGgo/g1VVqzDKQ+CEc+bAjcl+xxuTItl9ehOXCS
+5wYk71y/JbExvg5gu7WuXuG4/AFQ9LuH7s4q5QBqo8GZRgSGnCTViDJRK5u
yPo+4wV+x2IhZmdaXCVEjSvMDUD814FCF0ZtU1Q4ZKqj0rGME0I7Fsick0uX
r2kuwp2X0eR9XLGoeO49PnBhTrvngz2OLoI1Z242PRWLL96JDAg+Ie876h9K
xpsSIy9kFrPdPNnfk+MNGjTqDj+WGZ124IJHzP6H1/Djh34NPDFmFFQrU+SR
dM3DF8hN6K5owirte0m18uSoJ2nEfN/qfsdEUZpW0n38z8ExoBX8+/TAPEW9
/+iZIQPNyVNzcgT/PnthnuODL47NC3ju4OAA/g8PHhxyMUer+H/xvx1Pyb8R
PHW+iF/NiOD2q7LbmoWYzcPWGvD1qwmMAwpBLMiJeXRNeqsHwTEOdEIbDG5n
fsi0OXPVeUpPqqrrSUHaGAd/iqatntqm7o2VKEh+Ktgl4UW1uVIhVktPCv8B
IRQCBIleC7LTG6O76LUNo7sHto7eV59KxSnSqM6j1cErdiFSIbo80TThJUNy
cCJJlpoLGGYvIfysom0rXKrhIJkknAnJa2K6giHXVKeNAt1WcbMsinhfFXxP
HBmIYOOLVVmxBixOE44MpixFzVdoxqC0V+VgalsvZ9jfgjl5UccXX9328Yol
tqIEnTcrVzbBN/S2tLmOWP/T8BoYhQP0uvQk8wMvTC4MswP0+DkuMN0qmbmq
L32heG2xfdZ3b0ujNMKr/R216Teledo/pL087T+1vHmt+8hoST1ePTOSJ0AE
VUrw6x9FfnktXXV7sqcVCjmqAnD4j6UnTxtkrhKk7ng8RzkLxHARdQ6jEVL4
XT2Ihu5RxTuqza7SOmWuSggEgZuYY3kaGBQBx0Ff1ZlVLqQnu1o6gaKjounf
ANdxNztdxLoYJiHMZcUfo8gxTdhCMk1mlAmtG9yYRSCygWjsth4SmTZcwA/X
yAF0CzKFb33XZd3Gi2db91/4yu1viSaSONrQGMvm2WYAGCW+I+MYsdjmMXJJ
a5BwGZXV8LZg6hUZEcIUHl3jOKbEyqScUIzXqatN6BU5YOlD8tjREJjlKujY
JDgZiUUUodJozUBivNZE3iXSEpksWIciiMTVW6VLBsIwrbN314EYd5dJ+ciU
q/vdtkQttYWRtQRZdd1MjH64ZardrHSoHfcJwirllma38krrKVbveWTZV1L+
6BKZLW8c+FfY6t5yynOu3ecNjV9JanbFIqXCvU4nnADOvA/HURiXcmZdZ2bG
ITywwcRI3CSS2qVq0SpRVLesxaKeMT7dPEJMeNo/JgaGVRSWBWbAbL5yDfcg
7LF+Db/6ytkAUXvl6mFl3pVrUSA4F73twp0qPtYp7yZ8rOFtEx/hpH8PVBT1
5ndHRL0uWvMs0ZKKuzDIIxb5SDKsoCXluDy83bOG3hBldfGfj7itKCvDfBbe
Wm1OENb9eayr2Yy+4uVAhQ5fFbFF4sc+X9LSlPEW0YkFVBFqrF0H5htzsTqR
oED2xFVQ2T6Rnqzh0zsxyn0ax+4ouCRHcIo08NHzfh8UOidl2OAZIzS7ReXN
xAaiqcCq9WwL0+m6dJq5Z5ZN80diOumszeAkWdusvnAFhHqy9GxF9ohacrRG
O644+hwWwFVjYCDygSSyQF9Ybh5dkD5XMlDthyxjwQEJgNrx5QVC/i0nk/zj
0UWyVijSrAV1lJfDwo4Pu/CfE4rGgmmfnOzvdevXHrWUTyER611q8WHZFGak
mU+O+v1nL7rm+X6//+K4a16c9PsHBwdUH+bg4BD+OHzWgnkIHUx+rlpvdbJY
YE3ZJCLvHG4Y/7W8TYqKSuEFFF95TXohQIPzS4hFaDPDPGjJmZWlsM7j28sS
LOxGzjqmSriyMsbIeJZJedLJGqhcGb2PPxOjRB4KcUovnOCrnKmnCyOaIeKJ
KUQdhheckdER/4V4p5jB1p3+B13POOvCJ2GzLqwBx9HQBpd3UQ8KhVeaYTyi
sKMyRNethsdaBziMoKCXTw8Onx6hTxpL/GatzsWt7L/r8RCRmBr+dlUZa+s+
Pz7e5/lFFApGiZxUwNnFbJCt26ytURRQVk3TgfQfqMtHz4kNOytKXTCtS7x4
5xp2WvmundN6PJYTeEXp01FCDU3Yt07vEQORLdTQTDqDc+jsqiOGzTL7HxCi
e6JH54R+SiCkYuhtm8LrQy/EDpEHzl4f9713+ca3vh4eLr9+fnh0bPNI2gbw
Ldn8uOnJtOY7/OT46LXMH0TkMxVN7hM8DounNCfOHs65YUK6bvS4+VamkjmP
920kLv9p/um7mnDE7UJIWBV5l4ba5xNAxyBCn72GMga8peKU8OLgbMkp2A3v
AHkoJU2hcasaMPcvlC/Ns0+gjANASWk4tl3SBQWiKn0LgpwX/y5unE+FDb3p
suYx1rAE2BBqEbzbiI/zz5FUWzqKbJ1ynkHS4vwnhPe6warmFMQWI1T/uuTr
8Wl8UbzsKaYiThwOXu1L8wwYpJY10kBQD73a5+sEMnpXUedbmYkGEARX/CQE
ruMny10WRZv4GaCnXliHnuol4v0Qyen6/Dp05Fj3l/e4sSEjYWFF5KWq8L1z
jDcU2eJS+ZlnXWSDiCbtlG2yl0hU1pXLgChTNB2nazaSSxEVCiyToDPEJ5dH
3WZwDdhaYHNFQ7V1u0tWtBerFzlkpaWIIuP014aZk4R0lh8FrLLRqNxkSwWV
6qDVNKoqXJjGpzbSTKL2cBvEOhtrOTliwZLCsyYY90aBNVsJuZBrn82RkN30
x0t7lJOjgCf3rTxlM16TWStvphKRKJdhilUjTdXK6/LcsVfEs1nqGl/FYTg0
RV/Q+DsEjBOzUYU7Rr6GiwzA/QluUwUG7q0g57hHLGkjFgsp9C/GV6mNg0Uf
4yq8fnDtpOxgLTfegYNcpplayKUssdMBbLySd7k5GG8aj/l5TwUOiuVQgZGg
WmWFvUNmrMjQ6rSMzvsMk6HR98/EymNwVOQn4Xx/4WQCM6yvRmtkhYF1FAln
Gp4bKX4iheO0ewfvg9k908iqoJCcQGkSBMqa2hM1RkmoiAG5BUST6tOypJCd
9b0EvT52w/hbwD/EkhnfHXKJZ7DTPVKo/Nt8whHCyyVVIWeqEPF2xWmuheOw
uI2IEV61MS1MgjCZaC8nYu4KARb18Xt8PE17gLsl3xRtGoRjUxpi4jy8rMBx
eygEMbNVcgVIiqIqQFJc5fjwhEKlhrNW7Rtt1zkV0KaoCssoWZ3P/AXyHeQy
XQJ0EhHCYEO5Z4gGOpZqotgFgQzmJHOzBRxWc61dZbB6NVbDMXFRsCYo2iK8
qzFJU/X/Hx09lfCgyxwbFrLlxhZyJBzU0rKtppvh+Us8WrwwWGbSGC6UFVbJ
E1uLF4llQ31qhhZS+4g41A0twHBlp7QvzT/XCMJbDklmzHP9/JhbqDOHUvb8
QRbcvcbWENW6ctyCgTaI/oX6jJ590C90Xxrb2AqknecaPP2a6476E3edjtco
wcc1cbwAVscTFsAvkb56X4p4rUut78zaYlxM7cZFWVnauSZsW6zuxgXUgoWU
sLsQ3mYJABfR0sIO+x4Fb4BCJIdGiM9XzWjIc1UsorTvSWvhXmsRUfKiV4y2
mrTn6S+LhIO/2LxAJRqUiUookr3ZZZJyYT254r/ppKTx2ZaDagHcltOqA6le
f+IzT6sGuK+a7HMOqg07Np9Wfd6vP61bdxE9emE99/QyMAqOA9QWCYGYbPeD
harfV6oimDhj41UeaLjUriMId2fGahHmIiAHXqjgA4dcUjV0rEcpz8uTXSYs
WlCO90+VgfvOCh1MIeAJdXJrpJVHXQimVvqn2Gmq58tcVZhVAN3aIP58XoqF
NgEASgwPrUoh/yF+iBLkoi81dncWUniiuep71G5e3vQUzMCgUoB4j9SCeCVC
vO1u2nn8xfhB9S7k2WdJ3hxdTuLCoP1yRUZqQAHqeOv3KdzSFxXb3sQgZALq
w03wK+axmisG27N6AIV5w9KEhhU2E7kI2zVlYhFlK25Z4A1Dbdc+qZ/CXFqU
zyzTiGzurI0XiXiTc69RpX0x/kAtOVzU9jhmfGPYa30KN1GtVaXWDuYgvL6E
9rwb/KTg5p3BjqdAyO4tOHBboIV5JieufYF6OjwblJde5GWlCrzuTcs6T9WW
T7SqVpSxXRIl0fdM+5/A0S0SyVi7gHNdkjq3e3Z9sSfxbWr3Jg6B4TCF2Fn8
Oo34euFXUrR9UE8O94+46iAgCodVSmsaFcyCTr8x0K2Udf7BElOnAK9edanR
ixZjahZEV+MdirutobEWNzR2XA1C5HChTDrMYxHjdaT2HdXgOC1LuveEghI5
5ga3m+/Hp9F+HiUFSPQZ9+niYaRE9UxSpvSEt8xE5Onu/NolLIgA/+z5M8FM
JjVensLjJl+h0OfSj5DIrT3a3kcbe2lcedZW/iqe0wpb31oLEXDOP5YtETVi
pfXKuPpxR6SjMhUW/60uJ10rqaeS6F4fNls7ueBeolVLwWRjjN8hQpfVbTZi
Iah50YP46hn39llxClqw4DSOHjQQjoNPd0MZZ6u563BPcgoxzrykV6k/5WcP
8BRbVA1cc6fa6ryubZyUQobBLUEwidhzbPWqshFhRz4LsdRwYqQ2s/D6SXOz
yDH3PJGWkXZCkpOCzAhl8l6GBUw7seGeaFYqPFOMZ3lourqoC19JjVNhZddO
x6aiIb5c2WOfR88O4Udbbg+NozpwKr+GhiiuxdRwctBGWBoWAdM/ZBFLbJ/b
thF0V9ZLQUCOJSVA7p0k+iIxW2PYU/s5k7TDWrnNvaRmZxQy4apeIzlxgqr1
BMiB2FNeZWnyPqY6/8wrJvl9hh0KmbmI34auFiYYFtQHkYT4Vyq0he0t1Bwl
koO4UbIpi3URmiixGQH80+UJUZpFg0Ov4XPBJFaX+sfUASnt2FLaBntjixX2
LNBSwjVpCsHnt3xtYQRkh9DtcJF42/ggV4eAlC1GG2ImsIs/JGXll35/T70Y
qF/YLYso0n2spbfBkHgJN4ZYpVFRz66XkH/bmJziZCKzg7ayaodqXRdJPBP3
ecT1x1sNXrqzMezsvZfxytxARGz2gvmo3uz5ksxcqn2DlTqA+G4xMkI2eltz
E2hK0p0ns4oLdxPp5G7VFIThGkVPvabQtnj4pq2qHyq6vy8w0Z02NMPOUmQS
lmOlarlPvJQFLjeHzdCxTDUNYps+NcsK0GFUXhfOJJtrSQNXUV4kwg2NbMZp
PnlPzWg03WlGzJIolZ2SFqoyFU6E6ecae8RtLgl82LsP+742qpPjhVraImhe
TX4tTszR2nRnCYvJD2BbwsMhUVsnrEZeUvs2a35NUErO/qb6shpQ63t9ybZ8
pVQphwkQhLVdqLPoa17JDJsOuPK7bMRbOz/BMocLLWoWzGmpm3VECIQq7NvD
9YDxUrKMYDucbSADQgLQyYZ301ZeoHJfesfpTPzeKujjXMTqQipFI48pknSQ
BW1cqOkZahW2ymEbjpDwVcYxG6rxdlivn3IaZaC1S51Z/lM6u6BCvUUO7m9d
ox3g914klcnHmo1qERMfwW9d4WNSzqURp03iD9sYavlRHpzn3AZ6spFLJw7u
RxGUSnHKopNluUFMTMa7peS/4MTzmFgDm7BkwTZGW6iOpZSNheROAOZoW6uQ
bgSVX57d12h2Xarj0z2S7ssVInisi6GmW2EbFrivlH4gspwnjgeN+PRCyUAc
MSHNVkBxwlmSOJskznIeduZG2kYdR4Cyyxjk0uQOJ01tuk1OouacpOc+oy7z
3lhMHZZUDkS4Odf8dP1EfNc51e0sRIoF7rOyndo5HTjc0VbMZHUrf7Dl1hFZ
0kUT+WSCkEPo0xqkGFxlF+EOD2tpUCPVQbsETnFdsurMfEod+5KZyqjriEVU
2Z0KRno+D+6YgY1RknxVYscwl9/6aSgkogYuKOCD2yDbGyq1UPRu8T2qA09Z
dDs7dcCxzZ2TygLnC8BiIaH3OqoaYLHDzKOpDxnkj1KOB4gcl+sgocQ1Saxd
NQ3vpT7VJfVjI8ZszYlNXsVufXJ8sxMahUOpeLNjej0pR8OEovVgJNeCcrIf
M1+8gRv5xLVwjZXhWUzpeqUE8O8+FiRC9jeOU8xkd7V3aJkqHrE7G2QdbD6D
0H7Jg5T2PWcAxPdcQ/iEq22SNpkUk9WCt8BRCyJme9RhERecae4WQriAYpLV
3vJZl43R61yJMLWe0fADNeD092yQI3N4G3uMTD7hVpC2LUEgNkjrOqYiepTY
cGoOC9FjhwuxWJLPHaTHsNVCK6Hw+UPG2g93f3BYxNWOW5hL7X1pyzqPlkLu
S7sIq4J7CcJBXS3YMU/rTdR2M6XbUf1RTRttIeRhC1qAITv+bSUS1M+kpyee
P45CPREbeFDalpkY07uiuBU+YzaV+AWUyOayqlitStenZjfaw5bRCZf7yejY
UBYlD7sWKCL3PXN8tBvjILxT4ZxSzeHvK0BIJWQ4kLQutgEzeEBM7dmIZK/A
Lp0yvcNNTeKl1AXPPyS2xazKrMyk4TKzcZ2VVrZcYaxMPkYPICs/Af0hzRer
UGiYlNpUXuJAu+PfDgm/WEIg4Lvm1lo2i819zIFr8gfNOmayQVZl7AxNNXtc
+0npYUergn8LFdcRhda0WZdaJ61MvFle0ri7k8/cIRv47CaD9VphCbeDI4Ay
iydUq5y75stTUTo5LK5YUXhunD0kRZ6x4Mak247BxJB6iTp4eLW8wu1ibXC2
rEq72MLRVUmlp9mznM2/lEMPdwf58ApkZ+wbjPhIAiEDULRPmT7GHDnva7bN
BVXwoqq2+rpemvCgjL30GJ1xEfsJWip/J5mieQ534EOlKRI3GDsHEJtahds1
hk+BbOANO/M6Zt1xJ7Q2kUtdY8PMUPCmZdPcacB269Vh6424VrWhg9IDHL5k
O2sFHhtnNWpIBJYQBF3GBV/wVbELIiB94FuVw3Nr9VAzYoWaiH6zmJ/rZ2zr
OkqejVoOhLz4soRvjGs9lIYFzvyIrvqCDXEjscd48Ua7cf++3zVY3lAjdKi8
YdeviEhX7CZO4b4x2pABBW2Fu7d3N1QXkd58dnKirc0oESbikgpnXnMlcrgF
td92h2cXdoTDo+OPH/c4sg+7rLPtg6HhGReopalhFxS65EhGoWb22g+NDfOL
RBODkBUhyZOabq6RMPuGLDzCxoZeUZ0Nc/Clt0fW1mfL47CueWsZ++Z/gmqJ
5y/V7oKEduZehgiAK3WQ9zTG1fbF8y5CLhI9ikRAwNNayy0iM48sTpde2ZDQ
Mwt4ufnqv+bb8KOmFg8rV8LDSpxMqNCfh/2puD6jF0YnUY/WVuUYuu31VQX2
IjKiBcQvVJRr62e5mhpz2vQzMf+pnXJM0YakJ005jhHxhP2hbqGPsW09J+5J
9tjR0uFmkw3VxhGmLiaFBkJsAl6KvuwpBVgzxVgvY7VfG+smwFGoHSGeFadE
Da9/OKkbwKgUprNn0414Qs57X2kRHf3gCHV0+8ezjx9xOPv3sf/liftj//iQ
jOevVXojwYbWLo5rrWYQXKLPk/LJdzCg6Epk7dfoz/ArHw5JQ6ILT2KtF+ke
9Od93NKBp8s0wi/maAeKfb8TeVPEBI32CM2QEyRReaia17rFhK/VUEvdshYw
pNOVWs1jx3fh7LggKap9qryBOon6rp7EacHi7lUnQUfsOBi8QNIcWfNd2R4K
xvSr7gLaYJUta3j3k+r8h7G5FOCqOAq8JFWCh5RMfHHwHBCnZuohgQejtco9
1c3CniyytLrXudZu6si71V1XBICtWv4ZELNAwx3HyK41Q9ov3IzZkyIhiLtf
CwuFSZHWqS4MndaAVjIb6asFfSVbzFWfRT9lGXNWfSRaNUkCImLgGSYLSWll
+2JwxsIYSgm049JntV7TNjQKx/AL5RFdsiPUkF/q6z5KYotjR5Z10ELqjbFR
KJJLJd3X4Q7MUlthAZhbmi81vymfkZ+FfFhcWXXaOjYLRtT4NxTrGAGxPTgQ
wmK9FM3znS21GQAgLD+qcWWf0Y+cNydTiICXomzBrkKK6ZMoBI6nEpcxgxRT
ZlxUXGvJRvHdAPNAT2CjEKVnQQBqmlAalZdFk0iB56L0EcUqFX4BWuCGRcIJ
mxG3XPILk25EFT4CUmRAUq0kE4dNaEJ+xCEv4rYOYokRpyG0lSpn4SOnYjZy
YyVZyy+q5UWvtfi1mUeM9ORUtagXcrN1m7kXr01A0tbFthRWo5Kxtxc/7Khm
qvBoLUd/KK1giuu5WfJadI2XdZNY6xR2nuX8xEjBLLeGN4JC90pvLk1ObjJg
oplphvZQjfr3Dt+sb44ce9Y6xpmmgrquDOVrNpPr5aDzwRKqyzzBjUep1aMJ
46qV9ZQjxcPsJKw1xWn8MCQbR8kaAmpTxrxaizeAQguCjnQsjrl/L4bgsS8C
xOiF6M0bjG+kleXoF7LZCEhLxM1C7CSgdo6jBsTVE1MyfaFeRcCST4UqF5zG
BA4y/ExbwoGUX2A0WIrdn7VEznQF1GPdYxVhStKmWpVouyj9uT6qVE6y9Ezf
VMIOpwfiRKY38RVTUIqcRH9LSTR14MAsWhxcnUXi/9d65dxLye6IiIMUr2IH
sCcKcmQIyoCaMO31dJZ9NdsXoByc+Kmw1vEdAkDLagSxXSqUvqD22erA8M0X
tQjaJR+mF6u9KggnE6pKj5a+2cxLpOYJpF93FaVwq6IxmjE5jDX52UZdSRaw
TZuy2XKoCdDx5dRCnX0V5NxCjemR6ubCd/cr9GZEEnLrUv+9RCy+B+SfqBIk
6dYkos0bObGnnqpVa4wNGhtAnqvFAvuIUu1U3roPMRiLIcTk49mqFIeRj0+R
r2XqWXFEkPGbngfknjoEe0ClAga5NpYXyTopKGWTCtEn1g/iL10rxWtF2MrX
s2/zJTUxN/OEDpx0A2uNxCtgrXHkVpSSj+3mQGIaOiBj/ENi8y59qwzzVA56
p0rgVsRR4JxfjrpmNLwmhWT07va6a+LKK9Hkl+snVZPcVw8RUDkOYbORiXXv
Es3d9aOdhAWIEV8qsJMjxNUcXuZoaEo0ljUSBkZ0evjni4fDJyx/kX1F7UBd
LRykLAajiVXJr1DBDgazDI1GfYgK9NYBMCimWDieGJN7U2ABG+cVVXGCwWAp
VgZ2IcZI9WxxcilMvrVVQaPQOVmYNXQYFddIch2xpWZqM+ZRC0//VpUT3Elm
XsXJ3zK/sjqXGqDDj/Mldd4mix8W/yCPKJkhkPUbNqRUHnMJ2KgTmX0h5NQM
0jQpUWKKsvcJUN2zeYE2ZOa2369AoV1EXXOOhrPbeZQiUlxMzb/j0/FjMvkZ
/gQZ1vwZpHaQ81o2Q7j573BMZlC8f593zZ9RgAKpGwSJLkwLtOc2f4TLFoMQ
9S4uEqBvf45iePAmSpdzcw6yBDeju4kXCRaAw67AgPYVehpfpUAP2TR4m2dr
8z3cegBfr9ejIhJ4xD/O1+bN6OJfg3o7kn7t7AfW6dQFNot0gDR6KpvIuUNB
twCsHlQVqwkpauO1b3fnuHPXmnRcUJhcGnkeWHWanDKdESs64iBp0Dv6qTy3
07XSo5jOu7bhhG3vSx5uLZwb9J23NXOtG89vDsSXZrCq8ixf4FUacdec3cFo
TxVgFKWoNMxqyRJflmc9Sm3GWK1E/NE4zqs312YwAjWnmrOvVogwhWQAsMV5
JeoPswgYhYA0lqBcF2Uoia4sndkSSd52ygUaPdyGLPKLuxFLCeDx3QxvgJDi
XuCAln3K19rxq4EziBG6RVQ68GbrEMAioUamdkIvvZ67aDdZSO7DRBJDuuom
SYl523OygndwYBprJR7AFYbs8fgR2fOxjDVhrizCQgRlLbGjMT20Iapo1mRP
Otdv9nNA/MYbpBaQNdTZHdBlwToWitjoNFI5hKt++awXjQTcPqiBbC8liKHe
gMlN9HckNyCfgmRCub4S/ieFpEGRigC2JCLiFI5K/vIL3G8yEwFfJY5CXkYX
pW+df/S12bUV7kpnrIf1wigIDMoQUgiyvQEU3USspkm115UQ66lqbjYQW72Y
JFoUmfUMI/5JpAwKIHAsFx4U2LwoVibGO19yEH34yDnQxINj+wAbpmB/Q/XK
Kz0VqUgGD9vWSzXMLRV1Ra1VlxILfbbfUpfdBKG06MtriA/lZqu5UMiJi+FP
mh2NbTGFNdmtlejqq2yuGapxwJossNQR3lsxvPjoFYQ6iFBLtvYiyOb14GOD
pGkZ5DDyLaH6GDqEGyfo95viFCgZ3JEn8oSy8V5sZMiFXAIdXAEQfyjIRtPf
MC6TzeTYrMwF0wi1XGWPsHsULpZiwyByQsVqxE/Y9e8Cpy8uV8yp0EpD3pHI
VcSoISuRo21tw9ikguoO0rQl5rZZy8721yTHiVpVuIREDWVZZdTvg0RBv6SJ
UuLAt0HmJjwAQO4HUVnEnIvqFZA/tJogQXl0q7weeouRzDxpX0BWYlauU/S7
cOsAFt/dobN9jzDBN6BaKmo1uABZgH5E4tylm+6PHb7P+TT0BXBWHOhuSa6e
m5isDzDpwTOQiSbE28zh/sG+Xgxy/jI5wta96Ol7etLd399vZfdaN9rTDAF+
MCdFujHVoTEOjnUM+6hrDuwpkbqERMt7JPfzcV7M85wK2R7DICAolJZQfVq8
8OQKP+BJAt5xIBrU6+OGVwteYiFGIijIvUcKSq3Zs4zeFycR8y6qSdkF3Ykp
QdCPnbghg7QhxvlijIKAmBbjFWzwEcMYs7WDblTco9YjIcvMKptSmbpVMvYH
+K0MxFrzgBm25OzhfgjBUnYPnzwlN7g1d+eoTzqigpxdhoxtvArrp2vWaSjK
J2d5RukpNsMyUv1lvCaxSUO7+HTvMf1R9P+FF7HrRS34vdoQ09CWjNAJRTel
EShnylWVlEHhvPdF/giXHL1pC7JGlav7e+ulfYzFEy+WcaatEam0uc0L5bhh
vFv7eLp0wuI4niWg5oNkv44jipe8jTNJNoNDilxSgYYwtZw9QpWoVbkCse2B
AyhZNMxXhdPy1TvonG9EioTqTXMRlwj2bAqXtYBIk4qqbIUlSdkBoJL0yYGM
dI2orq9IldLoiyLH2EfQ9TLl0LgB8iltAkSyaFJp8Z4JSkyWm9lXrbR8D7ee
VPNVhWWyyKTCzZwUF5GHl0i5OeksKycR2yg8yOE9ZGxmFjvjXB8SSIUloEGx
EqsQloNaCsi9nM9VqYlf2g7G9/x4lBuXrtTdyppF7AWRRJ6XU4XLkvNDrUEA
FNV5sjiREOhqbv2pwp618gZM4mq3Eregwg5jOF2+22/i/L6IlnNxG3uyH3Y9
LOkOYQ4nzDIcXZccTf2Y7YB8rS8i9QOqkBdrKyRGluF5zUpIXiACSDXDKy9F
aoKJ3tpRz3ljI5qPAj+s6OUyOH3BK024vAI5NWyEvth9KYwdXXJxheDEunG2
zHsiHSG5kUER369I8IRzXgHaqZuBpB0K1UtmIthay7D14CTa6sym6yL+oyM0
6qo9DiV/ICZ4XzAMg7On7KnlocrUUD+tWkBE0aGRLYnaLsQsJAzPQ10Kj1g7
3UWci/hdaWotrXgUumhOFkTbjyd8SVqrJ8eqFyUfp8l9JF4PPhBBb5tHOkVm
iLnDrNtrQzrEN9FwZSwNsWAdYLyCY5ZqC1PrP5MCHqNrIzaZUHJ3Eis3epRu
Ab6RMkTZzJvVBwBvxQa4KfYG7Vlu8miKTYg193q0wK6Lb4oEC3ddDke3oF0m
Vlhp9lrf6ff7nmSoGC/ir1hAlpHLhZMkYpv/E0b2o1/exeC48CSXbKG5cZve
R8mCwCwvk+xWNwnb5BMvbYOt5CibRPdSrBeNInlq77jwfpbw/GBH14BSHQY9
26i6v1MDWl3EIseBNanJsdTAyXmHM454ZxLOUPScNVwEUBfNSRvbxvYUQy4f
rjkOHOYn4zlbA9oIFjnQsS7ySpvYi1e4Vr3Glh+VRlVZXTJkTdO7jHV60uXo
riXGNGr1eJcDh9HYC66hPFuVbKgYa/In9SC2Gh1bUFAIQjMQGZOEhChrb5IR
YnNRKXSUFbVWdc7lpUp2lN91mjlvphVKgpZYbRKfGPBrQl9e79pL8p9vMxO1
vbGvJoXOOamYhA2UEmyG8aNGTTirgGijdsUthUDVwufVBifrmIS100kpJeqV
yc/wSqBikhfiByxQpdf3DCvyMboRz816Gd/YB8J0LuJC5qy4ZK6mZ0NFItn2
tKxeuoq+3AmC+4ej+3KBy+jXiqVuq0cuw3iMNOEoNdbNV2PeEicyIF2okd+6
I5wDOslGsG3WjC8thWXQebK7Cvca3S+il+wHqw+OMf5OkeJ8HOoOxxoMyUhe
rRqub0wiTyXpnTKpbWWhbFuqMRBW+P4DlB+weD5TSKk2pgHcVGOx0sQ7X9Ni
J81ySbqQLGi8DkISbZM1pblio4unCfdGCMOEgw5R9D61Mo/J2WU0aiFhlxQs
oPMNCDcLbO0l9geUSWbaG7Cy5RuwPyUhm03epDWxfC8E3+/rpvVVrbXSL9AF
5A5NGFKdC04LZUQZZIEafYKx+RwUShXugoqNZOzLNLEwKbv2TVQto0r7lh+c
HkjCDBzJroTiZW40norCO7gkpowTTKkSORpS/c/5Za1SDleITcA2NZtCLILp
9mxPH1SFzf0qmWqWCrvMGQ0EurZ1hfQRsmXMqSRvV2IqNlcc/9D78N0+sT6u
/RM5Y2qGxC6h3L62M2XfscyvFVkk+HViC02TkOyKgPPt4UJ0HM7t1crgjshd
hxc+OhBxKKV9gVQjsIli9VYerJaIQk3anFY3IiHTX+P+xn3g2MFego2ILvMl
W6ntw3NChVvZvAsKBPIrzeMY+9/u/vf+ntE67Vw8eDKXSsnsH/ZX90dv6RLS
TeSBPR4oS8QsWTuBGMaRTsMKMI4OCtrN8Y6ccc31WapXqOx4kh41qn3yDb76
DTC25bogyo+JWof7BwdmeHH72twWK0lOIoIA/JbiazR8RCHxjWh6pU90qZJI
amjY0pYgJo1BZr2J0X8AuvjKRh9JMpKWykS5Ceh6seYO1KIRUWgYCSg8jl+N
V2zoGt/vvPK2co9z3E+wrbLlYd9wF/C4OvWW2KstktNKeHXEWTjDLLYhLZTO
BF8JPHkUqpiSTGJJuKQ6IiwOyPwWxG5x6PZOo2SBZSy3rYdKmFsQ6XrEkOSW
pAuxK/vtS9Ih3MpsQSiJWbD1EDEHg/mTdhoq7UnoMDaq299PuNdLUUhJKYg4
Bcc2Qx/lkyRG8ZIwFWsPW4xFC1Gh8+jLfHQSnMRaCE6aozkMXdlj6+eTGCrk
tDoILH6BeQsM16qs+6nQYZnPKgqzVuFZ53JjYEVVjS8hFOWaYd6eb78fjszo
6vXtj4ObC9DAzfXN1Q9DjLB79RN8eWHOrq5/uhm++f7WfH/19vziZmQGl+dy
ia8ub2+Gr+5ur+DTncEIXt/Bb+H/P5mL/7y+uRiNzNWNGb67fjuEEWGKm8Hl
7fBi1OUBhpdnb+/Oh5dvugZGoSDdt8N3w1t49vaqS9M33zVXr/ntdxc3Z9/D
Z4NXw7fD259o5tfD20uc9TVMOzDXg5vb4dnd28GNub67ub4CfQ12yW+fD0dn
bwfDdxfnyB8uYXJz8cPF5a0ZfT94+7a29asfLy9ucCv+lnmcVxew5sGrtxc8
J+z8fHhzcXYLaHLpfjsDkMJK33bN6PribAi/8NsX/3kBGxzc/NSV0UcX/3EH
T8IT5nzwbvAG9ru7GUxyhgArOLazu5uLd7iDq9dmdPdqdDu8vbu9MG+urs7p
GEYXNz8Mzy5GL83bKzyY1+ZudCHrOB/cDmgJMA7AEJ6B31/djYYEzeHl7cXN
zd317fDqcg/w4EeAFKx2AO+fO3S4uqTtA+Subn7C4REudDRd8+P3F/D5DQKa
QDhAsIwAlGe33mMyzg3s6ObW27e5vHjzdvjm4vLsAr+9wqF+HI4u9uA4hyN8
YMhz/zj4Sca4IzDgKcIi+VcP0bt01mb42gzOfxjiLvhhfhkQZTQUpCJYnn0v
h8E35wn89w9SDcjslNU0yfvzneBDjPApKv5UeZ6It55eUNkEextQ5l1N9AJR
YJbeZ62n5wQ3Er09gfEUtP48jdkUJMMAg5nnUzcIyAxafcnvrykV7Rs1pllR
sHo9DSFFk0XxJGeBFPAkVkz1VF1hZYpiJmPszNE3ImFd23+j2QgBNLw49jMZ
bN33vh0Dl7ajpuUd50siJmU9xHFLmfRvrF0KdfE/uSI4LSlY9ddsBcM/6QAO
LVYZuvrjKUvnhgX//0KR7y9/BcHtF1EKQLY63z+gnluH+0/p36P94y62eDvs
GvjgqGuOP75sGZB0j7YBsa8SDTQdP9dmXp8zIK3wL8//2vadgrb+9WQeFcja
Rdz9y8nx8dMTWs4+zLFp1RsmcU1e2r5V5H7pXaSrlp7bghQiRbOgik25+LfD
DQfUIe/Jwa4839XH91SRra1Gnnu59etD/PqX+iOoaRsj+gcByf0JkKuNLJ9/
+50/JuHsDFtCMkz27CyGxfo0Nrsitv/LdzJG+FAwp05iDqgh1QFqPS+9hz/K
7x9NnIJwsmWy33EuCwA6SAUXfrENA1wTr1Y86H0aD0DF+UfigSwoxLb/1mka
G5THN3WXRwdHUVA4pIY0bNvZQucEiktpvxv29Y08ZZGNcdb+0Ltfgt068Lff
6tCCQL0ejWn+ZPZD5HEXoPnuRx3//18GxBVJTmOzQvIzMa3ToK8XpT6hjue1
U/YkhDNbasZw29BG5whPTmCXkYRV8vvNpy0/5aeBu5+pMUPcxUrzeQQxNKIJ
YVM/bvZmWCzHgAH4J1tWDyf/Fe59l60Vm+4uf+tjcR3Nk033mnjl0fNNXxOX
w6/l+yeg4ejKYrEot7QFdm3LeGv4g46t3QRNPS9NAij1HP759tsQpZhzJ8h3
PTEj+auPScx46RlPcnDPfOz4Yz3F5xx83AAtX8DmwjN12af2cL0NCehoGCBH
9CcIJnvBPO57qY/vvve6mn7HtFpG7OqrTSIqdY019IDrsKJzC6197Azy78mh
vSf8evtluQqS+7UfWtYiZ3q4iytUJYC7qVDPVtxSALuN+I3HW+X/RQPt7m3H
XXdAbyk74T5uk4KN7dDo0tF/E/pZ4dBhYIBYbhmtIAuBY9WNjUt4+sklKK63
LWHQAms3lx2H8Jx4tPdR10O+z0My9TSiZQfwzUeyp1+NZG1dAPzyLN+It+GL
MI2JBGAajfH5mPZ/6Ii3YdlvOWIiIJ99xO/Q1uo5p2hQdOvugoo+QQPw/cPe
BijhE7paUZvk55tv8L1WaUp+QoK7Gf4oBuE8AMLDhtQxWxbw5my3rKZxASR1
Z4V9c075vFG9EtPB/8p29l6Gr7IRY3ff//yj+9X6K+HKVHmCS3j4y8Ff/adl
BPskCGIHe3bdigLiXSA8kN//xYpF8kkdL/jMPSHn1ElAUneFo2QtBsjPNonB
X1ljhsNTdp5FtcvOpY4px4ULlm6cMiTiLZPdzr0G5o6hslfKRc6xk7LfmAfx
wOrkvKW/NqVQ/BGc2KE19f7E93O6kgK9Uzv1qdlpeVt++O1T888fTtv+t/vP
H/a2vu78W1vHAMTsbh6FKcL+X7vy24H97dD+Bvf7UwMc2YeP7W8n9rdn2wbw
5Znne11HaXBR9o+DbUPYpw79V576fxx91vvH/isn/h+f3oJr//F8L6AEH31E
reMX3NqDAJOZaOrPRpx22Fx5dQhYRs5YWHJjCJtDVdhnX/YB/x6wTljbDza3
Ds+peS9a7wRWeaFWJxtvwlfcgq+/AV+F/V+F+TWsb39o41XYjPGfGOjIf/wL
sP03YHpA/J9uIP5K8imEuUn824Wqz7gvWkeiHjdt+xFzn2Abb1CFg6TxjMMD
/4H3hHaFNnAUNt1KPn1hPhPrv+LCbb4w/w9gZHf7rd52l5/aB3+XW73tboT4
NkBzBiWy5JMqtu2d7Unb+CiLui1UnsSczQj7OTopgQIQ25pGAJ89DWK7MBQg
tG0PsV0E+gxc/goRarvo83m4/Bnv1wWNAJ8/4/06orch8KcEsIBftSHxpwbw
sbuuyNAPdUuqf/Gx0/z9I+t/fuTS/wCTfDbyJfAAAA==

-->

</rfc>
