{"id":31729,"date":"2019-10-31T21:42:44","date_gmt":"2019-10-31T18:42:44","guid":{"rendered":"https:\/\/prohoster.info\/blog\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie\/"},"modified":"2019-10-31T21:42:44","modified_gmt":"2019-10-31T18:42:44","slug":"sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie","title":{"rendered":"N\u00e1hodn\u00e9 \u010d\u00edsla a decentralizovan\u00e9 siete: praktick\u00e9 uplatnenie","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<h2 id=\"vvedenie\">\u00davod<\/h2>\n<p><\/p>\n<p><em>\u201eGener\u00e1cia n\u00e1hodn\u00fdch \u010d\u00edsel je pr\u00edli\u0161 d\u00f4le\u017eit\u00e1 na to, aby sme ju nechali na n\u00e1hodu\u201c<\/em><br \/>\n<em>Robert Cahill, 1970<\/em><\/p>\n<p><\/p>\n<p>Tento \u010dl\u00e1nok je venovan\u00fd praktick\u00e9mu uplatneniu rie\u0161en\u00ed, ktor\u00e9 pou\u017e\u00edvaj\u00fa kolekt\u00edvnu gener\u00e1ciu n\u00e1hodn\u00fdch \u010d\u00edsel v ned\u00f4veryhodnom prostred\u00ed. Kr\u00e1tko povedan\u00e9 \u2014 ako a na \u010do sa pou\u017e\u00edva n\u00e1hodnos\u0165 v blockchaine a trochu o tom, ako rozl\u00ed\u0161i\u0165 \u201edobr\u00fa\u201c n\u00e1hodnos\u0165 od \u201ezl\u00fdch\u201c. Generovanie naozaj n\u00e1hodn\u00e9ho \u010d\u00edsla je mimoriadne zlo\u017eit\u00fd probl\u00e9m, aj na samostatnom po\u010d\u00edta\u010di, a u\u017e dlh\u00fa dobu sa n\u00edm zaoberaj\u00fa kryptografi. V decentralizovan\u00fdch sie\u0165ach je gener\u00e1cia n\u00e1hodn\u00fdch \u010d\u00edsel e\u0161te zlo\u017eitej\u0161ia a d\u00f4le\u017eitej\u0161ia.<\/p>\n<p><\/p>\n<p>Pr\u00e1ve v sie\u0165ach, kde si \u00fa\u010dastn\u00edci navz\u00e1jom neveria, mo\u017enos\u0165 vygenerova\u0165 nepopierate\u013en\u00e9 n\u00e1hodn\u00e9 \u010d\u00edslo efekt\u00edvne rie\u0161i mno\u017estvo d\u00f4le\u017eit\u00fdch \u00faloh a v\u00fdznamne zlep\u0161uje u\u017e existuj\u00face sch\u00e9my. Hranie hazardn\u00fdch hier a lot\u00e9rie tu v\u0161ak v\u00f4bec nie s\u00fa kone\u010dn\u00fdm cie\u013eom, ako by sa na prv\u00fd poh\u013ead mohlo zda\u0165 nezasv\u00e4ten\u00e9mu \u010ditate\u013eovi.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h2 id=\"generaciya-sluchaynyh-chisel\">Gener\u00e1cia n\u00e1hodn\u00fdch \u010d\u00edsel<\/h2>\n<p><\/p>\n<p>Po\u010d\u00edta\u010de samy nevedia generova\u0165 n\u00e1hodn\u00e9 \u010d\u00edsla, na to potrebuj\u00fa pomoc zvonka. Po\u010d\u00edta\u010d m\u00f4\u017ee z\u00edska\u0165 nejak\u00fa n\u00e1hodn\u00fa hodnotu napr\u00edklad pomocou pohybov my\u0161i, mno\u017estva pou\u017eitej pam\u00e4te, parazitn\u00fdch pr\u00fadov na kontaktoch procesora a mnoh\u00fdch \u010fal\u0161\u00edch zdrojov, naz\u00fdvan\u00fdch zdroje entropie. Tieto hodnoty nie s\u00fa \u00faplne n\u00e1hodn\u00e9, preto\u017ee sa nach\u00e1dzaj\u00fa v ur\u010ditom rozsahu alebo maj\u00fa predv\u00eddate\u013en\u00fd charakter zmien. Aby sa tak\u00e9 \u010d\u00edsla premenili na skuto\u010dne n\u00e1hodn\u00e9 \u010d\u00edslo v danom rozsahu, pou\u017e\u00edvaj\u00fa sa kryptologick\u00e9 transform\u00e1cie, aby sa z nerovnomerne rozdelen\u00fdch hodn\u00f4t zdrojov entropie z\u00edskali rovnomerne rozdelen\u00e9 pseudon\u00e1hodn\u00e9 hodnoty. Z\u00edskan\u00e9 hodnoty sa naz\u00fdvaj\u00fa pseudon\u00e1hodn\u00e9, preto\u017ee nie s\u00fa skuto\u010dne n\u00e1hodn\u00e9, ale deterministicky vyroben\u00e9 z entropie. Ka\u017ed\u00fd dobr\u00fd kryptologick\u00fd algoritmus, \u0161ifruj\u00faci d\u00e1ta, produkuje \u0161ifrovan\u00e9 texty, ktor\u00e9 by \u0161tatisticky mali by\u0165 nerozoznate\u013en\u00e9 od n\u00e1hodnej sekvencie, tak\u017ee na generovanie n\u00e1hody m\u00f4\u017eete bra\u0165 zdroj entropie, ktor\u00fd zabezpe\u010duje len dobr\u00fa neopakovate\u013enos\u0165 a nepredv\u00eddate\u013enos\u0165 hodn\u00f4t, aj v mal\u00fdch rozsahoch, zvy\u0161ok pr\u00e1ce na rozptyle a premie\u0161an\u00ed bitov v v\u00fdslednej hodnote prevedie \u0161ifrovac\u00ed algoritmus.<\/p>\n<p><\/p>\n<p>Aby som uzavrel kr\u00e1tku lekciu, dod\u00e1m, \u017ee generovanie n\u00e1hodn\u00fdch \u010d\u00edsel, ba ani na jednom zariaden\u00ed, nie je len jedn\u00fdm zo z\u00e1kladn\u00fdch pilierov zabezpe\u010denia na\u0161ich d\u00e1t, generovan\u00e9 pseudon\u00e1hodn\u00e9 \u010d\u00edsla sa pou\u017e\u00edvaj\u00fa pri nadviazan\u00ed zabezpe\u010den\u00fdch spojen\u00ed v r\u00f4znych sie\u0165ach, na generovanie kryptografick\u00fdch k\u013e\u00fa\u010dov, na vyv\u00e1\u017eenie za\u0165a\u017eenia, kontrolu integrity a e\u0161te pre mno\u017estvo \u010fal\u0161\u00edch aplik\u00e1ci\u00ed. Bezpe\u010dnos\u0165 mnoh\u00fdch protokolov z\u00e1vis\u00ed od mo\u017enosti vygenerova\u0165 spo\u013eahliv\u00fa, nepredv\u00eddate\u013en\u00fa n\u00e1hodu zvonka, uchova\u0165 ju a nezverejni\u0165 ju do \u010fal\u0161ieho kroku protokolu, inak bude bezpe\u010dnos\u0165 ohrozen\u00e1. \u00datok na gener\u00e1tor pseudon\u00e1hodn\u00fdch hodn\u00f4t je mimoriadne nebezpe\u010dn\u00fd a ohrozuje v\u0161etok softv\u00e9r, ktor\u00fd vyu\u017e\u00edva generovanie n\u00e1hodn\u00fdch \u010d\u00edsel. <\/p>\n<p><\/p>\n<p>V\u0161etko toto by ste mali vedie\u0165, ak ste absolvovali z\u00e1kladn\u00fd kurz o kryptografii, tak\u017ee pokra\u010dujeme v diskusii o decentralizovan\u00fdch sie\u0165ach.<\/p>\n<p><\/p>\n<h2 id=\"random-v-blokcheynah\">N\u00e1hodnos\u0165 v blockchains<\/h2>\n<p><\/p>\n<p>Najsk\u00f4r sa budem rozpr\u00e1va\u0165 o blockchains s podporou smart kontraktov, pr\u00e1ve tie m\u00f4\u017eu naplno vyu\u017ei\u0165 mo\u017enosti, ktor\u00e9 poskytuje kvalitn\u00e1 nepopierate\u013en\u00e1 n\u00e1hodnos\u0165. \u010ealej, pre stru\u010dnos\u0165, budem t\u00fato technol\u00f3giu naz\u00fdva\u0165 \u201c<em>Publicly Verifiable Random Beacons<\/em>\u201d alebo PVRB. Ke\u010f\u017ee blockchains s\u00fa siete, ktor\u00fdch inform\u00e1cie m\u00f4\u017ee overi\u0165 ka\u017ed\u00fd \u00fa\u010dastn\u00edk, k\u013e\u00fa\u010dovou \u010das\u0165ou n\u00e1zvu je \u201cPublicly Verifiable\u201d, t.j. ka\u017ed\u00fd, kto chce, m\u00f4\u017ee pomocou v\u00fdpo\u010dtov z\u00edska\u0165 d\u00f4kaz, \u017ee z\u00edskan\u00e9 \u010d\u00edslo, umiestnen\u00e9 v blockchaine, m\u00e1 tieto vlastnosti:<\/p>\n<p><\/p>\n<ul>\n<li>V\u00fdsledok mus\u00ed ma\u0165 dokazate\u013ene rovnomern\u00e9 rozdelenie, t.j. mus\u00ed by\u0165 zalo\u017een\u00fd na dokazate\u013ene odolnej kryptografii. <\/li>\n<li>Nie je mo\u017en\u00e9 kontrolova\u0165 ani jeden z bitov v\u00fdsledku. V d\u00f4sledku toho nie je mo\u017en\u00e9 v\u00fdsledok predpoveda\u0165.<\/li>\n<li>Nie je mo\u017en\u00e9 sabotova\u0165 protokol generovania pomocou ne\u00fa\u010dasti v protokole alebo pre\u0165a\u017een\u00edm siete \u00fato\u010dn\u00fdmi spr\u00e1vami.<\/li>\n<li>V\u0161etko vy\u0161\u0161ie uveden\u00e9 mus\u00ed by\u0165 odoln\u00e9 vo\u010di dohod\u00e1m tolerovate\u013en\u00e9ho po\u010dtu nespo\u013eahliv\u00fdch \u00fa\u010dastn\u00edkov protokolu (napr\u00edklad 1\/3 \u00fa\u010dastn\u00edkov).<\/li>\n<\/ul>\n<p><\/p>\n<p>Ak\u00e1ko\u013evek mo\u017enos\u0165 dohodnutej men\u0161ej skupiny \u00fa\u010dastn\u00edkov vykona\u0165 aj kontrolovan\u00fd p\u00e1rny\/nep\u00e1rny n\u00e1hodn\u00fd gener\u00e1tor \u2014 je bezpe\u010dnostn\u00e1 diera. Ak\u00e1ko\u013evek mo\u017enos\u0165 skupiny zastavi\u0165 generovanie n\u00e1hody \u2014 je bezpe\u010dnostn\u00e1 diera. V podstate, probl\u00e9mov je ve\u013ea a t\u00e1to \u00faloha nie je jednoduch\u00e1...<\/p>\n<p><\/p>\n<p>Zd\u00e1 sa, \u017ee najd\u00f4le\u017eitej\u0161ia aplik\u00e1cia pre PVRB s\u00fa r\u00f4zne hry, lot\u00e9rie a vlastne ak\u00e9ko\u013evek formy hazardu na blockchaine. Naozaj, je to d\u00f4le\u017eit\u00fd smer, ale n\u00e1hodnos\u0165 v blockchains m\u00e1 aj v\u00fdznamnej\u0161ie aplik\u00e1cie. Po\u010fme sa na ne pozrie\u0165.<\/p>\n<p><\/p>\n<h2 id=\"algoritmy-konsensusa\">Algoritmy konsenzu<\/h2>\n<p><\/p>\n<p>PVRB pre organiz\u00e1ciu sie\u0165ov\u00e9ho konsenzu zohr\u00e1va obrovsk\u00fa \u00falohu. Transakcie v blockchains s\u00fa chr\u00e1nen\u00e9 elektronick\u00fdm podpisom, preto \u201e\u00fatok na transakciu\u201c znamen\u00e1 v\u017edy zahrnutie\/vyl\u00fa\u010denie transakcie do bloku (alebo do nieko\u013ek\u00fdch blokov). Hlavnou \u00falohou konsenzusn\u00e9ho algoritmu je dohodn\u00fa\u0165 sa na porad\u00ed t\u00fdchto transakci\u00ed a na porad\u00ed blokov, ktor\u00e9 obsahuj\u00fa tieto transakcie. Rovnako nevyhnutnou vlastnos\u0165ou pre re\u00e1lne blockchains je fin\u00e1lnos\u0165 \u2014 schopnos\u0165 siete dohodn\u00fa\u0165 sa na tom, \u017ee re\u0165azec a\u017e po fin\u00e1lny blok je kone\u010dn\u00fd a nikdy nebude vyl\u00fa\u010den\u00fd kv\u00f4li objaveniu nov\u00e9ho fork-u. Zvy\u010dajne, aby sa dohodlo, \u017ee blok je platn\u00fd a, \u010do je najd\u00f4le\u017eitej\u0161ie, fin\u00e1lny, je potrebn\u00e9 z\u00edska\u0165 podpisy od v\u00e4\u010d\u0161iny v\u00fdrobcov blokov (\u010falej BP \u2014 block-producers), \u010do si vy\u017eaduje minim\u00e1lne prenies\u0165 re\u0165azec blokov na v\u0161etky BP a podpisy roz\u0161\u00edri\u0165 medzi v\u0161et\u00fdmi BP. Pri raste po\u010dtu BP exponenci\u00e1lne rastie po\u010det potrebn\u00fdch spr\u00e1v v sieti, preto algoritmy konsenzu, ktor\u00e9 vy\u017eaduj\u00fa fin\u00e1lnos\u0165, pou\u017eit\u00e9 napr\u00edklad v pBFT-konsenze Hyperledger, nefunguj\u00fa s potrebnou r\u00fdchlos\u0165ou, za\u010d\u00ednaj\u00fac u\u017e od nieko\u013ek\u00fdch desiatok BP, vy\u017eaduj\u00fac obrovsk\u00e9 mno\u017estvo pripojen\u00ed. <\/p>\n<p><\/p>\n<p>Ak v sieti existuje nepopierate\u013en\u00fd a \u010destn\u00fd PVRB, potom aj v najjednoduch\u0161om pr\u00edstupe je mo\u017en\u00e9 na jeho z\u00e1klade vybra\u0165 jedn\u00e9ho z block producers a ur\u010di\u0165 ho za \u201el\u00eddera\u201c po\u010das jedn\u00e9ho kola protokolu. Ak m\u00e1me <code>N<\/code> block producer-ov, z ktor\u00fdch <code>M: M &gt; 1\/2 N<\/code> s\u00fa \u010destn\u00ed, necenzuruj\u00fa transakcie a nevytv\u00e1raj\u00fa forky re\u0165aze s cie\u013eom uskuto\u010dni\u0165 \u00fatok \u201edouble spend\u201c, potom pou\u017eitie rovnomerne rozdelen\u00e9ho nepopierate\u013en\u00e9ho PVRB umo\u017en\u00ed vybra\u0165 \u010destn\u00e9ho l\u00eddra s pravdepodobnos\u0165ou <code>M \/ N (M \/ N &gt; 1\/2)<\/code>. Ak ka\u017ed\u00e9mu l\u00eddrovi prirad\u00edme vlastn\u00fd \u010dasov\u00fd interval, po\u010das ktor\u00e9ho m\u00f4\u017ee vytvori\u0165 blok a validova\u0165 re\u0165azec, a tieto intervaly s\u00fa \u010dasovo rovnak\u00e9, re\u0165az blokov \u010destn\u00fdch BP bude dlh\u0161ia ako re\u0165az vytvoren\u00e1 zlovestn\u00fdmi BP, a konsenzu\u00e1lny algoritmus, ktor\u00fd sa spolieha na d\u013a\u017eku re\u0165azca, jednoducho odmietne \u201ezl\u00fa\u201c. Tento princ\u00edp pride\u013eovania rovnak\u00fdch \u010dasov\u00fdch kvant ka\u017ed\u00e9mu BP bol prv\u00fdkr\u00e1t aplikovan\u00fd v Graphene (predchodcovi EOS) a umo\u017e\u0148uje v\u00e4\u010d\u0161ine blokov uzatv\u00e1ra\u0165 jedn\u00fdm podpisom, \u010do v\u00fdrazne zni\u017euje sie\u0165ov\u00fa z\u00e1\u0165a\u017e a umo\u017e\u0148uje tomuto konsenzu fungova\u0165 extr\u00e9mne r\u00fdchlo a stabilne. Napriek tomu sa sie\u0165 EOS v s\u00fa\u010dasnosti mus\u00ed uch\u00fdli\u0165 k \u0161peci\u00e1lnym blokom (Last Irreversible Block), ktor\u00e9 s\u00fa potvrden\u00e9 podpismi 2\/3 BP. Tieto bloky sl\u00fa\u017eia na zabezpe\u010denie fin\u00e1lnosti (impossibility of a chain fork starting before the last Last Irreversible Block).<\/p>\n<p><\/p>\n<p>Tie\u017e, v re\u00e1lnych implement\u00e1ci\u00e1ch, je sch\u00e9ma protokolu zlo\u017eitej\u0161ia \u2013 hlasovanie o navrhovan\u00fdch blokoch sa uskuto\u010d\u0148uje v nieko\u013ek\u00fdch etap\u00e1ch, aby udr\u017ealo \u010dinnos\u0165 siete v pr\u00edpade vynechania blokov a probl\u00e9mov so sie\u0165ou, ale aj s oh\u013eadom na to, algoritmy konsenzu vyu\u017e\u00edvaj\u00face PVRB vy\u017eaduj\u00fa podstatne menej spr\u00e1v medzi BP, \u010do ich umo\u017e\u0148uje r\u00fdchlej\u0161ie ako tradi\u010dn\u00fd P\u0412FT alebo r\u00f4zne jeho modifik\u00e1cie.<\/p>\n<p><\/p>\n<p>Najv\u00fdraznej\u0161\u00ed z\u00e1stupca tak\u00fdchto algoritmov: <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2016\/889.pdf\">Ouroboros<\/a><\/noindex> od t\u00edmu Cardano, ktor\u00fd, ako bolo ozn\u00e1men\u00e9, m\u00e1 matematicky dok\u00e1zate\u013en\u00fa odolnos\u0165 vo\u010di pr\u00edtomnosti sprisahania medzi BP. <\/p>\n<p><\/p>\n<p>V Ouroboros PVRB sa pou\u017e\u00edva na ur\u010denie takzvan\u00e9ho \u201eBP schedule\u201c \u2014 rozvrhu, pod\u013ea ktor\u00e9ho je ka\u017ed\u00e9mu BP priraden\u00fd jeho \u010dasov\u00fd slot na publikovanie bloku. Ve\u013ekou v\u00fdhodou pou\u017e\u00edvania PVRB je \u00fapln\u00e9 \u201erovnopr\u00e1vnos\u0165\u201c BP (pod\u013ea ve\u013ekosti ich zostatkov). \u010cestnos\u0165 PVRB zaru\u010duje, \u017ee zlovestn\u00e9 BP nem\u00f4\u017eu kontrolova\u0165 rozvrh \u010dasov\u00fdch slotov, a preto nem\u00f4\u017eu manipulova\u0165 s re\u0165azcom, vopred pripravuj\u00fac a analyzuj\u00fac forky re\u0165azca, a na v\u00fdber fork sta\u010d\u00ed spo\u013eahn\u00fa\u0165 sa jednoducho na d\u013a\u017eku re\u0165azca, bez manipul\u00e1ci\u00ed s rafinovan\u00fdmi sp\u00f4sobmi v\u00fdpo\u010dtu \u201eu\u017eito\u010dnosti\u201c BP a \u201ev\u00e1hy\u201c jeho blokov. <\/p>\n<p><\/p>\n<p>Vo v\u0161etk\u00fdch pr\u00edpadoch, ke\u010f je potrebn\u00e9 zvoli\u0165 n\u00e1hodn\u00e9ho \u00fa\u010dastn\u00edka v decentralizovanej sieti, bude takmer v\u017edy najlep\u0161ou vo\u013ebou PVRB, a nie deterministick\u00e1 varianta zalo\u017een\u00e1 napr\u00edklad na hashi bloku. Bez PVRB mo\u017enos\u0165 ovplyvni\u0165 v\u00fdber \u00fa\u010dastn\u00edka vedie k vzniku \u00fatokov, v ktor\u00fdch \u00fato\u010dn\u00edk m\u00f4\u017ee, vyberaj\u00fac z nieko\u013ek\u00fdch mo\u017enost\u00ed bud\u00facnosti, zvoli\u0165 nasleduj\u00faceho skorumpovan\u00e9ho \u00fa\u010dastn\u00edka alebo rovno nieko\u013ek\u00fdch, aby zabezpe\u010dil v\u00e4\u010d\u0161\u00ed podiel na rozhodovan\u00ed. Pou\u017eitie PVRB diskredituje tieto typy \u00fatokov.<\/p>\n<p><\/p>\n<h2 id=\"masshtabirovanie-i-balansirovka-nagruzki\">\u0160k\u00e1lovanie a vyva\u017eovanie z\u00e1\u0165a\u017ee<\/h2>\n<p><\/p>\n<p>PVRB m\u00f4\u017ee prinies\u0165 v\u00e1\u017ene v\u00fdhody aj v \u00faloh\u00e1ch na zn\u00ed\u017eenie z\u00e1\u0165a\u017ee, \u0161k\u00e1lovanie platieb. Najprv stoj\u00ed za to obozn\u00e1mi\u0165 sa s <noindex><a rel=\"nofollow\" href=\"https:\/\/people.csail.mit.edu\/rivest\/pubs\/Riv97b.pdf\">\u010dl\u00e1nkom<\/a><\/noindex> Rivestom \"Electronic Lottery Tickets as Micropayments\". Z\u00e1kladn\u00e1 my\u0161lienka spo\u010d\u00edva v tom, \u017ee namiesto toho, aby ste vykonali 100 platieb po 1c od plati\u010da pr\u00edjemcovi, m\u00f4\u017eete sa z\u00fa\u010dastni\u0165 spravodlivej lot\u00e9rie s cenou 1$ = 100c, kde plati\u010d pri ka\u017edej platbe 1c odovzd\u00e1va banke jeden zo svojich 100 \"lot\u00e9riov\u00fdch l\u00edstkov\". Jeden z t\u00fdchto l\u00edstkov vyhr\u00e1 banke 1$, a pr\u00e1ve tento l\u00edstok m\u00f4\u017ee pr\u00edjemca zaznamena\u0165 v blockchaine. Najd\u00f4le\u017eitej\u0161ie je, \u017ee ostatn\u00fdch 99 l\u00edstkov sa pren\u00e1\u0161a medzi pr\u00edjemcom a plati\u010dom bez ak\u00e9hoko\u013evek vonkaj\u0161ieho z\u00e1sahu, prostredn\u00edctvom s\u00fakromn\u00e9ho kan\u00e1la a akouko\u013evek potrebnou r\u00fdchlos\u0165ou. Dobr\u00e9 op\u00edsanie protokolu na z\u00e1klade tejto sch\u00e9my v sieti Emercoin si m\u00f4\u017eete pre\u010d\u00edta\u0165 <noindex><a rel=\"nofollow\" href=\"https:\/\/medium.com\/@emer.tech\/randpay-6a028f16c82a\">tu<\/a><\/noindex>. <\/p>\n<p><\/p>\n<p>T\u00e1to sch\u00e9ma m\u00e1 nieko\u013eko probl\u00e9mov, napr\u00edklad pr\u00edjemca m\u00f4\u017ee presta\u0165 obsluhova\u0165 plati\u010da ihne\u010f po obdr\u017ean\u00ed v\u00fdhern\u00e9ho l\u00edstka, ale pre mnoho \u0161peci\u00e1lnych aplik\u00e1ci\u00ed, ako je cenov\u00e1 \u0161trukt\u00fara na min\u00fatu alebo elektronick\u00e9 predplatn\u00e9 na slu\u017eby, je mo\u017en\u00e9 na ne zabudn\u00fa\u0165. Hlavn\u00fdm po\u017eiadavkom je samozrejme \u010destnos\u0165 vykon\u00e1vanej lot\u00e9rie, a na jej uskuto\u010dnenie je nevyhnutn\u00fd PVRB.<\/p>\n<p><\/p>\n<p>V\u00fdber n\u00e1hodn\u00e9ho \u00fa\u010dastn\u00edka je mimoriadne d\u00f4le\u017eit\u00fd aj pre protokoly shardingu, ktor\u00e9ho cie\u013eom je horizont\u00e1lne \u0161k\u00e1lovanie blockchainu, \u010do umo\u017e\u0148uje r\u00f4znym BP spracov\u00e1va\u0165 len svoj rozsah transakci\u00ed. Je to ve\u013emi zlo\u017eit\u00e1 \u00faloha, najm\u00e4 pokia\u013e ide o bezpe\u010dnos\u0165 pri sp\u00e1jan\u00ed shardov. Spravodliv\u00fd v\u00fdber n\u00e1hodn\u00e9ho BP na ur\u010denie jeho zodpovednosti za konkr\u00e9tny shard, rovnako ako v konsenzu\u00e1lnych algoritmoch \u2014 to je tie\u017e \u00faloha PVRB. V centralizovan\u00fdch syst\u00e9moch sa shardov\u00e9 jednotky prira\u010fuj\u00fa vyv\u00e1\u017eova\u010dom, ktor\u00fd jednoducho vypo\u010d\u00edta hash po\u017eiadavky a odo\u0161le ho potrebn\u00e9mu vykon\u00e1vate\u013eovi. V blockchainoch m\u00f4\u017ee ma\u0165 ovplyvnenie tohto priradenia za n\u00e1sledok \u00fatok na konsenzus. Napr\u00edklad, obsah transakci\u00ed m\u00f4\u017ee by\u0165 kontrolovan\u00fd \u00fato\u010dn\u00edkom, ktor\u00fd m\u00f4\u017ee ovplyv\u0148ova\u0165, ktor\u00e9 transakcie sa dostan\u00fa do jeho ovl\u00e1dan\u00e9ho shardu a manipulova\u0165 s blockchainom v \u0148om. Diskusiu o probl\u00e9me pou\u017eitia n\u00e1hodn\u00fdch \u010d\u00edsel pre \u00falohy shardingu v Ethereu si m\u00f4\u017eete pre\u010d\u00edta\u0165. <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/ethereum\/wiki\/wiki\/Sharding-FAQ#how-is-the-randomness-for-random-sampling-generated\">tu<\/a><\/noindex><br \/>\nSharding je jedna z najambici\u00f3znej\u0161\u00edch a najv\u00e1\u017enej\u0161\u00edch \u00faloh v oblasti blockchainu, jej rie\u0161enie umo\u017en\u00ed budova\u0165 decentralizovan\u00e9 siete fantastick\u00e9ho v\u00fdkonu a objemu. PVRB je len jedn\u00fdm z d\u00f4le\u017eit\u00fdch blokov na jej rie\u0161enie.<\/p>\n<p><\/p>\n<h2 id=\"igry-ekonomicheskie-protokoly-arbitrazh\">Hry, ekonomick\u00e9 protokoly, arbitr\u00e1\u017e<\/h2>\n<p><\/p>\n<p>\u00daloha n\u00e1hodn\u00fdch \u010d\u00edsel v hernom priemysle je \u0165a\u017eko prece\u0148ova\u0165. Ich jasn\u00e9 vyu\u017eitie v online kas\u00ednach a nepriame v hodnoten\u00ed \u00fa\u010dinkov ak\u00e9hoko\u013evek hr\u00e1\u010dskeho rozhodnutia predstavuj\u00fa ve\u013emi zlo\u017eit\u00fd probl\u00e9m pre decentralizovan\u00e9 siete, kde nie je mo\u017en\u00e9 sa spo\u013eahn\u00fa\u0165 na centr\u00e1lny zdroj n\u00e1hodnosti. Av\u0161ak, n\u00e1hodn\u00fd v\u00fdber m\u00f4\u017ee rie\u0161i\u0165 mno\u017estvo ekonomick\u00fdch probl\u00e9mov a pom\u00e1ha\u0165 pri vytv\u00e1ran\u00ed jednoduch\u0161\u00edch a efekt\u00edvnej\u0161\u00edch protokolov. Predpokladajme, \u017ee v na\u0161om protokole sa vyskytuj\u00fa spory t\u00fdkaj\u00face sa platieb za niektor\u00e9 lacn\u00e9 slu\u017eby, a tieto spory nast\u00e1vaj\u00fa dos\u0165 zriedka. V tomto pr\u00edpade, ak existuje nepopierate\u013en\u00fd PVRB, klienti a predajcovia sa m\u00f4\u017eu dohodn\u00fa\u0165 na n\u00e1hodnom rie\u0161en\u00ed sporov s vopred stanovenou pravdepodobnos\u0165ou. Napr\u00edklad, s pravdepodobnos\u0165ou 60 % vyhr\u00e1 klient a s pravdepodobnos\u0165ou 40 % vyhr\u00e1 predajca. Tak\u00fdto na prv\u00fd poh\u013ead absurdn\u00fd pr\u00edstup umo\u017e\u0148uje automaticky rie\u0161i\u0165 spory s presne predv\u00eddate\u013en\u00fdm pomerom v\u00fdhier\/prehier, \u010do vyhovuje obom stran\u00e1m bez akejko\u013evek \u00fa\u010dasti tretej strany a zbyto\u010dnej straty \u010dasu. Navy\u0161e, pomer pravdepodobnost\u00ed m\u00f4\u017ee by\u0165 dynamick\u00fd a z\u00e1visie\u0165 od niektor\u00fdch glob\u00e1lnych premenn\u00fdch. Napr\u00edklad, ak m\u00e1 spolo\u010dnos\u0165 dobr\u00e9 v\u00fdsledky, zaznamen\u00e1va sa n\u00edzky po\u010det sporov a vysok\u00e1 n\u00e1vratnos\u0165, spolo\u010dnos\u0165 m\u00f4\u017ee automaticky posun\u00fa\u0165 pravdepodobnos\u0165 rie\u0161enia sporu smerom k orient\u00e1cii na klientov, napr\u00edklad 70\/30 alebo 80\/20, a naopak, ak spory sp\u00f4sobuj\u00fa ve\u013ek\u00e9 finan\u010dn\u00e9 straty a s\u00fa podvodn\u00e9 alebo neadekv\u00e1tne, m\u00f4\u017eu sa pos\u00fava\u0165 pravdepodobnosti na opa\u010dn\u00fa stranu.<\/p>\n<p><\/p>\n<p>Existuje mno\u017estvo zauj\u00edmav\u00fdch decentralizovan\u00fdch protokolov, ako s\u00fa tokenom kur\u00e1torovan\u00e9 registre, predik\u010dn\u00e9 trhy, bonding curves a mnoh\u00e9 \u010fal\u0161ie, ktor\u00e9 predstavuj\u00fa ekonomick\u00e9 hry odme\u0148uj\u00face dobr\u00e9 spr\u00e1vanie a trestaj\u00face zl\u00e9. \u010casto sa tu objavuj\u00fa bezpe\u010dnostn\u00e9 probl\u00e9my, pri\u010dom opatrenia na ochranu pred nimi si navz\u00e1jom odporuj\u00fa. To, \u010do je chr\u00e1nen\u00e9 pred \u00fatokom \u201eve\u013eryb\u201c s miliardami tokenov (\u201ebig stake\u201c), je zranite\u013en\u00e9 vo\u010di \u00fatokom tis\u00edcky \u00fa\u010dtov s mal\u00fdmi zostatkami (\u201esybil stake\u201c), a opatrenia prijat\u00e9 proti jedn\u00e9mu typu \u00fatoku, ako napr\u00edklad neline\u00e1rne poplatky vytvoren\u00e9 na \u00fa\u010dely znepr\u00edjemnenia pr\u00e1ce ve\u013ek\u00fdm stakerom, s\u00fa zvy\u010dajne diskreditovan\u00e9 in\u00fdm \u00fatokom. Ke\u010f\u017ee ide o ekonomick\u00fa hru, pr\u00edslu\u0161n\u00e9 \u0161tatistick\u00e9 v\u00e1hy sa daj\u00fa vypo\u010d\u00edta\u0165 vopred a jednoducho nahradi\u0165 poplatky n\u00e1hodne generovan\u00fdmi s pr\u00edslu\u0161n\u00fdm rozdelen\u00edm. Tak\u00e9to pravdepodobnostn\u00e9 poplatky sa implementuj\u00fa ve\u013emi jednoducho, ak existuje v blockchain-e spo\u013eahliv\u00fd zdroj n\u00e1hody a nevy\u017eaduj\u00fa \u017eiadne zlo\u017een\u00e9 v\u00fdpo\u010dty, \u010d\u00edm s\u0165a\u017euj\u00fa \u017eivot aj ve\u013eryb\u00e1m, aj sybilom.<br \/>\nJe potrebn\u00e9 si v\u0161ak na\u010falej pam\u00e4ta\u0165, \u017ee kontrola nad jedin\u00fdm bitom v tejto n\u00e1hode umo\u017e\u0148uje podv\u00e1dza\u0165, zmen\u0161ova\u0165 a zvy\u0161ova\u0165 pravdepodobnosti v dvojn\u00e1sobku, tak\u017ee \u010destn\u00fd PVRB je najd\u00f4le\u017eitej\u0161ou s\u00fa\u010das\u0165ou tak\u00fdchto protokolov. <\/p>\n<p><\/p>\n<h2 id=\"gde-nayti-pravilnyy-random\">Kde n\u00e1js\u0165 spr\u00e1vnu n\u00e1hodu?<\/h2>\n<p><\/p>\n<p>Teoreticky, \u010destn\u00fd n\u00e1hodn\u00fd v\u00fdber v decentralizovan\u00fdch sie\u0165ach umo\u017e\u0148uje zabezpe\u010di\u0165 dokazate\u013en\u00fa bezpe\u010dnos\u0165 takmer ka\u017ed\u00e9ho protokolu pred sprisahan\u00edm. Od\u00f4vodnenie je pomerne jednoduch\u00e9 \u2014 ak sie\u0165 s\u00fahlas\u00ed s jedn\u00fdm bitom 0 alebo 1, a medzi \u00fa\u010dastn\u00edkmi je menej ako polovica ne\u010destn\u00fdch, potom pri dostato\u010dnom po\u010dte iter\u00e1ci\u00ed sie\u0165 zaru\u010dene dospeje k konsenzu o tomto bite s pevnou pravdepodobnos\u0165ou. Proste preto, \u017ee \u010destn\u00e1 n\u00e1hoda bude vybera\u0165 51 z 100 \u00fa\u010dastn\u00edkov v 51% pr\u00edpadoch. Ale to je teoretick\u00e9, preto\u017ee v re\u00e1lnych sie\u0165ach, na zabezpe\u010denie takej \u00farovne bezpe\u010dnosti, ak\u00e1 je v \u010dl\u00e1nkoch, je potrebn\u00fdch mno\u017estvo spr\u00e1v medzi hostite\u013emi, zlo\u017eit\u00e1 viacstup\u0148ov\u00e1 kryptografia a ak\u00e9ko\u013evek skomplikovanie protokolu okam\u017eite prid\u00e1va nov\u00e9 vektory \u00fatokov.<br \/>\nPreto zatia\u013e nevid\u00edme v blockchainoch overene odoln\u00fd PVRB, ktor\u00fd by bol pou\u017e\u00edvan\u00fd dostato\u010dne dlh\u00fd \u010das na to, aby pre\u0161iel testovan\u00edm skuto\u010dn\u00fdmi aplik\u00e1ciami, viacer\u00fdmi auditmi, z\u00e1\u0165a\u017eami a samozrejme aj re\u00e1lnymi \u00fatokmi, bez ktor\u00fdch je \u0165a\u017ek\u00e9 nazva\u0165 produkt naozaj bezpe\u010dn\u00fdm.<\/p>\n<p><\/p>\n<p>Napriek tomu existuje nieko\u013eko perspekt\u00edvnych pr\u00edstupov, ktor\u00e9 sa l\u00ed\u0161ia mno\u017estvom detailov a niektor\u00fd z nich ur\u010dite vyrie\u0161i probl\u00e9m. Pri s\u00fa\u010dasn\u00fdch v\u00fdpo\u010dtov\u00fdch zdrojoch dok\u00e1\u017ee kryptografick\u00e1 te\u00f3ria celkom \u0161ikovne prech\u00e1dza\u0165 do praktick\u00fdch aplik\u00e1ci\u00ed. V bud\u00facnosti s rados\u0165ou poskytneme inform\u00e1cie o implement\u00e1ci\u00e1ch PVRB: teraz ich je nieko\u013eko, pri\u010dom ka\u017ed\u00e1 m\u00e1 svoj vlastn\u00fd s\u00fabor d\u00f4le\u017eit\u00fdch vlastnost\u00ed a osobitosti v implement\u00e1cii a za ka\u017edou stoj\u00ed dobr\u00fd n\u00e1pad. Ransom v s\u00fa\u010dasnosti rie\u0161i len zop\u00e1r t\u00edmov a sk\u00fasenosti ka\u017ed\u00e9ho z nich s\u00fa nesmierne d\u00f4le\u017eit\u00e9 pre ostatn\u00fdch. D\u00fafame, \u017ee na\u0161e inform\u00e1cie umo\u017enia ostatn\u00fdm t\u00edmom ur\u00fdchli\u0165 proces s oh\u013eadom na sk\u00fasenosti predchodcov.<\/p>\n<p>Zdroj: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/448330\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u00ab\u0413\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044f \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0445 \u0447\u0438\u0441\u0435\u043b \u0441\u043b\u0438\u0448\u043a\u043e\u043c \u0432\u0430\u0436\u043d\u0430, \u0447\u0442\u043e\u0431\u044b \u043e\u0441\u0442\u0430\u0432\u043b\u044f\u0442\u044c \u0435\u0451 \u043d\u0430 \u0432\u043e\u043b\u044e \u0441\u043b\u0443\u0447\u0430\u044f\u00bb \u0420\u043e\u0431\u0435\u0440\u0442 \u041a\u0430\u0432\u044c\u044e, 1970 \u042d\u0442\u0430 \u0441\u0442\u0430\u0442\u044c\u044f \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u0430 \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u043c\u0443 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u044e \u0440\u0435\u0448\u0435\u043d\u0438\u0439, \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u044e\u0449\u0438\u0445 \u043a\u043e\u043b\u043b\u0435\u043a\u0442\u0438\u0432\u043d\u0443\u044e \u0433\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044e \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0445 \u0447\u0438\u0441\u0435\u043b \u0432 \u043d\u0435\u0434\u043e\u0432\u0435\u0440\u0435\u043d\u043d\u043e\u0439 \u0441\u0440\u0435\u0434\u0435. \u0415\u0441\u043b\u0438 \u043a\u0440\u0430\u0442\u043a\u043e \u2014 \u043a\u0430\u043a \u0438 \u0434\u043b\u044f \u0447\u0435\u0433\u043e \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u0435\u0442\u0441\u044f \u0440\u0430\u043d\u0434\u043e\u043c \u0432 \u0431\u043b\u043e\u043a\u0447\u0435\u0439\u043d\u0430\u0445, \u0438 \u043d\u0435\u043c\u043d\u043e\u0433\u043e \u043f\u0440\u043e \u0442\u043e, \u043a\u0430\u043a \u043e\u0442\u043b\u0438\u0447\u0438\u0442\u044c \u201c\u0445\u043e\u0440\u043e\u0448\u0438\u0439\u201d \u0440\u0430\u043d\u0434\u043e\u043c \u043e\u0442 \u201c\u043f\u043b\u043e\u0445\u043e\u0433\u043e\u201d. \u0413\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044f \u0434\u0435\u0439\u0441\u0442\u0432\u0438\u0442\u0435\u043b\u044c\u043d\u043e \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u043e\u0433\u043e \u0447\u0438\u0441\u043b\u0430 \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-31729","post","type-post","status-publish","format-standard","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.3 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u00ab\u0413\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044f \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0445 \u0447\u0438\u0441\u0435\u043b \u0441\u043b\u0438\u0448\u043a\u043e\u043c \u0432\u0430\u0436\u043d\u0430, \u0447\u0442\u043e\u0431\u044b \u043e\u0441\u0442\u0430\u0432\u043b\u044f\u0442\u044c \u0435\u0451 \u043d\u0430 \u0432\u043e\u043b\u044e \u0441\u043b\u0443\u0447\u0430\u044f\u00bb \u0420\u043e\u0431\u0435\u0440\u0442 \u041a\u0430\u0432\u044c\u044e, 1970 \u042d\u0442\u0430 \u0441\u0442\u0430\u0442\u044c\u044f \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u0430 \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u043c\u0443 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u044e.\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.3\" \/>\n\t\t<meta property=\"og:locale\" content=\"sk_SK\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u0421\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0435 \u0447\u0438\u0441\u043b\u0430 \u0438 \u0434\u0435\u0446\u0435\u043d\u0442\u0440\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u043d\u043d\u044b\u0435 \u0441\u0435\u0442\u0438: \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u0435 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u0435 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u00ab\u0413\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044f \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0445 \u0447\u0438\u0441\u0435\u043b \u0441\u043b\u0438\u0448\u043a\u043e\u043c \u0432\u0430\u0436\u043d\u0430, \u0447\u0442\u043e\u0431\u044b \u043e\u0441\u0442\u0430\u0432\u043b\u044f\u0442\u044c \u0435\u0451 \u043d\u0430 \u0432\u043e\u043b\u044e \u0441\u043b\u0443\u0447\u0430\u044f\u00bb \u0420\u043e\u0431\u0435\u0440\u0442 \u041a\u0430\u0432\u044c\u044e, 1970 \u042d\u0442\u0430 \u0441\u0442\u0430\u0442\u044c\u044f \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u0430 \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u043c\u0443 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u044e.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-10-31T18:42:44+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:42:44+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47N\u00e1hodn\u00e9 \u010d\u00edsla a decentralizovan\u00e9 siete: praktick\u00e9 vyu\u017eitie | ProHoster","description":"\u00davod \u201eGenerovanie n\u00e1hodn\u00fdch \u010d\u00edsel je pr\u00edli\u0161 d\u00f4le\u017eit\u00e9 na to, aby sme ho nechali na n\u00e1hodu\u201c Robert Coveyou, 1970 Tento \u010dl\u00e1nok sa zameriava na praktick\u00e9 vyu\u017eitie.","canonical_url":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"sk_SK","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u0421\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0435 \u0447\u0438\u0441\u043b\u0430 \u0438 \u0434\u0435\u0446\u0435\u043d\u0442\u0440\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u043d\u043d\u044b\u0435 \u0441\u0435\u0442\u0438: \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u0435 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u0435 | ProHoster","og:description":"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u00ab\u0413\u0435\u043d\u0435\u0440\u0430\u0446\u0438\u044f \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b\u0445 \u0447\u0438\u0441\u0435\u043b \u0441\u043b\u0438\u0448\u043a\u043e\u043c \u0432\u0430\u0436\u043d\u0430, \u0447\u0442\u043e\u0431\u044b \u043e\u0441\u0442\u0430\u0432\u043b\u044f\u0442\u044c \u0435\u0451 \u043d\u0430 \u0432\u043e\u043b\u044e \u0441\u043b\u0443\u0447\u0430\u044f\u00bb \u0420\u043e\u0431\u0435\u0440\u0442 \u041a\u0430\u0432\u044c\u044e, 1970 \u042d\u0442\u0430 \u0441\u0442\u0430\u0442\u044c\u044f \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u0430 \u043f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u043c\u0443 \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u044e.","og:url":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-prakticheskoe-primenenie","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-10-31T18:42:44+00:00","article:modified_time":"2019-10-31T18:42:44+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"31729","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-01-21 07:32:20","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 19:04:45","updated":"2026-01-21 07:32:20","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts\/31729","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/comments?post=31729"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts\/31729\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/media?parent=31729"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/categories?post=31729"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/tags?post=31729"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}