PageSourceSearch

https://docs.drand.love/assets/js/f5afc98b.dd959134.js

js drand.love collected 2026-09-24 17:21:46 UTC 2,221 bytes, 1 lines download raw bytes

1"use strict";(globalThis.webpackChunkdrand_docs=globalThis.webpackChunkdrand_docs||[]).push([[7243],{63358(n,e,o){o.r(e),o.d(e,{assets:()=>l,contentTitle:()=>s,default:()=>u,frontMatter:()=>r,metadata:()=>t,toc:()=>d});var t=o(77123),a=o(74848),i=o(28453);const r={title:"How many RTX 5090 do you need to find a SHA-1 collision in 2025?",description:"Who got a new GPU?",date:new Date("2025-01-31T00:00:00.000Z"),author:"Yolan Romailler",tags:["Beginner"]},s=void 0,l={authorsImageUrls:[void 0]},d=[];function c(n){const e={p:"p",...(0,i.R)(),...n.components};return(0,a.jsx)(e.p,{children:"Who got a new GPU?"})}function u(n={}){const{wrapper:e}={...(0,i.R)(),...n.components};return e?(0,a.jsx)(e,{...n,children:(0,a.jsx)(c,{...n})}):c(n)}},28453(n,e,o){o.d(e,{R:()=>r,x:()=>s});var t=o(96540);const a={},i=t.createContext(a);function r(n){const e=t.useContext(i);return t.useMemo(function(){return"function"==typeof n?n(e):{...e,...n}},[e,n])}function s(n){let e;return e=n.disableParentContext?"function"==typeof n.components?n.components(a):n.components||a:r(n.components),t.createElement(i.Provider,{value:e},n.children)}},77123(n){n.exports=JSON.parse('{"permalink":"/blog/2025/01/31/how-many-5090-to-break-sha1","editUrl":"https://github.com/drand/drand-docs/tree/master/blog/2025-01-31-how-many-5090-to-break-sha1.md","source":"@site/blog/2025-01-31-how-many-5090-to-break-sha1.md","title":"How many RTX 5090 do you need to find a SHA-1 collision in 2025?","description":"Who got a new GPU?","date":"2025-01-31T00:00:00.000Z","tags":[{"inline":true,"label":"Beginner","permalink":"/blog/tags/beginner"}],"readingTime":6.68,"hasTruncateMarker":true,"authors":[{"name":"Yolan Romailler","key":null,"page":null}],"frontMatter":{"title":"How many RTX 5090 do you need to find a SHA-1 collision in 2025?","description":"Who got a new GPU?","date":"2025-01-31T00:00:00.000Z","author":"Yolan Romailler","tags":["Beginner"]},"unlisted":false,"prevItem":{"title":"No Peeking! How to Build a Sealed-Bid Auction with On-Chain Timelock Encryption","permalink":"/blog/2025/03/04/onchain-sealed-bid-auction"},"nextItem":{"title":"On-Chain Randomness Gotchas","permalink":"/blog/2025/01/16/on-chain-randomness-gotchas"}}')}}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.