Content deleted Content added
Simple mathematics dicated the upper limit of a card sharing network→Limitations of Internet Card Sharing |
Simple mathematics dicated the upper limit of a card sharing network→Limitations of Internet Card Sharing |
||
Line 4:
The number of receivers capable of using the key stream is the upper limit (both theoretical and practical) for any card sharing network. To explain it in terms of your radio example, if there is a finite number of radio receivers, then the number of radios capable of receiving the radio broadcast from your radio station is finite and therefore limited. External conditions limit the size of card sharing network. If N is the number of receivers capable of using the key stream then the number of possible receivers in a card sharing network is always going to be less than or equal to N. [[User:Jmccormac|Jmccormac]] ([[User talk:Jmccormac|talk]]) 02:30, 16 February 2014 (UTC)
::There is no finite number of radios that can be used, or made, no limit exists, the fact that there is a finite number of radios in existence does not limit the potential number of radios that can receive a signal. There is no upper limit to how many receivers are capable of receiving the key stream, every new receiver that is built can receive the stream, just like every new radio built is able to receive the radio signal, regardless of how many already are receiving the same signal. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Notwillywanka|Notwillywanka]] ([[User talk:Notwillywanka|talk]] • [[Special:Contributions/Notwillywanka|contribs]]) 16:38, 17 February 2014 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
Obviously you haven't much of an understanding of this hack or simple mathematics. The theory behind it is really quite simple
==Merger Proposal==
|