{"id":477433,"date":"2023-08-09T09:14:50","date_gmt":"2023-08-09T09:14:50","guid":{"rendered":""},"modified":"2023-09-05T11:14:42","modified_gmt":"2023-09-05T11:14:42","slug":"hashing","status":"publish","type":"wiki","link":"https:\/\/oneproxy.pro\/tr\/wiki\/hashing\/","title":{"rendered":"karma"},"content":{"rendered":"<p>Karma, bilgisayar biliminde veri y\u00f6netimi, bilgi g\u00fcvenli\u011fi ve a\u011f olu\u015fturma konular\u0131nda geni\u015f etkileri olan temel bir kavramd\u0131r. Geni\u015f bir veri yelpazesinin, bir hash fonksiyonu kullan\u0131larak sabit bir boyuta d\u00f6n\u00fc\u015ft\u00fcr\u00fclmesi ve bunun sonucunda benzersiz bir hash de\u011feri veya hash kodu elde edilmesi s\u00fcrecini ifade eder.<\/p>\n<h2>Hashing&#039;in K\u00f6kenleri ve \u0130lk Referanslar\u0131<\/h2>\n<p>Hashing&#039;in bir bilgisayar bilimi kavram\u0131 olarak k\u00f6keni 1950&#039;lere kadar uzan\u0131r. Karma i\u015flemine ili\u015fkin ilk \u00e7al\u0131\u015fma, 1953 y\u0131l\u0131nda Hans Peter Luhn taraf\u0131ndan bir IBM dergisinde yay\u0131mland\u0131. Onun &quot;Dijital Tekniklerle Veri Aramaya Y\u00f6nelik Bir \u0130\u015f Makinesi&quot; adl\u0131 makalesi, h\u0131zl\u0131 bilgi alma y\u00f6ntemi olarak karma kodlama fikrini ortaya att\u0131. Y\u0131llar ge\u00e7tik\u00e7e karma, veri al\u0131m\u0131n\u0131 ve g\u00fcvenli\u011fi optimize etmek i\u00e7in \u00e7e\u015fitli karma fonksiyonlar\u0131n\u0131n geli\u015ftirilmesi ve iyile\u015ftirilmesiyle \u00f6nemli ilerlemeler kaydetti.<\/p>\n<h2>Hashing&#039;i Derinlemesine Ke\u015ffetmek<\/h2>\n<p>Karma \u00f6z\u00fcnde verileri (metin, ikili dosya veya ba\u015fka herhangi bir bilgi t\u00fcr\u00fc) nispeten k\u0131sa, sabit boyutlu bir bayt dizisine d\u00f6n\u00fc\u015ft\u00fcrme y\u00f6ntemidir. &quot;Karma&quot; ad\u0131 verilen bu dize, karma i\u015flevi olarak bilinen matematiksel bir algoritma kullan\u0131larak t\u00fcretilir.<\/p>\n<p>Hash fonksiyonunun amac\u0131, bir girdi (veya &#039;mesaj&#039;) almak ve sabit boyutlu bir bayt dizisi d\u00f6nd\u00fcrmektir. \u00c7\u0131kt\u0131 ideal olarak tek y\u00f6nl\u00fc, deterministik ve tekd\u00fcze bir da\u011f\u0131l\u0131m sa\u011flamal\u0131d\u0131r. Yani, ayn\u0131 girdi her zaman ayn\u0131 hash&#039;i \u00fcretecektir, ancak girdinin \u00e7ok k\u00fc\u00e7\u00fck bir k\u0131sm\u0131n\u0131 de\u011fi\u015ftirmek bile tamamen farkl\u0131 bir hash \u00fcretecektir.<\/p>\n<p>Hashing, h\u0131zl\u0131 veri al\u0131m\u0131 i\u00e7in hash tablolar\u0131 ve veritabanlar\u0131 gibi veri yap\u0131lar\u0131nda ve ayr\u0131ca veri b\u00fct\u00fcnl\u00fc\u011f\u00fcn\u00fc ve gizlili\u011fini korumak i\u00e7in kriptografik i\u015flevlerde kullan\u0131l\u0131r.<\/p>\n<h2>Hashing&#039;in \u0130\u00e7 Yap\u0131s\u0131: Nas\u0131l \u00c7al\u0131\u015f\u0131r?<\/h2>\n<p>Karma mekanizmas\u0131, karma fonksiyonunun karma\u015f\u0131kl\u0131\u011f\u0131na ba\u011fl\u0131 olarak birka\u00e7 ad\u0131m i\u00e7erir:<\/p>\n<ol>\n<li>\n<p><strong>Giri\u015f Verileri<\/strong>: Hashing baz\u0131 giri\u015f verileriyle ba\u015flar. Bu, bir metin dizisinden ikili dosyaya kadar herhangi bir \u015fey olabilir.<\/p>\n<\/li>\n<li>\n<p><strong>\u00d6zet fonksiyonu<\/strong>: Giri\u015f verileri karma i\u015flevinden ge\u00e7irilir. Belirli algoritmaya ba\u011fl\u0131 olarak i\u015flev, verileri d\u00f6n\u00fc\u015ft\u00fcrmek i\u00e7in kayd\u0131rma, katlama veya modulo i\u015flemleri gibi \u00e7e\u015fitli i\u015flemleri ger\u00e7ekle\u015ftirebilir.<\/p>\n<\/li>\n<li>\n<p><strong>Hash De\u011feri<\/strong>: Karma i\u015flevi, giri\u015f verilerinin boyutundan ba\u011f\u0131ms\u0131z olarak sabit boyutlu bir karakter dizisinin \u00e7\u0131kt\u0131s\u0131n\u0131 verir. Bu karma de\u011feri veya karma kodudur.<\/p>\n<\/li>\n<li>\n<p><strong>\u00c7arp\u0131\u015fma \u0130daresi<\/strong>: \u0130ki farkl\u0131 girdi ayn\u0131 hash&#039;i \u00fcretiyorsa (&quot;\u00e7arp\u0131\u015fma&quot;), hash fonksiyonunun bunu ele alman\u0131n bir yolu olmal\u0131d\u0131r; genellikle &quot;yeniden hash&quot; ad\u0131 verilen bir i\u015flem kullan\u0131larak hash biraz de\u011fi\u015ftirilmelidir.<\/p>\n<\/li>\n<\/ol>\n<p>Bir karma fonksiyonunun benzersiz \u00f6zelli\u011fi deterministik olmas\u0131d\u0131r; yani ayn\u0131 girdi her zaman ayn\u0131 karma de\u011ferini \u00fcretecektir.<\/p>\n<h2>Hashing&#039;in Temel \u00d6zellikleri<\/h2>\n<p>Hashing birka\u00e7 \u00f6nemli \u00f6zellikle birlikte gelir:<\/p>\n<ul>\n<li>\n<p><strong>H\u0131z<\/strong>: Karma, veri al\u0131m\u0131 i\u00e7in sabit zaman karma\u015f\u0131kl\u0131\u011f\u0131na (O(1)) izin verir; bu, veri k\u00fcmesinin boyutundan ba\u011f\u0131ms\u0131z olarak inan\u0131lmaz derecede h\u0131zl\u0131 oldu\u011fu anlam\u0131na gelir.<\/p>\n<\/li>\n<li>\n<p><strong>Determinizm<\/strong>: Ayn\u0131 giri\u015f her zaman ayn\u0131 hash de\u011ferini \u00fcretecektir.<\/p>\n<\/li>\n<li>\n<p><strong>Tekd\u00fczelik<\/strong>: \u0130yi bir karma i\u015flevi, karma de\u011ferlerinin d\u00fczg\u00fcn bir da\u011f\u0131l\u0131m\u0131n\u0131 \u00fcreterek \u00e7arp\u0131\u015fma olas\u0131l\u0131\u011f\u0131n\u0131 en aza indirir.<\/p>\n<\/li>\n<li>\n<p><strong>Tek Y\u00f6nl\u00fc \u0130\u015flevsellik<\/strong>: Karma de\u011ferinden orijinal girdiye ters m\u00fchendislik uygulamak hesaplama a\u00e7\u0131s\u0131ndan m\u00fcmk\u00fcn de\u011fildir. Bu \u00f6zellik \u00f6zellikle kriptografik karmada \u00f6nemlidir.<\/p>\n<\/li>\n<\/ul>\n<h2>Karma T\u00fcrleri<\/h2>\n<p>Hashing \u00e7e\u015fitli \u015fekillerde kategorize edilebilir. \u0130\u015fte birka\u00e7 karma t\u00fcr\u00fc:<\/p>\n<table>\n<thead>\n<tr>\n<th>Tip<\/th>\n<th>Tan\u0131m<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td><strong>Kriptografik Karma \u0130\u015flevi<\/strong><\/td>\n<td>Bunlar g\u00fcvenli olacak ve orijinal girdinin karmadan yeniden olu\u015fturulamamas\u0131 gibi belirli gereksinimleri kar\u015f\u0131layacak \u015fekilde tasarlanm\u0131\u015ft\u0131r. \u00d6rnekler aras\u0131nda SHA-256 ve MD5 yer al\u0131r.<\/td>\n<\/tr>\n<tr>\n<td><strong>Kriptografik Olmayan Karma \u0130\u015flevi<\/strong><\/td>\n<td>Bunlar, veri alma gibi g\u00f6revlerde performans i\u00e7in optimize edilmi\u015ftir. G\u00fcvenli\u011fe \u00f6ncelik vermiyorlar. \u00d6rnekler aras\u0131nda \u00dcf\u00fcr\u00fcm ve Fowler-Noll-Vo (FNV) karmas\u0131 yer al\u0131r.<\/td>\n<\/tr>\n<tr>\n<td><strong>Tekd\u00fczen Karma<\/strong><\/td>\n<td>\u00c7arp\u0131\u015fma olas\u0131l\u0131\u011f\u0131n\u0131 en aza indiren, her karman\u0131n e\u015fit olas\u0131l\u0131kla oldu\u011fu bir karma i\u015flevi t\u00fcr\u00fc.<\/td>\n<\/tr>\n<tr>\n<td><strong>M\u00fckemmel Karma<\/strong><\/td>\n<td>\u0130kinci seviyede s\u0131f\u0131r \u00e7arp\u0131\u015fman\u0131n oldu\u011fu iki seviyeli bir karma y\u00f6ntemi. Bu, statik veri k\u00fcmeleri i\u00e7in idealdir.<\/td>\n<\/tr>\n<tr>\n<td><strong>Tutarl\u0131 Karma<\/strong><\/td>\n<td>Bu t\u00fcr karma, da\u011f\u0131t\u0131lm\u0131\u015f sistemlerde \u00f6zellikle kullan\u0131\u015fl\u0131d\u0131r \u00e7\u00fcnk\u00fc karma tablosu yeniden boyutland\u0131r\u0131ld\u0131\u011f\u0131nda yeniden karma olu\u015fturmay\u0131 en aza indirir.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>Hashing ile \u0130lgili Uygulamalar, Sorunlar ve \u00c7\u00f6z\u00fcmler<\/h2>\n<p>Hashing&#039;in \u00e7e\u015fitli uygulamalar\u0131 vard\u0131r:<\/p>\n<ol>\n<li>\n<p><strong>Veri Alma<\/strong>: Karma, h\u0131zl\u0131 veri al\u0131m\u0131na izin vermek i\u00e7in karma tablolar\u0131 ve veritabanlar\u0131 gibi veri yap\u0131lar\u0131nda yayg\u0131n olarak kullan\u0131l\u0131r.<\/p>\n<\/li>\n<li>\n<p><strong>Kriptografi<\/strong>: Kriptografik karma i\u015flevleri, veri b\u00fct\u00fcnl\u00fc\u011f\u00fcn\u00fc do\u011frulamak ve parolalar\u0131 g\u00fcvenli bir \u015fekilde saklamak gibi \u00e7e\u015fitli g\u00fcvenlik uygulamalar\u0131nda kullan\u0131l\u0131r.<\/p>\n<\/li>\n<li>\n<p><strong>\u00d6nbellek \u0130\u015fleyi\u015fi<\/strong>: Karma, verileri daha h\u0131zl\u0131 getirmek i\u00e7in \u00f6nbelle\u011fe alma algoritmalar\u0131nda kullan\u0131labilir.<\/p>\n<\/li>\n<\/ol>\n<p>Ancak karma i\u015flemiyle ilgili zorluklar vard\u0131r:<\/p>\n<ul>\n<li>\n<p><strong>\u00c7arp\u0131\u015fma<\/strong>: Bu, iki farkl\u0131 giri\u015f ayn\u0131 karma de\u011feri \u00fcretti\u011finde meydana gelir. \u00c7arp\u0131\u015fma olas\u0131l\u0131\u011f\u0131n\u0131 azaltan iyi bir karma i\u015flevi ve zincirleme veya a\u00e7\u0131k adresleme gibi iyi bir \u00e7arp\u0131\u015fma y\u00f6netimi mekanizmas\u0131 kullan\u0131larak bu durum hafifletilebilir.<\/p>\n<\/li>\n<li>\n<p><strong>G\u00fcvenlik<\/strong>: Kriptografik karma i\u015flevleri g\u00fcvenli olacak \u015fekilde tasarlanm\u0131\u015f olsa da, kriptografik olmayan karma i\u015flevleri g\u00fcvenli veriler i\u00e7in kullan\u0131lmaz ve kullan\u0131lmamal\u0131d\u0131r.<\/p>\n<\/li>\n<\/ul>\n<h2>Benzer Kavramlarla Kar\u015f\u0131la\u015ft\u0131r\u0131ld\u0131\u011f\u0131nda Hashing<\/h2>\n<p>Karma benzersiz bir kavram olmas\u0131na ra\u011fmen di\u011fer veri y\u00f6netimi ve \u015fifreleme teknikleriyle benzerlikler ta\u015f\u0131r. \u0130\u015fte karma i\u015fleminin birka\u00e7 benzer kavramla kar\u015f\u0131la\u015ft\u0131rmas\u0131:<\/p>\n<table>\n<thead>\n<tr>\n<th>Konsept<\/th>\n<th>Tan\u0131m<\/th>\n<th>benzerlikler<\/th>\n<th>Farkl\u0131l\u0131klar<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td><strong>\u015eifreleme<\/strong><\/td>\n<td>Gizlili\u011fini korumak i\u00e7in verileri gizleme y\u00f6ntemi.<\/td>\n<td>Her ikisi de verileri bir formdan di\u011ferine d\u00f6n\u00fc\u015ft\u00fcrmeyi i\u00e7erir.<\/td>\n<td>\u015eifreleme geri d\u00f6nd\u00fcr\u00fclebilir (do\u011fru anahtarla) olacak \u015fekilde tasarlanm\u0131\u015ft\u0131r, karma tek y\u00f6nl\u00fcd\u00fcr ve geri d\u00f6nd\u00fcr\u00fclemez.<\/td>\n<\/tr>\n<tr>\n<td><strong>Kodlama<\/strong><\/td>\n<td>Verileri bir formdan di\u011ferine d\u00f6n\u00fc\u015ft\u00fcrme i\u015flemi.<\/td>\n<td>Her ikisi de verinin d\u00f6n\u00fc\u015ft\u00fcr\u00fclmesini i\u00e7erir.<\/td>\n<td>Kodlama g\u00fcvenlik ama\u00e7l\u0131 de\u011fil temsil ama\u00e7l\u0131d\u0131r. Hashing olmasa da tersine \u00e7evrilebilir.<\/td>\n<\/tr>\n<tr>\n<td><strong>Sa\u011flama toplam\u0131<\/strong><\/td>\n<td>Aktar\u0131m s\u0131ras\u0131nda verilerin bozulmad\u0131\u011f\u0131ndan emin olmak i\u00e7in basit bir veri b\u00fct\u00fcnl\u00fc\u011f\u00fc kontrol\u00fc.<\/td>\n<td>Her ikisi de daha b\u00fcy\u00fck verilerden k\u0131sa bir dize \u00fcretir.<\/td>\n<td>Sa\u011flama toplamlar\u0131 benzersiz veya g\u00fcvenli de\u011fildir ve bunlar\u0131n tek amac\u0131, verileri korumak de\u011fil, hatalar\u0131 kontrol etmektir.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>Hashing ile \u0130lgili Gelecek Perspektifleri ve Teknolojiler<\/h2>\n<p>Gelecekte karma, bilgisayar bilimi ve veri y\u00f6netiminde hayati \u00f6neme sahip olmaya devam edecek. Kuantum hesaplaman\u0131n ortaya \u00e7\u0131k\u0131\u015f\u0131, kuantum algoritmalar\u0131n\u0131n mevcut karma i\u015flevlerini potansiyel olarak bozabilmesi nedeniyle, \u00f6zellikle kriptografik karma olmak \u00fczere karma i\u00e7in bir zorluk te\u015fkil etmektedir. Bu, kuantum diren\u00e7li karma fonksiyonlar\u0131n geli\u015ftirilmesine yol a\u00e7m\u0131\u015ft\u0131r.<\/p>\n<p>Ek olarak, verilerin h\u0131zla b\u00fcy\u00fcmesiyle birlikte, daha da h\u0131zl\u0131 olan ve \u00e7arp\u0131\u015fmalar\u0131 en aza indiren hash fonksiyonlar\u0131, veritabanlar\u0131nda ve di\u011fer b\u00fcy\u00fck \u00f6l\u00e7ekli veri uygulamalar\u0131nda giderek daha \u00f6nemli hale gelecektir.<\/p>\n<h2>Karma ve Proxy Sunucular\u0131<\/h2>\n<p>Hashing&#039;in proxy sunucular\u0131n i\u015fleyi\u015finde pratik uygulamalar\u0131 vard\u0131r. \u00d6rne\u011fin, karma, y\u00fckleri bir proxy a\u011f\u0131ndaki birden fazla sunucuya e\u015fit olarak da\u011f\u0131tmak i\u00e7in kullan\u0131labilir. Tutarl\u0131 karma olu\u015fturma olarak bilinen bu teknik, bir sunucu eklendi\u011finde veya kald\u0131r\u0131ld\u0131\u011f\u0131nda her \u015feyin yeniden d\u00fczenlenmesi ihtiyac\u0131n\u0131 ortadan kald\u0131rmaya yard\u0131mc\u0131 olur.<\/p>\n<p>Ayr\u0131ca karma, proxy sunucular\u0131n\u0131n g\u00fcvenli\u011fini art\u0131rabilir. \u00d6rne\u011fin, karma parola kimlik do\u011frulamas\u0131, parola gizlili\u011fini sa\u011flamak i\u00e7in proxy sunucularda yayg\u0131n olarak kullan\u0131l\u0131r.<\/p>\n<h2>\u0130lgili Ba\u011flant\u0131lar<\/h2>\n<p>Karma hakk\u0131nda daha fazla bilgi i\u00e7in a\u015fa\u011f\u0131daki kaynaklara ba\u015fvurabilirsiniz:<\/p>\n<ol>\n<li>\n<p><a href=\"https:\/\/towardsdatascience.com\/what-is-hashing-6edba0ebfa67\" target=\"_new\" rel=\"noopener nofollow\">\u201cHashing nedir?\u201d \u2013 Veri Bilimine Do\u011fru<\/a><\/p>\n<\/li>\n<li>\n<p><a href=\"https:\/\/medium.com\/tech-tales\/what-is-hashing-6edba0ebfa67\" target=\"_new\" rel=\"noopener nofollow\">\u201cHashing Fonksiyonlar\u0131 ve Bilgisayar Bilimlerinde Kullan\u0131mlar\u0131\u201d \u2013 Medium<\/a><\/p>\n<\/li>\n<li>\n<p><a href=\"https:\/\/www.freecodecamp.org\/news\/a-beginners-guide-to-hashing-in-computer-science-471c80a7c8b5\/\" target=\"_new\" rel=\"noopener nofollow\">\u201cBilgisayar Bilimlerinde Yeni Ba\u015flayanlar \u0130\u00e7in Karma K\u0131lavuzu\u201d \u2013 freeCodeCamp<\/a><\/p>\n<\/li>\n<li>\n<p><a href=\"https:\/\/www.geeksforgeeks.org\/overview-of-hashing-and-its-computer-science-applications\/\" target=\"_new\" rel=\"noopener nofollow\">&quot;Hashing ve Bilgisayar Bilimi Uygulamalar\u0131na Genel Bak\u0131\u015f&quot; - GeeksforGeeks<\/a><\/p>\n<\/li>\n<li>\n<p><a href=\"https:\/\/en.wikipedia.org\/wiki\/Hash_function\" target=\"_new\" rel=\"noopener nofollow\">&quot;Karma i\u015flevi&quot; - Vikipedi<\/a><\/p>\n<\/li>\n<\/ol>\n<p>G\u00fcvenilir proxy sunucu sa\u011flay\u0131c\u0131n\u0131z olarak OneProxy&#039;nin sa\u011flam g\u00fcvenlik protokollerinin ve optimum veri alma mekanizmalar\u0131n\u0131n \u00f6nemini anlad\u0131\u011f\u0131n\u0131 unutmay\u0131n. En son teknolojimiz ve g\u00fcvenli\u011fe olan ba\u011fl\u0131l\u0131\u011f\u0131m\u0131zla m\u00fc\u015fterilerimize m\u00fcmk\u00fcn olan en iyi hizmeti sunmaya \u00e7al\u0131\u015f\u0131yoruz.<\/p>","protected":false},"featured_media":477434,"menu_order":0,"template":"","meta":{"_acf_changed":false,"content-type":"","inline_featured_image":false,"footnotes":""},"class_list":["post-477433","wiki","type-wiki","status-publish","has-post-thumbnail","hentry"],"acf":{"faq_title":"Frequently Asked Questions about <mark>Hashing: A Comprehensive Overview<\/mark>","faq_items":[{"question":"What is hashing in computer science?","answer":"<p>Hashing is a process in computer science where a hash function transforms an input of data into a fixed-size string of bytes, typically a hash value or hash code. This unique output represents the input data, serving various purposes from swift data retrieval to maintaining data security.<\/p>"},{"question":"Who introduced the concept of hashing?","answer":"<p>The concept of hashing was first introduced by Hans Peter Luhn, an IBM scientist, in a paper published in 1953. The paper, titled \"A Business Machine for Data Searching by Digital Techniques,\" presented hash coding as a method for rapid information retrieval.<\/p>"},{"question":"How does a hash function work?","answer":"<p>A hash function works by taking an input (or 'message') and returning a fixed-size string of bytes. The output is designed to be deterministic and uniformly distributed, meaning the same input will always generate the same output, and changing a tiny part of the input will yield a significantly different output. A good hash function also has mechanisms to handle collisions, where different inputs produce the same hash.<\/p>"},{"question":"What are some key features of hashing?","answer":"<p>Some key features of hashing include its speed, allowing for swift data retrieval regardless of the dataset's size, determinism where the same input always yields the same hash value, and one-way functionality which makes it computationally challenging to reverse-engineer the original input from the hash value.<\/p>"},{"question":"What are the different types of hashing?","answer":"<p>There are various types of hashing including cryptographic hash functions (like SHA-256 and MD5) designed for secure data integrity, non-cryptographic hash functions (like Murmur and Fowler\u2013Noll\u2013Vo (FNV)) optimized for performance, uniform hashing for evenly distributed hash values, perfect hashing ideal for static sets of data, and consistent hashing beneficial in distributed systems.<\/p>"},{"question":"What are some applications and problems related to hashing?","answer":"<p>Hashing is commonly used in data retrieval for hash tables and databases, cryptography for data integrity and secure password storage, and caching for swift data fetch. However, it's not without problems, with collision (two different inputs producing the same hash) being a key issue, as well as security concerns in non-cryptographic hash functions.<\/p>"},{"question":"How does hashing relate to proxy servers?","answer":"<p>Hashing can be applied in the operation of proxy servers in ways such as using consistent hashing to distribute loads evenly across servers in a proxy network, and enhancing security with hashed password authentication.<\/p>"},{"question":"What does the future hold for hashing technologies?","answer":"<p>Future technologies will continue to leverage hashing, with quantum-resistant hash functions and hash functions optimized for large-scale data applications being key areas of focus. This is largely due to the advent of quantum computing and the rapid growth of data respectively.<\/p>"}]},"_links":{"self":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki\/477433","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki"}],"about":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/types\/wiki"}],"version-history":[{"count":0,"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki\/477433\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/media\/477434"}],"wp:attachment":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/media?parent=477433"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}