Tsarin Yarjejeniya Mai Dogaro da Silsilai Biyu don Tsarin Blockchain

Teburin Abubuwan Ciki

1. Gabatarwa

Fasahar Blockchain ta fito a matsayin fasahar lissafin rarraba mai canzawa wacce ke da halayen rarraba iko, babban tsaro, da kuma ingantaccen bin diddigin bayanai. Tare da aikace-aikacen da suka haɗa da kuɗi, kiwon lafiya, noma, da tsaron bayanai, ana ƙara gane blockchain a matsayin muhimmin abin more rayuwa don sabbin fasahohi kamar metaverse. Tsarin yarjejeniya yana aiki azaman tushen tushen tsarin blockchain, yana ba wa mahalarta damar cimma yarjejeniya ba tare da babban iko ba.

Halin yarjejeniya na yanzu don tsarin blockchain "marasa tsabar kudi", musamman waɗanda suka dogara da Tabbacin Gudunmawa da Tabbacin Aiki (PoC+PoW), suna fuskantar manyan kalubale ciki har da ƙarancin inganci, rashin isasshen aminci da tsaro, da kuma yawan amfani da ƙarfin lissafi. Waɗannan iyakokin suna kawo cikas ga aiwatar da blockchain a cikin yanayi mara ƙarfi.

2. Ayyukan da suka danganci

Tsarukan yarjejeniya na blockchain na gargajiya sun haɗa da Tabbacin Aiki (PoW), Tabbacin Hannun jari (PoS), da Haƙƙin Haƙuri na Byzantine na Aiki (PBFT). Yayin da PoW ke ba da ingantaccen tsaro ta hanyar aikin lissafi, yana fama da yawan amfani da makamashi. PoW yana magance matsalolin makamashi amma yana iya haifar da ƙaddamarwa. PBFT yana ba da babban kwarara amma yana fuskantar matsalolin haɓakawa tare da ƙara adadin nodes.

An ƙera tsarin haɗin gwiwar PoC+PoW musamman don yanayin blockchain marasa tsabar kudi, yana haɗa tabbacin tushen gudunmawa da tabbacin lissafi. Duk da haka, wannan hanyar har yanzu ta gaji iyakoki da yawa na ka'idojinta, musamman dangane da inganci da amfani da albarkatun.

3. Tsarin CON_DC_PBFT

3.1 Tsarin Silsila Biyu

Tsarin CON_DC_PBFT ya gabatar da sabon tsarin gine-gine na silsila biyu wanda ya ƙunshi:

• Silsilar Kasuwanci: Tana sarrafa bayanan ciniki na farko da ayyuka na musamman
• Silsilar Tsarin: Tana sarrafa ƙimar gudunmawa, darajar node, da metadata na tsarin

Wannan rabuwa yana ba da damar sarrafa layi ɗaya inda ayyukan yarjejeniya zasu iya faruwa a lokaci ɗaya akan silsilolin biyu, yana inganta babban kwararar tsarin sosai. Silsilolin biyu suna aiki ta hanyar zaman kansu, tare da silsilar tsarin da ke kulawa da daidaita kwararar saƙon yarjejeniya na silsilar kasuwanci.

3.2 Ƙirar Yarjejeniya

Yarjejeniyar ta haɗu da gyare-gyaren PBFT tare da zaɓin node na tushen gudunmawa. Silsilar tsarin ta keɓance nodes ɗin lissafin silsilar kasuwanci bisa ƙimar gudunmawa, yana hana tsinkayar alamu waɗanda masu mugunta zasu iya amfani da su. Tsarin sadarwa na Byzantine yana tabbatar da ingancin saƙo kuma yana hana wuraren gazawa guda ɗaya.

4. Aiwatar da Fasaha

4.1 Tushen Lissafi

Yiwuwar zaɓin node yana bin rarraba nauyin gudunmawa:

$P_i = \frac{C_i^\alpha}{\sum_{j=1}^N C_j^\alpha}$

inda $P_i$ ke wakiltar yuwuwar zaɓi don node $i$, $C_i$ yana nuna ƙimar gudunmawar node $i$, $N$ shine jimillar adadin nodes, kuma $\alpha$ siga ce da ke sarrafa tasirin ƙimar gudunmawa.

An ƙirƙira ingancin yarjejeniya kamar haka:

$E = \frac{T_{parallel}}{T_{sequential}} = \frac{1}{1 - \rho + \frac{\rho}{k}}$

inda $\rho$ ke wakiltar rabon layi ɗaya kuma $k$ shine saurin haɓaka don sarrafa layi ɗaya.

4.2 Algorithm ɗin Zaɓin Node

function selectAccountingNode(contributionMap, currentBlock) {
    let totalWeight = 0;
    let cumulativeWeights = [];
    
    // Lissafa jimillar ma'auni bisa ƙimar gudunmawa
    for (let i = 0; i < contributionMap.length; i++) {
        totalWeight += Math.pow(contributionMap[i].value, ALPHA);
        cumulativeWeights.push(totalWeight);
    }
    
    // Ƙirƙiri zaɓin bazuwar
    const randomValue = Math.random() * totalWeight;
    
    // Zaɓi node bisa yuwuwar nauyi
    for (let i = 0; i < cumulativeWeights.length; i++) {
        if (randomValue <= cumulativeWeights[i]) {
            return contributionMap[i].nodeId;
        }
    }
    
    return contributionMap[0].nodeId; // Komawa baya
}

