Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
April Fools' Day Request for Comments
open-in-new
<h2 id="list-of-april-fools-day-rfcs">List of April Fools' Day RFCs</h2> <h3>1978</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc748">748</a> – TELNET RANDOMLY-LOSE Option,<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> <i>Status Unknown.</i></li></ul> A parody of the <a href="/facts/Internet_protocol_suite/KNkxtSpw">TCP/IP</a> documentation style. For a long time it was specially marked in the RFC index with "note date of issue". <h3>1989</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1097">1097</a> – TELNET SUBLIMINAL-MESSAGE Option,<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> <i>Status Unknown.</i></li></ul> <h3>1990</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1149">1149</a> – A Standard for the Transmission of IP Datagrams on Avian Carriers,<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> <i>Experimental.</i></li></ul> Updated by RFC 2549 in 1999; see below. Describes protocol for transmitting IP packets by <a href="/facts/Homing_pigeon/4oeMCg2q">homing pigeon</a>. In 2001, RFC 1149 was actually implemented<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> by members of the <a href="/facts/Bergen/jqbcAwxm">Bergen</a> <a href="/facts/Linux_User_Group/4rcGkqsr">Linux User Group</a>. See also RFC 6214, as noted below. Describes the adaptation of RFC 1149 for <a href="/facts/IPv6/d4dg7kIL">IPv6</a>. <p class="note">Further information: <a href="/facts/IP_over_Avian_Carriers/SC0JDD1m">IP over Avian Carriers</a></p> <h3>1991</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1216">1216</a> – Gigabit Network Economics and Paradigm Shifts,<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1217">1217</a> – Memo from the Consortium for Slow Commotion Research (CSCR),<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> <i>Informational.</i></li></ul> <h3>1992</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1313">1313</a> – Today's Programming for KRFC AM 1313 Internet Talk Radio,<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> <i>Informational.</i></li></ul> <h3>1993</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1437">1437</a> – The Extension of MIME Content-Types to a New Medium,<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1438">1438</a> – Internet Engineering Task Force Statements Of Boredom (SOBs),<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> <i>Informational.</i></li></ul> <h3>1994</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1605">1605</a> – SONET to Sonnet Translation,<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> <i>Informational.</i></li></ul> Attributed to <a href="/facts/William_Shakespeare/ohI96JTv">William Shakespeare</a>. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1606">1606</a> – A Historical Perspective On The Usage Of IP Version 9,<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1607">1607</a> – A VIEW FROM THE 21ST CENTURY,<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> <i>Informational.</i></li></ul> <h3>1995</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1776">1776</a> – The Address is the Message,<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> <i>Informational.</i></li></ul> <h3>1996</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1924">1924</a> – A Compact Representation of IPv6 Addresses,<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1925">1925</a> – The Twelve Networking Truths,<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1926">1926</a> – An Experimental Encapsulation of IP Datagrams on Top of ATM,<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1927">1927</a> – Suggested Additional MIME Types for Associating Documents,<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> <i>Informational.</i></li></ul> <h3>1997</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2100">2100</a> – The Naming of Hosts,<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> <i>Informational.</i></li></ul> <h3>1998</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2321">2321</a> – RITA -- The Reliable Internetwork Troubleshooting Agent,<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2322">2322</a> – Management of IP numbers by peg-dhcp,<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a> <i>Informational.</i></li></ul> This RFC is not solely for entertainment; the described protocol has regularly been implemented at hacker events in Europe. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2323">2323</a> – IETF Identification and Security Guidelines,<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2324">2324</a> – Hyper Text Coffee Pot Control Protocol (HTCPCP/1.0),<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> <i>Informational.</i> Updated by RFC 7168 in 2014.</li></ul> <p class="note">Further information: <a href="/facts/Hyper_Text_Coffee_Pot_Control_Protocol/kpH4vndE">Hyper Text Coffee Pot Control Protocol</a></p> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2325">2325</a> – Definitions of Managed Objects for Drip-Type Heated Beverage Hardware Devices using SMIv2,<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> <i>Informational.</i></li></ul> <h3>1999</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2549">2549</a> – IP over Avian Carriers with Quality of Service,<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> <i>Informational.</i> Updates RFC 1149.</li></ul> <p class="note">Further information: <a href="/facts/IP_over_Avian_Carriers/SC0JDD1m">IP over Avian Carriers</a></p> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2550">2550</a> – Y10K and Beyond,<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2551">2551</a> – The Roman Standards Process -- Revision III (I April MCMXCIV),<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> <i>Worst Current Practice.</i> Obsoletes MCMXCIX.</li></ul> <h3>2000</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2795">2795</a> – The Infinite Monkey Protocol Suite (IMPS),<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a> <i>Informational.</i></li></ul> Concerning the practicalities of the <a href="/facts/Infinite_monkey_theorem/rE8Rchab">infinite monkey theorem</a>. <h3>2001</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3091">3091</a> – Pi Digit Generation Protocol,<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3092">3092</a> – Etymology of "Foo",<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3093">3093</a> – Firewall Enhancement Protocol (FEP),<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a> <i>Informational.</i></li></ul> <h3>2002</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3251">3251</a> – Electricity over IP,<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a> <i>Informational.</i></li></ul> Parody of "Everything over IP and IP over Everything"<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a> and the <a href="/facts/2000%E2%80%932001_California_electricity_crisis/nyEEbxTw">2000–2001 California electricity crisis</a>. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3252">3252</a> – Binary Lexical Octet Ad-hoc Transport,<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a> <i>Informational.</i></li></ul> <h3>2003</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3514">3514</a> – The Security Flag in the IPv4 Header,<a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a> <i>Informational.</i></li></ul> Proposal for the '<a href="/facts/Evil_bit/hfGx8nTc">evil bit</a>', as an option in the <a href="/facts/IPv4/bnQ5MEqm">IPv4 packet header</a>. Later, this became a synonym for all attempts to seek simple technical solutions for difficult human social problems which require the willing participation of malicious actors. <p class="note">Further information: <a href="/facts/Evil_bit/hfGx8nTc">Evil bit</a></p> <h3>2004</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc3751">3751</a> – Omniscience Protocol Requirements,<a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a> <i>Informational.</i></li></ul> <h3>2005</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc4041">4041</a> – Requirements for Morality Sections in Routing Area Drafts,<a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc4042">4042</a> – UTF-9 and UTF-18 Efficient Transformation Formats of Unicode,<a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a> <i>Informational.</i></li></ul> Notable for containing <a href="/facts/PDP-10/zlfam4wk">PDP-10</a> assembly language code nearly 22 years after the manufacturer ceased production of the PDP-10, and for being technically possible as opposed to many of these other proposals. <ul><li>RFC Draft: "IP over Burrito Carriers"<a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a></li></ul> An <a href="/facts/Internet_protocol/Qq6VeEal">internet protocol</a> recipe, to communicate while eating. <h3>2006</h3> An April 1st RFC was not published this year, but an <a href="//www.ietf.org/mail-archive/web/ietf/current/msg41460.html">announcement on the IETF list</a> about the appointment of the <i><a href="/facts/Sesame_Street/kejrLUeG">Sesame Street</a></i> character <a href="/facts/Bert_(Sesame_Street)/q28UKB85">Bert</a> as member of the IAB appears to have been the April Fools' Day 2006 stunt. <h3>2007</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc4824">4824</a> – The Transmission of IP Datagrams over the Semaphore Flag Signaling System (SFSS),<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a> <i>Informational.</i></li></ul> <p class="note">Further information on its implementation: <a href="/facts/Semaphore_Flag_Signaling_System/05kF0D1m">Semaphore Flag Signaling System</a></p> <p class="note">Further information on competing ways of using flags to convey messages: <a href="/facts/Flag_semaphore/z2Cr5wNd">Flag semaphore</a></p> <h3>2008</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc5241">5241</a> – Naming Rights in IETF Protocols,<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc5242">5242</a> – A Generalized Unified Character Code: Western European and CJK Sections,<a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a> <i>Informational.</i></li></ul> <h3>2009</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc5513">5513</a> – IANA Considerations for Three Letter Acronyms,<a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a> <i>Informational.</i></li> <li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc5514">5514</a> – IPv6 over Social Networks,<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a> <i>Experimental.</i></li></ul> Implemented on <a href="/facts/Facebook/0IhXFR6u">Facebook</a> by the author, in the process of writing the RFC.<a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a> <h3>2010</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc5841">5841</a> – TCP Option to Denote Packet Mood,<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a> <i>Informational.</i></li></ul> <h3>2011</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6214">6214</a> – Adaptation of RFC 1149 for IPv6,<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a> <i>Informational.</i></li></ul> <p class="note">Further information: <a href="/facts/IP_over_Avian_Carriers/SC0JDD1m">IP over Avian Carriers</a></p> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6217">6217</a> – Regional Broadcast Using an Atmospheric Link Layer,<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a> <i>Experimental.</i></li></ul> <h3>2012</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6592">6592</a> – The Null Packet,<a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a> <i>Informational.</i></li></ul> Although mentioned in several networking protocols (like <a href="/facts/MPEG-2/SpuH5FJu">MPEG-2</a>, <a href="/facts/Real-time_Transport_Protocol/YKQK1RK2">RTP</a>, or <a href="/facts/RTP_Control_Protocol/grCfaxxe">RTCP</a>) the Null Packet has never been formally defined. This RFC corrects that omission by providing an empty definiton. Null packets are zero-dimensional, zero length, benign packets (i.e. lacking an <i>Evil bit</i>), that can be quite elusive. Interestingly, the rate at which Null Packets are sent does not increase the bit rate of the Null Packet traffic. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6593">6593</a> – Service Undiscovery Using Hide-and-Go-Seek for the Domain Pseudonym System (DPS),<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a> <i>Informational.</i></li></ul> Most services eagerly choose to be fully visible in the network so users may find them easily (by means of one of the many <a href="/facts/Service_discovery/ffYBWapn">service discovery</a> techniques), but "an apathetic, playful, overwhelmed, or shy service might prefer a hide or hint engagement, instead of directly showing itself." To do so, this RFC introduces a <a href="/facts/Hide-and-seek/HzlmamLw">hide-and-seek</a> paradigm, where the service (the "hider") has the option of several techniques for hiding from the client (in this scenario called "it"). DPS packets are sent over <a href="/facts/Transport_Control_Protocol/WW4sPrt9">TCP</a> with the <i>Mood</i> set to 'Sneaky' (see RFC <a href="https://datatracker.ietf.org/doc/html/rfc5841">5841</a> above) and with their <i>Evil bit</i> set (see RFC <a href="https://datatracker.ietf.org/doc/html/rfc3514">3514</a> above). The latter now ambiguously means "I am not sure" to further enhance the protocol. <h3>2013</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6919">6919</a> – Further Key Words for Use in RFCs to Indicate Requirement Levels,<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a> <i>Experimental.</i></li></ul> Enhances the ability of the RFC's author to also convey intention and purpose in a more informal way, with (in)directive key words, like: "MUST (BUT WE KNOW YOU WON'T)" (when you know beforehand you will be ignored, but to come out morally superior anyway) and "REALLY SHOULD NOT" (when it is to be expected that 'boys will be boys'). <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc6921">6921</a> – Design Considerations for Faster-Than-Light (FTL) Communication,<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a> <i>Informational.</i></li></ul> When it becomes possible to send packets over the Internet <a href="/facts/Faster_than_light/tpFg6JNd">faster than light</a>, they may be received before they are sent (due to <a href="/facts/Time_travel/3rmwahY9">time reversal</a>), which will have major impact on many protocols in use today. With sufficient speed (and corresponding negative time shift), a complete communication may have taken place before it even has started. The RFC reviews the design principles of those protocols, to prevent future breakdown of communication. Most likely, we should have started upgrading them yesterday. <p class="note">Further information on what in this case would be called 'Backward Error Correction': <a href="/facts/Forward_Error_Correction/cLUTUJrA">Forward Error Correction</a></p> <p class="note">Further information on another approach to this immanent disaster (predicting packets rather than implementing time resilience): April Fools' Day Request for Comments § 2024</p> <h3>2014</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc7168">7168</a> – The Hyper Text Coffee Pot Control Protocol for Tea Efflux Appliances (HTCPCP-TEA),<a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a> <i>Informational.</i></li></ul> Updates <a href="/facts/RFC_(identifier)/esftTvE7">RFC</a> <a href="https://datatracker.ietf.org/doc/html/rfc2324">2324</a> for <a href="/facts/Coffee_machine/8PwCovmD">coffee machines</a> which are also capable of brewing <a href="/facts/Tea/oDQhcyrc">tea</a>. Also defines the <a href="/facts/HTTP_response_code/nTtX2f6r">HTTP response code</a> <i>418 I'm a Teapot</i>, for <a href="/facts/Teapot/WILqD30M">teapots</a> to use when unable to brew <a href="/facts/Coffee/Q4Ko2C7I">coffee</a>. <p class="note">Further information: <a href="/facts/Hyper_Text_Coffee_Pot_Control_Protocol/kpH4vndE">Hyper Text Coffee Pot Control Protocol</a></p> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc7169">7169</a> – The NSA (No Secrecy Afforded) Certificate Extension,<a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a> <i>Informational.</i></li></ul> Although generally unwanted, <a href="/facts/Private_key/gowoFTxS">private key</a> counterparts of <a href="/facts/X509/rs0JuYDd">X509</a> <a href="/facts/Digital_certificate/J7aYI4Bx">digital certificates</a> may have been or have been shared with a third party, for <a href="/facts/Lawful_interception/343rdrtm">lawful interception</a> or other reasons. Users may now be notified of this fact with a new certificate extension, specifying the <a href="/facts/Boolean/r8j1Mh4m">boolean</a> value ext-KeyUsage. When 'true', the private key has been shared; when 'false', the signer abstains from commenting on whether or not sharing has taken place. <h3>2015</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc7511">7511</a> – Scenic Routing for IPv6,<a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a> <i>Experimental.</i></li></ul> <a href="/facts/Green_computing/SpV1lJg2">Green IT</a> has become increasingly important. In a <a href="/facts/Win-win/IsC7dYtU">win-win</a> proposition, for packets and the environment alike, this RFC defines a way to allow packets to be <a href="/facts/Routing/Ml6MVCaC">routed</a> through the air, to get as much sunlight and fresh air possible. Sending packets over <a href="/facts/Wi-Fi/u94quCsx">Wi-Fi</a> or by <a href="/facts/IP_over_avian_carriers/SC0JDD1m">pidgeons</a> will help them escape their torturous routine of assembly and disassembly, and being shot through dark <a href="/facts/Fiber_optics/5ruuIFbj">fibers</a> and <a href="/facts/Ethernet/nMfhU8tU">copper cables</a> all the time. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc7514">7514</a> – Really Explicit Congestion Notification (RECN),<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a> <i>Experimental.</i></li></ul> In an approach similar to the now deprecated <a href="/facts/Internet_control_message_protocol/VnrV56J0">ICMP</a> <a href="/facts/Internet_control_message_protocol/VnrV56J0">Source Quench</a>, it reuses that packet's 'Type' field (4) to tell the sender (really more explicitly than <a href="/facts/Explicit_congestion_notification/VKfVXcKp">ECN</a>) to shut up. The user responsible for the traffic MUST be made aware of the contents of an RECN message by means of <a href="/facts/Speech_synthesis/ceTczTv9">text-to-speech</a>, or <a href="/facts/Modal_window/5rLMlDJS">pop-ups</a> if the audio channel is muted. <h3>2016</h3> An April 1st RFC was not published this year.<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a> <h3>2017</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8135">8135</a> – Complex Addressing in IPv6,<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a> <i>Experimental.</i></li></ul> Takes a rather mathematical approach to use the 128-bit <a href="/facts/IPv6_address/azLG1gJy">IPv6 address</a> space in other ways than the traditional one, to ultimately arrive at Complex Addresses. You may use the imaginary part of a <a href="/facts/Complex_number/2w7mqI7e">complex</a> address (with <a href="/facts/Spherical_coordinate_system/5cVnNof3">polar coordinates</a> as the real part) to reach <a href="/facts/Santa_Claus/9hg3kDdD">Santa Claus</a>, for example. It also proposes to use Flying Addresses for end hosts using <a href="/facts/IP_over_avian_carriers/SC0JDD1m">IP over avian carriers</a>. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8136">8136</a> – Additional Transition Functionality for IPv6,<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a> <i>Informational.</i></li></ul> As the <a href="/facts/Internet_Architecture_Board/JV2M6FNP">Internet Architecture Board</a> intends to relax requirements for compatibility with <a href="/facts/IPv4/bnQ5MEqm">IPv4</a> for new or extended protocols, this RFC helps the adoption of <a href="/facts/IPv6/d4dg7kIL">IPv6</a> by setting the <a href="/facts/Evil_bit/hfGx8nTc">evil bit</a> for all IPv4 packets to 1, making sure that <a href="/facts/Dual_stack/d4dg7kIL">dual stack</a> hosts will favor IPv6, as will the <a href="/facts/Happy_Eyeballs/gJ7zMUqD">Happy Eyeballs</a> algorithm. To maintain functional equivalence between IPv4 and IPv6, the 'security flag' of <a href="/facts/RFC_(identifier)/esftTvE7">RFC</a> <a href="https://datatracker.ietf.org/doc/html/rfc3514">3514</a> should be included in the <a href="/facts/IPv6_packet/afCKKH3o">IPv6 header</a>. Advanced security options may be specified in a new <a href="/facts/IPv6_header/afCKKH3o">hop-by-hop</a> option header. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8140">8140</a> – The Arte of ASCII: Or, An True and Accurate Representation of an Menagerie of Thynges Fabulous and Wonderful in Ye Forme of Character,<a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a> <i>Informational.</i></li></ul> <a href="/facts/ASCII_art/TmgLtCg5">ASCII art</a> in its most splendid form. Depicts and annotates <a href="/facts/Fruit_bat/a12Daucy">fruit bats</a>, the <a href="/facts/Loch_Ness_monster/k3w54kE5">Loch Ness monster</a>, some fundamental <a href="/facts/Bauhaus/v2sWtxcj">Bauhaus</a> elements, and even a flock of <a href="/facts/IP_over_avian_carriers/SC0JDD1m">avian carriers</a>. <h3>2018</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8367">8367</a> – Wrongful Termination of Internet Protocol (IP) Packets,<a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a> <i>Informational.</i></li></ul> A heartfelt cry to end packet discrimination at the IP level, where they frequently (even in this day and age) are terminated prematurely, based on color,<a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a> <a href="/facts/Jumbo_frame/b4CGn6fM">length</a>, <a href="/facts/Time_to_live/CMFdghQh">age</a>, etcetera, or even by <a href="/facts/IP_protocol/Qq6VeEal">IP version</a>! <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8369">8369</a> – Internationalizing IPv6 Using 128-Bit Unicode,<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a> <i>Informational.</i></li></ul> Proposes to use 128-bit <a href="/facts/Unicode/DDu3MfPV">Unicode</a> to facilitate internationalization of <a href="/facts/IPv6/d4dg7kIL">IPv6</a>, since the 1.114.112 code points of the current implementation of Unicode is deemed insufficient for the future. <a href="/facts/IPv6_address/azLG1gJy">IPv6 addresses</a> may be represented by a single U+128 <a href="/facts/Glyph/A7Gesbxj">glyph</a>, to reduce stress on the eyes of network administrators. If implemented, it would obsolete <a href="/facts/RFC_(identifier)/esftTvE7">RFC</a> <a href="https://datatracker.ietf.org/doc/html/rfc8135">8135</a>, because "[i]t was found to be too complex to implement anyway". <h3>2019</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8565">8565</a> – Hypertext Jeopardy Protocol (HTJP/1.0),<a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a> <i>Informational.</i></li></ul> A 'response/request' protocol similar to <a href="/facts/HTTP/1.1/TWtvf7JD">HTTP/1.1</a> but where clients send a response to the server (e.g. "Hello World. My payload includes a trailing CRLF.") to which the server answers with a request (e.g. GET /hello.txt), like in the <a href="/facts/Jeopardy!/4H3SPzUJ">Jeopardy!</a> game. The Hypertext Double Jeopardy Protocol (HTJ2P) (described in Appendix A) inverses the semantics of HTJP again. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8567">8567</a> – Customer Management DNS Resource Records,<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a> <i>Informational.</i></li></ul> The authors contend that the <a href="/facts/Domain_name_system/rfxdWFsj">DNS</a> (secured with <a href="/facts/DNSSEC/cL9zwhjj">DNSSEC</a>) is most suited to globally and reliably provide information to help maintain a high <a href="/facts/Quality_of_experience/dUMWL0QJ">quality of experience</a> for <a href="/facts/Customer_premises_equipment/dVGqvkWL">CPE</a> (among others). With the definition of four new DNS <a href="/facts/Domain_name_system/rfxdWFsj">RR</a> types (<a href="/facts/Password/WEoul230">password</a>, <a href="/facts/Credit_card_number/g9C3edYe">credit card number</a>, <a href="/facts/Social_security_number/MPmrfRg2">social security number</a>, and an SSN <a href="/facts/Reverse_DNS_lookup/b5qL5mN1">pointer record</a>) they hope to create end-to-end, holistic network management. <h3>2020</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8771">8771</a> – The Internationalized Deliberately Unreadable Network NOtation (I-DUNNO),<a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a> <i>Experimental.</i></li></ul> A proposal to use <a href="/facts/UTF-8/xlaVHSyf">UTF-8</a> to obfuscate (and help replace) textual <a href="/facts/IP_address/z9V22Sw9">IP addresses</a>, to coerce a small minority of people to use the <a href="/facts/Domain_Name_System/rfxdWFsj">DNS</a> instead of sticking to (and mixing up) plain IP addresses. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8774">8774</a> – The Quantum Bug,<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a> <i>Informational.</i></li></ul> Dismisses <a href="/facts/RFC_(identifier)/esftTvE7">RFC</a> <a href="https://datatracker.ietf.org/doc/html/rfc6921">6921</a> with the notion that considering time travel for <a href="/facts/Faster-than-light/tpFg6JNd">faster-than-light</a> packet delivery is "amusing" but impossible as a concept. Instead, it focuses on real life <a href="/facts/Quantum_entanglement/afzslwN0">quantum entanglement</a> in relation to <a href="/facts/Network_packet/xCYf8SJu">packet</a> <a href="/facts/Round_trip_time/jYgNMK98">round trip times</a>, which (depending on the observer) could reach zero. This may cause havoc among several protocols, which should be fixed "in time" before things break. <h3>2021</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc8962">8962</a> – Establishing the Protocol Police,<a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a> <i>Informational.</i></li></ul> Since the <a href="/facts/Internet_Engineering_Task_Force/tIcCsFhX">Internet Engineering Task Force</a> claims it "is not the Protocol Police", it is formally established here. It polices various aspects of protocol definitions laid out by the RFC series, and enforces adherence to them. They are sanctioned to access <a href="/facts/Walled_garden_(technology)/pYUdItSd">walled gardens</a> and may even resort to traffic imprisonment. By the way: if you are interested in joining the Protocol Police, contact your <a href="/facts/Localhost/an0qLQq8">localhost</a>. <h3>2022</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9225">9225</a> – Software Defects Considered Harmful,<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a> <i>Informational.</i></li></ul> Discourages the practice of introducing <a href="/facts/Bug_(software)/I1uSXySv">software defects</a>, to reduce costs and lessen security impacts. By introducing some <a href="/facts/Best_current_practice/RUQJ4Nn6">best current practices</a> the authors hope to get rid of them: "Authors MUST NOT implement bugs. If bugs are introduced in code, they MUST be clearly documented." <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9226">9226</a> – Bioctal: Hexadecimal 2.0,<a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a> <i>Experimental.</i></li></ul> Known problems with <a href="/facts/Hexadecimal/02ohQW22">hexadecimal</a> representation of numbers can be avoided by replacing its <a href="/facts/Alphabet/vqfRpS3E">alphabet</a> of 0-9 and A-F with two <a href="/facts/Octal/4nRcq0Ce">octal</a> ranges: 0-7 and the letters 'cjzwfsbv' (to represent values 8-15 in a bitwise elegant way). <h3>2023</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9401">9401</a> – The Addition of the Death (DTH) Flag to TCP,<a class="footnote-ref" id="fnref:70" href="#fn:70"><sup>70</sup></a> <i>Informational.</i></li></ul> As is customary in <a href="/facts/Light_novel/cFCd55HW">light novels</a>, a 'death flag' indicates the increased likelihood of a swift demise of the character. Transferred to <a href="/facts/Transmission_Control_Protocol/WW4sPrt9">TCP</a>, the DTH flag in the <a href="/facts/Header_(computing)/DSbn3tM1">packet header</a> could lead to smoother and more attractive session narratives. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9402">9402</a> – Concat Notation,<a class="footnote-ref" id="fnref:71" href="#fn:71"><sup>71</sup></a> <i>Informational.</i></li></ul> Finally, a formalized way (with a <a href="/facts/Augmented_Backus%E2%80%93Naur_form/coNbJGD2">ABNF</a> <a href="/facts/Grammar/vprQsHIR">grammar</a> description) to properly describe the interaction between <a href="/facts/Cat/82d0y6D5">cats</a> and <a href="/facts/Container/yDfwMWvW">containers</a>, including the occasional ball of <a href="/facts/Yarn/fhMTsWg2">yarn</a>. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9405">9405</a> – AI Sarcasm Detection: Insult Your AI without Offending It,<a class="footnote-ref" id="fnref:72" href="#fn:72"><sup>72</sup></a> <i>Informational.</i></li></ul> The AI Sarcasm Detection Protocol (ASDP) is a <a href="/facts/Software_framework/EWasA8sG">framework</a> for detecting <a href="/facts/Sarcasm/QY2zXJ5X">sarcasm</a> in <a href="/facts/Artificial_intelligence/lJGauQwX">AI systems</a> (written with the help of <a href="/facts/ChatGPT/ptB1y6J5">ChatGPT</a>). Detecting sarcasm may help improve AI - human intercommunication. <h3>2024</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9564">9564</a> – Faster Than Light Speed Protocol (FLIP),<a class="footnote-ref" id="fnref:73" href="#fn:73"><sup>73</sup></a> <i>Informational.</i></li></ul> The recent advances in artificial intelligence (AI) such as large language models enable the design of the Faster than Light speed Protocol (FLIP) for Internet. FLIP provides a way to avoid congestion, enhance security, and deliver faster packets on the Internet by using AI to predict future packets at the receiving peer before they arrive. This document describes the protocol, its various encapsulations, and some operational considerations. <h3>2025</h3> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc9759">9759</a> – Unified Time Scaling for Temporal Coordination Frameworks,<a class="footnote-ref" id="fnref:74" href="#fn:74"><sup>74</sup></a> <i>Informational.</i></li></ul> Estimating time requirements for tasks, both critical and mundane, remains a challenge in engineering, business, and everyday communication. Existing models fail due to inherent unpredictability and inconsistencies in human estimation. This document introduces the Two-Week Principle (TWP), a novel, universally adaptable time scale that seeks to standardize all temporal references to a singular, uniform duration. TWP ensures clarity, predictability, and synchronization across all sectors that rely on time-based scheduling. <h2 id="other-humorous-rfcs">Other humorous RFCs</h2> <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc439">439</a> – PARRY Encounters the DOCTOR,<a class="footnote-ref" id="fnref:75" href="#fn:75"><sup>75</sup></a> <i>Status Unknown.</i></li></ul> Transcript of a talk of the <a href="/facts/Schizophrenic/FMP4lQ57">schizophrenic</a> <a href="/facts/Chatbot/kASkMjs7">chatbot</a> <a href="/facts/PARRY/PwDRceo7">PARRY</a> with the <a href="/facts/Computer_simulation/Re6o8vzN">computer simulated</a> <a href="/facts/Psychiatrist/hS7EnAU6">psychiatrist</a> <a href="/facts/ELIZA/e2Frdz7f">ELIZA</a> (a.k.a 'The Doctor') which both fail the <a href="/facts/Turing_test/wEvf9DIr">Turing test</a> with flying colours. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc527">527</a> – ARPAWOCKY,<a class="footnote-ref" id="fnref:76" href="#fn:76"><sup>76</sup></a> <i>Status Unknown.</i></li></ul> A very '<a href="/facts/Advanced_Research_Projects_Agency/Uf9sarhT">ARPA</a>-ish' parody of <a href="/facts/Lewis_Caroll/UnDExrlu">Lewis Caroll</a>'s <a href="/facts/Nonsense_poem/KcxgWPeg">nonsense poem</a> '<a href="/facts/Jabberwocky/5IUuQ2k3">Jabberwocky</a>'. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc968">968</a> – 'Twas the Night Before Start-up',<a class="footnote-ref" id="fnref:77" href="#fn:77"><sup>77</sup></a> <i>Status Unknown.</i></li></ul> A <a href="/facts/Poem/ylGarm6p">poem</a> that discusses problems that arise, and debugging techniques used, in bringing a new network into operation. It shows that <a href="/facts/Array_index/BKGvF8AM">array indexing</a> is problematic since the olden days. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc1882">1882</a> – The 12-Days of Technology Before Christmas,<a class="footnote-ref" id="fnref:78" href="#fn:78"><sup>78</sup></a> <i>Informational.</i></li></ul> A parody of the <a href="/facts/Christmas_carol/1pV7tEC2">Christmas carol</a> '<a href="/facts/The_Twelve_Days_of_Christmas_(song)/erHou1SX">The Twelve Days of Christmas</a>', where computer problems pile up and the IT staff is swamped, like on a regular day. <ul><li>RFC <a href="https://datatracker.ietf.org/doc/html/rfc2410">2410</a> – The NULL Encryption Algorithm and Its Use With IPsec,<a class="footnote-ref" id="fnref:79" href="#fn:79"><sup>79</sup></a> <i>Proposed Standard.</i></li></ul> Introducing the <a href="/facts/Null_function/jkyTCIfk">NULL encryption algorithm</a>, <a href="/facts/Mathematics/pxTouaz4">mathematically</a> defined as the <a href="/facts/Identity_function/9AtsP0LC">Identity function</a>: <i>NULL</i>(<i>b</i>) = <i>I</i>(<i>b</i>) = <i>b</i>, provides the means for <a href="/facts/Encapsulating_Security_Payload/01MwcET1">Encapsulating Security Payload</a> to provide <a href="/facts/Authentication/64y4S69b">authentication</a> and <a href="/facts/Integrity/2JwWgnvN">integrity</a>, but without <a href="/facts/Confidentiality/JFMubsQm">confidentiality</a>. <h2 id="submission-of-april-fools-day-rfcs">Submission of April Fools' Day RFCs</h2> <p>The RFC Editor accepts submission of properly formatted April Fools' Day RFCs from the general public, and considers them for publication in the same year if received at least two weeks prior to April 1st.<a class="footnote-ref" id="fnref:80" href="#fn:80"><sup>80</sup></a><a class="footnote-ref" id="fnref:81" href="#fn:81"><sup>81</sup></a> This practice of publishing April Fool's Day RFCs is specifically acknowledged in the instructions memo for RFC authors, with a tongue-in-cheek note saying: "Note that in past years the RFC Editor has sometimes published serious documents with April 1 dates. Readers who cannot distinguish satire by reading the text may have a future in marketing."<a class="footnote-ref" id="fnref:82" href="#fn:82"><sup>82</sup></a> </p> <h2 id="further-reading">Further reading</h2> <ul><li><a href="//www.rfc-editor.org/">RFC Editor home page</a> – hosts individual RFCs</li></ul> <h2 id="external-links">External links</h2> <ul><li>Marsan, Carolyn Duffy (April 1, 2005). <a href="https://www2.cio.co.nz/article/129195/yet_another_foolish_network_protocol/">"Yet Another Foolish Network Protocol"</a>. <i>Network World</i> – on RFC 3751 and April Fools' Day RFCs in general.</li> <li>Limoncelli, Thomas A.; Peter H. Salus (2007). <i>The Complete April Fools' Day RFCs</i>. Peer-to-Peer Communications. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-57398-042-5.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>M. Crispin (1 April 1978). TELNET RANDOMLY-LOSE Option. IETF. doi:10.17487/RFC0748. RFC 748. Status Unknown. <a href="/wiki/Mark_Crispin" target="_blank">/wiki/Mark_Crispin</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>B. Miller (1 April 1989). TELNET SUBLIMINAL-MESSAGE Option. Network Working Group. doi:10.17487/RFC1097. RFC 1097. Status Unknown. <a href="https://datatracker.ietf.org/doc/html/rfc1097" target="_blank">https://datatracker.ietf.org/doc/html/rfc1097</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>D. Waitzman (1 April 1990). A Standard for the Transmission of IP Datagrams on Avian Carriers. Network Working Group. doi:10.17487/RFC1149. RFC 1149. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc1149" target="_blank">https://datatracker.ietf.org/doc/html/rfc1149</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"RFC 1149 implemented". Blug.linux.no. Archived from the original on 2011-10-04. Retrieved 2012-03-18. <a href="https://web.archive.org/web/20111004221306/http://www.blug.linux.no/rfc1149/" target="_blank">https://web.archive.org/web/20111004221306/http://www.blug.linux.no/rfc1149/</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Poorer Richard; Prof. Kynikos (1 April 1991). Gigabit Network Economics and Paradigm Shifts. Network Working Group. doi:10.17487/RFC1216. RFC 1216. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1216" target="_blank">https://datatracker.ietf.org/doc/html/rfc1216</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>V. Cerf (1 April 1991). Memo from the Consortium for Slow Commotion Research (CSCR). Network Working Group. doi:10.17487/RFC1217. RFC 1217. Informational. <a href="/wiki/Vint_Cerf" target="_blank">/wiki/Vint_Cerf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>C. Partridge (1 April 1992). Today's Programming for KRFC AM 1313 Internet Talk Radio. Network Working Group. doi:10.17487/RFC1313. RFC 1313. Informational. <a href="/wiki/Craig_Partridge" target="_blank">/wiki/Craig_Partridge</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>N. Borenstein; M. Linimon (1 April 1993). The Extension of MIME Content-Types to a New Medium. Network Working Group. doi:10.17487/RFC1437. RFC 1437. Informational. <a href="/wiki/Nathaniel_Borenstein" target="_blank">/wiki/Nathaniel_Borenstein</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>L. Chapin; C. Huitema (1 April 1993). Internet Engineering Task Force Statements Of Boredom (SOBs). Network Working Group. doi:10.17487/RFC1438. RFC 1438. Informational. <a href="/wiki/Christian_Huitema" target="_blank">/wiki/Christian_Huitema</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>W. Shakespeare (1 April 1994). SONET to Sonnet Translation. Network Working Group. doi:10.17487/RFC1605. RFC 1605. Informational. <a href="/wiki/William_Shakespeare" target="_blank">/wiki/William_Shakespeare</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>J. Onions (1 April 1994). A Historical Perspective On The Usage Of IP Version 9. Network Working Group. doi:10.17487/RFC1606. RFC 1606. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1606" target="_blank">https://datatracker.ietf.org/doc/html/rfc1606</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>V. Cerf (1 April 1994). A VIEW FROM THE 21ST CENTURY. Network Working Group. doi:10.17487/RFC1607. RFC 1607. Informational. <a href="/wiki/Vint_Cerf" target="_blank">/wiki/Vint_Cerf</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>S. Crocker (1 April 1995). The Address is the Message. Network Working Group. doi:10.17487/RFC1776. RFC 1776. Informational. <a href="/wiki/Steve_Crocker" target="_blank">/wiki/Steve_Crocker</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>R. Elz (1 April 1996). A Compact Representation of IPv6 Addresses. Network Working Group. doi:10.17487/RFC1924. RFC 1924. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1924" target="_blank">https://datatracker.ietf.org/doc/html/rfc1924</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>R. Callon, ed. (1 April 1996). The Twelve Networking Truths. Network Working Group. doi:10.17487/RFC1925. RFC 1925. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1925" target="_blank">https://datatracker.ietf.org/doc/html/rfc1925</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>J. Eriksson (1 April 1996). An Experimental Encapsulation of IP Datagrams on Top of ATM. Network Working Group. doi:10.17487/RFC1926. RFC 1926. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1926" target="_blank">https://datatracker.ietf.org/doc/html/rfc1926</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>C. Rogers (1 April 1996). Suggested Additional MIME Types for Associating Documents. Network Working Group. doi:10.17487/RFC1927. RFC 1927. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1927" target="_blank">https://datatracker.ietf.org/doc/html/rfc1927</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>J. Ashworth (1 April 1997). The Naming of Hosts. Network Working Group. doi:10.17487/RFC2100. RFC 2100. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2100" target="_blank">https://datatracker.ietf.org/doc/html/rfc2100</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>A. Bressen (1 April 1998). RITA -- The Reliable Internetwork Troubleshooting Agent. Network Working Group. doi:10.17487/RFC2321. RFC 2321. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2321" target="_blank">https://datatracker.ietf.org/doc/html/rfc2321</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>K. van den Hout; A. Koopal; R. van Mook (1 April 1998). Management of IP numbers by peg-dhcp. Network Working Group. doi:10.17487/RFC2322. RFC 2322. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2322" target="_blank">https://datatracker.ietf.org/doc/html/rfc2322</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>A. Ramos (1 April 1998). IETF Identification and Security Guidelines. Network Working Group. doi:10.17487/RFC2323. RFC 2323. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2323" target="_blank">https://datatracker.ietf.org/doc/html/rfc2323</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>L. Masinter (1 April 1998). Hyper Text Coffee Pot Control Protocol (HTCPCP/1.0). Network Working Group. doi:10.17487/RFC2324. RFC 2324. Informational. <a href="/wiki/Larry_Masinter" target="_blank">/wiki/Larry_Masinter</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>M. Slavitch (1 April 1998). Definitions of Managed Objects for Drip-Type Heated Beverage Hardware Devices using SMIv2. Network Working Group. doi:10.17487/RFC2325. RFC 2325. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2325" target="_blank">https://datatracker.ietf.org/doc/html/rfc2325</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>D. Waitzman (1 April 1999). IP over Avian Carriers with Quality of Service. Network Working Group. doi:10.17487/RFC2549. RFC 2549. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2549" target="_blank">https://datatracker.ietf.org/doc/html/rfc2549</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>S. Glassman; M. Manasse; J. Mogul (1 April 1999). Y10K and Beyond. Network Working Group. doi:10.17487/RFC2550. RFC 2550. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2550" target="_blank">https://datatracker.ietf.org/doc/html/rfc2550</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>S. Bradner (1 April 1999). The Roman Standards Process -- Revision III (I April MCMXCIV). Network Working Group. doi:10.17487/RFC2551. RFC 2551. Worst Current Practice. <a href="/wiki/Scott_Bradner" target="_blank">/wiki/Scott_Bradner</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>S. Christey (1 April 2000). The Infinite Monkey Protocol Suite (IMPS). Network Working Group. doi:10.17487/RFC2795. RFC 2795. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc2795" target="_blank">https://datatracker.ietf.org/doc/html/rfc2795</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>H. Kennedy (1 April 2001). Pi Digit Generation Protocol. Network Working Group. doi:10.17487/RFC3091. RFC 3091. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc3091" target="_blank">https://datatracker.ietf.org/doc/html/rfc3091</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>D. Eastlake, 3rd; C. Manros; E. Raymond (1 April 2001). Etymology of "Foo". Network Working Group. doi:10.17487/RFC3092. RFC 3092. Informational. <a href="/wiki/Eric_S._Raymond" target="_blank">/wiki/Eric_S._Raymond</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>M. Gaynor; S. Bradner (1 April 2001). Firewall Enhancement Protocol (FEP). Network Working Group. doi:10.17487/RFC3093. RFC 3093. Informational. <a href="/wiki/Scott_Bradner" target="_blank">/wiki/Scott_Bradner</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>B. Rajagopalan (1 April 2002). Electricity over IP. Network Working Group. doi:10.17487/RFC3251. RFC 3251. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc3251" target="_blank">https://datatracker.ietf.org/doc/html/rfc3251</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>D. Thaler; B. Aboba (July 2008). What Makes for a Successful Protocol?. Network Working Group. doi:10.17487/RFC5218. RFC 5218. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc5218" target="_blank">https://datatracker.ietf.org/doc/html/rfc5218</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>H. Kennedy (1 April 2002). Binary Lexical Octet Ad-hoc Transport. Network Working Group. doi:10.17487/RFC3252. RFC 3252. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc3252" target="_blank">https://datatracker.ietf.org/doc/html/rfc3252</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>S. Bellovin (1 April 2003). The Security Flag in the IPv4 Header. Network Working Group. doi:10.17487/RFC3514. RFC 3514. Informational. <a href="/wiki/Steven_M._Bellovin" target="_blank">/wiki/Steven_M._Bellovin</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>S. Bradner (1 April 2004). Omniscience Protocol Requirements. Network Working Group. doi:10.17487/RFC3751. RFC 3751. Informational. <a href="/wiki/Scott_Bradner" target="_blank">/wiki/Scott_Bradner</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>A. Farrel (1 April 2005). Requirements for Morality Sections in Routing Area Drafts. Network Working Group. doi:10.17487/RFC4041. RFC 4041. Informational. <a href="/wiki/Adrian_Farrel" target="_blank">/wiki/Adrian_Farrel</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>M. Crispin (1 April 2005). UTF-9 and UTF-18 Efficient Transformation Formats of Unicode. Network Working Group. doi:10.17487/RFC4042. RFC 4042. Informational. <a href="/wiki/Mark_Crispin" target="_blank">/wiki/Mark_Crispin</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>M. Schulze; W. Lohsen (1 April 2005). IP over Burrito Carriers. Internet Engineering Task Force. I-D draft-lohsen-ip-burrito-00. <a href="https://datatracker.ietf.org/doc/html/draft-lohsen-ip-burrito-00" target="_blank">https://datatracker.ietf.org/doc/html/draft-lohsen-ip-burrito-00</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>J. Hofmueller; A. Bachmann; IO. zmoelnig, eds. (1 April 2007). The Transmission of IP Datagrams over the Semaphore Flag Signaling System (SFSS). Network Working Group. doi:10.17487/RFC4824. RFC 4824. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc4824" target="_blank">https://datatracker.ietf.org/doc/html/rfc4824</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>A. Falk; S. Bradner (1 April 2008). Naming Rights in IETF Protocols. Network Working Group. doi:10.17487/RFC5241. RFC 5241. Informational. <a href="/wiki/Scott_Bradner" target="_blank">/wiki/Scott_Bradner</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>J. Klensin; H. Alvestrand (1 April 2008). A Generalized Unified Character Code: Western European and CJK Sections. Network Working Group. doi:10.17487/RFC5242. RFC 5242. Informational. <a href="/wiki/John_Klensin" target="_blank">/wiki/John_Klensin</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>A. Farrel (1 April 2009). IANA Considerations for Three Letter Acronyms. Network Working Group. doi:10.17487/RFC5513. RFC 5513. Informational. <a href="/wiki/Adrian_Farrel" target="_blank">/wiki/Adrian_Farrel</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>E. Vyncke (1 April 2009). IPv6 over Social Networks. Network Working Group. doi:10.17487/RFC5514. RFC 5514. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc5514" target="_blank">https://datatracker.ietf.org/doc/html/rfc5514</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>E. Vyncke. "IPv6 over the Facebook Social Network". <a href="//tools.ietf.org/html/rfc5514#ref-IPv6overFacebook" target="_blank">//tools.ietf.org/html/rfc5514#ref-IPv6overFacebook</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>R. Hay; W. Turkal (1 April 2010). TCP Option to Denote Packet Mood. Independent Submission. doi:10.17487/RFC5841. ISSN 2070-1721. RFC 5841. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc5841" target="_blank">https://datatracker.ietf.org/doc/html/rfc5841</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>B. Carpenter; R. Hinden (1 April 2011). Adaptation of RFC 1149 for IPv6. Internet Engineering Task Force. doi:10.17487/RFC6214. ISSN 2070-1721. RFC 6214. Informational. <a href="/wiki/Brian_Carpenter_(engineer)" target="_blank">/wiki/Brian_Carpenter_(engineer)</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>T. Ritter (1 April 2011). Regional Broadcast Using an Atmospheric Link Layer. Independent Submission. doi:10.17487/RFC6217. ISSN 2070-1721. RFC 6217. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc6217" target="_blank">https://datatracker.ietf.org/doc/html/rfc6217</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>C. Pignataro (1 April 2012). The Null Packet. Independent Submission. doi:10.17487/RFC6592. ISSN 2070-1721. RFC 6592. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc6592" target="_blank">https://datatracker.ietf.org/doc/html/rfc6592</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>C. Pignataro; J. Clarke; G. Salgueiro (1 April 2012). Service Undiscovery Using Hide-and-Go-Seek for the Domain Pseudonym System (DPS). Independent Submission. doi:10.17487/RFC6593. ISSN 2070-1721. RFC 6593. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc6593" target="_blank">https://datatracker.ietf.org/doc/html/rfc6593</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>R. Barnes; S. Kent; E. Rescorla (1 April 2013). Further Key Words for Use in RFCs to Indicate Requirement Levels. Independent Submission. doi:10.17487/RFC6919. ISSN 2070-1721. RFC 6919. Experimental. <a href="/wiki/Stephen_Kent_(network_security)" target="_blank">/wiki/Stephen_Kent_(network_security)</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>R. Hinden (1 April 2013). Design Considerations for Faster-Than-Light (FTL) Communication. Independent Submission. doi:10.17487/RFC6921. ISSN 2070-1721. RFC 6921. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc6921" target="_blank">https://datatracker.ietf.org/doc/html/rfc6921</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>I. Nazar (1 April 2014). The Hyper Text Coffee Pot Control Protocol for Tea Efflux Appliances (HTCPCP-TEA). Independent Submission. doi:10.17487/RFC7168. ISSN 2070-1721. RFC 7168. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc7168" target="_blank">https://datatracker.ietf.org/doc/html/rfc7168</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>S. Turner (1 April 2014). The NSA (No Secrecy Afforded) Certificate Extension. Independent Submission. doi:10.17487/RFC7169. ISSN 2070-1721. RFC 7169. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc7169" target="_blank">https://datatracker.ietf.org/doc/html/rfc7169</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>M. Wilhelm (1 April 2015). Scenic Routing for IPv6. Independent Submission. doi:10.17487/RFC7511. ISSN 2070-1721. RFC 7511. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc7511" target="_blank">https://datatracker.ietf.org/doc/html/rfc7511</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>M. Luckie (1 April 2015). Really Explicit Congestion Notification (RECN). Independent Submission. doi:10.17487/RFC7514. ISSN 2070-1721. RFC 7514. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc7514" target="_blank">https://datatracker.ietf.org/doc/html/rfc7514</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>Flanagan, Heather (2 April 2016). "hey, guys, where 1 april 2016 RFC. Ups..." rfc-i (Mailing list). <a href="https://mailarchive.ietf.org/arch/msg/rfc-interest/xaHiBCRy26Q9V4-6xL2aHtqY0e8/" target="_blank">https://mailarchive.ietf.org/arch/msg/rfc-interest/xaHiBCRy26Q9V4-6xL2aHtqY0e8/</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>M. Danielson; M. Nilsson (1 April 2017). Complex Addressing in IPv6. Independent Submission. doi:10.17487/RFC8135. ISSN 2070-1721. RFC 8135. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc8135" target="_blank">https://datatracker.ietf.org/doc/html/rfc8135</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>B. Carpenter; R. Hinden (1 April 2017). Additional Transition Functionality for IPv6. Independent Submission. doi:10.17487/RFC8136. ISSN 2070-1721. RFC 8136. Informational. <a href="/wiki/Brian_Carpenter_(engineer)" target="_blank">/wiki/Brian_Carpenter_(engineer)</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>A. Farrel (1 April 2017). The Arte of ASCII: Or, An True and Accurate Representation of an Menagerie of Thynges Fabulous and Wonderful in Ye Forme of Character. Independent Submission. doi:10.17487/RFC8140. ISSN 2070-1721. RFC 8140. Informational. <a href="/wiki/Adrian_Farrel" target="_blank">/wiki/Adrian_Farrel</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>T. Mizrahi; J. Yallouz (1 April 2018). Wrongful Termination of Internet Protocol (IP) Packets. Independent Submission. doi:10.17487/RFC8367. ISSN 2070-1721. RFC 8367. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8367" target="_blank">https://datatracker.ietf.org/doc/html/rfc8367</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>O. Aboul-Magd; S. Rabie (July 2005). A Differentiated Service Two-Rate, Three-Color Marker with Efficient Handling of in-Profile Traffic. Network Working Group. doi:10.17487/RFC4115. RFC 4115. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc4115" target="_blank">https://datatracker.ietf.org/doc/html/rfc4115</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>H. Kaplan (1 April 2018). Internationalizing IPv6 Using 128-Bit Unicode. Independent Submission. doi:10.17487/RFC8369. ISSN 2070-1721. RFC 8369. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8369" target="_blank">https://datatracker.ietf.org/doc/html/rfc8369</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>E. Fokschaner (1 April 2019). Hypertext Jeopardy Protocol (HTJP/1.0). Independent Submission. doi:10.17487/RFC8565. ISSN 2070-1721. RFC 8565. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8565" target="_blank">https://datatracker.ietf.org/doc/html/rfc8565</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>E. Rye; R. Beverly (1 April 2019). Customer Management DNS Resource Records. Independent Submission. doi:10.17487/RFC8567. ISSN 2070-1721. RFC 8567. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8567" target="_blank">https://datatracker.ietf.org/doc/html/rfc8567</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>A. Mayrhofer; J. Hague (1 April 2020). The Internationalized Deliberately Unreadable Network NOtation (I-DUNNO). Independent Submission. doi:10.17487/RFC8771. ISSN 2070-1721. RFC 8771. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc8771" target="_blank">https://datatracker.ietf.org/doc/html/rfc8771</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>M. Welzl (1 April 2020). The Quantum Bug. Independent Submission. doi:10.17487/RFC8774. ISSN 2070-1721. RFC 8774. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8774" target="_blank">https://datatracker.ietf.org/doc/html/rfc8774</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>G. Grover; N. ten Oever; C. Cath; S. Sahib (1 April 2021). Establishing the Protocol Police. Independent Submission. doi:10.17487/RFC8962. ISSN 2070-1721. RFC 8962. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc8962" target="_blank">https://datatracker.ietf.org/doc/html/rfc8962</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>J. Snijders; C. Morrow; R. van Mook (1 April 2022). Software Defects Considered Harmful. Independent Submission. doi:10.17487/RFC9225. ISSN 2070-1721. RFC 9225. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc9225" target="_blank">https://datatracker.ietf.org/doc/html/rfc9225</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>M. Breen (1 April 2022). Bioctal: Hexadecimal 2.0. Independent Submission. doi:10.17487/RFC9226. ISSN 2070-1721. RFC 9226. Experimental. <a href="https://datatracker.ietf.org/doc/html/rfc9226" target="_blank">https://datatracker.ietf.org/doc/html/rfc9226</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> <li id="fn:70"><p>S. Toyosawa (1 April 2023). The Addition of the Death (DTH) Flag to TCP. Independent Submission. doi:10.17487/RFC9401. ISSN 2070-1721. RFC 9401. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc9401" target="_blank">https://datatracker.ietf.org/doc/html/rfc9401</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></p></li> <li id="fn:71"><p>M. Basaglia; J. Bernards; J. Maas (1 April 2023). Concat Notation. Independent Submission. doi:10.17487/RFC9402. ISSN 2070-1721. RFC 9402. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc9402" target="_blank">https://datatracker.ietf.org/doc/html/rfc9402</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></p></li> <li id="fn:72"><p>C. GPT (1 April 2023). R. L. Barnes (ed.). AI Sarcasm Detection: Insult Your AI without Offending It. Independent Submission. doi:10.17487/RFC9405. ISSN 2070-1721. RFC 9405. Informational. <a href="/wiki/ChatGPT" target="_blank">/wiki/ChatGPT</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></p></li> <li id="fn:73"><p>M. Blanchet (1 April 2024). Faster Than Light Speed Protocol (FLIP). Independent Submission. doi:10.17487/RFC9564. ISSN 2070-1721. RFC 9564. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc9564" target="_blank">https://datatracker.ietf.org/doc/html/rfc9564</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></p></li> <li id="fn:74"><p>K. Kuhns (1 April 2025). Unified Time Scaling for Temporal Coordination Frameworks. Internet Engineering Task Force. doi:10.17487/RFC9759. ISSN 2070-1721. RFC 9759. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc9759" target="_blank">https://datatracker.ietf.org/doc/html/rfc9759</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></p></li> <li id="fn:75"><p>V. Cerf (21 January 1973). PARRY Encounters the DOCTOR. Network Working Group. doi:10.17487/RFC0439. RFC 439. Status Unknown. NIC 13771. <a href="/wiki/Vint_Cerf" target="_blank">/wiki/Vint_Cerf</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></p></li> <li id="fn:76"><p>D.L. Covill (22 June 1973). R. Merryman (ed.). ARPAWOCKY. Network Working Group. doi:10.17487/RFC0527. RFC 527. Status Unknown. <a href="https://datatracker.ietf.org/doc/html/rfc527" target="_blank">https://datatracker.ietf.org/doc/html/rfc527</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></p></li> <li id="fn:77"><p>V. Cerf (December 1985). 'Twas the Night Before Start-up'. Network Working Group. doi:10.17487/RFC0968. RFC 968. Status Unknown. <a href="/wiki/Vint_Cerf" target="_blank">/wiki/Vint_Cerf</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></p></li> <li id="fn:78"><p>B. Hancock (December 1995). The 12-Days of Technology Before Christmas. Network Working Group. doi:10.17487/RFC1882. RFC 1882. Informational. <a href="https://datatracker.ietf.org/doc/html/rfc1882" target="_blank">https://datatracker.ietf.org/doc/html/rfc1882</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></p></li> <li id="fn:79"><p>R. Glenn; S. Kent (November 1998). The NULL Encryption Algorithm and Its Use With IPsec. Network Working Group. doi:10.17487/RFC2410. RFC 2410. Proposed Standard. <a href="https://datatracker.ietf.org/doc/html/rfc2410" target="_blank">https://datatracker.ietf.org/doc/html/rfc2410</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></p></li> <li id="fn:80"><p>"Instructions to Request for Comments (RFC) Authors". Archived from the original on 2012-03-27. Retrieved 2012-03-18. <a href="https://web.archive.org/web/20120327234338/http://www.rfc-editor.org/rfc-editor/instructions2authors.txt" target="_blank">https://web.archive.org/web/20120327234338/http://www.rfc-editor.org/rfc-editor/instructions2authors.txt</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></p></li> <li id="fn:81"><p>"IETF RFC-Editor FAQ, Q20: How can I submit an April 1st RFC?". Rfc-editor.org. 2011-07-21. Retrieved 2012-03-18. <a href="//www.rfc-editor.org/rfcfaq.html#april" target="_blank">//www.rfc-editor.org/rfcfaq.html#april</a> <a href="#fnref:81" class="footnote-back-ref">↩</a></p></li> <li id="fn:82"><p>"Instructions to Request for Comments (RFC) Authors". Archived from the original on 2012-03-27. Retrieved 2012-03-18. <a href="https://web.archive.org/web/20120327234338/http://www.rfc-editor.org/rfc-editor/instructions2authors.txt" target="_blank">https://web.archive.org/web/20120327234338/http://www.rfc-editor.org/rfc-editor/instructions2authors.txt</a> <a href="#fnref:82" class="footnote-back-ref">↩</a></p></li> </ol>