<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>Magickey</title>
        <link>https://paragraph.com/@magickey</link>
        <description>undefined</description>
        <lastBuildDate>Fri, 22 May 2026 03:23:10 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>Magickey</title>
            <url>https://storage.googleapis.com/papyrus_images/ac9c9e2ba1df97da8ed4d28f167a196295080f04d3f674a5f56c3f906937f53d.png</url>
            <link>https://paragraph.com/@magickey</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[Bitcoin: A Peer-to-Peer Electronic Cash System]]></title>
            <link>https://paragraph.com/@magickey/bitcoin-a-peer-to-peer-electronic-cash-system-3</link>
            <guid>byPGcV1qfRfoX5klnr6s</guid>
            <pubDate>Mon, 24 Jan 2022 02:00:10 GMT</pubDate>
            <description><![CDATA[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. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof...]]></description>
            <content:encoded><![CDATA[<p>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. 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&apos;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>]]></content:encoded>
            <author>magickey@newsletter.paragraph.com (Magickey)</author>
        </item>
        <item>
            <title><![CDATA[Bitcoin: A Peer-to-Peer Electronic Cash System]]></title>
            <link>https://paragraph.com/@magickey/bitcoin-a-peer-to-peer-electronic-cash-system-2</link>
            <guid>2CfakDjLrPLSgSbiXaHO</guid>
            <pubDate>Fri, 21 Jan 2022 12:43:10 GMT</pubDate>
            <description><![CDATA[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. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof...]]></description>
            <content:encoded><![CDATA[<p>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. 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&apos;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>]]></content:encoded>
            <author>magickey@newsletter.paragraph.com (Magickey)</author>
        </item>
        <item>
            <title><![CDATA[Bitcoin: A Peer-to-Peer Electronic Cash System]]></title>
            <link>https://paragraph.com/@magickey/bitcoin-a-peer-to-peer-electronic-cash-system</link>
            <guid>6AEOi2sSbnA5qhbWPROP</guid>
            <pubDate>Fri, 21 Jan 2022 11:59:50 GMT</pubDate>
            <description><![CDATA[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. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof...]]></description>
            <content:encoded><![CDATA[<p>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. 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&apos;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>]]></content:encoded>
            <author>magickey@newsletter.paragraph.com (Magickey)</author>
        </item>
    </channel>
</rss>