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