{"id":33888,"date":"2019-10-31T21:55:15","date_gmt":"2019-10-31T18:55:15","guid":{"rendered":"https:\/\/prohoster.info\/blog\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii\/"},"modified":"2019-10-31T21:55:15","modified_gmt":"2019-10-31T18:55:15","slug":"sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii","status":"publish","type":"post","link":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii","title":{"rendered":"Iejauktie skait\u013ci un decentraliz\u0113tas t\u012bklu strukt\u016bras: \u012bstenojumi","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<h1 id=\"vvedenie\">Ievads<\/h1>\n<p><\/p>\n<pre><code class=\"plaintext\">function getAbsol\u016btiRandomNummur() {\n        return 4; \\\/\\\/ returns absolutely random number!\n}<\/code><\/pre>\n<p><\/p>\n<p>T\u0101pat k\u0101 ar absol\u016bti iztur\u012bga \u0161ifra koncepciju kriptogr\u0101fij\u0101, re\u0101lie \"Publicly Verifiable Random Beacon\" (turpm\u0101k PVRB) protokoli tikai cen\u0161as maksim\u0101li pietuvoties ide\u0101lajai sh\u0113mai, jo re\u0101l\u0101s t\u012bklos t\u0101 nav tie\u0161i piem\u0113rojama: j\u0101vienojas ir par vienu bitu, j\u0101b\u016bt daudz k\u0101rt\u0101m, un visiem zi\u0146ojumiem j\u0101b\u016bt ide\u0101liem \u0101triem un vienm\u0113r j\u0101non\u0101k galam\u0113r\u0137\u012b. Protams, re\u0101l\u0101s t\u012bklos tas t\u0101 nav. T\u0101p\u0113c, projekt\u0113jot PVRB konkr\u0113t\u0101m vajadz\u012bb\u0101m m\u016bsdienu blok\u0137\u0113d\u0113s, papildus neiesp\u0113jam\u012bbai kontrol\u0113t ieg\u016bto nejau\u0161\u012bbu un kriptogr\u0101fisko iztur\u012bbu rodas v\u0113l daudz t\u012bri arhitekt\u016bras un tehnisku probl\u0113mu.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<p>Pati blok\u0137\u0113de b\u016bt\u012bb\u0101 ir PVRB sazi\u0146as vide, kur\u0101 zi\u0146ojumi = dar\u012bjumi. Tas \u013cauj da\u013c\u0113ji abstrah\u0113ties no t\u012bkla probl\u0113m\u0101m, zi\u0146ojumu pieg\u0101des trauc\u0113jumiem, starpprogrammat\u016bras probl\u0113m\u0101m \u2014 visus \u0161os riskus uz\u0146emas decentraliz\u0113t\u0101 t\u012bkls, un t\u0101s galven\u0101 v\u0113rt\u012bba PVRB m\u0113r\u0101 ir, ka nav iesp\u0113jams atsaukt vai saboj\u0101t jau nos\u016bt\u012btu dar\u012bjumu \u2014 tas ne\u013cauj dal\u012bbniekiem atteikties no dal\u012bbas protokol\u0101, ja vien vi\u0146i nav veiksm\u012bgi uzbruku\u0161i uz konsensusu. \u0160\u0101ds dro\u0161\u012bbas l\u012bmenis ir pie\u0146emams, t\u0101p\u0113c PVRB j\u0101b\u016bt iztur\u012bgam pret dal\u012bbnieku sazv\u0113rest\u012bb\u0101m tie\u0161i t\u0101d\u0101 pa\u0161\u0101 m\u0113r\u0101 k\u0101 pamata blok\u0137\u0113dei. Tas ar\u012b nor\u0101da, ka PVRB j\u0101b\u016bt da\u013cai no konsensusa, ja t\u012bkls ir vienojies par galveno blok\u0137\u0113di, tad ar\u012b j\u0101vienojas par vien\u012bgo god\u012bgo rezult\u0101tu nejau\u0161\u012bbu. Vai nu, PVRB ir vienk\u0101r\u0161i patst\u0101v\u012bgs protokols, kas realiz\u0113ts ar vied\u0101 kontrakta pal\u012bdz\u012bbu, str\u0101d\u0101jot asinkron\u0101 re\u017e\u012bm\u0101 attiec\u012bb\u0101 uz blok\u0137\u0113di un blokiem. Ab\u0101m pieej\u0101m ir savi ieguvumi un tr\u016bkumi, un izv\u0113le starp t\u0101m ir \u0101rk\u0101rt\u012bgi nenoteikta. <\/p>\n<p><\/p>\n<h2 id=\"dva-sposoba-implementacii-pvrb\">Divi PVRB implement\u0101cijas veidi<\/h2>\n<p><\/p>\n<p>Detaliz\u0113ti aprakst\u012bsim divus PVRB implement\u0101cijas variantus \u2014 patst\u0101v\u012bgo versiju, kas darbojas, izmantojot blok\u0137\u0113des neatkar\u012bgu viedo kontraktu, un consensus-integrated \u2014 integr\u0113tu protokolu, saska\u0146\u0101 ar kuru t\u012bkls vienojas par blok\u0137\u0113di un iek\u013cautajiem dar\u012bjumiem. Visos gad\u012bjumos es \u0146em\u0161u v\u0113r\u0101 popul\u0101ros blok\u0137\u0113des dzin\u0113jus: Ethereum, EOS un visus, kas l\u012bdz\u012bgi tiem sav\u0101 vied\u0101 kontrakta izvieto\u0161anas un apstr\u0101des veid\u0101. <\/p>\n<p><\/p>\n<h3 id=\"standalone-contract\">Patst\u0101v\u012bgs l\u012bgums<\/h3>\n<p><\/p>\n<p>\u0160aj\u0101 variant\u0101 PVRB ir viedais l\u012bgums, kas pie\u0146em random-producer (t\u0101l\u0101k RP) dar\u012bjumus, apstr\u0101d\u0101 tos, apvieno rezult\u0101tus, un rezult\u0101t\u0101 non\u0101k pie k\u0101das v\u0113rt\u012bbas, kuru var ieg\u016bt jebkur\u0161 lietot\u0101js no \u0161\u012b l\u012bguma. \u0160\u012b v\u0113rt\u012bba var netikt glab\u0101ta l\u012bgum\u0101 tie\u0161i, bet var b\u016bt att\u0113lota tikai ar datiem, no kuriem var determin\u0113t tikai vienu vien\u012bgu rezult\u0101ta izlases v\u0113rt\u012bbu. \u0160aj\u0101 sh\u0113m\u0101 RP ir blok\u0137\u0113des lietot\u0101ji, un piedal\u012bties \u0123ener\u0113\u0161anas proces\u0101 var at\u013caut jebkuru.<\/p>\n<p><\/p>\n<p>Patst\u0101v\u012bg\u0101 l\u012bguma variants ir labs:<\/p>\n<p><\/p>\n<ul>\n<li>portabilit\u0101tes (l\u012bgumi var tikt p\u0101rnesti no blok\u0137\u0113des uz blok\u0137\u0113di)<\/li>\n<li>ievie\u0161anas un test\u0113\u0161anas viegluma (l\u012bgumus ir \u0113rti rakst\u012bt un test\u0113t)<\/li>\n<li>ekonomisko sh\u0113mu \u012bsteno\u0161anas \u0113rtuma (viegl\u0101k izveidot savu token, kura lo\u0123ika kalpo PVRB m\u0113r\u0137iem)<\/li>\n<li>iesp\u0113jas palaist jau eso\u0161\u0101s blok\u0137\u0113d\u0113s<\/li>\n<\/ul>\n<p><\/p>\n<p>Tam ir ar\u012b tr\u016bkumi:<\/p>\n<p><\/p>\n<ul>\n<li>stingri ierobe\u017eojumi resursiem pie apr\u0113\u0137iniem, dar\u012bjumu apjoma un uzglab\u0101\u0161anas (vienk\u0101r\u0161\u0101k sakot, cpu\/mem\/io)<\/li>\n<li>ierobe\u017eojumi oper\u0101cij\u0101m l\u012bgum\u0101 (ne visas instrukcijas ir pieejamas, gr\u016bti pievienot \u0101r\u0113j\u0101s bibliot\u0113kas)<\/li>\n<li>neiesp\u0113jam\u012bba organiz\u0113t zi\u0146ojumu apmai\u0146u \u0101tr\u0101k, nek\u0101 dar\u012bjumi tiek iek\u013cauti blok\u0137\u0113d\u0113<\/li>\n<\/ul>\n<p><\/p>\n<p>\u0160is variants ir piem\u0113rots PVRB \u012bsteno\u0161anai, kas j\u0101palai\u017e jau eso\u0161\u0101 t\u012bkl\u0101, nesatur sare\u017e\u0123\u012btu kriptogr\u0101fiju un neprasa lielu mijiedarb\u012bbu.<\/p>\n<p><\/p>\n<h3 id=\"consensus-integrated\">Konsensu integr\u0113ts<\/h3>\n<p><\/p>\n<p>\u0160aj\u0101 PVRB versij\u0101 kod\u0101 ir realiz\u0113ta blok\u0137\u0113des mezgla funkcionalit\u0101te, kas ir ieb\u016bv\u0113ta vai darbojas paral\u0113li mezglu starp\u0101 notieko\u0161ajai zi\u0146u apmai\u0146ai. Protokola rezult\u0101ti tiek re\u0123istr\u0113ti tie\u0161i ra\u017eotajos blokos, bet protokola zi\u0146ojumi tiek nos\u016bt\u012bti pa p2p t\u012bklu starp mezgliem. T\u0101 k\u0101 protokols rezult\u0101t\u0101 rada skait\u013cus, kas j\u0101pieraksta blokos, t\u012bklam ir j\u0101non\u0101k pie konsensa atiec\u012bb\u0101 uz tiem. Tas noz\u012bm\u0113, ka PVRB zi\u0146ojumi, t\u0101pat k\u0101 dar\u012bjumi, j\u0101valid\u0113 mezgliem un j\u0101tiek iek\u013cautiem blokos, lai jebkur\u0161 t\u012bkla dal\u012bbnieks var\u0113tu valid\u0113t PVRB protokola iev\u0113ro\u0161anu. Tas autom\u0101tiski noved pie ac\u012bmredzama risin\u0101juma \u2014 ja t\u012bkls vienojas par konsensu attiec\u012bb\u0101 uz bloku un dar\u012bjumiem taj\u0101, tad PVRB ir j\u0101k\u013c\u016bst par konsensa da\u013cu, nevis atsevi\u0161\u0137u protokolu. Pret\u0113j\u0101 gad\u012bjum\u0101 var rasties situ\u0101cija, kad bloks ir der\u012bgs konsensa skat\u012bjum\u0101, bet PVRB protokols nav iev\u0113rots, un PVRB skat\u012bjum\u0101 bloks nav pie\u0146emams. T\u0101d\u0113\u013c, ja tiek izv\u0113l\u0113ts \u201ckonsensa-integr\u0113tais\u201d variants, PVRB k\u013c\u016bst par svar\u012bgu konsensa sast\u0101vda\u013cu.<\/p>\n<p><\/p>\n<p>Aprakstot PVRB ievie\u0161anu konsensa l\u012bmen\u012b t\u012bkl\u0101, oblig\u0101ti j\u0101apsver fin\u0101lit\u0101tes jaut\u0101jumi. Fin\u0101lit\u0101te ir meh\u0101nisms, ko izmanto determin\u0113tos konsensos, lai fiks\u0113tu bloku (un \u0137\u0113di, kas uz to v\u0113rsta), kas ir gal\u012bgs un nekad netiks atmests, pat ja par\u0101d\u0101s paral\u0113lais fork. Piem\u0113ram, Bitcoin \u0161\u0101ds meh\u0101nisms nav \u2014 ja tiek public\u0113ta \u0137\u0113de ar liel\u0101ku sare\u017e\u0123\u012bt\u012bbu, t\u0101 nomain\u012bs jebkuru maz\u0101k sare\u017e\u0123\u012btu, neatkar\u012bgi no \u0137\u0113des garuma. Savuk\u0101rt EOS fin\u0101lie bloki ir t\u0101 d\u0113v\u0113tie P\u0113d\u0113jie Neatgriezeniskie Bloki, kas par\u0101d\u0101s vid\u0113ji ik p\u0113c 432 blokiem (12*21 + 12*15, priek\u0161balsis + priek\u0161s\u0113d\u0113t\u0101js). \u0160is process b\u016bt\u012bb\u0101 ir 2\/3 parakstu gaid\u012b\u0161ana blokproducentiem (BP). Kad par\u0101d\u0101s fork, kas ir vec\u0101ks par p\u0113d\u0113jo LIB, tie vienk\u0101r\u0161i tiek atmesti. \u0160is meh\u0101nisms garant\u0113, ka dar\u012bjums ir iek\u013cauts blok\u0137\u0113d\u0113 un nekad netiks atcelts, neatkar\u012bgi no t\u0101, k\u0101das resursi ir uzbruc\u0113jam. Ar\u012b fin\u0101lie bloki ir blokki, ko parakst\u012bju\u0161i 2\/3 BP Hyperledger, Tendermint un citos pBFT balst\u012btos konsensos. T\u0101pat, protokolam, lai nodro\u0161in\u0101tu fin\u0101lit\u0101ti, ir j\u0113ga b\u016bt virs konsensa, jo tas var darboties asinkroni ar bloku ra\u017eo\u0161anu un public\u0113\u0161anu. <noindex><a rel=\"nofollow\" href=\"https:\/\/arxiv.org\/pdf\/1710.09437.pdf\">raksts<\/a><\/noindex> par fin\u0101lumu Ethereum.<\/p>\n<p><\/p>\n<p>Fin\u0101lums ir \u0101rk\u0101rt\u012bgi svar\u012bgs lietot\u0101jiem, kuri bez t\u0101 var k\u013c\u016bt par \"double spend\" uzbrukuma upuriem, kad BP \"tur\" blokas un public\u0113 tos p\u0113c tam, kad t\u012bkls ir \"redz\u0113jis\" labu dar\u012bjumu. Ja fin\u0101luma nav, tad public\u0113tais forks aizvieto bloku ar \"labu\" dar\u012bjumu ar citu, no \"slikt\u0101\" forka, kur \u0161ie pa\u0161i l\u012bdzek\u013ci tiek p\u0101rvietoti uz uzbruc\u0113ja adresi. PVRB gad\u012bjum\u0101 pras\u012bbas attiec\u012bb\u0101 uz fin\u0101lumu v\u0113l pastiprin\u0101s, jo forku veido\u0161ana PVRB noz\u012bm\u0113, ka uzbruc\u0113js var sagatavot vair\u0101kus re\u0101lus variantus ar m\u0113r\u0137i public\u0113t izdev\u012bg\u0101ko sev un ierobe\u017eot potenci\u0101l\u0101 uzbrukuma laiku \u2014 labs risin\u0101jums.<\/p>\n<p><\/p>\n<p>T\u0101p\u0113c lab\u0101kais variants ir apvienot PVRB un fin\u0101lumu vien\u0101 protokol\u0101 \u2014 tad fin\u0101liz\u0113tais bloks = fin\u0101liz\u0113ts re\u0101ls, un tie\u0161i to var\u0113ja ieg\u016bt. Tagad sp\u0113l\u0113t\u0101ji sa\u0146ems garant\u0113tu re\u0101lu  p\u0113c N sekund\u0113m un var\u0113s b\u016bt dro\u0161i, ka to atgriezt vai atk\u0101rtoti nosp\u0113l\u0113t nav iesp\u0113jams.<\/p>\n<p><\/p>\n<p>Variants ar consensus-integrated ir labs:<\/p>\n<p><\/p>\n<ul>\n<li>ar iesp\u0113ju asimandriskai \u012bsteno\u0161anai attiec\u012bb\u0101 uz bloku ra\u017eo\u0161anu \u2014 bloki tiek ra\u017eoti k\u0101 parasti, bet paral\u0113li tam var darboties PVRB protokols, kas ra\u017eo re\u0101lus ne katr\u0101 blok\u0101<\/li>\n<li>ar iesp\u0113ju \u012bstenot pat smagu kriptogr\u0101fiju, bez ierobe\u017eojumiem, kas piem\u0113roti viedajiem l\u012bgumiem<\/li>\n<li>ar iesp\u0113ju organiz\u0113t zi\u0146ojumu apmai\u0146u \u0101tr\u0101k, nek\u0101 dar\u012bjumi tiek iek\u013cauti blok\u0137\u0113d\u0113, piem\u0113ram, da\u013ca protokola var darboties starp mezgliem bez zi\u0146ojumu izplat\u012b\u0161anas t\u012bkl\u0101<\/li>\n<\/ul>\n<p><\/p>\n<p>Tam ir ar\u012b tr\u016bkumi:<\/p>\n<p><\/p>\n<ul>\n<li>gr\u016bt\u012bbas test\u0113\u0161an\u0101 un izstr\u0101d\u0113 \u2014 vajadz\u0113s emul\u0113t t\u012bkla k\u013c\u016bdas, pazudu\u0161us mezglus, t\u012bkla hardforkus<\/li>\n<li>k\u013c\u016bdas \u012bsteno\u0161an\u0101 prasa t\u012bkla hardforku<\/li>\n<\/ul>\n<p><\/p>\n<p>Abiem PVRB \u012bsteno\u0161anas veidiem ir ties\u012bbas past\u0101v\u0113t, bet \u012bsteno\u0161ana uz viedajiem l\u012bgumiem m\u016bsdienu blok\u0137\u0113d\u0113s tom\u0113r ir diezgan stingri ierobe\u017eota apr\u0113\u0137inu resursos, un jebkur\u0161 p\u0101reja uz nopietnu kriptogr\u0101fiju bie\u017ei ir vienk\u0101r\u0161i neiesp\u0113jama. Un nopietna kriptogr\u0101fija mums b\u016bs nepiecie\u0161ama, k\u0101 tiks demonstr\u0113ts v\u0113l\u0101k. Lai gan \u0161\u012b probl\u0113ma ir ac\u012bmredzami pagaidu raksturs, nopietna kriptogr\u0101fija l\u012bgumos ir nepiecie\u0161ama daudz\u0101m uzdevumu risin\u0101\u0161anai, un pak\u0101peniski t\u0101 par\u0101d\u0101s (piem\u0113ram, sist\u0113mas l\u012bgumi zkSNARKs Ethereum).<\/p>\n<p><\/p>\n<p>Blok\u0137\u0113ns, kas nodro\u0161ina caurskat\u0101mu un uzticamu zi\u0146ojumu apmai\u0146as kan\u0101lu protokol\u0101, to nedara bez maksas. Jebkuram decentraliz\u0113tam protokolam j\u0101\u0146em v\u0113r\u0101 Sybil uzbrukuma iesp\u0113jam\u012bba, jebkura darb\u012bba var tikt veikta ar daudzu kontu saska\u0146ot\u0101m darb\u012bb\u0101m, t\u0101d\u0113\u013c projekt\u0113\u0161an\u0101 j\u0101\u0146em v\u0113r\u0101 uzbruc\u0113ju iesp\u0113jas rad\u012bt izsist\u012bt\u0101 skaita protokola dal\u012bbniekus, kas darbojas saska\u0146oti. <\/p>\n<p><\/p>\n<h2 id=\"pvrb-i-peremennye-bloka\">PVRB un blok\u0137\u0113des main\u012bgie.<\/h2>\n<p><\/p>\n<p>Es nemeloju, kad teicu, ka laba PVRB, ko p\u0101rbaud\u012bju\u0161i daudzi azartsp\u0113\u013cu lietojumi, blok\u0137\u0113d\u0113s pagaid\u0101m nav \u012bstenota. No kurienes tad tik daudz azartsp\u0113\u013cu lietojumu Ethereum un EOS? Tas mani p\u0101rsteidz t\u0101pat k\u0101 j\u016bs, nu no kurienes piln\u012bgi determin\u0113t\u0101 vid\u0113 izvilka tik daudz \u201ciztur\u012bgu\u201d nejau\u0161\u012bbu?<\/p>\n<p><\/p>\n<p>Mans iecien\u012bt\u0101kais veids, k\u0101 ieg\u016bt nejau\u0161\u012bbu blok\u0137\u0113d\u0113, ir izmantot k\u0101du \u201cneparedzamu\u201d inform\u0101ciju no bloka un, pamatojoties uz to, rad\u012bt nejau\u0161\u012bbu \u2014 vienk\u0101r\u0161i hash-ojot v\u0113rt\u012bbas. Laba raksts par \u0161\u0101du sh\u0113mu probl\u0113m\u0101m. <noindex><a rel=\"nofollow\" href=\"https:\/\/blog.positive.com\/predicting-random-numbers-in-ethereum-smart-contracts-e5358c6b8620\">\u0161eit<\/a><\/noindex>. Var \u0146emt k\u0101du no \u201cneparedzamajiem\u201d v\u0113rt\u012bb\u0101m blok\u0101, piem\u0113ram, bloka hash, dar\u012bjumu skaitu, t\u012bkla gr\u016bt\u012bbas pak\u0101pi un citus, iepriek\u0161 nezin\u0101mus v\u0113rt\u012bbas. P\u0113c tam hash-ot t\u0101s, vienu vai vair\u0101kas, un, teor\u0113tiski, vajadz\u0113tu izn\u0101kt \u012bstai nejau\u0161\u012bbai. Pat varat pievienot balto gr\u0101matu, ka j\u016bsu sh\u0113ma ir \u201cpost-quantum secure\u201d (jo ir kvantu pier\u0101d\u012btas hash funkcijas :)).<\/p>\n<p><\/p>\n<p>Tom\u0113r pat post-quantum secure hash nav pietiekami, diem\u017e\u0113l. Nosl\u0113pums sl\u0113pjas PVRB pras\u012bb\u0101s, atg\u0101din\u0101\u0161u t\u0101s no iepriek\u0161\u0113j\u0101 raksta:<\/p>\n<p><\/p>\n<ol>\n<li>Rezult\u0101tam j\u0101b\u016bt pier\u0101d\u0101mi vienm\u0113r\u012bgi sadal\u012btam, t.i., balst\u012btam uz pier\u0101d\u0101mi stabilu kriptogr\u0101fiju.<\/li>\n<li>Nav iesp\u0113jams kontrol\u0113t nevienu no rezult\u0101ta bitiem. T\u0101d\u0113j\u0101di rezult\u0101tu nevar iepriek\u0161 paredz\u0113t.<\/li>\n<li>Nav iesp\u0113jams sabot\u0113t \u0123ener\u0113\u0161anas protokolu, nepiedaloties protokol\u0101 vai noslogojot t\u012bklu ar uzbr\u016bko\u0161iem zi\u0146ojumiem.<\/li>\n<li>Vis\u0101m iepriek\u0161 min\u0113taj\u0101m pras\u012bb\u0101m j\u0101b\u016bt iztur\u012bg\u0101m pret koal\u012bcij\u0101m at\u013cauta skaita negod\u012bgu dal\u012bbnieku (piem\u0113ram, 1\/3 dal\u012bbnieku).<\/li>\n<\/ol>\n<p><\/p>\n<p>\u0160aj\u0101 gad\u012bjum\u0101 tiek izpild\u012bts tikai 1. nosac\u012bjums, un 2. nosac\u012bjums netiek iev\u0113rots. He\u0161\u0113jot neprognoz\u0113jamus v\u0113rt\u012bbas no bloka, m\u0113s ieg\u016bstam vienm\u0113r\u012bgu sadal\u012bjumu un labus nejau\u0161\u012bbas r\u0101d\u012bt\u0101jus. Bet BP vismaz ir iesp\u0113ja \u201cpublic\u0113t bloku vai ne\u201d. T\u0101d\u0113j\u0101di BP vismaz var izv\u0113l\u0113ties no DIVI nejau\u0161\u012bbas variantiem: \u201csava\u201d un t\u0101, kas tiks ieg\u016bta, ja bloku izveidos k\u0101ds cits. BP var iepriek\u0161 \u201ciel\u016bkoties\u201d, kas notiks, ja vi\u0146\u0161 public\u0113s bloku, un vienk\u0101r\u0161i pie\u0146emt l\u0113mumu to dar\u012bt vai n\u0113. T\u0101d\u0113j\u0101di, sp\u0113l\u0113jot, piem\u0113ram, \u201cp\u0101ra-nep\u0101ra\u201d vai \u201csarkana\/meln\u0101\u201d rulet\u0113, vi\u0146\u0161 var public\u0113t bloku tikai tad, ja redz laimestu. Tas ar\u012b padara neefekt\u012bvu strat\u0113\u0123iju, izmantojot, piem\u0113ram, bloka he\u0161u \u201cno n\u0101kotnes\u201d. \u0160aj\u0101 gad\u012bjum\u0101 tiek teikts, ka \u201ctiks izmantota nejau\u0161\u012bba, kas ieg\u016bta, he\u0161\u0113jot pa\u0161reiz\u0113jos datus un n\u0101kotnes bloka he\u0161u, piem\u0113ram, N + 42, kur N ir pa\u0161reiz\u0113jais bloka augstums. Tas nedaudz pastiprina sh\u0113mu, bet joproj\u0101m \u013cauj BP, lai ar\u012b n\u0101kotn\u0113, izv\u0113l\u0113ties, vai patur\u0113t bloku vai public\u0113t to.<\/p>\n<p><\/p>\n<p>BP programmat\u016bra \u0161aj\u0101 gad\u012bjum\u0101 k\u013c\u016bst sare\u017e\u0123\u012bt\u0101ka, bet ne p\u0101r\u0101k. Vienk\u0101r\u0161i, valid\u0113jot un iek\u013caujot transakciju blok\u0101, notiek \u0101tra p\u0101rbaude, vai b\u016bs laimests, un iesp\u0113jams, ar\u012b viena parametra optimiz\u0101cija, lai ieg\u016btu augstu laimesta varb\u016bt\u012bbu. Taj\u0101 pa\u0161\u0101 laik\u0101, apm\u0101n\u012bt viltus BP, veicot \u0161\u0101das manipul\u0101cijas, praktiski nav iesp\u0113jams, jo katru reizi var izmantot jaunus adreses un laim\u0113t maz\u0101s summas, neradot aizdomas.<\/p>\n<p><\/p>\n<p>T\u0101d\u0113j\u0101di veidi, k\u0101 izmantot inform\u0101ciju no bloka, neder visp\u0101r\u0113jai PVRB ievie\u0161anai. Ierobe\u017eot\u0101 versij\u0101, ar ierobe\u017eojumiem likmju apm\u0113ros, ar ierobe\u017eojumiem sp\u0113l\u0113t\u0101ju skait\u0101 un\/vai KYC re\u0123istr\u0101ciju (lai nepie\u013cautu vienam sp\u0113l\u0113t\u0101jam izmantot vair\u0101kas adreses), \u0161\u012bs sh\u0113mas var darboties neliel\u0101s sp\u0113l\u0113s, bet ne vair\u0101k.<\/p>\n<p><\/p>\n<h2 id=\"pvrb-i-commit-reveal\">PVRB un commit-reveal.<\/h2>\n<p><\/p>\n<p>Labi, paldies he\u0161\u0113\u0161anai un vismaz attiec\u012bgajai neprognoz\u0113jam\u012bbai bloka he\u0161\u0101 un citos main\u012bgajos. Ja atrisin\u0101s mineru front-running probl\u0113mu, vajadz\u0113tu izn\u0101kt kaut kam lab\u0101kam. Pievienosim \u0161ai sh\u0113mai lietot\u0101jus \u2014 lai ar\u012b vi\u0146i ietekm\u0113 nejau\u0161\u012bbu: jebkur\u0161 tehnisk\u0101s atbalsta darbinieks jums teiks, ka visneparedzam\u0101kais IT sist\u0113m\u0101s ir lietot\u0101ju r\u012bc\u012bba \ud83d\ude42<\/p>\n<p><\/p>\n<p>Naiva sh\u0113ma, kad lietot\u0101ji vienk\u0101r\u0161i s\u016bta nejau\u0161as skait\u013cus, bet rezult\u0101ts tiek apr\u0113\u0137in\u0101ts k\u0101, piem\u0113ram, to summas ha\u0161s, nav piem\u0113rojama. \u0160aj\u0101 gad\u012bjum\u0101 p\u0113d\u0113jais sp\u0113l\u0113t\u0101js, izv\u0113loties savu nejau\u0161o skaitli, var kontrol\u0113t, k\u0101ds b\u016bs rezult\u0101ts. T\u0101p\u0113c tiek izmantots pla\u0161i izmantots patterns commit-reveal. Dal\u012bbnieki vispirms s\u016bta ha\u0161us no saviem nejau\u0161ajiem skait\u013ciem (commit), un p\u0113c tam atkl\u0101j savus nejau\u0161os skait\u013cus (reveal). F\u0101ze<\/p>\n<p><\/p>\n<p>Tas bija labs m\u0113\u0123in\u0101jums, un t\u0101das sh\u0113mas ar\u012b past\u0101v sp\u0113\u013cu DApp, bet diem\u017e\u0113l t\u0101 joproj\u0101m nav pietiekama. Tagad uz rezult\u0101tu var ietekm\u0113t ne tikai ieguv\u0113js, bet ar\u012b jebkur\u0161 protokola dal\u012bbnieks. Pa\u0161u v\u0113rt\u012bbu joproj\u0101m var kontrol\u0113t, ar zem\u0101ku main\u012bgumu un par naudu, ta\u010du, k\u0101 gad\u012bjum\u0101 ar ieguv\u0113ju, ja izlozes rezult\u0101ti ir v\u0113rt\u012bg\u0101ki nek\u0101 maksa par dal\u012bbu PVRB protokol\u0101, tad random-producer (RP) var izlemt, vai veikt reveal un joproj\u0101m var izv\u0113l\u0113ties no vismaz diviem nejau\u0161o skait\u013cu variantiem.<br \/>\nTa\u010du par\u0101d\u012bj\u0101s iesp\u0113ja sod\u012bt tos, kas veic commit un neveic reveal, un \u0161\u012b sh\u0113ma v\u0113l noder\u0113s. T\u0101s vienk\u0101r\u0161\u012bba ir liels priek\u0161roc\u012bba \u2014 nopietn\u0101ki protokoli prasa daudz jaud\u012bg\u0101kus apr\u0113\u0137inus.<\/p>\n<p><\/p>\n<h2 id=\"pvrb-i-determinirovannye-podpisi\">PVRB un determin\u0113t\u0101s paraksti.<\/h2>\n<p><\/p>\n<p>Ir v\u0113l viens veids, k\u0101 likt RP sniegt pseidoizlases skaitli, uz kuru vi\u0146\u0161 nevar ietekm\u0113t, ja tam tiek nodro\u0161in\u0101ts \"prototips\" \u2014 tas ir determin\u0113ta paraksts. Piem\u0113ram, t\u0101ds paraksts ir RSA, bet ne ECS. Ja RP ir atsl\u0113gu p\u0101ris: RSA un ECC, un vi\u0146\u0161 paraksta ar savu priv\u0101to atsl\u0113gu k\u0101du v\u0113rt\u012bbu, tad RSA gad\u012bjum\u0101 vi\u0146am b\u016bs VIENS UN TIKAI VIENS paraksts, bet ECS gad\u012bjum\u0101 vi\u0146\u0161 var \u0123ener\u0113t jebkuru skaitu at\u0161\u0137ir\u012bgu der\u012bgu parakstu. Tas notiek t\u0101d\u0113\u013c, ka ECS paraksta izveid\u0113 tiek izmantots nejau\u0161s skaitlis, ko izv\u0113las parakst\u012bt\u0101js, un to var izv\u0113l\u0113ties jebk\u0101d\u0101 veid\u0101, dodot parakst\u012bt\u0101jam iesp\u0113ju izv\u0113l\u0113ties vienu no vair\u0101kiem parakstiem. RSA gad\u012bjum\u0101: \"viens ievades v\u0113rt\u012bba\" + \"viena atsl\u0113gu p\u0101ris\" = \"viens paraksts\". Nav iesp\u0113jams paredz\u0113t, k\u0101ds paraksts b\u016bs citam RP, t\u0101p\u0113c PVRB ar determin\u0113tiem parakstiem var b\u016bt organiz\u0113ts, izveidojot kombin\u0101cijas no vair\u0101ku dal\u012bbnieku RSA parakstiem, kuri parakst\u012bju\u0161i to pa\u0161u v\u0113rt\u012bbu. Piem\u0113ram \u2014 iepriek\u0161\u0113jo nejau\u0161o skaitli. \u0160\u0101d\u0101 sh\u0113m\u0101 tiek ietaup\u012bti daudz resursu, jo paraksti ir reiz\u0113 ar\u012b protokola pareiz\u012bbas apstiprin\u0101jums un nejau\u0161\u012bbas avots.<\/p>\n<p><\/p>\n<p>Tom\u0113r pat ar determin\u0113tiem parakstiem sh\u0113ma joproj\u0101m ir pak\u013cauta \"p\u0113d\u0113j\u0101 aktora\" probl\u0113mai. P\u0113d\u0113jais dal\u012bbnieks joproj\u0101m var izlemt, vai public\u0113t savu parakstu vai n\u0113, t\u0101d\u0113j\u0101di kontrol\u0113jot rezult\u0101tu. Sh\u0113mu var pilnveidot, pievienojot blok\u0137\u0113des hashes, organiz\u0113jot k\u0101rtas, lai iepriek\u0161 rezult\u0101tu neb\u016btu iesp\u0113jams paredz\u0113t, bet visas \u0161\u012bs metodes, pat \u0146emot v\u0113r\u0101 daudzus uzlabojumus, joproj\u0101m atst\u0101j neatrisin\u0101tu probl\u0113mu par viena dal\u012bbnieka ietekmi uz kolekt\u012bvo rezult\u0101tu neuzticam\u0101 vid\u0113 un var darboties tikai ekonomisku un laika ierobe\u017eojumu apst\u0101k\u013cos. Turkl\u0101t RSA atsl\u0113gu izm\u0113rs (1024 un 2048 biti) ir diezgan liels, un izm\u0113rs blok\u0137\u0113des transakcij\u0101m ir \u0101rk\u0101rt\u012bgi b\u016btisks parametrs. Ac\u012bmredzot, vienk\u0101r\u0161i risin\u0101t \u0161o probl\u0113mu neizdosies, turpin\u0101sim.<\/p>\n<p><\/p>\n<h2 id=\"pvrb-i-secret-sharing-shemy\">PVRB un nosl\u0113pumu dal\u012b\u0161anas sh\u0113mas<\/h2>\n<p><\/p>\n<p>Kriptogr\u0101fij\u0101 past\u0101v sh\u0113mas, kas \u013cauj t\u012bklam vienoties par vienu un tikai vienu PVRB v\u0113rt\u012bbu, un \u0161\u0101das sh\u0113mas ir iztur\u012bgas pret jebk\u0101d\u0101m \u013caunpr\u0101t\u012bg\u0101m darb\u012bb\u0101m no dal\u012bbnieku puses. Viens no noder\u012bgajiem protokoliem, ar kuru v\u0113rts iepaz\u012bties, ir \u0160amira slepen\u0101s dal\u012b\u0161anas sh\u0113ma. T\u0101 kalpo, lai sadal\u012btu nosl\u0113pumu (piem\u0113ram, slepenu atsl\u0113gu) vair\u0101k\u0101s da\u013c\u0101s un izplat\u012btu \u0161\u012bs da\u013cas N dal\u012bbniekiem. Nosl\u0113pums tiek sadal\u012bts t\u0101, ka, lai to atjaunotu, ir pietiekami M da\u013cas no N, un jebkuras M da\u013cas var b\u016bt piem\u0113rotas. Ja run\u0101jam vienk\u0101r\u0161i, tad, ieg\u016bstot grafiku nezin\u0101mai funkcijai, dal\u012bbnieki apmain\u0101s ar punktiem uz grafika, un p\u0113c M punktu sa\u0146em\u0161anas ir iesp\u0113jams atjaunot visu funkciju.<br \/>\nLabi izskaidrots <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Shamir%27s_Secret_Sharing\">wiki<\/a><\/noindex> un praktiski to izm\u0113\u0123in\u0101t ir noder\u012bgi, lai p\u0101rdom\u0101tu protokolu <noindex><a rel=\"nofollow\" href=\"http:\/\/point-at-infinity.org\/ssss\/demo.html\">demo<\/a><\/noindex> lap\u0101.<\/p>\n<p><\/p>\n<p>Ja FSSS (Fiat-Shamir Secret Sharing) sh\u0113ma tiktu pielietota t\u012br\u0101 veid\u0101, tas b\u016btu nenogalin\u0101ms PVRB. Vienk\u0101r\u0161\u0101kaj\u0101 versij\u0101 protokols var\u0113tu izskat\u012bties t\u0101:<\/p>\n<p><\/p>\n<ul>\n<li>Katrs dal\u012bbnieks \u0123ener\u0113 savu random un izdala shares p\u0101r\u0113jiem dal\u012bbniekiem.<\/li>\n<li>Katrs dal\u012bbnieks atkl\u0101j savas p\u0101r\u0113jo dal\u012bbnieku nosl\u0113pumu da\u013cas.<\/li>\n<li>Ja dal\u012bbniekam ir vair\u0101k nek\u0101 M shares, tad \u0161\u012b dal\u012bbnieka numuru var apr\u0113\u0137in\u0101t, un tas b\u016bs unik\u0101ls, neatkar\u012bgi no atkl\u0101to dal\u012bbnieku komplekta.<\/li>\n<li>Atkl\u0101to random kombin\u0101cija ir mekl\u0113tais PVRB.<\/li>\n<\/ul>\n<p><\/p>\n<p>\u0160aj\u0101 br\u012bd\u012b atsevi\u0161\u0137u dal\u012bbnieku vairs neietekm\u0113 protokola rezult\u0101tus, iz\u0146emot gad\u012bjumus, kad nolai\u0161an\u0101s slieksnis, k\u0101 atkar\u012bga no vi\u0146iem tiek sasniegta. T\u0101p\u0113c \u0161is protokols, ja ir nepiecie\u0161amais darbinieku skaits, kas darbojas protokola ietvaros un pieejamo RP, darbojas, izpildot kriptogr\u0101fisk\u0101s iztur\u012bbas pras\u012bbas un ir iztur\u012bgs pret \u201ep\u0113d\u0113j\u0101 dal\u012bbnieka\u201d probl\u0113mu.<\/p>\n<p><\/p>\n<p>Tas var\u0113tu b\u016bt ide\u0101ls variants, \u0161\u012b PVRB sh\u0113ma, kas balst\u012bta uz Fiat-Shamir slepeno dal\u012b\u0161anu, ir aprakst\u012bta, piem\u0113ram, <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2017\/216.pdf\">\u0161\u012bs<\/a><\/noindex> rakst\u0101. Bet, k\u0101 jau min\u0113ts iepriek\u0161, ja m\u0113\u0123in\u0101t to piem\u0113rot blok\u0137\u0113d\u0113, par\u0101d\u0101s tehniskie ierobe\u017eojumi. \u0160eit ir piem\u0113rs protokola test\u0113\u0161anai viedo l\u012bgumu EOS un visb\u016btisk\u0101k\u0101 da\u013ca no t\u0101 \u2014 dal\u012bbnieka public\u0113t\u0101 share p\u0101rbaude: <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/mixbytes\/eoscraper\/blob\/master\/Proof.hh#L23\">quiche bibliot\u0113kas kods, p\u0113c tam j\u0101p\u0101rb\u016bv\u0113 nginx ar opcij\u0101m \"\u2014with-http_v3_module \u2014with-quiche=....\/quiche\". Izstr\u0101d\u0101jot, TLS atbalstam j\u0101balst\u0101s uz BoringSSL bibliot\u0113ku (\"\u2014with-openssl=....\/quiche\/deps\/boringssl\"), OpenSSL izmanto\u0161ana pagaid\u0101m nav atbalst\u012bta. Lai pie\u0146emtu savienojumus, iestat\u012bjumos j\u0101iek\u013cauj direkt\u012bva listen ar flagu \"quic\" (piem\u0113ram, \"listen 443 quic reuseport\").<\/a><\/noindex>. No koda var redzams, ka proof valid\u0101cija prasa vair\u0101kas skalar\u0101s reizin\u0101\u0161anas oper\u0101cijas, un skait\u013ci tiek izmantoti \u013coti lieli. \u0160aj\u0101 zi\u0146\u0101 j\u0101izprot, ka blok\u0137\u0113d\u0113s verifik\u0101cija notiek br\u012bd\u012b, kad block-producer apstr\u0101d\u0101 transakciju, un ikviens dal\u012bbnieks tam j\u0101sp\u0113j viegli p\u0101rbaud\u012bt protokola pareiz\u012bbu, t\u0101p\u0113c pras\u012bbas attiec\u012bb\u0101 uz verify funkcijas \u0101trumu ir \u013coti stingras. \u0160aj\u0101 variant\u0101 risin\u0101jums izr\u0101d\u012bj\u0101s neefekt\u012bvs, jo verifik\u0101cija neatbilst transakciju ierobe\u017eojumam (0,5 sek).<\/p>\n<p><\/p>\n<p>Verifik\u0101cijas efektivit\u0101te ir viena no vissvar\u012bg\u0101kaj\u0101m pras\u012bb\u0101m attiec\u012bb\u0101 uz jebk\u0101du progres\u012bvu kriptogr\u0101fisko sh\u0113mu izmanto\u0161anu blok\u0137\u0113d\u0113. Proof veido\u0161ana, zi\u0146ojumu sagatavo\u0161ana \u2013 \u0161os procesus var p\u0101rvietot off-chain un veikt uz augstas veiktsp\u0113jas datoriem, bet verifik\u0101ciju apiet nevar \u2013 tas ir v\u0113l viens b\u016btisks pras\u012bba PVRB. <\/p>\n<p><\/p>\n<h2 id=\"pvrb-i-threshold-signatures\">PVRB un threshold paraksti<\/h2>\n<p><\/p>\n<p>Iegrimus ar secret sharing sh\u0113mu, m\u0113s atkl\u0101j\u0101m veselu protokolu klasi, kas savienota ar atsl\u0113gv\u0101rdu \u201cthreshold\u201d. Kad inform\u0101cijas atkl\u0101\u0161anai nepiecie\u0161ama M god\u012bgu dal\u012bbnieku piedal\u012b\u0161an\u0101s no N, un god\u012bgu dal\u012bbnieku kopums var b\u016bt jebkur\u0161 apak\u0161kopums no N, m\u0113s run\u0101jam par \u201cthreshold\u201d sh\u0113m\u0101m. Tie\u0161i t\u0101s \u013cauj risin\u0101t \u201clast actor\u201d probl\u0113mu; ja uzbruc\u0113js neatkl\u0101j savu slepeno da\u013cu, to izdar\u012bs k\u0101ds cits, god\u012bgs dal\u012bbnieks. \u0160\u012bs sh\u0113mas \u013cauj vienoties par vienu un tikai vienu v\u0113rt\u012bbu, pat ja protokolu sabot\u0113 da\u013ca dal\u012bbnieku. <\/p>\n<p><\/p>\n<p>Determin\u0113to parakstu un threshold sh\u0113mu apvieno\u0161ana \u013c\u0101va izstr\u0101d\u0101t \u013coti \u0113rtu un sol\u012bgu sh\u0113mu PVRB \u012bsteno\u0161anai \u2014 tas ir determin\u0113tais threshold paraksts. \u0160eit <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2002\/081.pdf\">raksts<\/a><\/noindex> par da\u017e\u0101d\u0101m threshold parakstu pielietojumiem, bet \u0161eit v\u0113l viens labs <noindex><a rel=\"nofollow\" href=\"https:\/\/blog.dash.org\/secret-sharing-and-threshold-signatures-with-bls-954d1587b5f\">longread<\/a><\/noindex> no Dash. <\/p>\n<p><\/p>\n<p>P\u0113d\u0113j\u0101 rakst\u0101 aprakst\u012bti BLS paraksti (BLS noz\u012bm\u0113 Boneh-Lynn-Shacham, <noindex><a rel=\"nofollow\" href=\"https:\/\/www.iacr.org\/archive\/asiacrypt2001\/22480516.pdf\">\u0161aj\u0101<\/a><\/noindex> raksts ), kas ir \u013coti svar\u012bga un \u0101rk\u0101rt\u012bgi \u0113rta \u012bpa\u0161\u012bba programm\u0113t\u0101jiem \u2014 publiskie, slepenie, publiskie atsl\u0113gas un BLS paraksti var tikt kombin\u0113ti sav\u0101 starp\u0101, izmantojot vienk\u0101r\u0161as matem\u0101tiskas oper\u0101cijas, un \u0161o kombin\u0101ciju rezult\u0101t\u0101 paliek der\u012bgas atsl\u0113gas un paraksti, \u013caujot viegli agreg\u0113t daudzus parakstus vien\u0101 un daudzus publiskos atsl\u0113gas vien\u0101. T\u0101m piem\u012bt ar\u012b determinisms, un pie tiem pa\u0161iem izejas datiem t\u0101s dod vienu un to pa\u0161u rezult\u0101tu. \u0160\u012b \u012bpa\u0161\u012bba \u013cauj, ka BLS parakstu kombin\u0101cijas pa\u0161as ir der\u012bgas atsl\u0113gas, kas \u013cauj realiz\u0113t scen\u0101riju, kur M no N dal\u012bbniekiem rada vienu un tikai vienu parakstu, kas ir determin\u0113ts, publiski p\u0101rbaud\u0101ms un neparedzams, l\u012bdz to atkl\u0101j M-ais dal\u012bbnieks.<\/p>\n<p><\/p>\n<p>Slieks\u0146u BLS parakstu sh\u0113m\u0101 katrs dal\u012bbnieks paraksta, izmantojot BLS, kaut ko (piem\u0113ram, iepriek\u0161\u0113jo nejau\u0161o skaitli), un visp\u0101r\u0113jais slieks\u0146u paraksts ir mekl\u0113tais nejau\u0161ais skaitlis. BLS parakstu kriptogr\u0101fisk\u0101s \u012bpa\u0161\u012bbas atbilst nejau\u0161uma kvalit\u0101tes pras\u012bb\u0101m, slieks\u0146u sast\u0101vda\u013ca aizsarg\u0101 pret \u201cp\u0113d\u0113j\u0101 dal\u012bbnieka\u201d risku, un unik\u0101la atsl\u0113gu kombin\u0113jam\u012bba \u013cauj \u012bstenot v\u0113l daudzus interesantus algoritmus, kas, piem\u0113ram, efekt\u012bvi apvieno protokola zi\u0146ojumus.<\/p>\n<p><\/p>\n<p>T\u0101tad, ja j\u016bs veidojat PVRB sav\u0101 blok\u0137\u0113d\u0113, j\u016bs ar lielu varb\u016bt\u012bbu non\u0101ksiet pie BLS slieks\u0146u parakstu sh\u0113mas, kuru jau izmanto vair\u0101ki projekti. Piem\u0113ram, DFinity (<noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/dfinity\/random-beacon\">\u0161eit<\/a><\/noindex> benchmark, kas \u012bsteno sh\u0113mu, un <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/dfinity\/vss\/blob\/master\/docs\/index.md\">\u0161eit<\/a><\/noindex> verific\u0113jamas slepen\u0101s dal\u012b\u0161anas realiz\u0101cijas piem\u0113rs), vai Keep.network (skat\u012bt vi\u0146u nejau\u0161o r\u0101d\u012bt\u0101ju <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/keep-network\/random-beacon-yellowpaper\">yellowpaper<\/a><\/noindex>, bet <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/keep-network\/random-beacon-box\">piem\u0113rs<\/a><\/noindex> vied\u0101 l\u012bguma, kas apkalpo protokolu).<\/p>\n<p><\/p>\n<h2 id=\"implementaciya-pvrb\">PVRB \u012bsteno\u0161ana<\/h2>\n<p><\/p>\n<p>Diem\u017e\u0113l m\u0113s joproj\u0101m neredzam gatavu, blok\u0137\u0113d\u0113s PVRB \u012bstenotu protokolu, kas pier\u0101d\u012bjis savu dro\u0161\u012bbu un iztur\u012bbu. Neskatoties uz to, ka pa\u0161i protokoli ir gatavi, tehniski pielietot tos eso\u0161aj\u0101s risin\u0101jumos nav viegli. Centraliz\u0113t\u0101m sist\u0113m\u0101m PVRB nav j\u0113gas, bet decentraliz\u0113tajiem ir \u013coti ierobe\u017eoti visi apr\u0113\u0137inu resursi: CPU, atmi\u0146a, kr\u0101tuve, I\/O. PVRB projekt\u0113\u0161ana ir da\u017e\u0101du protokolu kombin\u0113\u0161ana, lai tom\u0113r izveidotu kaut ko, kas atbilst vis\u0101m pras\u012bb\u0101m, vismaz k\u0101dam dz\u012bvotsp\u0113j\u012bgam blok\u0137\u0113d\u0113. Viens protokols efekt\u012bv\u0101k apr\u0113\u0137ina, ta\u010du prasa vair\u0101k zi\u0146ojumu starp RP, bet cits prasa \u013coti maz zi\u0146ojumu, ta\u010du pier\u0101d\u012bjuma izveide var b\u016bt uzdevums, kas aiz\u0146em desmitiem min\u016b\u0161u vai pat stundu.<\/p>\n<p><\/p>\n<p>Es uzskait\u012b\u0161u faktorus, kurus jums b\u016bs j\u0101\u0146em v\u0113r\u0101, izv\u0113loties kvalitat\u012bvu PVRB:<\/p>\n<p><\/p>\n<ul>\n<li><em>Kriptogr\u0101fisk\u0101 iztur\u012bba<\/em>. J\u016bsu PVRB ir j\u0101b\u016bt absol\u016bti neietekm\u0113jamam, bez iesp\u0113jas kontrol\u0113t vienu bitu. Da\u017eos sh\u0113m\u0101s tas t\u0101 nav, t\u0101d\u0113\u013c piesaistiet kriptogr\u0101fijas speci\u0101listu.<\/li>\n<li><em>P\u0113d\u0113j\u0101 aktora probl\u0113ma<\/em>. J\u016bsu PVRB ir j\u0101b\u016bt iztur\u012bgam pret uzbrukumiem, kad uzbruc\u0113js, kontrol\u0113jot vienu vai vair\u0101kus RP, var izv\u0113l\u0113ties vienu no diviem izn\u0101kumiem.<\/li>\n<li><em>Protokola sabot\u0101\u017eas probl\u0113ma<\/em>. J\u016bsu PVRB ir j\u0101b\u016bt iztur\u012bgam pret uzbrukumiem, kad uzbruc\u0113js, kontrol\u0113jot vienu vai vair\u0101kus RP, izlemj, vai b\u016bt nejau\u0161am vai n\u0113, un var garant\u0113ti vai ar noteiktu varb\u016bt\u012bbu ietekm\u0113t to.<\/li>\n<li><em>Zi\u0146ojumu skaita probl\u0113ma<\/em>. J\u016bsu RP j\u0101nos\u016bta blok\u0137\u0113d\u0113 vismaz zi\u0146ojumu skaits un maksim\u0101li j\u0101izvair\u0101s no sinhroniz\u0113t\u0101m darb\u012bb\u0101m, k\u0101 situ\u0101cijas \u201ces nos\u016bt\u012bju k\u0101du inform\u0101ciju, gaidu atbildi no konkr\u0113ta dal\u012bbnieka\u201d. P2P t\u012bklos, \u012bpa\u0161i \u0123eogr\u0101fiski sadal\u012btajos, nevajadz\u0113tu cer\u0113t uz \u0101tru atbildi.<\/li>\n<li><em>Apr\u0113\u0137inu sare\u017eg\u012bt\u012bbas probl\u0113ma<\/em>. Ikviena PVRB on-chain posma verifik\u0101cija j\u0101veic \u0101rk\u0101rt\u012bgi viegli, jo to veic visi t\u012bkla pilnie klienti. Ja izpilde tiek veikta, izmantojot viedos l\u012bgumus, pras\u012bbas attiec\u012bb\u0101 uz \u0101trumu ir \u013coti stingras.<\/li>\n<li><em>Pieejam\u012bbas un dz\u012bvotsp\u0113jas probl\u0113ma<\/em>. J\u016bsu PVRB ir j\u0101tiecas b\u016bt iztur\u012bgam pret situ\u0101cij\u0101m, kad da\u013ca t\u012bkla uz noteiktu laiku k\u013cuvis nepieejams, un da\u013ca RP vienk\u0101r\u0161i p\u0101rst\u0101j darboties.<\/li>\n<li><em>Uztic\u0113tu uzst\u0101d\u012b\u0161anu un s\u0101kotn\u0113jo atsl\u0113gu sadal\u012b\u0161anas probl\u0113ma<\/em>. Ja j\u016bsu PVRB izmanto prim\u0101ro protokola uzst\u0101d\u012bjumu, tad tas ir atsevi\u0161\u0137s lielas un nopietnas probl\u0113mas gad\u012bjums. L\u016bk, <noindex><a rel=\"nofollow\" href=\"https:\/\/z.cash\/ru\/blog\/the-design-of-the-ceremony\/\">piem\u0113rs<\/a><\/noindex>. Ja dal\u012bbniekiem ir j\u0101zi\u0146o viens otram par saviem atsl\u0113g\u0101m pirms protokola uzs\u0101k\u0161anas \u2014 tas ar\u012b ir probl\u0113ma, ja dal\u012bbnieku sast\u0101vs main\u0101s.<\/li>\n<li><em>Izstr\u0101des probl\u0113mas<\/em>. Bibliot\u0113ku pieejam\u012bba nepiecie\u0161amaj\u0101s valod\u0101s, to dro\u0161\u012bba un veiktsp\u0113ja, publiskums, sare\u017e\u0123\u012bti testi utt.<\/li>\n<\/ul>\n<p><\/p>\n<p>Piem\u0113ram, BLS sl\u0113dzienu slieksnim ir b\u016btiska probl\u0113ma \u2014 pirms s\u0101kt str\u0101d\u0101t, dal\u012bbniekiem oblig\u0101ti j\u0101apmain\u0101s ar atsl\u0113g\u0101m, izveidojot grupu, kur\u0101 darbosies slieksnis. Tas noz\u012bm\u0113, ka vismaz vienu apmai\u0146as apli decentraliz\u0113taj\u0101 t\u012bkl\u0101 b\u016bs j\u0101gaida, un, \u0146emot v\u0113r\u0101, ka \u0123ener\u0113tais nejau\u0161ais skaitlis ir nepiecie\u0161ams sp\u0113l\u0113s praktiski re\u0101l\u0101 laik\u0101, tas noz\u012bm\u0113, ka \u0161aj\u0101 posm\u0101 protokola sabot\u0101\u017ea ir iesp\u0113jama, un sliek\u0161\u0146a sh\u0113mas priek\u0161roc\u012bbas tiek zaud\u0113tas. \u0160\u012b probl\u0113ma jau ir vienk\u0101r\u0161\u0101ka nek\u0101 iepriek\u0161\u0113j\u0101, ta\u010du tai joproj\u0101m ir nepiecie\u0161ama atsevi\u0161\u0137as slieks\u0146a grupas izveides proced\u016bras izstr\u0101de, kas b\u016bs j\u0101aizsarg\u0101 ekonomisk\u0101 veid\u0101, piem\u0113ram, ar depoz\u012btiem un dal\u012bbnieku l\u012bdzek\u013cu at\u0146em\u0161anu (slashing), kas neiev\u0113ro protokolu. Turkl\u0101t BLS verifik\u0101cija ar pie\u0146emamu dro\u0161\u012bbas l\u012bmeni vienk\u0101r\u0161i nepietiek, piem\u0113ram, standarta EOS vai Ethereum dar\u012bjumam \u2014 vienk\u0101r\u0161i nav pietiekami daudz laika verifik\u0101cijai. L\u012bgumu kodi \u2014 tas ir WebAssembly vai EVM, izpilda virtu\u0101l\u0101 ma\u0161\u012bna. Kriptogr\u0101fisk\u0101s funkcijas nav ieviestas nat\u012bvi (l\u012bdz \u0161im), un t\u0101s darbojas desmitiem rei\u017eu l\u0113n\u0101k nek\u0101 parastas kriptogr\u0101fisk\u0101s bibliot\u0113kas. Daudzi protokoli neatbilst pras\u012bb\u0101m tikai jau no atsl\u0113gu apjoma, piem\u0113ram, tas ir 1024 un 2048 biti RSA, 4-8 reizes vair\u0101k nek\u0101 standarta dar\u012bjuma paraksts Bitcoin un Ethereum.<\/p>\n<p><\/p>\n<p>Loma ir ar\u012b eso\u0161o realiz\u0101ciju pieejam\u012bbai da\u017e\u0101d\u0101s programm\u0113\u0161anas valod\u0101s \u2014 kuru ir maz, \u012bpa\u0161i jauniem protokoliem. Variants ar integr\u0101ciju konsens\u0101 prasa rakst\u012bt protokolu platformas valod\u0101, t\u0101p\u0113c b\u016bs j\u0101mekl\u0113 kods Go valod\u0101 geth, Rust valod\u0101 Parity, C++ valod\u0101 EOS. JavaScript kodu b\u016bs j\u0101m\u0113\u0123ina mekl\u0113t visiem, un t\u0101 k\u0101 JavaScript un kriptogr\u0101fija nav \u012bpa\u0161i cie\u0161as draudzenes, WebAssembly, kas tagad noteikti pretend\u0113 uz n\u0101kamo noz\u012bm\u012bgo interneta standartu, b\u016bs noder\u012bgs.<\/p>\n<p><\/p>\n<h2 id=\"zaklyuchenie\">Secin\u0101jums<\/h2>\n<p><\/p>\n<p>Ceru, ka iepriek\u0161\u0113j\u0101 <noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/448330\/\">rakst\u0101<\/a><\/noindex> Esmu sp\u0113jis p\u0101rliecin\u0101t j\u016bs, ka nejau\u0161u skait\u013cu \u0123ener\u0113\u0161ana blok\u0137\u0113d\u0113 ir kritiski svar\u012bga daudziem aspektiem decentraliz\u0113to t\u012bklu dz\u012bv\u0113, un \u0161aj\u0101 rakst\u0101 esmu par\u0101d\u012bjis, ka \u0161is uzdevums ir \u0101rk\u0101rt\u0113ji ambiciozs un sare\u017e\u0123\u012bts, ta\u010du labas risin\u0101jumi jau past\u0101v. Kopum\u0101 gal\u012bgais protokola dizains ir iesp\u0113jams tikai p\u0113c pla\u0161iem testiem, \u0146emot v\u0113r\u0101 visus aspektus no iestat\u012b\u0161anas l\u012bdz k\u013c\u016bdu simul\u0101cijai, t\u0101p\u0113c, iesp\u0113jams, jums neizdosies atrast gatavas receptes komandu baltajos pap\u012bros un rakstos, un m\u0113s tuv\u0101kaj\u0101 gad\u0101-divos noteikti neuzdro\u0161in\u0101simies rakst\u012bt \"dariet t\u0101, t\u0101 ir pareizi\". <\/p>\n<p><\/p>\n<p>Pag\u0101ju\u0161i, m\u016bsu PVRB izstr\u0101d\u0101taj\u0101 blok\u0137\u0113d\u0113 <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/mixbytes\/haya\">Haya<\/a><\/noindex>, m\u0113s esam apst\u0101ju\u0161ies pie threshold BLS parakstiem, pl\u0101nojot \u012bstenot PVRB konsensa l\u012bmen\u012b, jo verifik\u0101cija viedaj\u0101 l\u012bgum\u0101 ar pie\u0146emamu dro\u0161\u012bbas l\u012bmeni pa\u0161laik nav iesp\u0113jama. Iesp\u0113jams, ka m\u0113s izmantosim divas sh\u0113mas: vispirms d\u0101rgu slepeno da\u013cu dal\u012b\u0161anu, lai izveidotu ilgtermi\u0146a random_seed, un to izmantosim k\u0101 pamatu augstas frekvences nejau\u0161\u012bbas \u0123ener\u0113\u0161anai, izmantojot determin\u0113tus threshold BLS parakstus; iesp\u0113jams, ka apst\u0101simies pie vienas sh\u0113mas. Iesp\u0113jams iepriek\u0161 pateikt, k\u0101ds b\u016bs protokols, diem\u017e\u0113l nav iesp\u0113jams, ta\u010du iedvesmo tas, ka, t\u0101pat k\u0101 zin\u0101tn\u0113, in\u017eeniertehniskajos uzdevumos negat\u012bvs rezult\u0101ts ar\u012b ir rezult\u0101ts, un katra jaun\u0101 m\u0113\u0123in\u0101juma atrisin\u0101t uzdevumu ir jauna pak\u0101pe visiem, kas p\u0113t\u0101m \u0161o probl\u0113mu. Lai nodro\u0161in\u0101tu biznesa pras\u012bbu izpildi, m\u0113s risin\u0101m konkr\u0113tu praktisku uzdevumu \u2014 uzticama entropijas avota nodro\u0161in\u0101\u0161anu sp\u0113\u013cu lietotn\u0113m, t\u0101p\u0113c mums j\u0101\u0146em v\u0113r\u0101 ar\u012b pati blok\u0137\u0113de, jo \u012bpa\u0161i \u0137\u0113des gal\u012bguma un t\u012bkla p\u0101rvald\u012bbas jaut\u0101jumi. <\/p>\n<p><\/p>\n<p>Un, lai gan m\u0113s pagaid\u0101m neredzam blok\u0137\u0113d\u0113s pier\u0101d\u012btu PVRB, kas jau pietiekami ilgi b\u016btu ticis izmantots, lai iztur\u0113tu re\u0101lo lietojumu, vair\u0101ku auditu, slodzes un, protams, re\u0101lu uzbrukumu p\u0101rbaudi, skaits iesp\u0113jamo ce\u013cu apstiprina, ka risin\u0101jums past\u0101v, un k\u0101ds no \u0161iem algoritmiem galu gal\u0101 atrisin\u0101s probl\u0113mu. M\u0113s ar prieku dal\u012bsimies ar rezult\u0101tiem un pateicamies cit\u0101m komand\u0101m, kas ar\u012b str\u0101d\u0101 pie \u0161\u012b jaut\u0101juma, par rakstiem un kodu, kas in\u017eenieriem \u013cauj nespert divreiz uz tiem pa\u0161iem gr\u0101bek\u013ciem. <\/p>\n<p><\/p>\n<p>T\u0101tad, saskaroties ar programm\u0113t\u0101ju, kur\u0161 projekt\u0113 decentraliz\u0113tu randomiz\u0101cijas risin\u0101jumu, esiet uzman\u012bgi un g\u0101d\u012bgi, ja nepiecie\u0161ams, sniedziet psiholo\u0123isko atbalstu \ud83d\ude42<\/p>\n<p>Avots: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/452340\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 function getAbsolutelyRandomNumer() { return 4; \/\/ returns absolutely random number! } \u041a\u0430\u043a \u0438 \u0432 \u0441\u043b\u0443\u0447\u0430\u0435 \u0441 \u043a\u043e\u043d\u0446\u0435\u043f\u0446\u0438\u0435\u0439 \u0430\u0431\u0441\u043e\u043b\u044e\u0442\u043d\u043e \u0441\u0442\u043e\u0439\u043a\u043e\u0433\u043e \u0448\u0438\u0444\u0440\u0430 \u0438\u0437 \u043a\u0440\u0438\u043f\u0442\u043e\u0433\u0440\u0430\u0444\u0438\u0438, \u0440\u0435\u0430\u043b\u044c\u043d\u044b\u0435 \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u044b \u201cPublicly Verifiable Random Beacon\u201d (\u0434\u0430\u043b\u0435\u0435 PVRB) \u043b\u0438\u0448\u044c \u043f\u044b\u0442\u0430\u044e\u0442\u0441\u044f \u043c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u043e \u043f\u0440\u0438\u0431\u043b\u0438\u0437\u0438\u0442\u044c\u0441\u044f \u043a \u0438\u0434\u0435\u0430\u043b\u044c\u043d\u043e\u0439 \u0441\u0445\u0435\u043c\u0435, \u0442.\u043a. \u0432 \u0440\u0435\u0430\u043b\u044c\u043d\u044b\u0445 \u0441\u0435\u0442\u044f\u0445 \u0432 \u0447\u0438\u0441\u0442\u043e\u043c \u0432\u0438\u0434\u0435 \u043e\u043d\u0430 \u043d\u0435\u043f\u0440\u0438\u043c\u0435\u043d\u0438\u043c\u0430: \u0434\u043e\u0433\u043e\u0432\u0430\u0440\u0438\u0432\u0430\u0442\u044c\u0441\u044f \u043d\u0430\u0434\u043e \u0441\u0442\u0440\u043e\u0433\u043e \u043e\u0431 \u043e\u0434\u043d\u043e\u043c \u0431\u0438\u0442\u0435, \u0440\u0430\u0443\u043d\u0434\u043e\u0432 \u0434\u043e\u043b\u0436\u043d\u043e [&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-33888","post","type-post","status-publish","format-standard","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.5.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 function getAbsolutelyRandomNumer() { return 4; \/\/ returns absolutely random number!\" \/>\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\/lv\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.5.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"lv_LV\" \/>\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: \u0438\u043c\u043f\u043b\u0435\u043c\u0435\u043d\u0442\u0430\u0446\u0438\u0438 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 function getAbsolutelyRandomNumer() { return 4; \/\/ returns absolutely random number!\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii\" \/>\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:55:15+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:55:15+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\udd47 Nejau\u0161i skait\u013ci un decentraliz\u0113tas t\u012bklos: ievie\u0161ana | ProHoster","description":"Ievads function getAbsolutelyRandomNumer() { return 4; \/\/ atgrie\u017e piln\u012bgi nejau\u0161u skaitli!","canonical_url":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"lv_LV","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: \u0438\u043c\u043f\u043b\u0435\u043c\u0435\u043d\u0442\u0430\u0446\u0438\u0438 | ProHoster","og:description":"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 function getAbsolutelyRandomNumer() { return 4; \/\/ returns absolutely random number!","og:url":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/sluchajnye-chisla-i-detsentralizovannye-seti-implementatsii","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:55:15+00:00","article:modified_time":"2019-10-31T18:55:15+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"33888","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 17:06:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 02:31:23","updated":"2026-01-21 17:06:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts\/33888","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/comments?post=33888"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts\/33888\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/media?parent=33888"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/categories?post=33888"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/tags?post=33888"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}