{"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\/cs\/blog\/administrirovanie\/konsensus-na-reputatsii-nody-nuzhen-li","title":{"rendered":"Konsensus na reputaci uzlu. Pot\u0159ebujeme ho?","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

V\u00edm, v\u00edm. Krypto projekt\u016f je spousta, existuje cel\u00e1 \u0159ada konsens\u016f: na z\u00e1klad\u011b pr\u00e1ce a vlastnictv\u00ed, zlata, ropy, upe\u010den\u00fdch kol\u00e1\u010dk\u016f (takov\u00e9 v\u011bci tak\u00e9 existuj\u00ed, ano, ano). Co n\u00e1m p\u0159inese dal\u0161\u00ed? To chci prodiskutovat po p\u0159e\u010dten\u00ed p\u0159ekladu \u201ezjednodu\u0161en\u00e9\u201c technick\u00e9 dokumentace projektu *Souhv\u011bzd\u00ed (Souhv\u011bzd\u00ed<\/a><\/noindex>). Samoz\u0159ejm\u011b to nen\u00ed \u00fapln\u00fd popis algoritmu, ale zaj\u00edm\u00e1 m\u011b n\u00e1zor komunity Habr, zda takov\u00fd konsensus m\u00e1 smysl, nebo je zbyte\u010dn\u00fd?<\/p>\n

<\/p>\n

Dal\u0161\u00edch p\u00edsmen nen\u00ed moc, tak\u017ee pokud se v\u00e1m prost\u011b chce napsat \u201efuj, kolik lze o kryptu mluvit\u201c, pros\u00edm, zdr\u017ete se. Pokud v\u00e1s zaj\u00edmaj\u00ed nov\u00e9 v\u00fdvoje v oblasti distribuovan\u00fdch syst\u00e9m\u016f a m\u00e1te, co sd\u00edlet v koment\u00e1\u0159\u00edch, pros\u00edm, pokra\u010dujte n\u00ed\u017ee.<\/p>\n

<\/p>\n

P.S. Nejsem autor technologie, za pln\u00e9 pochopen\u00ed podstaty nemohu ru\u010dit, budu tedy r\u00e1d za koment\u00e1\u0159e s opravami, pokud n\u011bjak\u00e9 budou.<\/em><\/p>\n

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

Evoluce od synchronn\u00edch konsens\u016f k asynchronn\u00edm<\/h3>\n

<\/p>\n

Uzly jsou vyb\u00edr\u00e1ny pomoc\u00ed deterministick\u00e9ho procesu (toho sam\u00e9ho, kter\u00fd se pou\u017e\u00edv\u00e1 v DHT, nap\u0159\u00edklad bittorrent), kter\u00fd dynamicky reguluje povinnosti uzl\u016f pro \"usnadn\u011bn\u00ed\" validace, nebo jinak \u0159e\u010deno, pro dosa\u017een\u00ed konsensu. Vyb\u00edr\u00e1me skupiny z 3 uzl\u016f a prov\u00e1d\u00edme kola konsensu paraleln\u011b, aby jeden uzel mohl b\u00fdt facilit\u00e1torem v n\u011bkolika bloc\u00edch. To n\u00e1m umo\u017e\u0148uje zpracov\u00e1vat transakce asynchronn\u011b, co\u017e v podstat\u011b znamen\u00e1, \u017ee se formuj\u00ed n\u011bkolik blockchain\u016f z\u00e1rove\u0148. Proces je podobn\u00fd pavu\u010din\u011b vytvo\u0159en\u00e9 mnoha vl\u00e1kny, na rozd\u00edl od uzl\u016f, kter\u00e9 vytv\u00e1\u0159ej\u00ed jednu \u0159et\u011bzovou formu b\u011bhem \u010dasu. Asynchronn\u00ed nebo paraleln\u00ed zpracov\u00e1n\u00ed je z\u00e1kladn\u00edm kamenem \u0161k\u00e1lovateln\u00e9ho programov\u00e1n\u00ed, nebo\u0165 umo\u017e\u0148uje vyu\u017e\u00edt v\u0161echny zdroje po\u010d\u00edta\u010de a zrychlit celkov\u00e1 v\u00fdpo\u010dty. Tato s\u00ed\u0165 se naz\u00fdv\u00e1 orientovan\u00fd acyklick\u00fd graf nebo DAG v po\u010d\u00edta\u010dov\u00fdch v\u011bd\u00e1ch.<\/p>\n

<\/p>\n

\"Konsensus
\n\u0160\u00ed\u0159ka kan\u00e1lu line\u00e1rn\u00edho blockchainu versus multiplika\u010dn\u00ed efekt DAG, kde m\u00e1me n\u011bkolik paraleln\u00edch blockchain\u016f. <\/em><\/p>\n

<\/p>\n

\"Konsensus
\nGeometrick\u00e1 realizace line\u00e1rn\u00edho blockchainu versus DAG. \u010cern\u00e9 te\u010dky jsou bloky, b\u00edl\u00e9 te\u010dky jsou uzly.<\/em><\/p>\n

<\/p>\n

Pou\u017e\u00edv\u00e1me 3 uzly v ka\u017ed\u00e9m kole konsensu, proto\u017ee to n\u00e1m poskytuje zaj\u00edmav\u00e9 matematick\u00e9 procesy pro \u00favahy o stavu, vytv\u00e1\u0159ej\u00edc\u00ed \"rovinu povrchu\" nap\u0159\u00ed\u010d daty ve form\u011b troj\u00faheln\u00edk\u016f se vazbami. Protokol pot\u00e9 pou\u017e\u00edv\u00e1 troj\u00faheln\u00edky k \"se\u0161\u00edv\u00e1n\u00ed\" optim\u00e1ln\u00edho povrchu, kter\u00fd neobsahuje nadbyte\u010dn\u00e1 nebo protich\u016fdn\u00e1 data a m\u00e1 minim\u00e1ln\u00ed mo\u017en\u00e9 troj\u00faheln\u00edky. Algoritmicky to odpov\u00edd\u00e1 \"minim\u00e1ln\u00edmu \u0159ezu\" grafu a matematicky je to derivace nebo optimaliza\u010dn\u00ed funkce (z n\u00ed\u017e funkce nach\u00e1z\u00ed nejkrat\u0161\u00ed cestu, kterou m\u016f\u017ee p\u0159e-cross p\u0159es povrch). Tato nejkrat\u0161\u00ed cesta je ekvivalentn\u00ed optim\u00e1ln\u00edmu ukl\u00e1d\u00e1n\u00ed dat (transakc\u00ed) ve skupin\u011b zajistit datov\u00e9 dostupnosti. Konfliktn\u00ed troj\u00faheln\u00edkov\u00e9 \"dla\u017edice\" zaji\u0161\u0165uj\u00ed, \u017ee povrch ud\u00e1losti je hladk\u00fd a bez konflikt\u016f.<\/p>\n

<\/p>\n

\"Konsensus
\nGeometrick\u00e1 realizace detekce \/ zpracov\u00e1n\u00ed konflikt\u016f. Konfliktn\u00ed blok vytv\u00e1\u0159\u00ed dal\u0161\u00ed dla\u017edici povrchu. Odstra\u0148ujeme dla\u017edici dodate\u010dn\u00e9ho povrchu, abychom udr\u017eeli ploch\u00fd (= bezkonfliktn\u00ed) povrch ud\u00e1lost\u00ed. <\/em><\/p>\n

<\/p>\n

Konsensus zalo\u017een\u00fd na reputaci<\/h3>\n

<\/p>\n

V optim\u00e1ln\u00edm decentralizovan\u00e9m p2p syst\u00e9mu reputace by ka\u017ed\u00fd uzel m\u011bl m\u00edt mo\u017enost samostatn\u011b posoudit svou d\u016fv\u011bru k ostatn\u00edm uzl\u016fm. N\u00e1\u0161 syst\u00e9m pou\u017e\u00edv\u00e1 speci\u00e1ln\u00ed model, kter\u00fd zahrnuje tranzitivn\u00ed vztahy nebo vztahy, kter\u00e9 m\u00e1 uzel s jin\u00fdmi uzly, p\u0159i p\u0159i\u0159azen\u00ed glob\u00e1ln\u00edho hodnocen\u00ed. \"Jste tak dob\u0159\u00ed, jak\u00e1 je va\u0161e spole\u010dnost.\" Kone\u010dn\u00fdm v\u00fdsledkem je \"zkreslen\u00ed\" nebo gradient vych\u00e1zej\u00edc\u00ed z tranzitivn\u00ed d\u016fv\u011bry nebo reputace ve v\u0161ech uzlech v $DAG nebo standardn\u00edm kan\u00e1lu. To lze pova\u017eovat za struhadlo nebo bruskou na s\u00fdr, kter\u00e9 set\u00ed povrch \"roviny povrchu\" a vyb\u00edr\u00e1, kter\u00e9 \"troj\u00faheln\u00edkov\u00e9 dla\u017edice\" set\u0159\u00edt a kter\u00e9 nechat. Takto logika konfliktu ve skute\u010dnosti odstra\u0148uje \"troj\u00faheln\u00edkov\u00e9 dla\u017edice\".<\/p>\n

<\/p>\n

\"Konsensus
\nDAG s konfliktn\u00ed dla\u017edic\u00ed proch\u00e1zej\u00edc\u00ed \"zkreslen\u00fdm\" prostorem, kter\u00fd je gradientem podobn\u00fdm struhadlu na s\u00fdr, a p\u0159ipravuje se na odstran\u011bn\u00ed nebo \"set\u0159en\u00ed\" konfliktn\u00ed dla\u017edice.<\/em><\/p>\n

<\/p>\n

\u010c\u00e1ste\u010dn\u00e9 \/ \u00fapln\u00e9 \u0161k\u00e1lov\u00e1n\u00ed uzlu<\/h3>\n

<\/p>\n

V teorii s\u00edt\u00ed je optim\u00e1ln\u00ed rozlo\u017een\u00ed obvykle ozna\u010dov\u00e1no jako \u201ebez \u0161k\u00e1lov\u00e1n\u00ed\u201c, co\u017e lze popsat jako hierarchick\u00e9 uspo\u0159\u00e1d\u00e1n\u00ed s velk\u00fdmi centr\u00e1ln\u00edmi uzly, kter\u00e9 spravuj\u00ed mnoh\u00e9 men\u0161\u00ed perifern\u00ed uzly. Toto rozlo\u017een\u00ed je viditeln\u00e9 v p\u0159\u00edrod\u011b a p\u0159edev\u0161\u00edm na internetu. Constellation pou\u017e\u00edv\u00e1 tuto architekturu pro \u201e\u0161k\u00e1lov\u00e1n\u00ed\u201c, neboli zvy\u0161ov\u00e1n\u00ed propustnosti nebo \u0161\u00ed\u0159ky na\u0161eho Grafu.<\/p>\n

<\/p>\n

\"Konsensus
\nEfekt hierarchick\u00e9ho d\u011blen\u00ed. M\u016f\u017eeme p\u0159idat v\u00edce uzl\u016f, \u010d\u00edm\u017e zv\u00fd\u0161\u00edme \u0161\u00ed\u0159ku propustnosti.<\/em><\/p>\n

<\/p>\n

Hylochain \u2014 Podpora aplikac\u00ed zalo\u017een\u00fdch na kan\u00e1lech.<\/h3>\n

<\/p>\n

N\u00e1\u0161 p\u0159\u00edstup k podpo\u0159e aplikac\u00ed lze pova\u017eovat za \u201edecentralizovanou platformu chytr\u00fdch smluv\u201c. M\u00edsto centr\u00e1ln\u00ed s\u00edt\u011b, kter\u00e1 vykon\u00e1v\u00e1 ve\u0161kerou logiku a zpracov\u00e1v\u00e1 v\u0161echna data z aplikace, Constellation koordinuje data aplikace pomoc\u00ed \u201est\u00e1tn\u00edch kan\u00e1l\u016f\u201c, kter\u00e9 lze pova\u017eovat za televizn\u00ed stanici, vys\u00edlaj\u00edc\u00ed v\u0161echna data ze st\u00e1tn\u00edho syst\u00e9mu. Ka\u017ed\u00fd st\u00e1tn\u00ed kan\u00e1l m\u016f\u017ee implementovat svou vlastn\u00ed logiku ov\u011b\u0159ov\u00e1n\u00ed, co\u017e umo\u017e\u0148uje \u0159e\u0161it probl\u00e9m oracle skrze d\u016fkladnou verifikaci v\u00fdrobc\u016f dat a tranzitivn\u00ed ov\u011b\u0159ov\u00e1n\u00ed slo\u017een\u00fdch st\u00e1tn\u00edch syst\u00e9m\u016f. S\u00edt\u011b st\u00e1tn\u00edch kan\u00e1l\u016f poskytuj\u00ed paraleln\u00ed podporu aplikac\u00ed, \u010d\u00edm\u017e urychluj\u00ed \u010das akceptace, kter\u00fd je v s\u00edti chytr\u00fdch smluv omezen tradi\u010dn\u00edm synchronn\u00edm konsensem.<\/p>\n

<\/p>\n

\"Konsensus
\nDva st\u00e1tn\u00ed kan\u00e1ly, kter\u00e9 jsou \u201ekompatibiln\u00ed\u201c p\u0159es s\u00ed\u0165 $DAG. Mohou interagovat nebo b\u00fdt interpretov\u00e1ny, nebo\u0165 oba jsou \u201eintegrovan\u00e9\u201c s $DAG prost\u0159ednictv\u00edm nasazen\u00ed hybridn\u00edch uzl\u016f $DAG + Kan\u00e1l.<\/em><\/p>\n

<\/p>\n

D\u016fvod, pro\u010d se to naz\u00fdv\u00e1 Hylochain, spo\u010d\u00edv\u00e1 v tom, \u017ee v na\u0161em p\u0159\u00edstupu k podpo\u0159e aplikac\u00ed byla pou\u017eita funk\u010dn\u00ed model programov\u00e1n\u00ed Recursion Schemes pro vytvo\u0159en\u00ed rozhran\u00ed MapReduce. Zejm\u00e9na mohou b\u00fdt sch\u00e9mata rekursivn\u00edho Hylomorphismu a Metamorphismu integrov\u00e1na pro vytv\u00e1\u0159en\u00ed verifikovateln\u00fdch dotaz\u016f a streamov\u00fdch spojen\u00ed p\u0159es standardn\u00ed kan\u00e1ly t\u00edm, \u017ee se kontroluj\u00ed algebraick\u00e9 datov\u00e9 typy stejn\u011b jako se kontroluj\u00ed op-k\u00f3dy pro chytr\u00e9 kontrakty. Kone\u010dn\u00fdm v\u00fdsledkem je funk\u010dn\u00ed rozhran\u00ed MapReduce, kter\u00e9 je zn\u00e1mo datov\u00fdm in\u017een\u00fdr\u016fm a je kompatibiln\u00ed se st\u00e1vaj\u00edc\u00edmi technologiemi velk\u00fdch dat.<\/p>\n

<\/p>\n

\"Konsensus
\nHylomorfn\u00ed a metamorfn\u00ed standardn\u00ed kan\u00e1ly pro kontrast. Ve metamorfn\u00edm stavu jsou data z obou standardn\u00edch kan\u00e1l\u016f odes\u00edl\u00e1na do bloku v metakan\u00e1lu. V Hylu bereme p\u0159edchoz\u00ed stav kan\u00e1lu a pou\u017eijeme ho k dotazu (vlo\u017e\u00edme konkr\u00e9tn\u00ed ot\u00e1zku) na dal\u0161\u00ed dva kan\u00e1ly, a pot\u00e9 ukl\u00e1d\u00e1me v\u00fdsledek dotazu do bloku.<\/em><\/p>\n

<\/p>\n

Tokenomika a jej\u00ed spojen\u00ed s Hylochain<\/h3>\n

<\/p>\n

Kdy\u017e je standardn\u00ed kan\u00e1l vytvo\u0159en, m\u016f\u017ee b\u00fdt integrov\u00e1n do kan\u00e1lu $DAG, ale s pou\u017eit\u00edm rozhran\u00ed ACI neboli Application Chain Interface. Toto rozhran\u00ed je prost\u011b objekt JSON s informacemi o konfiguraci a ve\u0159ejn\u00fdm kl\u00ed\u010dem spojen\u00fdm s t\u00edmto kan\u00e1lem. D\u016fvod, pro\u010d spojujeme ve\u0159ejn\u00fd kl\u00ed\u010d se standardn\u00edm kan\u00e1lem, spo\u010d\u00edv\u00e1 v vytvo\u0159en\u00ed zprost\u0159edkovatelsk\u00e9ho mechanismu pro data standardn\u00edho kan\u00e1lu. Kdy\u017e je standardn\u00ed kan\u00e1l nasazen, v\u00fdvoj\u00e1\u0159i si sami nastavuj\u00ed, jak se platby z $DAG s\u00edt\u011b distribuuj\u00ed mezi uzly a oper\u00e1tory.<\/p>\n

<\/p>\n

\"Konsensus
\nTok pro n\u00e1kup p\u0159\u00edstupu k informac\u00edm nebo modifikaci informac\u00ed. Dotaz je sm\u011brov\u00e1n do $DAG, prost\u0159edky jsou zasl\u00e1ny na \u00fa\u010det kan\u00e1lu, v\u00fdsledek je zasl\u00e1n kupuj\u00edc\u00edmu a kontroln\u00ed sou\u010det transakce je zasl\u00e1n do s\u00edt\u011b $DAG, kter\u00e1 pak uvol\u0148uje prost\u0159edky pro standardn\u00ed kan\u00e1l.<\/em><\/p>\n

Zdroj: 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\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\udd47Konsensus na reputaci uzlu. Je pot\u0159eba?","description":"V\u00edm, v\u00edm. Kryptoprojekt\u016f je spousta, existuje spousta konsens\u016f: na z\u00e1klad\u011b pr\u00e1ce a vlastnictv\u00ed, zlata, ropy, pe\u010den\u00fdch kol\u00e1\u010dk\u016f (ano, i takov\u00e9 jsou). Co n\u00e1m je\u0161t\u011b zb\u00fdv\u00e1 od jednoho?","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/konsensus-na-reputatsii-nody-nuzhen-li","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"cs_CZ","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\/cs\/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\/cs\/wp-json\/wp\/v2\/posts\/36425","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/comments?post=36425"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/36425\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/27262"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=36425"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=36425"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=36425"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}