{"id":36425,"date":"2019-10-31T22:11:34","date_gmt":"2019-10-31T19:11:34","guid":{"rendered":"https:\/\/prohoster.info\/blog\/konsensus-na-reputatsii-nody-nuzhen-li\/"},"modified":"2019-10-31T22:11:34","modified_gmt":"2019-10-31T19:11:34","slug":"konsensus-na-reputatsii-nody-nuzhen-li","status":"publish","type":"post","link":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/konsensus-na-reputatsii-nody-nuzhen-li","title":{"rendered":"Consensul asupra reputa\u021biei nodului. Este necesar?","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\u0218tiu, \u0219tiu. Exist\u0103 o mul\u021bime de criptoproiecte, cu diverse consensuri: bazate pe munc\u0103 \u0219i proprietate, aur, petrol, pl\u0103cinte coapte (da, exist\u0103 \u0219i a\u0219a ceva). Ce ne-ar mai trebui de la unul singur? Asta a\u0219 dori s\u0103 discut\u0103m dup\u0103 citirea traducerii documenta\u021biei tehnice 'simplificate' a proiectului *Constela\u021bia (Constellation<\/a><\/noindex>). Bine\u00een\u021beles, aceasta nu este o descriere complet\u0103 a algoritmului, dar m\u0103 intereseaz\u0103 opinia comunit\u0103\u021bii Habr, are un astfel de consens vreo relevan\u021b\u0103 sau este inutil?<\/p>\n

<\/p>\n

\u00cen continuare, nu sunt multe litere, a\u0219a c\u0103, dac\u0103 pur \u0219i simplu dori\u021bi s\u0103 scrie\u021bi 'uf, c\u00e2te se poate spune despre cript\u0103', v\u0103 rog s\u0103 v\u0103 ab\u021bine\u021bi. Dac\u0103 sunte\u021bi interesat de noile dezvolt\u0103ri \u00een domeniul sistemelor distribuite \u0219i ave\u021bi ceva de \u00eemp\u0103rt\u0103\u0219it \u00een comentarii, v\u0103 rog s\u0103 merge\u021bi mai departe.<\/p>\n

<\/p>\n

P.S. Nu sunt autorul tehnologiei, nu pot garanta pentru transmiterea complet\u0103 a esen\u021bei, a\u0219a c\u0103 voi fi bucuros s\u0103 primesc comentarii cu corecturi, dac\u0103 vor exista.<\/em><\/p>\n

<\/a><\/noindex><\/p>\n

Evolu\u021bia de la consensuri sincronizate la cele asincronizate<\/h3>\n

<\/p>\n

Nodurile sunt selectate folosind un proces determinist (acela\u0219i folosit \u00een DHT, de exemplu, bittorrent), care regleaz\u0103 dinamic atribu\u021biile nodurilor pentru a facilita validarea sau, mai bine spus, pentru a ajunge la consens. Se selecteaz\u0103 grupuri de 3 noduri \u0219i se desf\u0103\u0219oar\u0103 runde de consens \u00een paralel, astfel \u00eenc\u00e2t un nod s\u0103 poat\u0103 ac\u021biona ca facilitator \u00een mai multe blocuri. Aceasta ne permite s\u0103 proces\u0103m tranzac\u021biile asincron, ceea ce, \u00een esen\u021b\u0103, \u00eenseamn\u0103 c\u0103 se formeaz\u0103 simultan mai multe blockchains. Procesul este similar unei p\u00e2nze, format\u0103 din multe fire, spre deosebire de noduri care formeaz\u0103 un singur lan\u021b \u00een timp. Procesarea asincron\u0103 sau paralel\u0103 este baza program\u0103rii scalabile, deoarece permite utilizarea tuturor resurselor computerului, acceler\u00e2nd calculul total. Aceast\u0103 re\u021bea este numit\u0103 grafic orientat aciclic sau DAG \u00een informatic\u0103.<\/p>\n

<\/p>\n

\"Consensul
\nL\u0103\u021bimea canalului blockchain-ului liniar versus efectul multiplicativ al DAG-ului, unde avem mai multe blockchains paralele. <\/em><\/p>\n

<\/p>\n

\"Consensul
\nImplementarea geometric\u0103 a blockchain-ului liniar versus DAG. Punctele negre sunt blocuri, punctele albe sunt noduri.<\/em><\/p>\n

<\/p>\n

Folosim 3 noduri \u00een fiecare rund\u0103 de consens, deoarece acest lucru ne ofer\u0103 unele procese matematice interesante pentru a analiza starea, form\u00e2nd \u201eplanul suprafe\u021bei\u201d prin date sub form\u0103 de triunghiuri legate. Apoi, protocolul folose\u0219te triunghiurile pentru a \u201ecosi\u201d suprafa\u021ba optim\u0103, care nu con\u021bine date redundante sau contradictorii \u0219i are cel mai mic num\u0103r posibil de triunghiuri. Algoritmic \u2014 acest lucru este similar cu \u201et\u0103ierea minim\u0103\u201d a unui graf, iar matematic \u2014 este o derivat\u0103 sau o func\u021bie de optimizare (din care func\u021bia g\u0103se\u0219te cel mai scurt drum pe care \u00eel poate traversa pe suprafa\u021b\u0103). Acest drum cel mai scurt este echivalent cu stocarea optim\u0103 a datelor (tranzac\u021biilor) \u00eentr-un grup de baze de date \u00een disponibilitate. Triunghiurile \u201epl\u0103cilor\u201d conflictuale, astfel \u00eenc\u00e2t suprafa\u021ba evenimentului s\u0103 fie uniform\u0103 \u0219i f\u0103r\u0103 conflicte.<\/p>\n

<\/p>\n

\"Consensul
\nImplementarea geometric\u0103 a detect\u0103rii \/ gestion\u0103rii conflictelor. Un bloc conflictual creeaz\u0103 o plac\u0103 suplimentar\u0103 a suprafe\u021bei. Elimin\u0103m placa suplimentar\u0103 a suprafe\u021bei pentru a men\u021bine o suprafa\u021b\u0103 plat\u0103 (= f\u0103r\u0103 conflicte) a evenimentelor. <\/em><\/p>\n

<\/p>\n

Consens bazat pe reputa\u021bie<\/h3>\n

<\/p>\n

\u00centr-un sistem de reputa\u021bie p2p decentralizat optim, fiecare nod trebuie s\u0103 aib\u0103 capacitatea de a-\u0219i determina singur nivelul de \u00eencredere fa\u021b\u0103 de celelalte noduri. Sistemul nostru utilizeaz\u0103 un model special care include rela\u021bii transitive sau rela\u021bii pe care un nod le are cu alte noduri atunci c\u00e2nd se acord\u0103 o evaluare global\u0103. \u201eE\u0219ti la fel de bun ca \u0219i compania ta\u201d. Rezultatul final este un \u201edeforma\u021bie\u201d sau un gradient, bazat pe \u00eencrederea transativ\u0103 sau reputa\u021bia \u00een toate nodurile din $DAG sau canalul sta\u021bionar. Acest lucru poate fi v\u0103zut ca o r\u0103z\u0103toare pentru br\u00e2nz\u0103 care \u0219terge suprafa\u021ba \u201eplanului suprafe\u021bei\u201d \u0219i decide care \u201epl\u0103ci triangulare\u201d s\u0103 fie \u0219terse \u0219i care s\u0103 fie p\u0103strate. A\u0219a func\u021bioneaz\u0103 logica conflictului pentru a elimina efectiv \u201epl\u0103cile triunghiulare\u201d.<\/p>\n

<\/p>\n

\"Consensul
\nDAG cu o plac\u0103 conflictual\u0103, travers\u00e2nd un spa\u021biu \u201edeformat\u201d, care este un gradient similar cu o r\u0103z\u0103toare pentru br\u00e2nz\u0103, \u0219i se va str\u0103dui s\u0103 elimine sau \u201es\u0103 \u0219tearg\u0103\u201d placa conflictual\u0103.<\/em><\/p>\n

<\/p>\n

Scalarea par\u021bial\u0103 \/ complet\u0103 a nodului<\/h3>\n

<\/p>\n

\u00cen teoria re\u021belelor, distribu\u021bia optim\u0103 este adesea cunoscut\u0103 sub denumirea de \u201ef\u0103r\u0103 scalare\u201d, care poate fi descris\u0103 ca o organizare ierarhic\u0103 cu noduri centrale mari, care controleaz\u0103 multe noduri periferice mai mici. Aceast\u0103 distribu\u021bie se reg\u0103se\u0219te \u00een natur\u0103 \u0219i, \u00een special, pe internet. Constellation folose\u0219te aceast\u0103 arhitectur\u0103 pentru \u201escalare\u201d, sau pentru a cre\u0219te l\u0103\u021bimea de band\u0103 sau capacitatea Grafului nostru.<\/p>\n

<\/p>\n

\"Consensul
\nEfectul \u00eemp\u0103r\u021birii ierarhice. Putem ad\u0103uga mai multe noduri, extinz\u00e2nd l\u0103\u021bimea de band\u0103.<\/em><\/p>\n

<\/p>\n

Hylochain \u2014 Suport pentru aplica\u021bii bazate pe canale.<\/h3>\n

<\/p>\n

Abordarea noastr\u0103 pentru suportul aplica\u021biilor poate fi v\u0103zut\u0103 ca o \u201eplatform\u0103 descentralizat\u0103 de contracte inteligente\u201d. \u00cen loc de o re\u021bea central\u0103 care s\u0103 execute \u00eentreaga logic\u0103 \u0219i s\u0103 proceseze toate datele de la aplica\u021bie, Constellation coordoneaz\u0103 datele aplica\u021biei prin \u201ecanale de stat\u201d, care pot fi considerate ca o sta\u021bie de televiziune ce difuzeaz\u0103 toate datele din sistemul de stat. Fiecare canal de stat poate implementa propria logic\u0103 de verificare, rezolv\u00e2nd problema oracolelor prin autentificarea transitar\u0103 a produc\u0103torilor de date \u0219i verificarea transitar\u0103 a sistemelor de stat compuse. Re\u021belele de canale de stat ofer\u0103 suport paralel pentru aplica\u021bii, acceler\u00e2nd timpul de adoptare, care, \u00een re\u021belele cu contracte inteligente, este limitat de consensul tradi\u021bional sincron.<\/p>\n

<\/p>\n

\"Consensul
\nDou\u0103 canale de stat care sunt \u201ecompatibile\u201d prin re\u021beaua $DAG. Ele pot interac\u021biona sau fi interpretate, deoarece ambele sunt \u201eintegrate\u201d cu $DAG prin desf\u0103\u0219urarea de noduri hibride $DAG + Canal.<\/em><\/p>\n

<\/p>\n

Motivul pentru care se nume\u0219te Hylochain este c\u0103 \u00een abordarea noastr\u0103 pentru suportul aplica\u021biilor am folosit modelul func\u021bional de programare Recursion Schemes pentru a crea o interfa\u021b\u0103 MapReduce. \u00cen special, schemele de recursie Hylomorphism (Hylomorfism) \u0219i Metamorphism (Metamorfoz\u0103) pot fi integrate pentru a crea interog\u0103ri verificabile \u0219i conexiuni de streaming prin canale standard, prin verificarea tipurilor de date algebrice la fel cum sunt verificate op-code-urile pentru contractele inteligente. Rezultatul final este o interfa\u021b\u0103 func\u021bional\u0103 MapReduce, cunoscut\u0103 de inginerii de date \u0219i compatibil\u0103 cu tehnologia existent\u0103 de big data.<\/p>\n

<\/p>\n

\"Consensul
\nHylomorphic \u0219i Metamorphic canale standard pentru contrast. \u00cen starea metamorphic, datele din dou\u0103 canale standard sunt trimise \u00eentr-un bloc \u00een metacanal. \u00cen Hilo, lu\u0103m starea anterioar\u0103 a canalului \u0219i o folosim pentru a solicita (a pune o \u00eentrebare specific\u0103) dou\u0103 alte canale, apoi p\u0103str\u0103m rezultatul interog\u0103rii \u00eentr-un bloc.<\/em><\/p>\n

<\/p>\n

Tokenomica \u0219i leg\u0103tura ei cu Hylochain<\/h3>\n

<\/p>\n

Odat\u0103 ce canalul standard este creat, poate fi integrat \u00een canalul $DAG, dar folosind interfa\u021ba ACI sau Application Chain Interface. Aceast\u0103 interfa\u021b\u0103 este pur \u0219i simplu un obiect JSON cu informa\u021bii despre configura\u021bie \u0219i o cheie public\u0103 asociat\u0103 canalului propriu-zis. Motivul pentru care asociem cheia public\u0103 cu canalul standard este crearea unui mecanism de brokeraj pentru datele canalului standard. Odat\u0103 ce canalul standard este desf\u0103\u0219urat, dezvoltatorii decid cum se \u00eempart pl\u0103\u021bile din re\u021beaua $DAG \u00eentre noduri \u0219i operatori.<\/p>\n

<\/p>\n

\"Consensul
\nFlux pentru achizi\u021bia de acces la informa\u021bii sau modificarea informa\u021biilor. Solicitarea este trimis\u0103 \u00een $DAG, fondurile sunt trimise pe contul canalului, rezultatul este trimis cump\u0103r\u0103torului, iar suma de control a tranzac\u021biei este trimis\u0103 \u00een re\u021beaua $DAG, care apoi deblocheaz\u0103 fondurile pentru canalul standard.<\/em><\/p>\n

Sursa: habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"

\u0417\u043d\u0430\u044e-\u0437\u043d\u0430\u044e. \u041a\u0440\u0438\u043f\u0442\u043e\u043f\u0440\u043e\u0435\u043a\u0442\u043e\u0432 \u0442\u044c\u043c\u0430, \u0435\u0441\u0442\u044c \u043a\u0443\u0447\u0430 \u043a\u043e\u043d\u0441\u0435\u043d\u0441\u0443\u0441\u043e\u0432: \u043d\u0430 \u043e\u0441\u043d\u043e\u0432\u0435 \u0442\u0440\u0443\u0434\u0430 \u0438 \u0432\u043b\u0430\u0434\u0435\u043d\u0438\u044f, \u0437\u043e\u043b\u043e\u0442\u0430, \u043d\u0435\u0444\u0442\u0438, \u0432\u044b\u043f\u0435\u0447\u0435\u043d\u043d\u044b\u0445 \u043f\u0438\u0440\u043e\u0436\u043a\u043e\u0432 (\u0435\u0441\u0442\u044c \u0438 \u0442\u0430\u043a\u043e\u0439, \u0434\u0430-\u0434\u0430). \u0427\u0442\u043e \u043d\u0430\u043c \u0435\u0449\u0451 \u043e\u0442 \u043e\u0434\u043d\u043e\u0433\u043e? \u042d\u0442\u043e \u0438 \u043f\u0440\u0435\u0434\u043b\u0430\u0433\u0430\u044e \u043e\u0431\u0441\u0443\u0434\u0438\u0442\u044c \u043f\u043e\u0441\u043b\u0435 \u043f\u0440\u043e\u0447\u0442\u0435\u043d\u0438\u044f \u043f\u0435\u0440\u0435\u0432\u043e\u0434\u0430 «\u043e\u0431\u043b\u0435\u0433\u0447\u0435\u043d\u043d\u043e\u0439» \u0442\u0435\u0445\u043d\u0438\u0447\u0435\u0441\u043a\u043e\u0439 \u0434\u043e\u043a\u0443\u043c\u0435\u043d\u0442\u0430\u0446\u0438\u0438 \u043f\u0440\u043e\u0435\u043a\u0442\u0430 *\u0421\u043e\u0437\u0432\u0435\u0437\u0434\u0438\u0435 (Constellation). \u041a\u043e\u043d\u0435\u0447\u043d\u043e, \u044d\u0442\u043e \u043d\u0435 \u043f\u043e\u043b\u043d\u043e\u0435 \u043e\u043f\u0438\u0441\u0430\u043d\u0438\u0435 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0430, \u043d\u043e \u043c\u043d\u0435 \u0438\u043d\u0442\u0435\u0440\u0435\u0441\u043d\u043e \u043c\u043d\u0435\u043d\u0438\u0435 \u043a\u043e\u043c\u044c\u044e\u043d\u0438\u0442\u0438 \u0445\u0430\u0431\u0440\u0430, \u0438\u043c\u0435\u0435\u0442 \u043b\u0438 \u043c\u0435\u0441\u0442\u043e «\u0431\u044b\u0442\u044c» \u0442\u0430\u043a\u043e\u043c\u0443 \u043a\u043e\u043d\u0441\u0435\u043d\u0441\u0443\u0441\u0443 […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":27262,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-36425","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n","aioseo_head_json":{"title":"\ud83e\udd47Consensul pe baza reputa\u021biei nodului. Este nevoie de el? | ProHoster","description":"\u0218tiu, \u0219tiu. Exist\u0103 o mul\u021bime de criptoproiecte, sunt o gr\u0103mad\u0103 de consensuri: bazate pe munc\u0103 \u0219i proprietate, aur, petrol, pl\u0103cinte coapte (da, exist\u0103 \u0219i a\u0219a ceva). Ce ne-ar mai putea aduce un altul?","canonical_url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/konsensus-na-reputatsii-nody-nuzhen-li","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"ro_RO","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\u041a\u043e\u043d\u0441\u0435\u043d\u0441\u0443\u0441 \u043d\u0430 \u0440\u0435\u043f\u0443\u0442\u0430\u0446\u0438\u0438 \u043d\u043e\u0434\u044b. \u041d\u0443\u0436\u0435\u043d \u043b\u0438? | ProHoster","og:description":"\u0417\u043d\u0430\u044e-\u0437\u043d\u0430\u044e. \u041a\u0440\u0438\u043f\u0442\u043e\u043f\u0440\u043e\u0435\u043a\u0442\u043e\u0432 \u0442\u044c\u043c\u0430, \u0435\u0441\u0442\u044c \u043a\u0443\u0447\u0430 \u043a\u043e\u043d\u0441\u0435\u043d\u0441\u0443\u0441\u043e\u0432: \u043d\u0430 \u043e\u0441\u043d\u043e\u0432\u0435 \u0442\u0440\u0443\u0434\u0430 \u0438 \u0432\u043b\u0430\u0434\u0435\u043d\u0438\u044f, \u0437\u043e\u043b\u043e\u0442\u0430, \u043d\u0435\u0444\u0442\u0438, \u0432\u044b\u043f\u0435\u0447\u0435\u043d\u043d\u044b\u0445 \u043f\u0438\u0440\u043e\u0436\u043a\u043e\u0432 (\u0435\u0441\u0442\u044c \u0438 \u0442\u0430\u043a\u043e\u0439, \u0434\u0430-\u0434\u0430). \u0427\u0442\u043e \u043d\u0430\u043c \u0435\u0449\u0451 \u043e\u0442 \u043e\u0434\u043d\u043e\u0433\u043e?","og:url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/konsensus-na-reputatsii-nody-nuzhen-li","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-31T19:11:34+00:00","article:modified_time":"2019-10-31T19:11:34+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"36425","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-22 03:15:20","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 01:45:35","updated":"2026-01-22 03:15:20","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/36425","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/comments?post=36425"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/36425\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media\/27262"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media?parent=36425"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/categories?post=36425"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/tags?post=36425"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}