{"id":53183,"date":"2019-11-25T00:00:00","date_gmt":"2019-11-24T21:00:00","guid":{"rendered":"https:\/\/prohoster.info\/blog\/blog_prohoster\/ot-blokchejna-k-dag-izbavlyaemsya-ot-posrednikov"},"modified":"2026-02-15T19:54:48","modified_gmt":"2026-02-15T17:54:48","slug":"ot-blokchejna-k-dag-izbavlyaemsya-ot-posrednikov","status":"publish","type":"post","link":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/ot-blokchejna-k-dag-izbavlyaemsya-ot-posrednikov","title":{"rendered":"De la blockchain la DAG: sc\u0103p\u0103m de intermediari","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\u00cen acest articol, v\u0103 voi vorbi despre DAG (Grafic Ayclic Dirijat) \u0219i aplica\u021biile acestuia \u00een registrele distribuite, \u0219i vom compara asta cu blockchain-ul.<\/p>\n

\"De
\n
\nDAG nu este un concept nou \u00een lumea criptomonedelor. Poate c\u0103 a\u021bi auzit despre el ca o solu\u021bie pentru problemele de scalabilitate ale blockchain-urilor. Dar ast\u0103zi nu vom discuta despre scalabilitate, ci despre ceea ce face criptomonedele diferite de toate celelalte: descentralizarea, absen\u021ba intermediarilor \u0219i rezisten\u021ba la cenzur\u0103.
\n<\/a><\/noindex>
\n\"De
\n
\nDe asemenea, v\u0103 voi ar\u0103ta c\u0103 DAG este, de fapt, mai rezistent la cenzur\u0103, iar \u00een acesta nu exist\u0103 intermediari pentru accesul la registru.<\/p>\n

\"De
\n
\n\u00cen blockchain-urile cu care suntem obi\u0219nui\u021bi, utilizatorii nu au acces direct la registrul propriu-zis. C\u00e2nd dori\u021bi s\u0103 ad\u0103uga\u021bi o tranzac\u021bie \u00een registru, trebuie s\u0103 'cere\u021bi' produc\u0103torului de blocuri (block producer, cunoscut \u0219i ca 'miner') s\u0103 fac\u0103 acest lucru. Numai minerii decid ce tranzac\u021bie s\u0103 adauge \u00een urm\u0103torul bloc \u0219i care nu. Numai minerii au acces exclusiv la blocuri \u0219i dreptul de a decide ce tranzac\u021bie s\u0103 accepte pentru a fi ad\u0103ugat\u0103 \u00een registru.<\/p>\n

Minerii sunt intermediari care stau \u00eentre dumneavoastr\u0103 \u0219i registrul distribuit.<\/p>\n

\"De
\n
\n\u00cen practic\u0103, de obicei, un num\u0103r mic de piscine de mineri controleaz\u0103 colectiv mai mult de jum\u0103tate din puterea de calcul a re\u021belei. Pentru Bitcoin, sunt patru piscine, iar pentru Ethereum \u2013 dou\u0103. \u00cen cazul \u00een care acestea colaboreaz\u0103, pot bloca orice tranzac\u021bii doresc.<\/p>\n

\"De
\n
\n\u00cen ultimii c\u00e2\u021biva ani, au fost propuse numeroase varia\u021bii ale blockchain-urilor, diferind \u00een principiile de alegere a produc\u0103torilor de blocuri. Dar produc\u0103torii de blocuri \u00een sine nu dispar; ace\u0219tia continu\u0103 s\u0103 fie 'la barier\u0103': fiecare tranzac\u021bie trebuie s\u0103 treac\u0103 prin produc\u0103torul de blocuri, iar dac\u0103 acesta nu o accept\u0103, atunci tranzac\u021bia, de fapt, nu exist\u0103.<\/p>\n

\"De
\n
\nAceasta este o problem\u0103 inevitabil\u0103 \u00een cazul blockchain-ului. \u0218i dac\u0103 dorim s\u0103 o rezolv\u0103m, trebuie s\u0103 schimb\u0103m radical designul \u0219i s\u0103 ne desp\u0103r\u021bim complet de blocuri \u0219i produc\u0103torii de blocuri. \u00cen loc s\u0103 construim o succesiune de blocuri, vom conecta tranzac\u021biile \u00eentre ele, inclusiv \u00een fiecare tranzac\u021bie hash-urile mai multor tranzac\u021bii anterioare. Ca rezultat, vom ob\u021bine o structur\u0103 cunoscut\u0103 \u00een matematic\u0103 ca grafic aciclic dirijat \u2013 DAG.<\/p>\n

Acum, fiecare are acces direct la registru, f\u0103r\u0103 intermediari. C\u00e2nd dori\u021bi s\u0103 ad\u0103uga\u021bi o tranzac\u021bie \u00een registru \u2013 pur \u0219i simplu o ad\u0103uga\u021bi. Alege\u021bi c\u00e2teva tranzac\u021bii p\u0103rinte, ad\u0103uga\u021bi datele dvs., semna\u021bi \u0219i trimite\u021bi tranzac\u021bia dvs. \u00een re\u021bea. Gata. Nu exist\u0103 nimeni care s\u0103 v\u0103 poat\u0103 opri s\u0103 face\u021bi asta, a\u0219a c\u0103 tranzac\u021bia dvs. este deja \u00een registru.<\/p>\n

Acesta este cel mai descentralizat, cel mai rezistent la cenzur\u0103 mod de a ad\u0103uga tranzac\u021bii \u00een registru f\u0103r\u0103 intermediari. Pentru c\u0103 to\u021bi cei interesa\u021bi pur \u0219i simplu \u00ee\u0219i adaug\u0103 tranzac\u021biile \u00een registru, f\u0103r\u0103 a cere permisiunea cuiva.<\/p>\n

\"De
\n
\nDAG poate fi considerat a treia etap\u0103 a evolu\u021biei registrelor. Prima dat\u0103 au fost registre centralizate, unde o parte controla accesul la ele. Apoi au ap\u0103rut blockhain-urile, \u00een care existau mai mul\u021bi controlori care \u00eenregistrau tranzac\u021biile \u00een registru. \u0218i, \u00een cele din urm\u0103, \u00een DAG nu exist\u0103 controlori, utilizatorii adaug\u0103 tranzac\u021biile lor direct.<\/p>\n

\"De
\n
\nAcum, c\u00e2nd avem aceast\u0103 libertate, ea nu ar trebui s\u0103 conduc\u0103 la haos. Trebuie s\u0103 avem un consens asupra st\u0103rii registrului. \u0218i acest consens, sau consens, \u00eenseamn\u0103 de obicei consens asupra a dou\u0103 lucruri:<\/p>\n

    \n
  1. Ce s-a \u00eent\u00e2mplat?\n<\/li>\n
  2. \u00cen ce ordine a avut loc?\n<\/li>\n<\/ol>\n

    \nLa prima \u00eentrebare putem r\u0103spunde cu u\u0219urin\u021b\u0103: odat\u0103 ce tranzac\u021bia corect creat\u0103 a fost ad\u0103ugat\u0103 \u00een registru, aceasta a avut loc. \u0218i punct. Informa\u021biile despre aceasta pot ajunge la to\u021bi participan\u021bii \u00een momente diferite, dar, \u00een cele din urm\u0103, toate nodurile vor primi aceast\u0103 tranzac\u021bie \u0219i vor afla c\u0103 a avut loc.<\/p>\n

    Dac\u0103 ar fi fost un blockchain, minerii ar decide ce se \u00eent\u00e2mpl\u0103. Tot ce decide minerul s\u0103 includ\u0103 \u00een bloc \u2013 aceea se \u00eent\u00e2mpl\u0103. Tot ce nu include \u00een bloc \u2013 nu se \u00eent\u00e2mpl\u0103.<\/p>\n

    \u00cen blockhain-uri, minerii decid de asemenea a doua problem\u0103 a consensului: ordinea. Li se permite s\u0103 ordoneze tranzac\u021biile din interiorul blocului \u00een orice fel doresc.<\/p>\n

    Cum putem determina ordinea tranzac\u021biilor \u00een DAG?<\/p>\n

    \"De
    \n
    \nDoar pentru c\u0103 graful nostru este orientat, avem deja un anumit ordine. Fiecare tranzac\u021bie se refer\u0103 la una sau mai multe tranzac\u021bii anterioare, p\u0103rinte. P\u0103rin\u021bii, la r\u00e2ndul lor, se refer\u0103 la p\u0103rin\u021bii lor \u0219i a\u0219a mai departe. P\u0103rin\u021bii, evident, apar \u00eenaintea tranzac\u021biilor fiice. Dac\u0103 oricare dintre tranzac\u021bii poate fi atins\u0103 prin leg\u0103turi \u201ep\u0103rinte-copil\u201d, \u0219tim cu siguran\u021b\u0103 ordinea dintre tranzac\u021biile din aceast\u0103 secven\u021b\u0103 de tranzac\u021bii.<\/p>\n

    \"De
    \n
    \nDar ordinea dintre tranzac\u021bii nu poate fi \u00eentotdeauna determinat\u0103 doar din forma grafului. De exemplu, atunci c\u00e2nd dou\u0103 tranzac\u021bii se afl\u0103 pe ramuri paralele ale grafului.<\/p>\n

    \"De
    \n
    \nPentru a rezolva ambiguitatea \u00een astfel de cazuri, ne baz\u0103m pe a\u0219a-numi\u021bii furnizori de ordine. De asemenea, \u00eei numim \u201emartori\u201d. Ace\u0219tia sunt utilizatori obi\u0219nui\u021bi, sarcina lor fiind de a trimite constant tranzac\u021bii \u00een re\u021bea respect\u00e2nd ordinea, adic\u0103 astfel \u00eenc\u00e2t fiecare tranzac\u021bie anterioar\u0103 s\u0103 poat\u0103 fi atins\u0103 prin leg\u0103turi \u201ep\u0103rinte-copil\u201d. Furnizorii de ordine \u2013     utilizatori de \u00eencredere<\/a>, \u0219i \u00eentreaga re\u021bea se bazeaz\u0103 pe faptul c\u0103 ace\u0219tia nu vor \u00eenc\u0103lca aceast\u0103 regul\u0103. Pentru a a avea \u00eencredere \u00een mod ra\u021bional<\/b> , cerem ca fiecare furnizor de ordine s\u0103 fie o persoan\u0103 sau o organiza\u021bie cunoscut\u0103 (non-anonim\u0103) \u0219i s\u0103 aib\u0103 ceva ce poate pierde \u00een cazul \u00een care \u00eencalc\u0103 regulile, cum ar fi reputa\u021bia sau un business bazat pe \u00eencredere.<\/p>\n

    \"De
    \n
    \nFurnizorii de ordine sunt ale\u0219i de utilizatori, iar fiecare utilizator inclus \u00een fiecare tranzac\u021bie pe care o trimite \u00een re\u021bea o list\u0103 a furnizorilor s\u0103i de \u00eencredere. Aceast\u0103 list\u0103 const\u0103 din 12 furnizori. Acesta este un num\u0103r destul de mic, astfel \u00eenc\u00e2t o persoan\u0103 s\u0103 poat\u0103 verifica identit\u0103\u021bile \u0219i reputa\u021bia fiec\u0103ruia dintre ei, \u0219i suficient pentru ca re\u021beaua s\u0103 continue s\u0103 func\u021bioneze \u00een cazul inevitabilelor probleme cu o minoritate de furnizori de ordine.<\/p>\n

    Aceast\u0103 list\u0103 de furnizori variaz\u0103 de la utilizator la utilizator, dar listele tranzac\u021biilor \u00eenvecinate pot diferi maximum cu un furnizor.<\/p>\n

    \"De
    \n
    \nAcum, c\u00e2nd avem furnizori de ordine, putem eviden\u021bia tranzac\u021biile lor \u00een DAG \u0219i s\u0103 ordon\u0103m toate celelalte tranzac\u021bii \u00een jurul ordinii create de ace\u0219tia. Exist\u0103 posibilitatea de a crea un astfel de algoritm (vezi     Obyte White Paper<\/a><\/noindex> pentru detalii tehnice).<\/p>\n

    Dar ordinea \u00een \u00eentreaga re\u021bea nu poate fi stabilit\u0103 instantaneu, avem nevoie de timp pentru ca furnizorii de ordine s\u0103 trimit\u0103 un num\u0103r suficient de tranzac\u021bii pentru a ne asigura de ordinea final\u0103 a tranzac\u021biilor anterioare.<\/p>\n

    \u0218i, deoarece ordinea este determinat\u0103 doar de pozi\u021biile tranzac\u021biilor furnizorilor \u00een DAG, toate nodurile re\u021belei, mai devreme sau mai t\u00e2rziu, vor primi toate tranzac\u021biile \u0219i vor ajunge la aceea\u0219i concluzie cu privire la ordinea tranzac\u021biilor.<\/p>\n

    \"De
    \n
    \nAstfel, avem un consens cu privire la ceea ce consider\u0103m c\u0103 s-a \u00eent\u00e2mplat: orice tranzac\u021bie care a ajuns \u00een DAG s-a \u00eent\u00e2mplat. De asemenea, avem un consens asupra ordinii evenimentelor: aceasta este fie evident\u0103 din rela\u021biile parent-children ale tranzac\u021biilor, fie rezult\u0103 din ordinea tranzac\u021biilor trimise de furnizorii de ordine. A\u0219adar, avem consens.<\/p>\n

    \"De
    \n
    \nAceast\u0103 variant\u0103 de consens o avem \u00een Obyte. De\u0219i accesul la registrul Obyte este complet descentralizat, consensul asupra ordinii tranzac\u021biilor este \u00eenc\u0103 centralizat, deoarece 10 din 12 furnizori sunt controla\u021bi de creator (Anton Churiumov), iar doar 2 dintre ei sunt independen\u021bi. C\u0103ut\u0103m candida\u021bi dornici s\u0103 devin\u0103 unul dintre furnizorii independen\u021bi de ordine, pentru a ne ajuta s\u0103 descentraliz\u0103m stabilirea ordinii \u00een registru.<\/p>\n

    Recent a ap\u0103rut un al treilea candidat independent dornic s\u0103 stabileasc\u0103 \u0219i s\u0103 men\u021bin\u0103 un nod de furnizor de ordine \u2013 Universitatea din Nicossia.<\/p>\n

    \"De
    \n
    \nAcum, cum control\u0103m cheltuielile duble (double-spends)?<\/p>\n

    Conform regulilor, \u00een cazul \u00een care sunt descoperite dou\u0103 tranzac\u021bii care cheltuiesc aceea\u0219i moned\u0103, tranzac\u021bia care a fost procesat\u0103 prima \u00een ordinea final\u0103 a tuturor tranzac\u021biilor c\u00e2\u0219tig\u0103. A doua este invalidat\u0103 de algoritmul de consens.<\/p>\n

    \"De
    \n\u00cen cazul \u00een care exist\u0103 posibilitatea de a stabili ordinea \u00eentre dou\u0103 tranzac\u021bii care cheltuiesc aceea\u0219i moned\u0103 (prin rela\u021biile parent-child), toate nodurile resping imediat o astfel de \u00eencercare de cheltuire dubl\u0103.<\/p>\n

    \"De
    \n
    \n\u00cen cazul \u00een care ordinea nu este evident\u0103 din leg\u0103turile parent-children \u00eentre aceste dou\u0103 tranzac\u021bii, ambele sunt acceptate \u00een registru, \u0219i va fi necesar s\u0103 a\u0219tept\u0103m consensul \u0219i stabilirea ordinii \u00eentre ele prin furnizorii de ordine. Atunci, tranzac\u021bia mai veche va c\u00e2\u0219tiga, iar a doua va deveni invalid\u0103.<\/p>\n

    \"De
    \n
    \nChiar dac\u0103 a doua tranzac\u021bie devine invalid\u0103, aceasta r\u0103m\u00e2ne \u00een registru, deoarece are deja tranzac\u021bii ulterioare care se refer\u0103 la ea, care nu au \u00eenc\u0103lcat nimic \u0219i nu \u0219tiau c\u0103 \u00een viitor aceast\u0103 tranzac\u021bie va deveni invalid\u0103. \u00cen caz contrar, ar trebui s\u0103 \u0219tergem p\u0103rintele tranzac\u021biilor urm\u0103toare corecte, ceea ce ar \u00eencalca principiul de baz\u0103 al re\u021belei \u2013 orice tranzac\u021bie corect\u0103 este acceptat\u0103 \u00een registru.<\/p>\n

    \"De
    \n
    \nAceasta este o regul\u0103 foarte important\u0103, care permite \u00eentregului sistem s\u0103 fie rezistent la \u00eencerc\u0103rile de cenzur\u0103.\u00a0<\/p>\n

    S\u0103 presupunem c\u0103 to\u021bi furnizorii de ordine intr\u0103 \u00eentr-o \u00een\u021belegere pentru a 'cenzura' o tranzac\u021bie specific\u0103. Ace\u0219tia pot s\u0103 o ignore \u0219i s\u0103 nu o aleag\u0103 niciodat\u0103 ca 'p\u0103rinte' pentru tranzac\u021biile lor, dar aceasta nu este suficient; tranzac\u021bia poate fi \u00een continuare inclus\u0103 indirect ca p\u0103rinte al unei alte tranzac\u021bii emise de orice utilizator al re\u021belei care nu particip\u0103 la \u00een\u021belegere. Cu timpul, o astfel de tranzac\u021bie va primi din ce \u00een ce mai mul\u021bi copii, nepo\u021bi \u0219i str\u0103nepo\u021bi de la utilizatori obi\u0219nui\u021bi, extinz\u00e2ndu-se ca un bulgare de z\u0103pad\u0103, iar to\u021bi furnizorii de ordine conveni\u021bi vor trebui s\u0103 ignore \u0219i aceste tranzac\u021bii. \u00cen cele din urm\u0103, va trebui s\u0103 cenzureze \u00eentreaga re\u021bea, ceea ce echivaleaz\u0103 cu sabotaj.<\/p>\n

    \"De
    \n
    \nAstfel, DAG r\u0103m\u00e2ne rezistent la cenzur\u0103, chiar dac\u0103 exist\u0103 o \u00een\u021belegere \u00eentre furnizorii de ordine, dep\u0103\u0219ind astfel blockchain-ul \u00een ceea ce prive\u0219te rezisten\u021ba la cenzur\u0103, \u00een cazul \u00een care minerii decid s\u0103 nu includ\u0103 o anumit\u0103 tranzac\u021bie. Aceasta urmeaz\u0103 din proprietatea principal\u0103 a DAG: participarea \u00een registru este complet independent\u0103 \u0219i f\u0103r\u0103 intermediari, iar tranzac\u021biile sunt ireversibile.
    \n
    Sursa:     habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"

    \u0412 \u044d\u0442\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u044f \u0440\u0430\u0441\u0441\u043a\u0430\u0436\u0443 \u0432\u0430\u043c \u043e DAG (Directed Acyclic Graph, \u043d\u0430\u043f\u0440\u0430\u0432\u043b\u0435\u043d\u043d\u044b\u0439 \u0430\u0446\u0438\u043a\u043b\u0438\u0447\u0435\u0441\u043a\u0438\u0439 \u0433\u0440\u0430\u0444) \u0438 \u0435\u0433\u043e \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u0438 \u0432 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0451\u043d\u043d\u044b\u0445 \u0440\u0435\u0435\u0441\u0442\u0440\u0430\u0445, \u0438 \u043c\u044b \u0441\u0440\u0430\u0432\u043d\u0438\u043c \u0435\u0433\u043e \u0441 \u0431\u043b\u043e\u043a\u0447\u0435\u0439\u043d\u043e\u043c. DAG \u043d\u0435 \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0447\u0435\u043c-\u0442\u043e \u043d\u043e\u0432\u044b\u043c \u0432 \u043c\u0438\u0440\u0435 \u043a\u0440\u0438\u043f\u0442\u043e\u0432\u0430\u043b\u044e\u0442. \u0412\u043e\u0437\u043c\u043e\u0436\u043d\u043e \u0432\u044b \u0441\u043b\u044b\u0448\u0430\u043b\u0438 \u043e \u043d\u0451\u043c \u043a\u0430\u043a \u043e \u0440\u0435\u0448\u0435\u043d\u0438\u0438 \u043f\u0440\u043e\u0431\u043b\u0435\u043c \u043c\u0430\u0441\u0448\u0442\u0430\u0431\u0438\u0440\u0443\u0435\u043c\u043e\u0441\u0442\u0438 \u0431\u043b\u043e\u043a\u0447\u0435\u0439\u043d\u043e\u0432. \u041d\u043e \u0441\u0435\u0433\u043e\u0434\u043d\u044f \u043c\u044b \u0431\u0443\u0434\u0435\u043c \u0433\u043e\u0432\u043e\u0440\u0438\u0442\u044c \u043d\u0435 \u043e \u043c\u0430\u0441\u0448\u0442\u0430\u0431\u0438\u0440\u0443\u0435\u043c\u043e\u0441\u0442\u0438, \u0430 \u043e […]<\/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-53183","post","type-post","status-publish","format-standard","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\udd47De la blockchain la DAG: sc\u0103p\u0103m de intermediari | ProHoster","description":"\u00cen acest articol, v\u0103 voi vorbi despre DAG (Grafic Ayclic Dirijat) \u0219i aplica\u021biile acestuia \u00een registrele distribuite, \u0219i vom compara asta cu blockchain-ul.","canonical_url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/ot-blokchejna-k-dag-izbavlyaemsya-ot-posrednikov","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\u041e\u0442 \u0431\u043b\u043e\u043a\u0447\u0435\u0439\u043d\u0430 \u043a DAG: \u0438\u0437\u0431\u0430\u0432\u043b\u044f\u0435\u043c\u0441\u044f \u043e\u0442 \u043f\u043e\u0441\u0440\u0435\u0434\u043d\u0438\u043a\u043e\u0432 | ProHoster","og:description":"\u0412 \u044d\u0442\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u044f \u0440\u0430\u0441\u0441\u043a\u0430\u0436\u0443 \u0432\u0430\u043c \u043e DAG (Directed Acyclic Graph, \u043d\u0430\u043f\u0440\u0430\u0432\u043b\u0435\u043d\u043d\u044b\u0439 \u0430\u0446\u0438\u043a\u043b\u0438\u0447\u0435\u0441\u043a\u0438\u0439 \u0433\u0440\u0430\u0444) \u0438 \u0435\u0433\u043e \u043f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u0438 \u0432 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0451\u043d\u043d\u044b\u0445 \u0440\u0435\u0435\u0441\u0442\u0440\u0430\u0445, \u0438 \u043c\u044b \u0441\u0440\u0430\u0432\u043d\u0438\u043c \u0435\u0433\u043e \u0441 \u0431\u043b\u043e\u043a\u0447\u0435\u0439\u043d\u043e\u043c.","og:url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/ot-blokchejna-k-dag-izbavlyaemsya-ot-posrednikov","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-11-24T21:00:00+00:00","article:modified_time":"2026-02-15T17:54:48+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"53183","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-02-15 17:55:40","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 20:29:27","updated":"2026-02-15 17:55:40","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\/53183","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=53183"}],"version-history":[{"count":1,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/53183\/revisions"}],"predecessor-version":[{"id":161174,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/53183\/revisions\/161174"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media?parent=53183"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/categories?post=53183"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/tags?post=53183"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}