hashes
US
・UK
C1 高級
n. pl.名詞 (複數)哈希
影片字幕
有沒有想過比特幣（和其他加密貨幣）實際工作？ (Ever wonder how Bitcoin (and other cryptocurrencies) actually work?)
26:21
- finding a new special number for each of these blocks that makes their hashes start with 60 zeros.
為這些區塊中的每一個區塊找到一個新的特殊數字，使它們的哈希值以60個零開始。
區塊鏈到底是什麼？ (What Exactly Is Blockchain?)
04:33
- hashes for all the blocks in the chain to try and cover their tracks, the decentralized
鏈中所有區塊的哈希值，以試圖掩蓋他們的蹤跡，去中心化的。
- increase the time it takes to generate new hashes, making the process of hacking multiple
增加了生成新哈希值所需的時間，使得黑客攻擊多個
有效的 SOC 管理和事件響應 (Effective SOC Management and Incident Response)
56:56
- That could be something such as an IOC, hashes, domain names, IP addresses.
這可以是 IOC、哈希值、域名、IP 地址等。
區塊鏈如何運作？ (How does a blockchain work - Simply Explained)
06:00
- So in other words: hashes are very useful
when you want to detect changes to blocks.
所以換句話說：哈希是非常有用的。 當你想檢測塊的變化時。
- But using hashes is not enough to prevent
tampering.
但使用哈希值並不足以防止 篡改。
圖形卡如何工作？ 探索圖形處理器架構 (How do Graphics Cards Work? Exploring GPU Architecture)
28:30
- As a result, a graphics card like this one could generate around 95 million SHA-256 hashes, or 95 million randomly numbered lottery tickets every second.
是以，像這樣的顯卡每秒可生成約 9500 萬個 SHA-256 哈希值，或 9500 萬張隨機編號的彩票。
- However, nowadays computers filled with ASICs, or Application Specific Integrated Circuits, perform 250 trillion hashes a second, or the equivalent of 2,600 graphics cards, thereby making graphics cards look like a spoon when mining Bitcoin, next to an excavator that is an ASIC mining computer.
然而，如今裝滿 ASIC（專用集成電路）的計算機每秒可執行 250 萬億次哈希值，相當於 2 600 塊顯卡，是以在挖掘比特幣時，顯卡就像一把勺子，而挖掘機就是 ASIC 挖礦計算機。
系統設計訪談中的 DB 索引 - B 樹、地理空間、反轉索引等！ (DB Indexing in System Design Interviews - B-tree, Geospatial, Inverted Index, and more!)
14:16
- And so what we do is we actually create the geohashes and then just build a B-tree on top of the hashes themselves, which allow us to easily do these range queries and these O of 1 or nearly O of 1 lookups on precise areas.
是以，我們要做的就是創建地理散列，然後在散列本身的基礎上建立一棵 B 樹，這樣我們就能輕鬆地對精確區域進行範圍查詢和 O of 1 或接近 O of 1 的查找。
