<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">kaz44</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Университета Шакарима. Серия технические науки</journal-title><trans-title-group xml:lang="en"><trans-title>Bulletin of Shakarim University. Technical Sciences</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2788-7995</issn><issn pub-type="epub">3006-0524</issn><publisher><publisher-name>«Шәкәрім университеті» КеАҚ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.53360/2788-7995-2024-4(16)-9</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz44-1505</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>АВТОМАТИЗАЦИЯ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ (ОРИГИНАЛЬНАЯ СТАТЬЯ)</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>AUTOMATION AND INFORMATION TECHNOLOGY (ORIGINAL ARTICLE)</subject></subj-group></article-categories><title-group><article-title>МНОГОМЕРНЫЙ БЛОКЧЕЙН И ЕГО ПРЕИМУЩЕСТВА</article-title><trans-title-group xml:lang="en"><trans-title>MULTIDIMENSIONAL BLOCKCHAIN AND ITS ADVANTAGES</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0000-9109-533X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Каратаев</surname><given-names>Д. К.</given-names></name><name name-style="western" xml:lang="en"><surname>Karataev</surname><given-names>D. K.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Даниял Каратаев – магистрант кафедры информационной безопасности</p><p>10000, Республика Казахстан, г. Астана, ул. Сатбаева, 2 </p></bio><bio xml:lang="en"><p>Daniyal Karataev – master's student of the Department of Information Security </p><p>10000, Republic of Kazakhstan, Astana, 2 Satbaev st. </p></bio><email xlink:type="simple">dkarataev2000@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Абдураимова</surname><given-names>Б. К.</given-names></name><name name-style="western" xml:lang="en"><surname>Abduraimova</surname><given-names>B. K.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Баян Абдураимова – научный руководитель, кандидат технических наук, доцент </p><p>10000, Республика Казахстан, г. Астана, ул. Сатбаева, 2 </p></bio><bio xml:lang="en"><p>Bayan Abduraimova – scientific adviser, Candidate of Technical Sciences, Associate Professor </p><p>10000, Republic of Kazakhstan, Astana, 2 Satbaev st. </p></bio><email xlink:type="simple">bayan77740@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Евразийский национальный университет им. Л.Н. Гумилева<country>Казахстан</country></aff><aff xml:lang="en">L.N. Gumilyov Eurasian National University<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>27</day><month>12</month><year>2024</year></pub-date><volume>1</volume><issue>4(16)</issue><fpage>66</fpage><lpage>72</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Каратаев Д.К., Абдураимова Б.К., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Каратаев Д.К., Абдураимова Б.К.</copyright-holder><copyright-holder xml:lang="en">Karataev D.K., Abduraimova B.K.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://tech.vestnik.shakarim.kz/jour/article/view/1505">https://tech.vestnik.shakarim.kz/jour/article/view/1505</self-uri><abstract><p>Многомерный блокчейн – это революционное развитие традиционной технологии блокчейн, предлагающее динамичную и эффективную архитектуру для хранения и обработки данных. Эта уникальная структура повышает масштабируемость за счет распределения транзакционной нагрузки по различным цепочкам, значительно повышая скорость обработки и сокращая время ожидания. Благодаря таким параллельным цепочкам риск возникновения узких мест сводится к минимуму, что позволяет значительно повысить пропускную способность и оптимизировать поток данных. Кроме того, многомерные блокчейны обеспечивают более высокий уровень безопасности, изолируя данные в определенных цепочках, что затрудняет злоумышленникам доступ ко всей сети или вмешательство в нее. Эта архитектура также помогает снизить энергопотребление, позволяя распределять ресурсы в зависимости от спроса, в отличие от традиционных блокчейнов, которые требуют высокой энергоемкости для каждой транзакции. Многомерные блокчейны могут быть адаптированы к различным бизнес-моделям, от финансов и логистики до здравоохранения, и легко адаптироваться к отраслям.</p></abstract><trans-abstract xml:lang="en"><p>The multidimensional blockchain is a revolutionary evolution of traditional blockchain technology, offering a dynamic and efficient architecture for data storage and processing. This unique structure enhances scalability by distributing transaction loads across various chains, significantly improving processing speed and reducing latency. With these parallel chains, the risk of bottlenecks is minimized, allowing for much higher throughput and optimized data flow. Additionally, multidimensional blockchains offer stronger security by isolating data within specific chains, making it harder for malicious actors to access or tamper with the entire network. This architecture also helps reduce energy consumption by allowing resource allocation based on demand, unlike traditional blockchains that require high energy output for each transaction. Multidimensional blockchains can be customized to suit diverse business models, from finance and logistics to healthcare, adapting seamlessly to sector-specific needs. In summary, multidimensional blockchains present an adaptable, energy-efficient, and highly scalable solution that improves transaction speeds, security, and data management capabilities across industries.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>многомерный блокчейн</kwd><kwd>параллельные цепочки</kwd><kwd>масштабируемость</kwd><kwd>безопасность данных</kwd><kwd>пропускная способность</kwd><kwd>оптимизация транзакций</kwd><kwd>энергоэффективность</kwd><kwd>бизнес-модели</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Industry adaptability</kwd><kwd>business models</kwd><kwd>cross-chain security</kwd><kwd>enhanced scalability</kwd><kwd>multidimensional blockchain</kwd><kwd>bandwidth</kwd><kwd>transaction optimization</kwd><kwd>energy efficiency</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Obzor yazykov dlya bezopasnogo programmirovaniya smart-kontraktov / A.V. Tyurin i dr. // Trudy Instituta sistemnogo programmirovaniya RAN. – 2019. – Tom 31, № 3. – S. 157-176. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Obzor yazykov dlya bezopasnogo programmirovaniya smart-kontraktov / A.V. Tyurin i dr. // Trudy Instituta sistemnogo programmirovaniya RAN. – 2019. – Tom 31, № 3. – S. 157-176. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Skovikov A.G. Blockchain technology and decentralized applications / A.G. Skovikov, N.A. Skovikov // Russian economy: a look into the future: Materials of the VI International Scientific and Practical Conference (full-time), Tambov, February 20, 2020 / Editor Ya.Yu. Radyukova. Tambov: Tambov State University named after G.R. Derzhavin, 2020. – Р. 157-162. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Skovikov A.G. Blockchain technology and decentralized applications / A.G. Skovikov, N.A. Skovikov // Russian economy: a look into the future: Materials of the VI International Scientific and Practical Conference (full-time), Tambov, February 20, 2020 / Editor Ya.Yu. Radyukova. Tambov: Tambov State University named after G.R. Derzhavin, 2020. – Р. 157-162. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Belyajkin N.A. Fundamental'naya transformaciya ekonomiki v usloviyah integracii blokchejna / N.A. Belyajkin // Hronoekonomika. – 2024. – № 1(43). – S. 6-12. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Belyajkin N.A. Fundamental'naya transformaciya ekonomiki v usloviyah integracii blokchejna / N.A. Belyajkin // Hronoekonomika. – 2024. – № 1(43). – S. 6-12. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Bondarenko A.S. Analiz i ocenka uyazvimosti informacii v kreditnyh organizaciyah / A.S. Bondarenko, P.K. YArygin, M.A. Turilov // Mezhdunarodnyj zhurnal gumanitarnyh i estestvennyh nauk. – 2019. – № 6-2. – S. 151-157 (In Russian).</mixed-citation><mixed-citation xml:lang="en">Bondarenko A.S. Analiz i ocenka uyazvimosti informacii v kreditnyh organizaciyah / A.S. Bondarenko, P.K. YArygin, M.A. Turilov // Mezhdunarodnyj zhurnal gumanitarnyh i estestvennyh nauk. – 2019. – № 6-2. – S. 151-157 (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Yakovleva A.V. Sushchestvuet li balans normativno-pravovyh polozhenij v oblasti zashchity personal'nyh dannyh i blokchejn tekhnologii? (na primere analiza Zakona o zashchite personal'noj informacii Kitajskoj Narodnoj Respubliki) / A.V. Yakovleva // Problemy ekonomiki i yuridicheskoj praktiki. – 2023. – T. 19, № 4. – S. 14-22. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Yakovleva A.V. Sushchestvuet li balans normativno-pravovyh polozhenij v oblasti zashchity personal'nyh dannyh i blokchejn tekhnologii? (na primere analiza Zakona o zashchite personal'noj informacii Kitajskoj Narodnoj Respubliki) / A.V. Yakovleva // Problemy ekonomiki i yuridicheskoj praktiki. – 2023. – T. 19, № 4. – S. 14-22. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Kiajyas A. Uroboros: Dokazuemo bezopasnyj blokchejn-protokol proof-of-stake / A. Kiajyas, A. Rassel, B. Devid, R. Olejnikov // Konspekty lekcij po informatike. – 2017. – Tom 10401. – S. 357-388. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Kiajyas A. Uroboros: Dokazuemo bezopasnyj blokchejn-protokol proof-of-stake / A. Kiajyas, A. Rassel, B. Devid, R. Olejnikov // Konspekty lekcij po informatike. – 2017. – Tom 10401. – S. 357-388. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Multidimensional control points for preventing long-range attacks in proof-of-stake blockchains / I. A.I. Almallokhi et al. // Series of materials of the ACM International Conference: 3, Xi'an, March 08-10, 2019. – Xi'an, 2019. – P. 118-122. (In English).</mixed-citation><mixed-citation xml:lang="en">Multidimensional control points for preventing long-range attacks in proof-of-stake blockchains / I. A.I. Almallokhi et al. // Series of materials of the ACM International Conference: 3, Xi'an, March 08-10, 2019. – Xi'an, 2019. – P. 118-122. (In English).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Sabinin, O.Y. Constructing a composition of consensus algorithms of the Federated Byzantine Agreement and Proof of Stake / O.Y. Sabinin, M.V. Toporov // Theoretical and Applied Science. – 2019. – № 5(73). – P. 335-343. (In English).</mixed-citation><mixed-citation xml:lang="en">Sabinin, O.Y. Constructing a composition of consensus algorithms of the Federated Byzantine Agreement and Proof of Stake / O.Y. Sabinin, M.V. Toporov // Theoretical and Applied Science. – 2019. – № 5(73). – P. 335-343. (In English).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Gazi P. Sidechains with bid confirmation / P. Gazi, A. Kiayas, D. Zindros // IEEE Symposium on Security and Privacy (SP) 2019. – Vol. 1. – P. 677-694. (In English).</mixed-citation><mixed-citation xml:lang="en">Gazi P. Sidechains with bid confirmation / P. Gazi, A. Kiayas, D. Zindros // IEEE Symposium on Security and Privacy (SP) 2019. – Vol. 1. – P. 677-694. (In English).</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Garai J. Bitcoin backbone protocol with chains of variable complexity / J. Garai, A. Kiayas, N. Leonardos // Achievements of cryptography – CRYPTI 2017. Lecture notes on computer science. (In English).</mixed-citation><mixed-citation xml:lang="en">Garai J. Bitcoin backbone protocol with chains of variable complexity / J. Garai, A. Kiayas, N. Leonardos // Achievements of cryptography – CRYPTI 2017. Lecture notes on computer science. (In English).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