5. Sakamakon Gwaji

Cikakken bincike na gwaji ya kimami tasirin sigogi daban-daban akan aikin tsarin yarjejeniya:

• Yuwuwar Zaɓin Block: CON_DC_PBFT ya nuna madaidaicin rarrabuwa idan aka kwatanta da PoC+PoW
• Ƙimar Gazawar Maki ɗaya: An rage da kashi 45% ta hanyoyin sadarwa na Byzantine
• Ƙimar Node Count: Ya ci gaba da ingantaccen aiki tare da ƙara lambobin node
• Ƙimar Watsa Block: An sami ingantaccen kashi 35% a cikin kwarara
• Amfani da CPU: An rage da kashi 40% idan aka kwatanta da PoC+PoW

Sakamakon ya nuna cewa CON_DC_PBFT yana adana fiye da kashi 50% na albarkatun ƙwaƙwalwa da ma'ajiya idan aka kwatanta da PoC+PoW, yayin da yake inganta jimillar jinkirin yarjejeniya da fiye da kashi 30%.

6. Bincike da Tattaunawa

Tsarin CON_DC_PBFT yana wakiltar ci gaba mai mahimmanci a cikin ƙirar yarjejeniya na blockchain don aikace-aikacen marasa tsabar kudi. Ta hanyar raba metadata na tsarin daga ma'amalar kasuwanci ta hanyar tsarin silsila biyu, yarjejeniyar ta sami ingantacciyar ci gaba a cikin inganci da tsaro. Zaɓin node na bazuwar dangane da ƙimar gudunmawa, yayin da yake kiyaye amincin samfurin haƙurin kuskure na Byzantine, yana magance muhimman raunuka a cikin hanyoyin da suka wanzu.

Wannan bincike ya yi daidai da manyan trends a cikin ingantaccen blockchain, kama da sabbin abubuwan gine-gine da ake gani a cikin aiwatar da sharding kamar waɗanda Ethereum 2.0 [Buterin, 2020] suka gabatar. Ƙarfin sarrafa layi ɗaya yana maimaita ka'idojin da ake samu a cikin wallafe-wallafen tsarin rarraba [Coulouris et al., 2011], inda rabuwa da damuwa sau da yawa ke haifar da ribar aiki.

Idan aka kwatanta da aiwatar da PBFT na gargajiya, waɗanda ke fuskantar iyakokin haɓakawa kamar yadda aka rubuta a cikin asalin bayanin yarjejeniya [Castro da Liskov, 1999], hanyar CON_DC_PBFT ta silsila biyu tana rarraba aikin yarjejeniya yadda ya kamata. Zaɓin node na tushen gudunmawa yana gabatar da wani ɓangare na rashin tsinkaya wanda ke haɓaka tsaro akan hare-haren da aka yi niyya, wata damuwa da aka haskaka a cikin binciken tsaron blockchain na baya-bayan nan [Gervais et al., 2016].

Sakamakon gwaji ya nuna cewa fa'idodin ka'idar tsarin silsila biyu suna fassara zuwa ingantaccen aiki na aiki. Rage kashi 30% na jinkirin yarjejeniya da tanadin albarkatu na kashi 50% sun sanya CON_DC_PBFT a matsayin mafita mai yuwuwa don aikin blockchain na kamfani inda inganci da matsalolin albarkatu suke da mahimmanci.

7. Aikace-aikace na Gaba

Tsarin CON_DC_PBFT yana nuna alama ta musamman a cikin yankuna masu tasowa da yawa:

• Gudanar da Sarkar Wadata: Ingantaccen bin diddigin bayanai tare da ingantaccen inganci don rikitarwar ma'amaloli na ɓangarori da yawa
• Musayar Bayanan Kula da Lafiya: Raba bayanan marasa lafiya cikin aminci tare da rage nauyin lissafi
• Cibiyoyin Sadarwar IoT: Yanayin ƙarancin albarkatu yana amfana daga rage buƙatun ƙwaƙwalwa da ma'ajiya
• Tsarin Shaidar Dijital: Tabbacin ainihi mai iya aiki tare da kiyaye garanti na tsaro
• Abin More Rayuwa na Metaverse: Taimakawa manyan buƙatun kwarara na ma'amalolin duniyar zamani

Hanyoyin bincike na gaba sun haɗa da bincika algorithms ɗin ƙimar gudunmawa, hanyoyin haɗin kai na silsila, da haɗin kai tare da shaidar sani mara sani don ingantaccen sirri.

8. Bayanan da aka ambata

1. Buterin, V. (2020). Ethereum 2.0 Specifications. Ethereum Foundation.
2. Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance. OSDI.
3. Coulouris, G., Dollimore, J., Kindberg, T., & Blair, G. (2011). Distributed Systems: Concepts and Design. Pearson Education.
4. Gervais, A., Karame, G. O., Wüst, K., Glykantzis, V., Ritzdorf, H., & Capkun, S. (2016). On the Security and Performance of Proof of Work Blockchains. CCS.
5. Zhu, Y., et al. (2020). CycleGAN: Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks. ICCV.
6. Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System.
7. Wood, G. (2014). Ethereum: A Secure Decentralised Generalised Transaction Ledger.