<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Justin Percy on Medium]]></title>
        <description><![CDATA[Stories by Justin Percy on Medium]]></description>
        <link>https://medium.com/@justinpercy?source=rss-a404bb9e3abf------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*hIbg3773pPnDuoU-.</url>
            <title>Stories by Justin Percy on Medium</title>
            <link>https://medium.com/@justinpercy?source=rss-a404bb9e3abf------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sun, 22 Nov 2026 07:30:27 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@justinpercy/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Breathing problems]]></title>
            <link>https://medium.com/@justinpercy/breathing-problems-abeeb55b4668?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/abeeb55b4668</guid>
            <category><![CDATA[life]]></category>
            <category><![CDATA[oxygen]]></category>
            <category><![CDATA[atmosphere]]></category>
            <category><![CDATA[health]]></category>
            <category><![CDATA[nitrogen]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Sat, 24 Jan 2026 11:12:18 GMT</pubDate>
            <atom:updated>2026-02-19T13:38:44.913Z</atom:updated>
            <content:encoded><![CDATA[<p>Do we actually need pure oxygen and nitrogen gas?</p><p>UNFINISHED DRAFT — Last: Updated: Jan 26, 2026</p><p>Biology might not quite fully understand what makes oxygen breathing creatures stay alive.</p><p>I am a long term smoker, toker and midnight star gazer, up here in Canada the air is cold (-30+ Celsius, 5% humidity) and the Northern Lights are bright. We get a dusting of snow almost every night of a few centimeters around 8 PM. Recently, I noticed it was hard to breath after the sun went down during the evening or even early morning. This got me to thinking and experimenting.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*-8RVq6e0Wfsm1YPMvOszgQ.jpeg" /><figcaption>Temperatures colder than -30 Celsius, very low humidity</figcaption></figure><p>Breathing dry cold/hot air is damaging to the lungs, even if the oxygen to nitrogen ratio’s are perfect! Breathing too much humidity in the air is also damaging to the lungs, it’s all about the perfect ratio!</p><p><strong>Conclusion: </strong>We do not inhale pure oxygen and nitrogen into the lungs that directly get absorbed into the bloodstream; we breath water vapor mixed with other gases, but only need the oxygen bound to hydrogen! During the absorption process through our lung membrane the hydrogen is converted to a non-toxic form, nitrogen and the oxygen can safely be transported in the bloodstream to individual cells for charge (electron) transmission. Like a car sitting on the side of the road waiting for a tow truck to drive by with booster cables (nitrogen) to give their battery a jump start (oxygen) to keep going.</p><p>Buy an ultrasonic humidifying machine if you want a “fresh” air smell, and then also get a de-humidifying machine to maintain a proper balance.</p><p>… experiment, data, references go here, no time at the moment</p><p>Why do we produce and piss Ammonia? We convert it from hydrogen to produce nitrogen — Integrated Nitrogen Production and Conversion of Hydrogen to Ammonia: <a href="https://www.aidic.it/cet/18/70/096.pdf">https://www.aidic.it/cet/18/70/096.pdf</a></p><p>“When it comes to oxygen, you can have too much of a good thing. Breathing air that contains higher levels of oxygen than the usual 21 percent found in Earth’s atmosphere can cause organ damage, seizures, and even death in people and animals, particularly if it’s in excess of the body’s oxygen needs. Until now, however, scientists have mostly speculated about the mechanisms behind this phenomenon, known as oxygen toxicity, or hyperoxia.” <a href="https://gladstone.org/news/researchers-discover-how-too-much-oxygen-damages-cells-and-tissues">https://gladstone.org/news/researchers-discover-how-too-much-oxygen-damages-cells-and-tissues</a></p><p>“The normal composition of the Earth’s atmosphere is about 78% nitrogen, 21% oxygen, and 1% argon, carbon dioxide, and other gases. After just two or three breaths of nitrogen, the oxygen concentration in the lungs would be low enough for some oxygen already in the bloodstream to exchange back to the lungs and be eliminated by exhalation.” <a href="https://en.wikipedia.org/wiki/Inert_gas_asphyxiation">https://en.wikipedia.org/wiki/Inert_gas_asphyxiation</a></p><p>“According to pulmonologist <a href="https://www.jeffersonhealth.org/find-a-doctor/s/scharf-michael-l">Dr. Michael Scharf</a>, inhaling cold air may cause bronchial irritation and cough.” <a href="https://www.jeffersonhealth.org/your-health/living-well/why-breathing-cold-air-hurts-your-lungs">https://www.jeffersonhealth.org/your-health/living-well/why-breathing-cold-air-hurts-your-lungs</a></p><p>“Weather that’s too humid or not humid enough can make it harder to breathe when you have chronic obstructive pulmonary disease” <a href="https://www.webmd.com/lung/copd/copd-humidity">https://www.webmd.com/lung/copd/copd-humidity</a></p><p><strong>Humidifiers:</strong> <a href="https://www.homedepot.ca/en/home/categories/appliances/heating-cooling-and-air-quality/humidifiers-and-dehumidifiers/humidifiers.html">https://www.homedepot.ca/en/home/categories/appliances/heating-cooling-and-air-quality/humidifiers-and-dehumidifiers/humidifiers.html</a></p><p><strong>De-humidifiers:</strong> <a href="https://www.homedepot.ca/en/home/categories/appliances/heating-cooling-and-air-quality/humidifiers-and-dehumidifiers/dehumidifiers.html?searchterm=dehumidifier">https://www.homedepot.ca/en/home/categories/appliances/heating-cooling-and-air-quality/humidifiers-and-dehumidifiers/dehumidifiers.html?searchterm=dehumidifier</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=abeeb55b4668" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Crypostle: A Peer To Peer Economic System]]></title>
            <link>https://medium.com/@justinpercy/crypostle-a-peer-to-peer-economic-system-c0fdf74d92d8?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/c0fdf74d92d8</guid>
            <category><![CDATA[money]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[economics]]></category>
            <category><![CDATA[crypto]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Sat, 25 Mar 2023 01:24:33 GMT</pubDate>
            <atom:updated>2023-04-05T03:33:52.937Z</atom:updated>
            <content:encoded><![CDATA[<p>March 24, 2023<br>License: Attribution-ShareAlike 4.0 International</p><p><strong>Abstract:</strong> A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network.</p><p>The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they’ll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.</p><p><strong>Mining: </strong>Generating a unique serial number represented as a coin token and assigning it to a public key Clearing — Verification of transactions by nodes<br><strong>Minting:</strong> (Settlement) Transaction confirmations by other nodes are sequentially hashed together to form a chain of trust. These are in a separate database from the transaction data or mined coin tokens.<br><strong>Transaction fee:</strong> divided equally per node for required confirmations.<br><strong>Blocks:</strong> Multiple transactions are only bundled into blocks for checkpoint purposes, this is NOT the settlement finality like in Bitcoin.</p><p>Last Edited: April 4, 2023</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c0fdf74d92d8" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[EZE-Signature]]></title>
            <link>https://medium.com/@justinpercy/eze-signature-f788842d3989?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/f788842d3989</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[crypto]]></category>
            <category><![CDATA[cryptography]]></category>
            <category><![CDATA[security]]></category>
            <category><![CDATA[hash]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Mon, 06 Mar 2023 00:57:47 GMT</pubDate>
            <atom:updated>2026-08-27T21:43:46.944Z</atom:updated>
            <content:encoded><![CDATA[<p>Side-channel resistant hash based digital signature scheme</p><p><em>Rough draft: April 4, 2023<br></em>License: Attribution-ShareAlike 4.0 International</p><blockquote>In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction (finding its inverse) without special information, called the “trapdoor”. — Wikipedia</blockquote><p><strong>Abstract:</strong></p><p>With the advancement of distributed computing systems, multi-threaded cloud based applications and more recently quantum processors; Security for the future generation of algorithms are in question. Brute-force solutions to the prime number factorization in common trapdoor functions like those used in RSA and Rabin become theoretically possible and even commercially viable attack vectors. Elliptic Curve was designed to mitigate these attacks but it too is suffering the same fate. These outdated security protocols must be replaced by a more secure mathematical method in the near future as this assumption has been widely accepted since the recent advancement of supercomputers. Adding the complexity of hash based algorithms in conjunction with an improved unique trapdoor function can increase the security level per bit while maintaining short key lengths .</p><blockquote>“In a <a href="https://en.wikipedia.org/wiki/Digital_signature"><strong>digital signature</strong></a> system, a sender can use a private key together with a message to create a <strong>signature</strong>. Anyone with the corresponding public key can verify whether the signature matches the message, but a forger who does not know the private key cannot find any message/signature pair that will pass verification with the public key.” — Wikipedia (Public-Key cryptography)</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/678/1*sofmdyZGmDfnr68tt2jqzQ.gif" /><figcaption>EZE-Signature Alpha/Prototype</figcaption></figure><p>n=p.q</p><p>Many existing solutions are quite complicated for the average programmer to implement quickly in their software. EZE-Signature attempts to solve that problem by using a novel approach to an old problem. A simple and quick function yet difficult to crack using the fundamentals of mod or log based asymmetric encryption algorithms.</p><blockquote>“Prime Factorization (or integer factorization) is a commonly used mathematical problem often used to secure public-key encryption systems.” — Privacycanada.net</blockquote><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2F-UrdExQW0cs%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D-UrdExQW0cs&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2F-UrdExQW0cs%2Fhqdefault.jpg&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/4fdb462144870823696e3664e8418407/href">https://medium.com/media/4fdb462144870823696e3664e8418407/href</a></iframe><p><strong>Trapdoor:</strong></p><p>You can think of this function as a checksum calculator. It returns a unique total of the sum of the ASCII value (integer of 0–255) of all characters multiplied by the position of each character in the Input Text<br>Variable 1: ASCII value of char X(Y) in string<br>Variable 2: Position of char X in string</p><p>These two short natural numbers are multiplied by each other and then added to the running total for the string IE: output</p><blockquote>GAMBAS3 CODE:</blockquote><blockquote>Public ASCIIMapped[256] As Integer</blockquote><blockquote>Public Function ASCIIMap(CharValue As Integer) As Long<br> Dim i As Integer<br> ASCIIMapped[0] = 64311446<br> ASCIIMapped[1] = 59109892<br> ASCIIMapped[2] = 51858135<br> ASCIIMapped[3] = 84850272<br> ASCIIMapped[4] = 03708897<br> ASCIIMapped[5] = 09024970<br> ASCIIMapped[6] = 58521061<br> ASCIIMapped[7] = 88143739<br>….. Return ASCIIMapped[CharValue]<br>End</blockquote><blockquote>Public Function TrapDoor(InputText As String) As Float<br> Dim Total As Float<br> Total = 1<br> Dim CharPos As Integer</blockquote><blockquote>For CharPos = 0 To InputText.Len — 1<br> ‘Adds the sum of the ASCII value of current character multiplied by the position of the character in the InputText<br> Total = Total + (ASCIIMap(Asc(InputText, CharPos)) * CharPos)<br> Next<br> <br> Return Total<br> <br>End</blockquote><blockquote>Input: QubTJKSmNhVjB3V2taMWhOTlBEamxCM1NLUU1rb1FZY015a3RSTjZ0UU1tMTBWaEdtL0ZleFVLWnd2Wlg0NFZPVjM2eVdlQmFhQWc1eUVYbGEuYS9L</blockquote><blockquote>Output: 3.42902359605E+11</blockquote><blockquote>“An example of a simple mathematical trapdoor is “6895601 is the product of two prime numbers. What are those numbers?” A typical “brute-force” solution would be to try dividing 6895601 by several prime numbers until finding the answer. However, if one is told that 1931 is one of the numbers, one can find the answer by entering “6895601 ÷ 1931” into any calculator. This example is not a sturdy trapdoor function — modern computers can guess all of the possible answers within a second — but this sample problem could be improved by using the product of two much larger primes.” — Wikipedia</blockquote><p><strong>Prime Number Problem:</strong></p><p>One long held standard of security for trapdoor functions is to attempt the use of assumed difficulty to factor large prime numbers. Limited resources for computing such equations in the given time frame to be used in an attack was the contributing reasoning to rely on this quite simple to brute-force method.</p><p>Prime numbers can only be divided by themselves and 1, yes this requires computation power to start at the smallest prime working upwards but sometimes breaking it down into to any factors you can then working down can yield very quick results. Using the fundamental of distributed computing even the most complex factorization can be performed with modern technology in negligible time.</p><p>For example: <br>This large whole number can be calculated virtually instantly using this website without multi-threaded processing required. <a href="https://www.mathsisfun.com/numbers/prime-factorization-tool.html">https://www.mathsisfun.com/numbers/prime-factorization-tool.html</a><br>9007199254740991 = 6361 × 69431 × 20394401</p><p>Humans are not efficient at prime factorization as this generally requires a “try-every combination that works” with/without a factor tree optimization; Super-computers and cluster networks with the introduction of artificial intelligence algorithms, would turn this security method into a laughable elementary school game… If they have not already.</p><blockquote>“There is only one (unique!) set of prime factors for any number.” -MathisFun.com</blockquote><p>EZE-Signature uses a completely new approach to this fundamental building block of almost all encryption. Instead of using unique prime factors for large pseudorandom whole numbers, a hybrid-product of the sum using the position of the character is multiplied by the ASCII value to create a mathematical equivalent to a dynamic prime factorization method. The result is a multiplication of a small integer based on its relative position in the input string with a very large integer mapped to an ASCII value. Reverse calculation is near impossible as it would require not only a division of many small integers with a mapped unique set of larger integers; With an added preprocessing step of subtraction from the current sum every for each character in the input string. The longer the input string, the more secure the output signature becomes without affecting the variable length.</p><p><strong>Randomization error:</strong></p><blockquote>“Software-generated random numbers only are pseudorandom. They are not truly random because the computer uses an algorithm based on a distribution, and are not secure because they rely on deterministic, predictable algorithms. Since a seed number can be set to replicate the “random” numbers generated, it is possible to predict the numbers if the seed is known.” — Wolfssl.com</blockquote><p>It is widely accepted in computer science that true random numbers are not easily generated, especially many consecutive numbers in sequence.</p><p>Instead of using an external random source, an internal unique seed is generated by the UNIX timestamp. This will ensure the next time the cypher is ran; It will never accidentally use the same seed number from previous iterations generating noticeable output patterns. The seed number can’t be easily calculated before or after the cypher is ran because it’s deterministic on the exact second elapsed since 1/1/1970.</p><p>To further the randomization process, EZE-Signature uses a function called RandoStorm with a BigInt output type. This unique random number generating function works by sequentially generating from 512 to 1024 random seed numbers added to sum of the seed and current total multiplied by the timestamp in seconds.</p><blockquote><em>GAMBAS3 CODE:<br></em>Public Function RandoStorm() As BigInt<br>‘Generates a Big Integer pseudo-random number in 4-byte chunks (Integer) outputted as BigInt data type</blockquote><blockquote>Randomize <br> <br> Dim Seed As BigInt<br> Seed = New BigInt<br> <br> Dim MaxRange As Integer<br> MaxRange = 99999999<br> <br> Dim Drops As New Long[1024]<br> Dim Cloud_Count As Integer<br> Dim Drop_Count As Integer</blockquote><blockquote>‘Use a random number of Clouds to seed the 512 to 1024 drops<br> Cloud_Count = Int(Rnd(512, 1024) + 1)<br> <br> ‘Fill drops with random values<br> For Drop_Count = 1 To Cloud_Count<br> Randomize<br> Drops[Drop_Count] = Int(Rnd(1, MaxRange))<br> Next</blockquote><blockquote>‘Serialize Drops onto Seed string<br> For Drop_Count = 1 To Cloud_Count<br> Seed = Seed + Drops[Drop_Count]<br> Seed = Seed * EZE_SIG.GetTimeStamp()<br> Next</blockquote><blockquote>Return Seed</blockquote><blockquote>End</blockquote><p><strong>Key Locks: </strong>private &amp; public keys are run through the Trapdoor function to create a unique output for verification of ownership or as a checksum.</p><p><strong>Key Masks: </strong>These are SHA3–512 hashed Keylocks, they can be partially shared with the public key to verify ownership. These are designed to protect the key data itself and can be used as compressed formats.</p><p><strong>Key format &amp; Checksum:</strong></p><p>Prefix (1 char) + trapdoor checksum (4 chars in hex) + Key (30 chars)</p><p><strong>Hash-Tree Keys:</strong></p><p>Using a customized Merkle Hash Tree structure, virtually unlimited child-key pairs can be created and owned by 1 unique seed key.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/687/1*oP3xTCdObWm1qgPsk5G9PQ.png" /></figure><p><strong>Sponge Calculation:</strong></p><p>“Functions that behave like a random oracle” — <a href="https://keccak.team/sponge_duplex.html">https://keccak.team/sponge_duplex.html</a></p><p>To initially generate the seed root key as parent for all children key-pairs a unique sponge is calculated by running a very large pseudo-random number (seed) through the Trapdoor (Checksum) function to achieve a calculated signature. The seed key is then generated from SHA3–512 serialized hashing of the raw seed number and the Trapdoor result.</p><p>Generating Key-ring data from any unique to device or user information is strongly suggested. In the GAMBAS implementation; System.Architecture System.Username, System.Host, System.Domain, System.Family, System.Cores, System.Language, System.Timezone are serialized and hashed using SHA3–512.</p><p><strong>Key Generation: </strong>Using the Key Sponge and running it through the Trapdoor function then serializing the output with the key to produce a hash using SHA3–512. The result is formatted using the key format and checksum function to produce the raw private key. The raw public key is derived in a similar way producing both Key Masks and Key Mask Locks for additional layers of verification without revealing the keys themselves.</p><p><strong>Sign: </strong>Signing a message with the both public key and private key using privacy proof.</p><p><strong>Signature Seal:</strong> The result of signing a message with the public key and private Key Mask Lock using multiplication of their trapdoor results.</p><p><strong>Signature:</strong> Base64 encoded output of SHA3–512 the message, public key, and checksum</p><p><strong>Verify: </strong>Quick verification for a signed message and public key using the Trapdoor function to calculate an alternative hash of the serialized data.</p><p><strong>Verify Ownership:</strong> Using a mask lock of the private key, public verification of ownership can be securely performed on a signed message unlike conventional Elliptic Curve implementations.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/607/1*kPuugbf5b4QvlTmhDse6jA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/773/1*_vTaJPiXFUuhMjMCpkshxA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/621/1*qdNFerbruzC_42yACvin6g.png" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f788842d3989" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The quantum forces responsible for electro-magnetism]]></title>
            <link>https://medium.com/@justinpercy/the-quantum-forces-responsible-for-electro-magnetism-b67e39fe7449?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/b67e39fe7449</guid>
            <category><![CDATA[theory]]></category>
            <category><![CDATA[physics]]></category>
            <category><![CDATA[spintronics]]></category>
            <category><![CDATA[energy]]></category>
            <category><![CDATA[electromagnetism]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Mon, 10 Jan 2022 23:11:29 GMT</pubDate>
            <atom:updated>2023-03-26T01:14:28.306Z</atom:updated>
            <content:encoded><![CDATA[<p><em>ROUGH DRAFT</em> — A theoretical research project to advance “Spintronics”.</p><p>© Jan 10, 2021 Justin Percy (Biznatch Enterprises)<br>Last Edited: March 25, 2023</p><p><strong>Abstract:</strong></p><p>Electron Energy is the potential difference between two or more opposing or differential spins, the remainder has the potential to do work in a system.</p><p><strong>Applies to:</strong></p><ul><li>Electricity &amp; Magnetism</li><li>Light</li><li>Gravity -&gt; <a href="https://opg.optica.org/oe/fulltext.cfm?uri=oe-31-2-2665&amp;id=525052">https://opg.optica.org/oe/fulltext.cfm?uri=oe-31-2-2665&amp;id=525052</a></li><li>Other</li></ul><p><strong>ZERO Potential (Entropy Systems/Steady State)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*VmUaxtDy_jlPwRjnqX_GAQ.png" /><figcaption>Electron #1 Spin (0)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*VmUaxtDy_jlPwRjnqX_GAQ.png" /><figcaption>Electron #2 Spin (0)</figcaption></figure><ul><li>0–0 = 0 VDC/VAC</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron Spin #1 (+1)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron Spin #2 (+1)</figcaption></figure><ul><li>1–+1 = 0 VDC/VAC</li></ul><p><strong>Direct Potential Current (Asymmetrical System)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron Spin #1 (+1)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*VmUaxtDy_jlPwRjnqX_GAQ.png" /><figcaption>Electron Spin #2 (0)</figcaption></figure><ul><li>+1–0 = +1 VDC or +0.5 VAC @ Speed of Light frequency</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*rNJNWcKnAo-XaC3TVCwYwA.png" /><figcaption>Electron Spin #1 (-1)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*VmUaxtDy_jlPwRjnqX_GAQ.png" /><figcaption>Electron Spin #2 (0)</figcaption></figure><ul><li>-1–0 = -1 VDC or -0.5 VAC @ Speed of Light frequency</li></ul><p><strong>Alternating Potential Current (Asymmetrical System):</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron #1 Spin (+1)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*rNJNWcKnAo-XaC3TVCwYwA.png" /><figcaption>Electron #2 Spin (-1)</figcaption></figure><ul><li>+1 — — 1 = 2 VAC or +1 VDC</li></ul><p><strong>Differential Potential Current (Asymmetrical System):</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron #1 Spin (+3)</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/103/1*wzOM8vSmwzY9mNEAik8Ohw.png" /><figcaption>Electron #2 Spin (+1.5)</figcaption></figure><ul><li>+3 — +1.5 = 1.5 V (STATIC in time) current instantly destroys their speed difference and therefore potential difference measured as voltage but difficult to measure current in a system EX: Static Electricity, Lightning, Tesla Switch</li></ul><p><strong>Some theoretical observations (Point Form):</strong></p><ul><li>As the charge re-gauge happens — when electron 1 affects electron 2, while electron 1 doesn’t catch up in speed u momentarily get a spike because of speed differences.</li><li>Particles with more electrons give you more spin differential potentials that are sometimes linear in relation such as diodes — or semi-conductors. 10 possible simultaneous phases with only 1 particle vs 1:1</li><li>Can’t measure or use energy directly from electron spin because the frequency phase (orbit speed) is too fast and we can’t make a switch fast enough, the only thing fast enough is a charged atom with identical properties to the electron to match the orbit (frequency) of the opposite spin to form a dipole.</li><li>Direction of spin relative to the measuring device or observer determines the voltage + -</li><li><em>Direction of spin for Electron 1 vs Electron 2 may not be crucially important</em> in determination of potential difference as much as the <em>electrons position in their orbits in relation to each other</em>. An out of phase orbit can yield smaller potentials but are still phased in their positions vs the nuclei in relation to each other in space. IE: Far apart = low potential, Close together, high potential</li><li>Cross path orbits and alignments in certain materials can yield semi-conductor properties based on their orbit phases and interaction with each other during the orbits.</li><li>Transmutation of atoms and matter by changing particle spin and orientation to accept or reject electrons, etc…</li></ul><p><strong>Possible Simple Experimental Design:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*PLPD4jQ-Xf3yi7NVbGNi8w.png" /></figure><p>Using 2 separate lasers focused on a conductive plate such as copper or gold to determine potential difference in energy between isolated conductors in space.</p><p><strong>Advanced Experimental Design:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/966/1*uRFUGvvkb5EwWWzXCxRzHQ.png" /></figure><p>Green = Collecting coil<br>Red = Driving Coils<br>Blue = Atomic Carbon</p><p>Process: Driving coils push atomic carbon towards each other then repel before collision, inducing spin possibly collecting vacuum energy due to broken symmetry relative to each other. Maybe.</p><p>Theoretical Experimentation with Helium 3 &amp; Deuterium</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FW5Fz_BsWCjU%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DW5Fz_BsWCjU&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FW5Fz_BsWCjU%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/689501b8530c8ed983017781debf5e33/href">https://medium.com/media/689501b8530c8ed983017781debf5e33/href</a></iframe><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2F_bDXXWQxK38%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D_bDXXWQxK38&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2F_bDXXWQxK38%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/a4300a6f3af58360161e2dc143a0f43b/href">https://medium.com/media/a4300a6f3af58360161e2dc143a0f43b/href</a></iframe><p>Current goes from positive to negative or negative to positive or both?</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FFqnQXRaSw28%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DFqnQXRaSw28&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FFqnQXRaSw28%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/665b1d2a3bc28633f448434aaff85c88/href">https://medium.com/media/665b1d2a3bc28633f448434aaff85c88/href</a></iframe><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2F1bBNeyrMOJE%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D1bBNeyrMOJE&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2F1bBNeyrMOJE%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/84d7ca92096c2ed1c5141309fef03a2c/href">https://medium.com/media/84d7ca92096c2ed1c5141309fef03a2c/href</a></iframe><p><strong>The Theory of Relativity is not quite complete:</strong></p><p>Einstein showed maximum potential energy between two masses ONLY (attractive or repulsive force) as in a steady state equilibrium system (symmetrical — identical charges and spins/directions) but not asymmetrical (spin1 speed or direction &lt;&gt; Spin 2 Speed or direction)</p><p>E = MC2</p><p>E = Spin 1 — spin2 / speed of light^2 ?????</p><p>Gravity = Electro-magnetic attractive force<br>Anti-Gravity = Electro-magnetic attractive force</p><p>Gravity is only observable through a matter-energy interaction, the potential is infinite and can’t be measured or calculated when in the form of pure energy. Similar to a spinning gyroscope “spin-axis”…</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*1Fa9sOWviVLswOX7.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/331/0*aG-Wy1OJXzTCWjyZ" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*nNt_Mqzza7pGvgcm.jpg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/900/0*BDDsPvp6wsllQWEd.jpg" /></figure><p><strong>Notable References:</strong></p><p>Faraday, Maxwell, Nikola Tesla, Walter Russell, Tom Bearden, John Bedini, Joseph Newman, Howard Johnson, Jim Watson, John CEJKA, EV Gray, Floyd Sweet, William Doyal, Lockridge, Mark Johnson and R. H. Silsbee…</p><p><a href="https://en.wikipedia.org/wiki/Spintronics">https://en.wikipedia.org/wiki/Spintronics</a></p><p><strong>Call to help from others:</strong></p><p>If you can elaborate on this thesis or disagree with it, I would like to hear from you, drop a comment below or email me at justin@biznaturally.ca</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b67e39fe7449" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[How to Make a Mint: The Network of Anonymous Electronic Cash]]></title>
            <link>https://medium.com/coinmonks/how-to-make-a-mint-the-network-of-anonymous-electronic-cash-91b461e237e5?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/91b461e237e5</guid>
            <category><![CDATA[decentralized]]></category>
            <category><![CDATA[satoshi-nakamoto]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[peer-to-peer]]></category>
            <category><![CDATA[nsa]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Tue, 09 Nov 2021 02:25:19 GMT</pubDate>
            <atom:updated>2021-11-12T05:26:06.702Z</atom:updated>
            <content:encoded><![CDATA[<p>Almost everyone that knows anything about “Bitcoin or cryptocurrency” has a very fragmented understanding of some key aspects. I would like to discuss an often ignored and perhaps controversial topic, the network itself.</p><h3>The Past:</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*eEZQKvFwTXncQ-3UN-YhLw.png" /><figcaption>[1]</figcaption></figure><p>The National Security Agency of United States was actively working on a project that resembles Bitcoin in many ways since the inception of modern computers; Released publicly in 1996 as a theoretical research topic.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*_WvPWmsqprrW1rI6RTCEng.png" /><figcaption>[1]</figcaption></figure><p>Aside for the glaring obvious “Okamoto” keyword similarity to Satoshi Nakamoto the concept is very similar to “double-spend” found in Bitcoin!</p><p>Unfortunately, this project was never completed due to crucial technical pieces of the puzzle missing to create a functional computer program with the presented advanced concepts. Not to mention, computer hardware and Internet Service Provider limitations at the time were also a paralyzing factor.</p><p>One of the basic flaws with the NSA’s Mint Project was the laws surrounding privacy and enforcement of financial services, along with the issuer trust factor. If a cryptographic based money was minted who would be keeping the digital records and give access to those authorities who need it while protecting the user’s rights? Some very crucial questions remained unanswered.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*GbdI_P7Qu1I7_KoDhyZsNQ.png" /><figcaption>[1]</figcaption></figure><blockquote>“The system must have adequate network and physical security…”</blockquote><p>This could be a challenge as with all centralized based systems; The experts noted in their report. Security professionals would have a difficult time with preventing intrusions while maintaining accessibility to the system at all times, zero down-time was required, and yes real physical guards required too!</p><h3>The simple P2P experiment:</h3><blockquote>“On July 11, 2001, Napster shut down its entire network in order to comply with the injunction.”</blockquote><p>I do not encourage copyright infringement at all, as a young programmer I was intrigued how a multi-million dollar network could be no longer functional just because of a few “bad Metallica uploaders”. It was obvious to me how crippled the network design was from the start; It relied on a central hub to connect everyone else using the software to provide search and download functionality. At the time the internet infrastructure was “server-client” based and peer to peer was still a new topic of discussion. Server and client functions traditionally — were two separate executable programs, the fringe concept of containing them within the same application was not only technically challenging but who could I go to for help, nobody does this yet… I thought, Why not? But then I started to realized the painful truth: How can you control an uncontrollable beast if you actually need to? You can’t.</p><p>I was experimenting with the idea in the late 1990s early 2000s era while teaching myself programming with Microsoft Visual Studio. I was able to write a basic functional peer to peer network based on Napster’s file sharing services, but due to legal issues I decided not to release it “as is”.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/618/0*OzX6O6XSM_hl11ac" /><figcaption>[2]</figcaption></figure><p>Instead, I gave the source code to a friend who shared it with another and then another whom was all working with encryption and other related technology. It was the unlikely secure network the improbable Mint Project required, but never had!</p><p>A network with nobody in control — Based upon encryption and mathematics. The network itself could be trusted more than any human or authority could be trusted with the private keys! It was a radical concept never attempted before, and with many challenges and pitfalls — It actually worked better than expected in a unlikely implementation… Making a Mint!</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/652/1*4D8jgH9zfzGt7TChkkP5nA.png" /><figcaption>[2]</figcaption></figure><h3>Ripostle protocol basics:</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/846/1*1kbtsgDmsq31FB3ohKIuzA.png" /><figcaption>[2]</figcaption></figure><h3>Bitcoin/net_processing.cpp source code:</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JYxRJGbIQGpb3c55CXXziw.png" /><figcaption>[3]</figcaption></figure><p>If you compare some of the connection code found in Ripostle with even the most recent Bitcoin code the similarities are obvious. The software has a local saved list of IP addresses, connects to one of them, asks for a list of IPs, gives a list of IPs and merges into a local list to share with a different peer in the future. These simple steps of code automatically build a “self-discovery” network that did not require a routing server or hub to operate, peer to peer.</p><p>Pretty darn simple how to make the decentralized, trustless &amp; secure mint network? Eh?</p><p><strong>References:</strong></p><p>[1] HOW TO MAKE A MINT: THE CRYPTOGRAPHY OF ANONYMOUS ELECTRONIC CASH<br><a href="https://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm">https://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm</a></p><p>[2] Ripostle — True P2P Anonymous File Sharing Program<br><a href="https://github.com/BiznatchEnterprises/Ripostle/blob/master/Form1.frm">https://github.com/BiznatchEnterprises/Ripostle/blob/master/Form1.frm</a></p><p>[3] Bitcoin<br><a href="https://github.com/bitcoin/bitcoin/blob/master/src/net_processing.cpp">https://github.com/bitcoin/bitcoin/blob/master/src/net_processing.cpp</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=91b461e237e5" width="1" height="1" alt=""><hr><p><a href="https://medium.com/coinmonks/how-to-make-a-mint-the-network-of-anonymous-electronic-cash-91b461e237e5">How to Make a Mint: The Network of Anonymous Electronic Cash</a> was originally published in <a href="https://medium.com/coinmonks">Coinmonks</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Breaking Satoshi’s Vision]]></title>
            <link>https://medium.com/@justinpercy/breaking-satoshis-vision-e622f9bbfdca?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/e622f9bbfdca</guid>
            <category><![CDATA[craig-wright]]></category>
            <category><![CDATA[genesis]]></category>
            <category><![CDATA[bsv]]></category>
            <category><![CDATA[exploit]]></category>
            <category><![CDATA[double-spend]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Thu, 05 Mar 2020 07:46:53 GMT</pubDate>
            <atom:updated>2020-03-08T20:17:07.617Z</atom:updated>
            <content:encoded><![CDATA[<p>Exploiting BSV’s double-spend protection in the Genesis release</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/425/0*WvTHLlpF-j3gLgI-.jpg" /></figure><p>Craig Wright has relentlessly marketed himself as the sole inventor and developer responsible for Bitcoin. One would assume, he has more knowledge of the inner workings than anyone else, and could easily improve sections of the code at will, without help.</p><p>Anyone who’s aware of the 22,000+ commits (changes) made to the code since the original release — can tell you that version 0.1 was flawed, buggy and incomplete. The Bitcoin we use today was not developed by one person, it was the cooperation of hundreds if not thousands of people since 2008 and prior.</p><p>In the early days of BTC (Bitcoin), some people wondered why 0-confirmation payments are not always assumed to be valid before they’re mined. Recently, Craig Wright has misquoted Satoshi’s own posts from earlier to fit a new agenda for marketing features in BSV (Not Bitcoin).</p><h4><strong>What is the node “race condition”?</strong></h4><blockquote>The network nodes only accept the first version of a transaction they receive to incorporate into the block they’re trying to generate. When you broadcast a transaction, if someone else broadcasts a double-spend at the same time, it’s a race to propagate to the most nodes first. If one has a slight head start, it’ll geometrically spread through the network faster and get most of the nodes.</blockquote><blockquote>A rough back-of-the-envelope example:<br>1 0<br>4 1<br>16 4<br>64 16<br>80% 20%</blockquote><blockquote>So if a double-spend has to wait even a second, it has a huge disadvantage.</blockquote><blockquote>The payment processor has connections with many nodes. When it gets a transaction, it blasts it out, and at the same time monitors the network for double-spends. If it receives a double-spend on any of its many listening nodes, then it alerts that the transaction is bad. A double-spent transaction wouldn’t get very far without one of the listeners hearing it. The double-spender would have to wait until the listening phase is over, but by then, the payment processor’s broadcast has reached most nodes, or is so far ahead in propagating that the double-spender has no hope of grabbing a significant percentage of the remaining nodes.</blockquote><blockquote>Satoshi Nakamoto on BitcoinTalk<br><a href="https://bitcointalk.org/index.php?topic=423.msg3819#msg3819">https://bitcointalk.org/index.php?topic=423.msg3819#msg3819</a></blockquote><p><strong>How does the mempool double-spend attack work?</strong></p><p>Satoshi attempted to explain in 2010 how the double-spend attack is done before transactions are mined in a block: as a transaction (TX) is sitting in the mempool.</p><p>One of the most important parts of this explanation is: <em>“When you broadcast a transaction, if someone else broadcasts a double-spend at the same time, it’s a race to propagate to the most nodes first.”</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*s0Y1pVQ-18_pevEmPookKg.gif" /></figure><p>As shown above: When a payment is broadcast under normal conditions — It takes many “hops” to reach a final node destination known as the merchant wallet . During this process a slight delay occurs; The network nodes are fragmented in a state of partial consensus for the <em>potential validity</em> of that transaction (TX). Without actually “mining” or performing additional checks, nodes simply forward this new transaction to other peers they’re connected to.</p><p>At this point the network is NOT self-aware of this future “IOU” to pay the merchant once the TX is mined in a block (approximately every 10 minutes).</p><p>The mempool are transactions that qualify for inclusion in the next block only IF they’re valid. It is when they’re MINED and included in the blockchain — that full nodes check TX coin inputs and ensure they’re not found in other confirmed transaction blocks. They will reject a “double-spend” at this time and write it to the ledger for future reference, usually as an orphan block.</p><p><strong>If mempool transactions are immutable, why are we mining blocks?</strong></p><p>BSV doesn’t seam to understand the concept that a queue of transactions should not be assumed to be valid until they actually are confirmed by the nodes on the network. Consensus for payments are not based on a single wallet keeping track of the order in which they receive spent coinbase inputs… While unable to determine the actual consensus among the network; For an event that hasn’t even happened yet!</p><p>Consensus among the network nodes occur after the block is mined, broadcast and confirmed to be valid by the majority of nodes! This race-to-mine-first is the primary incentive driving the economic model of Bitcoin.</p><p>“Don’t count your eggs before they hatch”</p><p><strong>How does BSV attempt to prevent this attack?</strong></p><p>Included in the recent release “Genesis” are two new source code files: txn_double_spend_detector.cpp and txn_double_spend_detector.h.</p><p>Upon further examination, it’s clear to see in the code comments — the intended operation of these never before implemented functions by Satoshi.</p><p>These recent protocol alterations were submitted to Github from an account with the name of Richard Millis</p><blockquote>// To avoid race conditions in double spends we need to take this mutex first<br> // This approach guarantees that:<br>// a) if dstxn1 is accepted to the mempool then dstxn2 will be rejected as a mempool conflict<br>// b) if dstxn1 and dstxn2 are valid txns (at this stage) then the first of them is allowed to<br>// continue processing but the other one is rejected as a double spend</blockquote><blockquote>Line #26–30 found in <a href="https://github.com/bitcoin-sv/bitcoin-sv/blob/master/src/txn_double_spend_detector.cpp">https://github.com/bitcoin-sv/bitcoin-sv/blob/master/src/txn_double_spend_detector.cpp</a></blockquote><p>Remembering Satoshi’s quote from 2010 “When you broadcast a transaction, if someone else broadcasts a double-spend at the same time, it’s a race to propagate to the most nodes first.” One should never ASSUME that a transaction broadcast is more valid over the other based on the consecutive order in which it was received. More importantly, the self-awareness conclusion for the majority of nodes on the network is that the arbitrarily selected TX — will most likely be included in the next block is never guaranteed until after it was mined!</p><p>BSV’s altered code will now automatically give priority to the first transaction with the same coinbase inputs found in the mempool, rejecting the second one, even it it was a valid payment to a merchant or exchange!</p><p>Essentially what they did: Removed the randomized network “race-condition” described by Satoshi and implemented a default node-based settlement for detecting duplicate transactions not on the network itself! They guarantee that the duplicate TX2 will be rejected by that node, at the same time — The network could be including TX2 in the block it’s currently mining! Moments later, permanently writing it to the Blockchain ledger, invalidating TX1 NETWORK WIDE! In the process that could take minutes or seconds; The merchant or exchange suffers financial loss and the attacker receives their coins back in an address they control, minus a small fee.</p><p><strong>How could a simple attack exploit this flaw:</strong></p><p>Setting up two separate nodes, with the same wallet.dat (coinbase inputs/ private keys) an attacker could send their transaction broadcasts in opposite order in relation to the merchant and majority of network nodes, then wait for the next block to be mined. It’s pretty much that simple to exploit their ill-fated protection by statically choosing validity for incomplete data.</p><p>Shown below is how it could be easily performed in a visual representation.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*pYEfW-aFOmVLIM0WOdcV6A.gif" /></figure><p>The TXs colored in green are payments made to the attacker’s own address and the TXs colored in red are sent to the merchant or exchange’s wallet.</p><p>The first frame shows attacker 1, and attacker 2 nodes sharing the same coinbase inputs for two separate transactions in opposite order in their mempools. Green TX1 from attacker 1 is actually the same as coinbase inputs from green TX2 from attacker 2 node. This specific ordering will eventually ensure that the double-spend transactions never actually reach a “race-condition” at all; They’re pre-determined in a static format to ensure the desired transaction is confirmed!</p><p>The second frame shows green TX from attacker 1 transferring to node 1, that’s accepted into the mempool only moments later, the green TX1 is forwarded to other connected nodes.</p><p>Meanwhile — Attacker 2 has sent green TX1 as green TX2 to the merchant directly! Without using advanced node isolation attacks such as Erebus or BGP hijacking to further increase success, as required with Bitcoin (BTC). BSV now ensures it’s 100% guaranteed that the merchant node will reject green TX2 because it’s a double spend.. It fails their new code checks!</p><p>Alright, everything appears normal at this point and the merchant software queries the wallet API and accepts TX1 as a valid payment to their address and credits the product or service to the attacker.</p><p>While this process is taking milliseconds, green TX1 from attacker 1 is still propagating through the nodes on the network, eventually reaching mining pools and waiting to be included in the next block discovered.</p><p>At this point, the queued transactions used for the product or service have already completed in the shopping cart software using the red TX1. The transaction payment success is written in the merchant software database and begin to execute shipping or delivery of services. Moments later, their records are deleted from mempool and simultaneously replaced by the green TX written to the blockchain in the most recent block. The merchant account was not credited as expected, and the funds are returned to the attacker 1 wallet private keys. This gives anyone the power to cancel payments before they’re actually mined in a block — on the chain. When the new block is built from attacker 1’s green TX, it then clears the mempools and as it broadcasts to all the the other nodes, including the merchant.</p><p>Merchant software that can’t detect this slight of hand switch — immediately stopping the cart-order process before the next block is found, will eventually realize their balance is not what would be expected. The payment that should have went to their wallet address, showed up confirmed for a brief moment before red TX1 eventually was discarded and replaced by green TX1 from attacker 1 back to attacker 1! Forever recorded in history regardless of the order of TXs in the mempool.. Past, present or future! Red TX was a fake, but looked real, now the product and service shipped anyways, automatically!</p><p>The massive challenge to use off-chain protections to detect this on-chain and mempool fraud at the merchant software level is a fruitless endeavor. The software is simply unaware of the blocks currently being mined on the rest of the network with transactions only sent to specific mining nodes and not the merchant itself. Some merchants will have the upper hand advantage by manually verifying orders or a delay in shipment, and could investigate fraud already occurred while unable to depend on their BSV node to prevent it from happening in the first place; Like the way Bitcoin was designed!</p><p>“You don’t need a time machine if you know how to remember” — Rodman-Philbrick</p><p>BSV merchants are sitting ducks in a pond surrounded by hunters not afraid to exploit the allegedly “original protocol” source code, you’ve all been warned!</p><p><strong>A message to Craig Wright and BSV developers:</strong></p><p>I am disclosing this security audit publicly now that you’ve rejected my numerous attempts to explain this in detail to your minions (or you) on Twitter for over a month! You offered no reasonable bounty and would change the subject in an attempt to debate something about BTC or Lightning Network to fit the narrative that Craig portrays in his dysfunctional lawsuits or regular technobabble rambling blog posts; To pump the price higher.</p><p>Instead, you assume I am a paid puppet from Greg Maxwell… I have never chatted, spoken or met him in my entire life! You’re going to need to find a better defense for your incompetence to live up to your marketing promises.</p><p>Instead, you all offered trivial reasons why BTC is not Bitcoin and repeated “BSV is the real thing” unaware or perhaps fully aware that I know more about Bitcoin than you do! Troll and shills relentlessly attempting to sell a “better version of Bitcoin” with a new use. I was unable to communicate with anyone competent enough to have a worthwhile technical debate.</p><p>Your ego(s) got the best of you while you frantically tried to prove to the world you know everything about Bitcoin because you allegedly invented it. While forgetting the nature of open-source development is relying on others to assist in aspects you can’t quite understand, even if you’re the so called “inventor”.</p><p>Keep your dirty money, I will let professional security experts teach you a lesson you failed to comprehend. Lulz</p><p>You want to be Satoshi so badly, now you’re dealing with his problems! You’re one step closer to the becoming a real developer responsible for protecting the protocol. Have fun fixing your — what should appear to be obvious mistakes.</p><p><strong>Class dismissed…</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/560/0*gqGzrrQn0Cj2Yuwe.jpg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=e622f9bbfdca" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Bitcoin’s Buggy Sync]]></title>
            <link>https://medium.com/thecapital/bitcoins-buggy-sync-655374a2b6d2?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/655374a2b6d2</guid>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[btc]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[crypto]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Thu, 22 Aug 2019 06:44:51 GMT</pubDate>
            <atom:updated>2019-10-26T00:30:40.079Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*kT2QFP6BUhObu5wL3xORgw.png" /></figure><h4>A long history of frustrations, deceit and financial losses</h4><blockquote>“Those who know don’t talk. Those who talk don’t know. Close your mouth, block off your senses, blunt your sharpness, untie your knots, soften your glare, settle your dust. This is the primal identity. Be like the Tao. It can’t be approached or withdrawn from, benefited or harmed, honored or brought into disgrace. It gives itself up continually. That is why it endures.”― <strong>Tao Te Ching</strong></blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/619/0*CxasLR1OkC8TgnNT" /><figcaption><a href="http://www.bitcoin-en.com/install-bitcoin-qt-faster.html">[</a>4]</figcaption></figure><p>If you’ve been running a full node or the QT wallet on your desktop since 2014 or prior; You probably remember the synchronization dilemmas, maybe even the tricks and tips to speed up the process.[1]</p><p>Not only was this early flaw an annoyance — It was also responsible for the denial of service attacks — taking nodes completely offline and disrupting exchange and merchant services by forcing them to manually re-index the entire blockchain; Their wallets and nodes got stuck on orphan chains and refused to download new blocks from the network. [2]</p><h4><strong>History of the Glitch</strong></h4><p>Bitcoin Core 8 issues lead to the development of a quick solution for new node/wallet installations or recovering a ‘stuck’ wallet; By clearing the local blockchain files and using a dependable remote source for downloading. The Bootstrap — implemented into Core 9; It was used as an alternative and slightly quicker method than attempting to synchronize from other live nodes on the network.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/614/0*9ZUI0jz4KU_Bn6h2" /><figcaption><a href="http://www.bitcoin-en.com/install-bitcoin-qt-faster.html">[</a>4]</figcaption></figure><p>It does have its own risks — the transaction records could be altered by the ‘provider’ and accepted by the majority of the network; Essentially a double-spend attack, but without the mining investment required with a 51% attack.</p><blockquote>“The biggest pain point of using Bitcoin-Qt (Bitcoin Core) prior to v 0.10 as your wallet is it takes forever to sync to get the complete block chain.” [3]</blockquote><p>Low RAM, CPU or slow internet was often viewed as the culprit for such a painstaking Bitcoin experience. Bootstrapping was a quick fix, but was simply a centralized solution to a decentralized problem. This is when I began researching the resource consumption along with data transmissions during full network synchronizations and even while bootstrapping — unexpectedly the peers appeared to be fighting each other on the network while downloading orphan blocks, I also speculated this was later used as an attack vector to further enhance the Sybil (double-spend &amp; 51%) vulnerabilities — when nodes are knocked offline or stuck on undesired block heights [2] [5].</p><blockquote>“Mt. Gox plans to resume Bitcoin transfers after fixing ‘phantom’ weakness”[2]</blockquote><blockquote>“The malformed records created discrepancies in the effected exchange’s accounting systems that caused them to fall out of sync with the network.” [2]</blockquote><blockquote>“Thanks to our friends at Blockchain.info, Mt. Gox now has a workaround that will use a unique identifier created by Blockchain to show whether transactions have been modified or not.” [2]</blockquote><p>Unfortunately this “unique identifier” was not the fix-all solution required — it was only a small piece of a few simple flaws that was further compounded by improper handling of orphan blocks in the ProcessBlock function.</p><blockquote>If you have checked the network connections and added nodes if needed, but your wallet still won’t sync, then you may need to delete the blockchain along with a few other files and start over.[4]</blockquote><h4><strong>Satoshi — We have a Problem!</strong></h4><p>Bitcoin Core developers were out of quick-fix options, and the sync issue never went away. During an opportunistic time-period — some heavily funded developers [6] [7] used this chaos &amp; unrest to further their own political motives to become the dominant force among the core team; Bribes, bullying or other marketing tactics eventually forced the Bitcoin community to adopt whatever “solutions” this rogue sub-development group proposed… Anything that appeared to solve the issues of the past — they also recently did this marketing campaign with Bitcoin and Bitcoin Cash developers to create the BSV fork. [8]</p><p>In 2015 — Bitcoin Core 10 was released, the “improved” version with a completely revamped code base promoting new features called “headers-first synchronization and parallel block download”</p><blockquote>“Blocks will be stored on disk out of order (in the order they are received, really), which makes it incompatible with some tools or other programs. Reindexing using earlier versions will also not work anymore as a result of this.</blockquote><blockquote>The block index database will now hold headers for which no block is stored on disk, which earlier versions won’t support.” [9]</blockquote><p>This controversial upgrade replaced the original Satoshi peer consensus code with ChainActive class [10]. Blocks would be downloaded, stored and accessed in an order determined by a summary of block data called the CBlockHeader class — limited by incomplete block information to verify their validity.</p><p>In another erroneous attempt to streamline synchronization and prevent stuck block issues, peers would download this block header summary from only 1 peer on the network; then request full block information from all peers who shared the identical header summaries as the single peer initially connected to.</p><p>Attackers quickly figured out how to ensure their nodes had connection priority on the network and used this upgrade to increase the success rate of their Sybil attacks even more so. Making matters even worse, ChainActive was designed to find the most recent chain Tip in the past and present without proper information to make an informed consensus.</p><p>Early critics could see some possible issues developing with such an upgrade to the vitally important Satoshi Consensus, they expressed their concerns and most of it was overshadowed by the clever marketing ploy that Core 10 was robust, new and would sync far faster than previous Bitcoin versions without “stuck wallets” or bootstrapping! Some fell for this gimmick and adopted it blindly, later discovering their alt-coins could be totally destroyed overnight (past, present, and future); If they did not maintain majority hash-rate to ensure network security at all times.</p><blockquote>“No more orphan blocks. At all. We only ever request a block for which we have verified the headers” [11]</blockquote><p>But how could the wallet be sure that verified headers are in full consensus on the network when an internal class was used to find the most recent “Tip” of the chain by downloading it from a SINGLE peer upon wallet startup? How would it know the most valid network-wide chain height and hash checkpoint to continue building new blocks, or where a chain split occurred and reorganization was required, as a checkpoint? They simply couldn’t.</p><p>Greg Maxwell was one of the first to discover this new “solution” had some major issues; The wallet was disconnecting peers and banning them for “misbehaving” when what appeared to be randomly. [12]</p><p>Blocks were now also stored “out-of-order” on the disk and depended fully upon their header information, ChainActive made it possible for deep chain reorganization sometimes thousands of blocks at a time in the past. [13]</p><p>A prime example of blatant ignorance can be seen in Core 10.3 code and even newer cores; FindNextBlocksToDownload function, Line numbers: 416–420</p><blockquote>if (state-&gt;pindexLastCommonBlock == NULL) {<br>// Bootstrap quickly by guessing a parent of our best tip is the forking point.<br>// Guessing wrong in either direction is not a problem.</blockquote><blockquote>state-&gt;pindexLastCommonBlock = chainActive[std::min(state-&gt;pindexBestKnownBlock-&gt;nHeight, chainActive.Height())];<br>}</blockquote><p>This code means the wallet can perform automatic deep re-organization of the local wallet as soon as a peer reorganizes their own chain (for some odd reason)… Line numbers: 422–426</p><blockquote>// If the peer reorganized, our previous pindexLastCommonBlock may not be an ancestor<br> // of their current tip anymore. Go back enough to fix that.<br> state-&gt;pindexLastCommonBlock = LastCommonAncestor(state-&gt;pindexLastCommonBlock, state-&gt;pindexBestKnownBlock);<br> if (state-&gt;pindexLastCommonBlock == state-&gt;pindexBestKnownBlock)<br> return;</blockquote><p>All peers that did not follow the new changed “Tip” as determined by ChainActive was immediately shunted offline from the network, further enhancing the ability for Sybil attacks to completely decimate the entire network simultaneously as opposed to one node as seen with Mt. Gox in the past. [14]</p><h4><strong>The Long Treasure Hunt</strong></h4><p>After years of frustration, and later digging deeper into the source code, I was referred by some core developers to look at the net.cpp for this fatal flaw. Finding other issues there and taking a proactive approach; I was the first developer to create a primitive artificially intelligent firewall, [15] to mitigate centralized data transmission by one peer attempting to hijack the network.</p><p>Uneducated in all other aspects of the source code, I was unable to fully fix the root cause of the issue — I WAS able to successfully mitigate and prevent its damaging effects on the network by detecting and shutting it down in real-time using the network nodes to determine normal behavior; I simply did not know enough of what was good or bad network traffic, I had to make the peers learn that from other nodes; Then protect against abnormal peers and nodes using primitive artificial intelligence and machine learning.</p><p>Working on my own modified Core 8 alt-coin — Profit Hunters Coin (PHC), I was able to dive fully into the Core 8 codebase and tinker, creating some solutions never before seen in the industry and pushing new boundaries never possible with Bitcoin. [16] but I kept running into the same issue Bitcoin did, stuck wallets, slow sync, massive bandwidth, and resource usage for unexplained reasons.</p><p>After improving the old debugging code, the development team assisted me in testing and re-testing multiple versions of PHC wallet software and attempting a full blockchain synchronization more times than we can keep track of, but still learning vital data to assume normal performance benchmarks on multiple devices.</p><p>Waking up one morning, and discovering that one of my test nodes was stuck on a block and wouldn’t sync; I was excited to have finally caught the undesired event and captured a clue as to the cause in debug.log. I could see repeating errors from ProcessBlock regarding orphan blocks as it was apparent to be related to the issue.</p><h4><strong>The Root of the Problem</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*AeFFyWRanTuDA7dC7uLzsg.png" /></figure><p>PHC (Main.cpp — 1.0.0.7-base)</p><p>Looking at the source code responsible for the buggy glitches of the past can reveal a simple yet complex issue. The above code was “shunting off orphan chains” into memory and aggressively asking the peer that sent the orphan block currently getting processed to keep sending the root parents and children… filling up memory and stalling other peers from broadcasting the valid chain. This was regardless of importing, reindexing or initial block download status.</p><p>What was truly missing was smart-routing — The ability to keep track of past rejected blocks per node. Peercoin attempted to optimize this sync process by asking for the root of the orphan block and all consecutive blocks after, but this uses excessive bandwidth and does not ask the rest of the network for the valid chain, only the current peer for more invalid blocks.</p><p>This glitch has been exploited during denial of service attacks or what was known as “disk-fill-attacks” even when free space was more than available on the node. This was due to memory leak issues and not related to the hard drive at all.</p><p>Orphan chains could exhaust RAM resources quickly, this; In turn, caused database errors. Nothing was even written to the disk, it was all held in memory and crashed the database libraries with unexpected errors returned to the client software often corrupting the raw database, leveldb and even sometimes the wallet.dat file. That’s why people needed to bootstrap in a pinch or re-index their local files and “don’t forget to backup wallet.dat”.</p><h4><strong>The Not So Quick Fix</strong></h4><p>The new PHC source code ProcessBlock function has grown significantly in size after optimization and what we consider to be a stable and secure temporary quick fix.</p><p>The original Bitcoin version Core 8 contained a flaw where the wallet would receive an orphan block from a node, and then proceeded to ask for the entire chain beginning at the orphan root up to the end of the chain tip. This was also in the PHC code base that included stake mining from Peercoin. But the flaw was still unfixed and we noticed would result in an infinite loop until all mapped orphans held in memory became duplicates and was ONLY proof of stake blocks. All proof of work blocks would continually be requested — causing memory buffer overflows, database corruption and unresponsive wallets, sometimes an orphan block was written to the database by error and permanently locked the wallet client on an orphan chain. This was the glitch Bitcoin 8 and Mt. Gox suffered from, this was the “phantom bug”.</p><p>TO EDIT -&gt; new fix found recently.</p><p>PHC was able to work around a series of glitches by modifying sections of the existing code to only execute orphan chain requests during Initial Block Downloading (full node synchronization) and can be disabled when the wallet client (daemon or qt) is executed with the -orphansync=false command argument or in the configuration file. Without changing a massive amount of the consensus code to implement ChainActive and HFS; This prevents excessive resource usage and disabled any potential for “disk-fill-attacks” as experienced in the past by default. Removing this code entirely would cause the wallet to get stuck on a block, so it had to be called upon on certain conditions and in a controlled environment.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*4i2XLYzyhKkc00BFQDoK5Q.png" /></figure><p>One other critical modification done to the ProcessBlock function to ensure that while the wallet client was already synced to the network, and received an orphan block it would not go into “idle” mode and refuse to request any other peers for alternative block candidates.</p><p>By creating a new Dynamic Checkpoint buffer in CNode class called dOrphanRecv and recording orphan block hash, timestamps and parent node information; A small secondary section of code could safely allocate orphan flooding protection held in memory and would be sufficient during normal chain splits. Ensuring the client could call ForceSync function to request the valid chain from all other connected peers starting at the pindexBest-&gt;pprev valid block. Primarily it would force a PushGetBlocks request to the orphan node first, to see if they contained any valid blocks after the current best block height (-1). This appears to prevent wallets from getting stuck or falling behind on the network while minimizing bandwidth and resource consumption.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*z7s089iEw3LIXrdqYHaB5w.png" /></figure><p>mapOrphanBlocks has been modified to have only a maximum of 100 entries to prevent excessive CPU or RAM resources.</p><h4><strong>The Bonus Features</strong></h4><blockquote>“I never did anything worth doing by accident, nor did any of my inventions come by accident; they came by work.” — <strong>Plato</strong></blockquote><p><strong>HyperSync</strong> was born through the debugging process leading up to the research presented above, as the PHC development team attempted to narrow down the root causes by patching in fixes; They noticed that Core 8 could synchronize to the network in record speeds, comparable to Core 10 or above… Simply by calling to the ForceSync function during the Initial Block Download process, after processing an orphan chain from a node. This kick-starts a new cycle of block processing starting at the most recent best block height (-1) from a decentralized source (all connected peers).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/700/1*yoEKanKbtgXphx-FTPh97g.png" /></figure><p>This new feature DOES use a more than normal amount of bandwidth and more CPU/RAM resources compared to the default optimized fixes discussed in the previous sections of this paper, but can be run using the following command-line argument:</p><blockquote>phcd -hypersync<br>phc-qt -hypersync</blockquote><p><strong>Lowbandwidth</strong> mode: Now that the synchronization code has been optimized an additional feature has been added to the Firewall. It will disconnect nodes trying to synchronize blocks past a certain threshold from the current best: default 1000. This will ensure nodes running on limited bandwidth quotas are able to contribute to the network without detrimental effects on performance.</p><blockquote>phcd -lowbandwidth<br>phc-qt -lowbandwidth</blockquote><p>or edit phc.conf and add the following line:</p><blockquote>lowbandwidth=1</blockquote><h4><strong>Staking &amp; Mining is Possible on a Mobile Device</strong></h4><p>Balanced low usage will ensure unexpected data overcharges do not happen.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ArudGSZAdoj74CM3BD3CUw.png" /></figure><p>The Firewall will automatically prevent nodes from “full-syncing” to mobile nodes and disconnect/ban them for 24 hours.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*8slXwrv2Mjz6qj8iAnzw-w.png" /></figure><p><strong>The battle is far from over</strong></p><p>Initial tweaks and test show positive results, but the buggy sync is far from fixed in PHC at the moment. More troubleshooting and is testing required. Some of the patches above may become obsolete or depreciated…</p><p><strong>References:</strong></p><p>[1]<a href="https://cryptomining-blog.com/230-how-to-speed-up-new-bitcoin-wallet-synchronization/">https://cryptomining-blog.com/230-how-to-speed-up-new-bitcoin-wallet-synchronization/</a></p><p>[2] <a href="http://thomist.org/images/sample/BitcoinWallet/bitcoin-wallet-sync-slow.php">http://thomist.org/images/sample/BitcoinWallet/bitcoin-wallet-sync-slow.php</a></p><p>[3] <a href="http://www.bitcoin-en.com/install-bitcoin-qt-faster.html">http://www.bitcoin-en.com/install-bitcoin-qt-faster.html</a></p><p>[4] <a href="https://cryptorials.io/wallet-wont-sync/">https://cryptorials.io/wallet-wont-sync/</a></p><p>[5] <a href="https://bitcoin.stackexchange.com/questions/2979/what-can-i-do-when-the-blockchain-synchronization-is-stuck-at-a-specific-block">https://bitcoin.stackexchange.com/questions/2979/what-can-i-do-when-the-blockchain-synchronization-is-stuck-at-a-specific-block</a></p><p>[6] <a href="https://blockstream.com/2014/10/23/en-why-we-are-co-founders-of-blockstream/">https://blockstream.com/2014/10/23/en-why-we-are-co-founders-of-blockstream/</a></p><p>[7] <a href="https://www.businessinsider.com/craig-steven-wright-rumoured-bitcoin-creator-was-commercialising-blockchain-research-and-reviving-company-hotwire-2015-12">https://www.businessinsider.com/craig-steven-wright-rumoured-bitcoin-creator-was-commercialising-blockchain-research-and-reviving-company-hotwire-2015-12</a></p><p>[8] <a href="https://medium.com/@jonaldfyookball/an-open-letter-to-unwriter-169af09867b1">https://medium.com/@jonaldfyookball/an-open-letter-to-unwriter-169af09867b1</a></p><p>[9] <a href="https://bitcoin.org/en/release/v0.10.0">https://bitcoin.org/en/release/v0.10.0</a></p><p>[10] <a href="https://github.com/bitcoin/bitcoin/pull/5890">https://github.com/bitcoin/bitcoin/pull/5890</a></p><p>[11] <a href="https://github.com/bitcoin/bitcoin/pull/4468">https://github.com/bitcoin/bitcoin/pull/4468</a></p><p>[12] <a href="https://github.com/bitcoin/bitcoin/pull/4468#issuecomment-48102820">https://github.com/bitcoin/bitcoin/pull/4468#issuecomment-48102820</a></p><p>[13] <a href="https://github.com/bitcoin/bitcoin/archive/v0.10.3.zip">https://github.com/bitcoin/bitcoin/archive/v0.10.3.zip</a></p><p>[14] <a href="https://github.com/bitcoin/bitcoin/issues/5851">https://github.com/bitcoin/bitcoin/issues/5851</a></p><p>[15] <a href="https://github.com/BiznatchEnterprises/BitcoinFirewall">https://github.com/BiznatchEnterprises/BitcoinFirewall</a></p><p>[16] <a href="https://medium.com/altcoin-magazine/the-difference-between-general-and-specific-consensus-in-bitcoin-538ed8dfe696">https://medium.com/altcoin-magazine/the-difference-between-general-and-specific-consensus-in-bitcoin-538ed8dfe696</a></p><p><strong>Additional Research:</strong></p><p>[1] <a href="https://medium.com/@jonaldfyookball/on-solving-the-51-attack-problem-in-bitcoin-part-1-9de59e34144">https://medium.com/@jonaldfyookball/on-solving-the-51-attack-problem-in-bitcoin-part-1-9de59e34144</a></p><p>[2] <a href="https://hackernoon.com/bitcoin-core-bug-cve-2018-17144-an-analysis-f80d9d373362">https://hackernoon.com/bitcoin-core-bug-cve-2018-17144-an-analysis-f80d9d373362</a></p><p>[3] <a href="https://coinguides.org/wallet-not-syncing-fix/">https://coinguides.org/wallet-not-syncing-fix/</a></p><p>[4] <a href="https://bitcoin.stackexchange.com/questions/4920/my-client-stopped-synchronizing-how-can-i-access-my-wallet">https://bitcoin.stackexchange.com/questions/4920/my-client-stopped-synchronizing-how-can-i-access-my-wallet</a></p><p>[5] <a href="https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-April/007828.html">https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-April/007828.html</a></p><p>[6] <a href="http://12580max.com/github_/bitcoin/bitcoin/pull/14711">http://12580max.com/github_/bitcoin/bitcoin/pull/14711</a></p><p>[7] <a href="https://github.com/bitcoin/bips/pull/400">https://github.com/bitcoin/bips/pull/400</a></p><p>[8] <a href="https://en.bitcoin.it/wiki/Bitcoin_Core_0.11_%28ch_6%29:_The_Blockchain">https://en.bitcoin.it/wiki/Bitcoin_Core_0.11_%28ch_6%29:_The_Blockchain</a></p><p>[9] <a href="https://bitcointalk.org/index.php?topic=1204592.0">https://bitcointalk.org/index.php?topic=1204592.0</a></p><p>[10] <a href="https://en.wikipedia.org/wiki/Bitcoin_scalability_problem">https://en.wikipedia.org/wiki/Bitcoin_scalability_problem</a></p><p>[11] <a href="https://bitcoin.stackexchange.com/questions/37475/call-function-for-block-n-on-blockchain">https://bitcoin.stackexchange.com/questions/37475/call-function-for-block-n-on-blockchain</a></p><p>[12] <a href="https://bitcointalk.org/index.php?topic=1204592.0">https://bitcointalk.org/index.php?topic=1204592.0</a></p><p>[13] <a href="https://github.com/bitcoin/bitcoin/issues/5851">https://github.com/bitcoin/bitcoin/issues/5851</a></p><p>[14] <a href="https://sourceforge.net/projects/bitcoin/files/">https://sourceforge.net/projects/bitcoin/files/</a></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Vkr6_V3sH1eUkuu-ZhB01Q.png" /></figure><p><a href="https://twitter.com/Alt__Magazine">Altcoin Magazine</a></p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fupscri.be%2F3c1144%3Fas_embed%3Dtrue&amp;dntp=1&amp;url=https%3A%2F%2Fupscri.be%2F3c1144%2F&amp;key=d04bfffea46d4aeda930ec88cc64b87c&amp;type=text%2Fhtml&amp;schema=upscri" width="800" height="400" frameborder="0" scrolling="no"><a href="https://medium.com/media/4b37fd61c8660dc2cbfe8232dfa683e2/href">https://medium.com/media/4b37fd61c8660dc2cbfe8232dfa683e2/href</a></iframe><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=655374a2b6d2" width="1" height="1" alt=""><hr><p><a href="https://medium.com/thecapital/bitcoins-buggy-sync-655374a2b6d2">Bitcoin’s Buggy Sync</a> was originally published in <a href="https://medium.com/thecapital">The Capital</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Scarcity creates value, in theory.]]></title>
            <link>https://medium.com/@justinpercy/scarcity-creates-value-in-theory-614e8975ffe2?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/614e8975ffe2</guid>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[halving]]></category>
            <category><![CDATA[difficulty]]></category>
            <category><![CDATA[sasaygi]]></category>
            <category><![CDATA[glitch]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Wed, 31 Jul 2019 03:02:27 GMT</pubDate>
            <atom:updated>2019-07-31T03:16:41.055Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*u9IF7_Tzgf_oKJ9d.jpeg" /></figure><p>The long held belief in Bitcoin is that block halving events are directly related to the future value of the coins. The actual price not only depends on supply but also demand. Bitcoin’s speculative use case appears to be creating the most demand, due to the fact that at this time — there is not widespread merchant or bank adoption.</p><p>Yes, Bitcoin is used for purchases but those factors are somewhat negligible compared to the actual market value from any market pressures derived from the exchange of goods or services; Are nullified as soon as they’re converted back to fiat or other currencies. Those coins used in the sale are not usually held for speculative aspects, just for the capital liquidity and are required for business day to day operations.</p><p>For the past decade, the driving force for increasing market demand was to consider the reduction in supply as with a halving event shown above. Shortly after the price increases to cover the costs of mining less coins for the same hash-power due to increased difficulty. Speculative investors are aware that miners would not simply take a loss, so they began to increase their buying pressures prior to halving, knowing with almost 100% certainty they can short-sell and earn a decent profit, this compounds the effects of supply reduction, driving the prices even higher!</p><p>An often overlooked flaw in Bitcoin is found in the difficulty re-targeting source code. By allowing excessively fast blocks to be created, difficulty never fully recalculates properly to achievable levels while miners already need to work twice as hard for the same return prior to a block reward halving.</p><p><strong>Why doesn’t difficulty halve too?</strong></p><p>As with an increased demand for new coins increases, this indirectly pushes up difficulty and as a result the price. Similar to a Ponzi Scheme, long-term large mining farms get more profitable as the small miners are simply shut out of the markets completely, not even able to solve a block at a loss even if they wanted to! If you’re too late, too bad, you lost.</p><p>This is not the decentralized peer to peer cash that Satoshi envisioned originally. It has been corrupted by large hardware manufactures, Goliath mining farms and centralized mining pools. To Satoshi’s defense, up until recently there was no solution to prevent this, it was a wildcard issue never solved. The marketplace adopted around it in order to thrive.</p><p>The real problem will begin to become apparent, when the speculative nature of Bitcoin begins to fade and mass adoption from merchants enter the marketplace. HODL will become “sell as soon as you get it” (SASAYGI), if you can or you will lose it. To make matters worse; Miners solving blocks with no subsidy and only getting paid in fees will probably go bankrupt or stay offline shortly after the halving event prior to difficulty re-targeting (2016 blocks — two weeks), anticipating a speculative price increase for profitability, this will make block-times longer and in extreme cases; Blocks won’t be solved for hours, days or even weeks! The chain may temporarily slow down or stop!</p><p>Some may call this prediction FUD, or untrue but the writing is on the wall. Many alt-coins have suffered “chain-locking” after a 51% attack, difficulty was pushed to extreme levels never before seen with a short-lived spike in hash power. Bitcoin is more vulnerable due to the fact that there’s a limited amount of “spare” hash-power available to recover after miners begin dropping like flies because they can’t afford to mine at a loss and speculate on future profit.</p><p>Don’t worry, this article is not all gloom and doom… We still have time to fix this glitch, not much time, but it’s still possible if we can all agree it would be beneficial to consider the outcome if we chose to ignore it.</p><p><strong>References:</strong></p><ul><li><a href="https://medium.com/@stecumm/bitcoin-block-reward-will-halve-in-may-2020-how-will-it-affect-the-price-2543132042bf">Bitcoin Block Reward Will Halve in May 2020. How Will It Affect the Price?</a></li><li><a href="https://blog.goodaudience.com/blockchain-the-mystery-of-mining-difficulty-and-block-time-f07f0ee64fd0">Blockchain: The mystery of mining difficulty and block time..</a></li><li><a href="http://radar.oreilly.com/2014/04/bitcoin-what-happens-when-the-miners-pack-up-their-gear.html">Bitcoin: what happens when the miners pack up their gear?</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=614e8975ffe2" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Bitcoin’s dynamic consensus upgrade implemented in PHC]]></title>
            <link>https://medium.com/@justinpercy/bitcoins-dynamic-consensus-upgrade-implemented-in-phc-5808e79c0c70?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/5808e79c0c70</guid>
            <category><![CDATA[dynamic-checkpoints]]></category>
            <category><![CDATA[chain-shield]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[peer-to-peer]]></category>
            <category><![CDATA[consensus]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Sun, 28 Jul 2019 00:58:23 GMT</pubDate>
            <atom:updated>2019-07-28T22:37:41.639Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1012/1*mC4B8EBfcwJiJMWIE8wAJg.png" /></figure><p>PRESS RELEASE: July 27, 2019 — Profit Hunters Coin</p><p>An in-depth look into the “consensus” source code found in the most recent version of Bitcoin reveals limited dynamic consensus among peers.</p><p>As previously discussed this in the article: <a href="https://medium.com/altcoin-magazine/the-difference-between-general-and-specific-consensus-in-bitcoin-538ed8dfe696">The Difference Between General And Specific Consensus In Bitcoin</a> In summary, nodes lack secondary checks to verify their current chain validity without the use of Dynamic Checkpoints and Chain Buddy classes with assistance from Block Shield in cooperation with Chain Shield.</p><p><strong>Dynamic Checkpoints</strong></p><p>Dynamic Checkpoints have been implemented into PHC as a foundation for the new peer to peer consensus upgrade. Static checkpoints used in the past are only effective after a scheduled hard fork to ensure network integrity.</p><p>During attack attempts or normal chain splits (shallow chain re-organizations), nodes sometimes get stuck on the wrong chain. This simple, yet required validation source code was never developed into Bitcoin in the past.</p><p>Nodes running version PHC 1.0.0.7 on the Test-net will automatically send their nBestHeight and nBestChainHash to all active &amp; connected peers in one minute intervals. This soft-fork upgrade is also scheduled at a undefined future time on the Main-net.</p><p>These most recently received checkpoint from nodes automatically gets recorded into the altered CNode class and can be queried with CNodeStateStats class within the source code.</p><p><strong>Chain Buddy</strong></p><p>Nodes stats are collected on an interval of every 5 blocks in a ConsensusCheckpointMap containing Node IP, Timestamp, Hash, Height information in a sequential list, with a maximum amount of entries of 50.</p><p>The ConsensusCheckpointMap is evaluated using the ChainBuddy::FindConsensus() function and queried using ChainBuddy::WalletHasConsensus() function to return a TRUE or FALSE value.</p><p>Further protection can be used in conjunction with Chain Shield to halt local block creation until the network nodes have reached a majority consensus.</p><p><strong>Chain Shield</strong></p><p>ChainShield::Protect() is called to evaluate network consensus compared to the local wallet block-chain state. If any discrepancies are found while Chain Buddy halts any further chain splitting; The local wallet will “roll back” their block-chain 5 blocks and re-sync to the network to receive the most valid chain split/fork from the majority of peers connected.</p><p>This can also be useful during a double-spend attack, as live-monitoring can detect non-consensus among the peers automatically and rejoin the proper chain without massive disruption or loss of funds.</p><p><strong>Dynamic Coin Distribution</strong></p><p>DynamicCoinDistribution::ASIC_Choker() function uses the external <a href="https://medium.com/@justinpercy/bitcoins-block-time-issue-5c0c804a0e1c?source=---------2------------------">Block Shield</a> function to prevent time-warp mining, block time-spans with massive discrepancies from the expected target time, or malicious timestamp attacks.</p><p>All new blocks accepted from nodes are collected within a new class called PeerBlockIndexMap with essential information about the node and new block (Height, Timestamp, Node IP Address, PoW/PoS).</p><p>This is later evaluated every 10 new accepted blocks, using DynamicCoinDistribution::Adjust(int nHeight) function that will ensure all accepted blocks follow new strict decentralized coin distribution rules.</p><p>Regardless, if a small or large amount of mining nodes are on the network; They automatically adjust Min_DistributionPercent, Max_DistributionPercent, Min_StakePercent, and Max_StakePercent. These are dynamic similar to the difficulty function to ensure the same amount of Proof of Work vs. Proof of Stake blocks in 100 blocks are a limited, and balanced with a limited percentage of blocks validated from individual nodes.</p><p>This will ensure CPU mining stays profitable on the PHC network, during the entire block-chain&#39;s lifetime. The old security model of: The chain with the most hash power wins is obsolete! The most valid, peer to peer consensus chain wins, or at least should…</p><p>Take a look at the source code here:</p><p><a href="https://github.com/profithunterscoin/phc/blob/1.0.0.7-dev/src/checkpoints.cpp">https://github.com/profithunterscoin/phc/blob/1.0.0.7-dev/src/checkpoints.cpp</a></p><p><a href="https://github.com/profithunterscoin/phc/blob/1.0.0.7-dev/src/consensus.cpp">https://github.com/profithunterscoin/phc/blob/1.0.0.7-dev/src/consensus.cpp</a></p><p>More information available on the website: <a href="http://profithunterscoin.com/">http://profithunterscoin.com</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5808e79c0c70" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Bitcoin’s block-time issue]]></title>
            <link>https://medium.com/@justinpercy/bitcoins-block-time-issue-5c0c804a0e1c?source=rss-a404bb9e3abf------2</link>
            <guid isPermaLink="false">https://medium.com/p/5c0c804a0e1c</guid>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[phc]]></category>
            <category><![CDATA[profit-hunters-coin]]></category>
            <category><![CDATA[time-block]]></category>
            <category><![CDATA[retargeting]]></category>
            <dc:creator><![CDATA[Justin Percy]]></dc:creator>
            <pubDate>Fri, 26 Jul 2019 06:57:49 GMT</pubDate>
            <atom:updated>2019-07-26T22:44:53.932Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/840/1*rcSDAb_GOXyTd0ZyibsmVA.png" /></figure><p>It’s no secret that Bitcoin has flaws, the concept works, but needs upgrades. Long-thought beliefs are becoming obsolete as with outdated software. This is the inherent nature of the industry, push new boundaries and test the untested, depreciate and disregard old methods.</p><p>After careful review, testing and development; The Profit Hunters Coin development team have identified and fixed a major flaw found in the base Bitcoin source code and all forks thereof. This flaw has pushed difficulty to extreme heights over the last decade, creating incentive for monopolistic mining by power brokers and huge hardware investments.</p><p>CPU mining became obsolete when GPUs were reconfigured to generate the hashes required to validate a block. The mathematical formula is designed to stop blocks from being created too quickly, therefore making it work harder the next time; In the process (in theory) slowing down the block times. This formula is effective to a certain point, at least when re-targeting is set to 1 block and not 2016 like in Bitcoin.</p><p>ASIC hardware eventually forced all new blocks to be created by a few large mining pools producing excessive work as defined by the difficulty algorithm. If someone with a large amount of hash power generates a bunch of blocks, then anyone with a CPU or GPU has to work just as hard if not harder than the ASIC machine prior and in the future for any hope of generating rewards.</p><p>As seen in the picture above, the difficulty formula does not ensure accurate block times. Many custom re-targeting algorithms come very close but only deal with half the issue. The generic flaw of not forcing a minimal block space very close to the expected block target time. By allowing unlimited valid blocks consecutively without ensuring proper spacing — this directly pushes difficulty to unreachable levels required to ensure true decentralized mining on a peer to peer network such as Bitcoin. The circles marked in red show block spacing very off from target, orange symbolize minimal discrepancies as green is almost or exactly on target.</p><p>Profit Hunters Coin — Block Shield 1.0</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/597/1*1v4i9sIotv1LDed5x0zIgw.png" /></figure><p>The picture above is a screenshot of our Testnet mining. All blocks that are significantly out of time are rejected, regardless of hash power. This ensures that difficulty is NEVER pushed to unreachable levels after re-targeting occurs prior to the following block. Never before in history has a CPU miner and ASIC mining hardware been able to cooperate and validate blocks for the same network, using the same algorithm, without compromising profitability!</p><p>Miners will need to be reconfigured to “wait their turn” after the hard fork is activated. The internal mining functions have been restored in the newest version of 1.0.0.7 and will automatically pause for the next expected target time. Brute forcing invalid block times will never achieve successful results.</p><p>ASIC Choker functions working in conjunction with Block Shield and Dynamic Distribution, will ensure all miners on the network receive fair compensation for their validations, regardless of efforts from centralized pools.</p><p>PHC hard fork will ensure block times are exactly on time, every time… and “1 CPU = 1 vote”, just like Satoshi envisioned originally.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/920/1*MBdeeyGyHsLJfwj9StsFXg.png" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5c0c804a0e1c" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>