{"id":7852,"date":"2018-01-18T00:00:00","date_gmt":"2018-01-17T23:00:00","guid":{"rendered":"https:\/\/blog.ouidou.fr\/?p=7852"},"modified":"2025-12-01T16:30:39","modified_gmt":"2025-12-01T15:30:39","slug":"implementation-dune-blockchain","status":"publish","type":"post","link":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain","title":{"rendered":"Impl\u00e9mentation d&rsquo;une blockchain"},"content":{"rendered":"<p><em>Article \u00e9crit par Benoit C.<\/em><\/p>\n<p>Nous avons tous entendu parler des crypto-monnaies Bitcoin ou Ethereum. Et nous regrettons tous de ne pas avoir achet\u00e9 des Bitcoins quand ces derniers valaient quelques centimes et non pas 15\u00a0000 euros comme aujourd\u2019hui. M\u00eame si nous n\u2019avons pas fait fortune avec, il est int\u00e9ressant de se pencher sur leur mode de fonctionnement.<\/p>\n<p>Aujourd\u2019hui quand nous payons avec une carte bleue, la transaction est stock\u00e9e dans le grand livre de compte de notre banque. C\u2019est sur ces grands livres de compte que repose l\u2019ensemble de notre syst\u00e8me mon\u00e9taire actuel. Maintenant, que se passerait-il si des livres de compte venaient \u00e0 dispara\u00eetre ou \u00e9taient corrompus\u00a0?<\/p>\n<p>Les crypto-monnaies n\u2019ont pas ce probl\u00e8me car elles reposent sur des livres de compte librement accessibles et d\u00e9centralis\u00e9s. Tout le monde peut aujourd\u2019hui t\u00e9l\u00e9charger le livre de compte des transactions Bitcoin. Il faut pour cela avoir \u00e0 peu pr\u00e8s 160Go d\u2019espace disque.<\/p>\n<p>Ce grand livre de compte porte un autre nom, la <em>blockchain<\/em>. Je vous propose aujourd\u2019hui d\u2019impl\u00e9menter une <em>blockchain<\/em> minimaliste afin de comprendre comment les transactions Bitcoin sont structur\u00e9es.<\/p>\n<h2 id=\"quest-ce-quune-blockchain\">Qu\u2019est-ce qu\u2019une <em>blockchain<\/em>\u00a0?<\/h2>\n<p>La <em>blockchain<\/em> est une liste compl\u00e8te de tous les blocs de transactions compl\u00e9t\u00e9es depuis le d\u00e9but du Bitcoin par exemple. Afin de renforcer la s\u00e9curit\u00e9 du syst\u00e8me, la <em>blockchain<\/em> a \u00e9t\u00e9 con\u00e7ue de sorte que chaque bloc de transaction contienne le <em>hash<\/em> produit \u00e0 partir du bloc pr\u00e9c\u00e9dent. La <em>blockchain<\/em> est une technologie de stockage et de transmission d\u2019informations \u00e0 faible co\u00fbt, s\u00e9curis\u00e9e, transparente, et fonctionnant sans organe central de contr\u00f4le. Par extension, la <em>blockchain<\/em> d\u00e9signe une base de donn\u00e9es s\u00e9curis\u00e9e et distribu\u00e9e (car partag\u00e9e par ses diff\u00e9rents utilisateurs), contenant un ensemble de transactions dont chacun peut v\u00e9rifier la validit\u00e9. La <em>blockchain<\/em> peut donc \u00eatre compar\u00e9e \u00e0 un grand livre comptable public, anonyme et infalsifiable.<\/p>\n<h2 id=\"structure-dun-bloc\">Structure d\u2019un bloc<\/h2>\n<p>Commen\u00e7ons par d\u00e9finir la structure d\u2019un bloc. Seulement les parties essentielles sont ajout\u00e9es dans un bloc pour l\u2019instant\u00a0:<\/p>\n<ul>\n<li><code>index<\/code>: la position du bloc dans la cha\u00eene<\/li>\n<li><code>date<\/code>: date de cr\u00e9ation du bloc<\/li>\n<li><code>data<\/code>: les donn\u00e9es \u00e0 stocker (exemple\u00a0: liste de transactions)<\/li>\n<li><code>hash<\/code>: un <em>hash<\/em> SHA256 g\u00e9n\u00e9r\u00e9 \u00e0 partir des donn\u00e9es contenues dans le bloc<\/li>\n<li><code>previousHash<\/code>: le <em>hash<\/em> du bloc pr\u00e9c\u00e9dent<\/li>\n<\/ul>\n<p><a href=\"https:\/\/synbioz-website-attachments.s3.eu-west-1.amazonaws.com\/articles\/20180110\/blockchain1.png\"><img decoding=\"async\" src=\"https:\/\/synbioz-website-attachments.s3.eu-west-1.amazonaws.com\/articles\/20180110\/blockchain1.png\" alt=\"\" loading=\"lazy\" \/><\/a><\/p>\n<p>Ce qui donne le bloc suivant\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code><span class=\"kd\">class<\/span> <span class=\"nx\">Block<\/span> <span class=\"p\">{<\/span>    <span class=\"kd\">constructor<\/span><span class=\"p\">(<\/span><span class=\"nx\">index<\/span><span class=\"p\">,<\/span> <span class=\"nx\">timeStamp<\/span><span class=\"p\">,<\/span> <span class=\"nx\">data<\/span><span class=\"p\">,<\/span> <span class=\"nx\">previousHash<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">index<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">index<\/span><span class=\"p\">;<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">timeStamp<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">timeStamp<\/span><span class=\"p\">;<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">data<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">data<\/span><span class=\"p\">;<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">previousHash<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">previousHash<\/span><span class=\"p\">;<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">nonce<\/span> <span class=\"o\">=<\/span> <span class=\"mi\">0<\/span><span class=\"p\">;<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span> <span class=\"o\">=<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">();<\/span>   <span class=\"p\">}<\/span> <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<h2 id=\"gnration-du-hash\">G\u00e9n\u00e9ration du <em>hash<\/em><\/h2>\n<p>Le <em>hash<\/em> d\u2019un bloc est sa partie la plus importante, il garantit que le bloc est valide. Le <em>hash<\/em> est calcul\u00e9 \u00e0 partir de toutes les donn\u00e9es contenues dans le bloc. Cela signifie que si une donn\u00e9e est modifi\u00e9e dans le bloc, le <em>hash<\/em> n\u2019est plus valide. Le <em>hash<\/em> peut \u00eatre vu comme l\u2019identifiant unique d\u2019un bloc. Il est possible de trouver 2 blocs avec le m\u00eame ID, en cas de conflit, mais ils auront un <em>hash<\/em> diff\u00e9rent.<\/p>\n<p>Pour calculer le <em>hash<\/em> d\u2019un bloc, nous utiliserons la librairie CryptoJS https:\/\/www.npmjs.com\/package\/crypto-js.<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code><span class=\"kd\">var<\/span> <span class=\"nx\">SHA256<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">require<\/span><span class=\"p\">(<\/span><span class=\"dl\">\"<\/span><span class=\"s2\">crypto-js\/sha256<\/span><span class=\"dl\">\"<\/span><span class=\"p\">);<\/span>  <span class=\"nx\">calculateHash<\/span><span class=\"p\">()<\/span> <span class=\"p\">{<\/span>     <span class=\"k\">return<\/span> <span class=\"nx\">SHA256<\/span><span class=\"p\">(<\/span><span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">id<\/span> <span class=\"o\">+<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">timeStamp<\/span> <span class=\"o\">+<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">data<\/span> <span class=\"o\">+<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">previousHash<\/span><span class=\"p\">).<\/span><span class=\"nx\">toString<\/span><span class=\"p\">();<\/span> <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<p>Notons que pour un bloc donn\u00e9, le <em>hash<\/em> du bloc pr\u00e9c\u00e9dent est utilis\u00e9 pour le calcul du <em>hash<\/em>. Cela signifie que si un bloc est modifi\u00e9, il faut recalculer son <em>hash<\/em> ainsi que le <em>hash<\/em> de tous les blocs suivants.<\/p>\n<p>Attention, pour le moment, le <em>hash<\/em> n\u2019est pas utilis\u00e9 pour faire ce que l\u2019on appelle du \u00ab\u00a0minage\u00a0\u00bb. Le <em>hash<\/em> est utilis\u00e9 pour garantir l\u2019int\u00e9grit\u00e9 du bloc.<\/p>\n<p>Dans l\u2019exemple suivant, si les donn\u00e9es du bloc 0 sont modifi\u00e9es, son <em>hash<\/em> change ainsi que celui de tous les blocs suivants.<\/p>\n<p><a href=\"https:\/\/synbioz-website-attachments.s3.eu-west-1.amazonaws.com\/articles\/20180110\/blockchain2.png\"><img decoding=\"async\" src=\"https:\/\/synbioz-website-attachments.s3.eu-west-1.amazonaws.com\/articles\/20180110\/blockchain2.png\" alt=\"\" loading=\"lazy\" \/><\/a><\/p>\n<h2 id=\"la-blockchain\">La <em>blockchain<\/em><\/h2>\n<h3 id=\"le-premier-bloc\">Le premier bloc<\/h3>\n<p>Le premier bloc d\u2019une <em>blockchain<\/em> est appel\u00e9 <code>GenesisBlock<\/code>, c\u2019est le seul bloc de la cha\u00eene \u00e0 ne pas poss\u00e9der de <code>previousHash<\/code>. Il sera cr\u00e9\u00e9 avec le code suivant\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">createGenesisBlock<\/span><span class=\"p\">()<\/span> <span class=\"p\">{<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">timeStamp<\/span> <span class=\"o\">=<\/span> <span class=\"k\">new<\/span> <span class=\"nb\">Date<\/span><span class=\"p\">().<\/span><span class=\"nx\">getTime<\/span><span class=\"p\">();<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">.<\/span><span class=\"nx\">push<\/span><span class=\"p\">(<\/span><span class=\"k\">new<\/span> <span class=\"nx\">Block<\/span><span class=\"p\">(<\/span><span class=\"mi\">0<\/span><span class=\"p\">,<\/span> <span class=\"nx\">timeStamp<\/span><span class=\"p\">,<\/span> <span class=\"dl\">\"<\/span><span class=\"s2\">Genesis Block<\/span><span class=\"dl\">\"<\/span><span class=\"p\">,<\/span> <span class=\"kc\">null<\/span><span class=\"p\">));<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<p>La m\u00e9thode <code>calculateHash<\/code> g\u00e9n\u00e8re alors le <em>hash<\/em> du 1er bloc qui sera utilis\u00e9 pour l\u2019ajout du bloc suivant.<\/p>\n<pre><code>e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 <\/code><\/pre>\n<h3 id=\"cration-dun-bloc\">Cr\u00e9ation d\u2019un bloc<\/h3>\n<p>Pour g\u00e9n\u00e9rer un nouveau bloc, il nous faut conna\u00eetre le <em>hash<\/em> du bloc pr\u00e9c\u00e9dent. La partie data est fournie par l\u2019utilisateur le reste est g\u00e9n\u00e9r\u00e9 comme suit\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">generateNextBlock<\/span><span class=\"p\">(<\/span><span class=\"nx\">blockData<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">previousBlock<\/span> <span class=\"o\">=<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">getLatestBlock<\/span><span class=\"p\">();<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">nextIndex<\/span> <span class=\"o\">=<\/span> <span class=\"nx\">previousBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">index<\/span> <span class=\"o\">+<\/span> <span class=\"mi\">1<\/span><span class=\"p\">;<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">nextDate<\/span> <span class=\"o\">=<\/span> <span class=\"k\">new<\/span> <span class=\"nb\">Date<\/span><span class=\"p\">().<\/span><span class=\"nx\">getTime<\/span><span class=\"p\">();<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">newBlock<\/span> <span class=\"o\">=<\/span> <span class=\"k\">new<\/span> <span class=\"nx\">Block<\/span><span class=\"p\">(<\/span><span class=\"nx\">nextIndex<\/span><span class=\"p\">,<\/span> <span class=\"nx\">nextDate<\/span><span class=\"p\">,<\/span> <span class=\"nx\">blockData<\/span><span class=\"p\">,<\/span> <span class=\"nx\">previousBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">);<\/span>     <span class=\"k\">return<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">;<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<h2 id=\"stockage-de-la-blockchain\">Stockage de la <em>blockchain<\/em><\/h2>\n<p>Pour l\u2019instant, les blocs seront stock\u00e9s dans un simple tableau, les donn\u00e9es ne seront pas persistantes.<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">createGenesisBlock<\/span><span class=\"p\">()<\/span> <span class=\"p\">{<\/span>     <span class=\"kd\">const<\/span> <span class=\"nx\">timeStamp<\/span> <span class=\"o\">=<\/span> <span class=\"k\">new<\/span> <span class=\"nb\">Date<\/span><span class=\"p\">().<\/span><span class=\"nx\">getTime<\/span><span class=\"p\">();<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">.<\/span><span class=\"nx\">push<\/span><span class=\"p\">(<\/span><span class=\"k\">new<\/span> <span class=\"nx\">Block<\/span><span class=\"p\">(<\/span><span class=\"mi\">0<\/span><span class=\"p\">,<\/span> <span class=\"nx\">timeStamp<\/span><span class=\"p\">,<\/span> <span class=\"dl\">\"<\/span><span class=\"s2\">Genesis Block<\/span><span class=\"dl\">\"<\/span><span class=\"p\">,<\/span> <span class=\"kc\">null<\/span><span class=\"p\">));<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<h3 id=\"la-validation-des-blocs\">La validation des blocs<\/h3>\n<p>\u00c0 tout moment, il doit \u00eatre possible de valider l\u2019int\u00e9grit\u00e9 d\u2019un bloc ou d\u2019un ensemble de blocs. Pour qu\u2019un bloc soit valide, il faut qu\u2019il valide les r\u00e8gles suivantes\u00a0:<\/p>\n<ul>\n<li>L\u2019index du bloc doit suivre l\u2019index du bloc pr\u00e9c\u00e9dent<\/li>\n<li>le <code>previousHash<\/code> correspond bien au <em>hash<\/em> du bloc pr\u00e9c\u00e9dent<\/li>\n<li>le <em>hash<\/em> du bloc est valide<\/li>\n<\/ul>\n<p>Pour faire cela voici le code\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">isValidNewBlock<\/span><span class=\"p\">(<\/span><span class=\"nx\">newBlock<\/span><span class=\"p\">,<\/span> <span class=\"nx\">previousBlock<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">previousBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">index<\/span> <span class=\"o\">+<\/span> <span class=\"mi\">1<\/span> <span class=\"o\">!==<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">index<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid index<\/span><span class=\"dl\">'<\/span><span class=\"p\">,<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">previousBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span> <span class=\"o\">!==<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">previousHash<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid previoushash<\/span><span class=\"dl\">'<\/span><span class=\"p\">,<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">()<\/span> <span class=\"o\">!==<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid hash: <\/span><span class=\"dl\">'<\/span> <span class=\"o\">+<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">()<\/span> <span class=\"o\">+<\/span> <span class=\"dl\">'<\/span> <span class=\"dl\">'<\/span> <span class=\"o\">+<\/span> <span class=\"nx\">newBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">return<\/span> <span class=\"kc\">true<\/span><span class=\"p\">;<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<p>Pour valider le bloc Genesis, les r\u00e8gles sont les m\u00eames sauf que le <code>previousHash<\/code> doit \u00eatre <code>null<\/code>.<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">isValidGenesisBlock<\/span><span class=\"p\">()<\/span> <span class=\"p\">{<\/span>     <span class=\"kd\">let<\/span> <span class=\"nx\">genesisBlock<\/span> <span class=\"o\">=<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">[<\/span><span class=\"mi\">0<\/span><span class=\"p\">];<\/span>      <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">index<\/span> <span class=\"o\">!==<\/span> <span class=\"mi\">0<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid index<\/span><span class=\"dl\">'<\/span><span class=\"p\">,<\/span> <span class=\"nx\">genesisBlock<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">previousHash<\/span> <span class=\"o\">!==<\/span> <span class=\"kc\">null<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid previoushash<\/span><span class=\"dl\">'<\/span><span class=\"p\">,<\/span> <span class=\"nx\">genesisBlock<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">()<\/span> <span class=\"o\">!==<\/span> <span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">invalid hash: <\/span><span class=\"dl\">'<\/span> <span class=\"o\">+<\/span> <span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">()<\/span> <span class=\"o\">+<\/span> <span class=\"dl\">'<\/span> <span class=\"dl\">'<\/span> <span class=\"o\">+<\/span> <span class=\"nx\">genesisBlock<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">);<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">return<\/span> <span class=\"kc\">true<\/span><span class=\"p\">;<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<p>Maintenant que nous savons comment valider un bloc, il est possible de valider tout une <em>blockchain<\/em>. Dans un premier temps, il faut valider que le bloc Genesis est valide puis valider tous les blocs suivant. Voici le code pour faire cela\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">isValidChain<\/span><span class=\"p\">()<\/span> <span class=\"p\">{<\/span>     <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"o\">!<\/span><span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">isValidGenesisBlock<\/span><span class=\"p\">(<\/span><span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">[<\/span><span class=\"mi\">0<\/span><span class=\"p\">]))<\/span> <span class=\"p\">{<\/span>       <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>      <span class=\"k\">for<\/span> <span class=\"p\">(<\/span><span class=\"kd\">let<\/span> <span class=\"nx\">i<\/span> <span class=\"o\">=<\/span> <span class=\"mi\">1<\/span><span class=\"p\">;<\/span> <span class=\"nx\">i<\/span> <span class=\"o\">&lt;<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">.<\/span><span class=\"nx\">length<\/span><span class=\"p\">;<\/span> <span class=\"nx\">i<\/span><span class=\"o\">++<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"o\">!<\/span><span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">isValidNewBlock<\/span><span class=\"p\">(<\/span><span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">[<\/span><span class=\"nx\">i<\/span><span class=\"p\">],<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">blocks<\/span><span class=\"p\">[<\/span><span class=\"nx\">i<\/span> <span class=\"o\">-<\/span> <span class=\"mi\">1<\/span><span class=\"p\">]))<\/span> <span class=\"p\">{<\/span>         <span class=\"k\">return<\/span> <span class=\"kc\">false<\/span><span class=\"p\">;<\/span>       <span class=\"p\">}<\/span>     <span class=\"p\">}<\/span>     <span class=\"k\">return<\/span> <span class=\"kc\">true<\/span><span class=\"p\">;<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n<h2 id=\"le-minage\">Le minage<\/h2>\n<p>La validation des transactions dans un r\u00e9seau de <em>blockchains<\/em> est un processus complexe. Une des briques principales permettant cette validation est ce que l\u2019on appelle le <em>Proof of Work<\/em>. Il s\u2019agit d\u2019un puzzle \u00e0 r\u00e9soudre avant de pouvoir ajouter un bloc \u00e0 la <em>blockchain<\/em>. La r\u00e9solution de ce puzzle est ce qui s\u2019appelle \u00ab\u00a0miner\u00a0\u00bb.<\/p>\n<p>Le <em>Proof of Work<\/em> est une protection pour \u00e9viter que les mineurs soient tent\u00e9s de tricher en ajoutant des blocs frauduleux. Pour un mineur, le fait de miner un bloc lui co\u00fbte en \u00e9lectricit\u00e9. S\u2019il trichait et qu\u2019il \u00e9tait d\u00e9couvert, cette d\u00e9pense serait perdue. \u00c0 l\u2019inverse, le fait de miner des blocs valides rapporte une r\u00e9compense au mineur s\u2019il r\u00e9sout le <em>Proof of Work<\/em> ; r\u00e9compense sous forme de Bitcoins \u2014cr\u00e9\u00e9s <em>ex nihilo<\/em> pour l\u2019occasion\u2014 si notre <em>blockchain<\/em> est utilis\u00e9e dans le cadre de cette crypto-monnaie.<\/p>\n<p>Comment impl\u00e9menter le <em>Proof of Work<\/em>\u00a0?<\/p>\n<p>Un des puzzles les plus r\u00e9pandus est le fait de trouver un <em>hash<\/em> valide pour le bloc d\u00e9butant par un certain nombre de z\u00e9ro suivant la difficult\u00e9 souhait\u00e9e. Pour pouvoir modifier le <em>hash<\/em>, un compteur va \u00eatre ajout\u00e9 dans le bloc. Ce compteur est appel\u00e9 <em>nonce<\/em>. En it\u00e9rant sur le <em>nonce<\/em> nous modifions le <em>hash<\/em> jusqu\u2019\u00e0 tomber sur un <em>hash<\/em> d\u00e9butant par le nombre de z\u00e9ros souhait\u00e9. L\u2019int\u00e9r\u00eat est que le puzzle est compliqu\u00e9 \u00e0 trouver, mais il est tr\u00e8s simple \u00e0 valider.<\/p>\n<p>Une m\u00e9thode va \u00eatre ajout\u00e9e \u00e0 la classe <code>Block<\/code> pour faire cela\u00a0:<\/p>\n<div class=\"language-js highlighter-rouge\">\n<div class=\"highlight\">\n<pre class=\"highlight\"><code>  <span class=\"nx\">solveProofOfWork<\/span><span class=\"p\">(<\/span><span class=\"nx\">difficulty<\/span> <span class=\"o\">=<\/span> <span class=\"mi\">4<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>     <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">nonce<\/span> <span class=\"o\">=<\/span> <span class=\"mi\">0<\/span><span class=\"p\">;<\/span>     <span class=\"k\">while<\/span> <span class=\"p\">(<\/span><span class=\"kc\">true<\/span><span class=\"p\">)<\/span> <span class=\"p\">{<\/span>       <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span> <span class=\"o\">=<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">calculateHash<\/span><span class=\"p\">();<\/span>       <span class=\"kd\">const<\/span> <span class=\"nx\">valid<\/span> <span class=\"o\">=<\/span> <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">hash<\/span><span class=\"p\">.<\/span><span class=\"nx\">slice<\/span><span class=\"p\">(<\/span><span class=\"mi\">0<\/span><span class=\"p\">,<\/span> <span class=\"nx\">difficulty<\/span><span class=\"p\">);<\/span>        <span class=\"k\">if<\/span> <span class=\"p\">(<\/span><span class=\"nx\">valid<\/span> <span class=\"o\">===<\/span> <span class=\"nb\">Array<\/span><span class=\"p\">(<\/span><span class=\"nx\">difficulty<\/span> <span class=\"o\">+<\/span> <span class=\"mi\">1<\/span><span class=\"p\">).<\/span><span class=\"nx\">join<\/span><span class=\"p\">(<\/span><span class=\"dl\">'<\/span><span class=\"s1\">0<\/span><span class=\"dl\">'<\/span><span class=\"p\">))<\/span> <span class=\"p\">{<\/span>         <span class=\"nx\">console<\/span><span class=\"p\">.<\/span><span class=\"nx\">log<\/span><span class=\"p\">(<\/span><span class=\"k\">this<\/span><span class=\"p\">);<\/span>         <span class=\"k\">return<\/span> <span class=\"kc\">true<\/span><span class=\"p\">;<\/span>       <span class=\"p\">}<\/span>       <span class=\"k\">this<\/span><span class=\"p\">.<\/span><span class=\"nx\">nonce<\/span><span class=\"o\">++<\/span><span class=\"p\">;<\/span>     <span class=\"p\">}<\/span>   <span class=\"p\">}<\/span> <\/code><\/pre>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Comment impl\u00e9menter une blockchain en javascript.<\/p>\n","protected":false},"author":10,"featured_media":10167,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"content-type":"","inline_featured_image":false,"fifu_image_url":"","fifu_image_alt":"","footnotes":""},"categories":[34],"tags":[],"class_list":["post-7852","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-articles-techniques"],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v28.9 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Impl\u00e9mentation d&#039;une blockchain - Ouidou<\/title>\n<meta name=\"description\" content=\"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Impl\u00e9mentation d&#039;une blockchain - Ouidou\" \/>\n<meta property=\"og:description\" content=\"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain\" \/>\n<meta property=\"og:site_name\" content=\"Ouidou\" \/>\n<meta property=\"article:published_time\" content=\"2018-01-17T23:00:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-12-01T15:30:39+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1105\" \/>\n\t<meta property=\"og:image:height\" content=\"564\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Sara Lourties\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u00c9crit par\" \/>\n\t<meta name=\"twitter:data1\" content=\"Sara Lourties\" \/>\n\t<meta name=\"twitter:label2\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain\"},\"author\":{\"name\":\"Sara Lourties\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#\\\/schema\\\/person\\\/e1d66085fb7c22ede319ce56adc373a4\"},\"headline\":\"Impl\u00e9mentation d&rsquo;une blockchain\",\"datePublished\":\"2018-01-17T23:00:00+00:00\",\"dateModified\":\"2025-12-01T15:30:39+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain\"},\"wordCount\":1145,\"publisher\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#organization\"},\"image\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2018\\\/01\\\/Blockchain.png\",\"articleSection\":[\"Articles Techniques\"],\"inLanguage\":\"fr-FR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain\",\"url\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain\",\"name\":\"Impl\u00e9mentation d'une blockchain - Ouidou\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2018\\\/01\\\/Blockchain.png\",\"datePublished\":\"2018-01-17T23:00:00+00:00\",\"dateModified\":\"2025-12-01T15:30:39+00:00\",\"description\":\"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#breadcrumb\"},\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#primaryimage\",\"url\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2018\\\/01\\\/Blockchain.png\",\"contentUrl\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2018\\\/01\\\/Blockchain.png\",\"width\":1105,\"height\":564},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/articles-techniques\\\/implementation-dune-blockchain#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Accueil\",\"item\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Impl\u00e9mentation d&rsquo;une blockchain\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/\",\"name\":\"Blog Ouidou\",\"description\":\"Conseil et expertise en technologies\",\"publisher\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"fr-FR\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#organization\",\"name\":\"Ouidou\",\"url\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/04\\\/image_2022-04-13_150237378.png\",\"contentUrl\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/04\\\/image_2022-04-13_150237378.png\",\"width\":180,\"height\":180,\"caption\":\"Ouidou\"},\"image\":{\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/ouidou.fr\\\/blog\\\/#\\\/schema\\\/person\\\/e1d66085fb7c22ede319ce56adc373a4\",\"name\":\"Sara Lourties\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g\",\"caption\":\"Sara Lourties\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Impl\u00e9mentation d'une blockchain - Ouidou","description":"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain","og_locale":"fr_FR","og_type":"article","og_title":"Impl\u00e9mentation d'une blockchain - Ouidou","og_description":"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.","og_url":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain","og_site_name":"Ouidou","article_published_time":"2018-01-17T23:00:00+00:00","article_modified_time":"2025-12-01T15:30:39+00:00","og_image":[{"width":1105,"height":564,"url":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png","type":"image\/png"}],"author":"Sara Lourties","twitter_card":"summary_large_image","twitter_misc":{"\u00c9crit par":"Sara Lourties","Dur\u00e9e de lecture estim\u00e9e":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#article","isPartOf":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain"},"author":{"name":"Sara Lourties","@id":"https:\/\/ouidou.fr\/blog\/#\/schema\/person\/e1d66085fb7c22ede319ce56adc373a4"},"headline":"Impl\u00e9mentation d&rsquo;une blockchain","datePublished":"2018-01-17T23:00:00+00:00","dateModified":"2025-12-01T15:30:39+00:00","mainEntityOfPage":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain"},"wordCount":1145,"publisher":{"@id":"https:\/\/ouidou.fr\/blog\/#organization"},"image":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#primaryimage"},"thumbnailUrl":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png","articleSection":["Articles Techniques"],"inLanguage":"fr-FR"},{"@type":"WebPage","@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain","url":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain","name":"Impl\u00e9mentation d'une blockchain - Ouidou","isPartOf":{"@id":"https:\/\/ouidou.fr\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#primaryimage"},"image":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#primaryimage"},"thumbnailUrl":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png","datePublished":"2018-01-17T23:00:00+00:00","dateModified":"2025-12-01T15:30:39+00:00","description":"Nos experts vous expliquent \u00e9tape par \u00e9tape comment impl\u00e9menter une blockchain, en abordant les concepts cl\u00e9s et les techniques essentielles.","breadcrumb":{"@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#breadcrumb"},"inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain"]}]},{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#primaryimage","url":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png","contentUrl":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2018\/01\/Blockchain.png","width":1105,"height":564},{"@type":"BreadcrumbList","@id":"https:\/\/ouidou.fr\/blog\/articles-techniques\/implementation-dune-blockchain#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Accueil","item":"https:\/\/ouidou.fr\/blog\/"},{"@type":"ListItem","position":2,"name":"Impl\u00e9mentation d&rsquo;une blockchain"}]},{"@type":"WebSite","@id":"https:\/\/ouidou.fr\/blog\/#website","url":"https:\/\/ouidou.fr\/blog\/","name":"Blog Ouidou","description":"Conseil et expertise en technologies","publisher":{"@id":"https:\/\/ouidou.fr\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/ouidou.fr\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"fr-FR"},{"@type":"Organization","@id":"https:\/\/ouidou.fr\/blog\/#organization","name":"Ouidou","url":"https:\/\/ouidou.fr\/blog\/","logo":{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/ouidou.fr\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2022\/04\/image_2022-04-13_150237378.png","contentUrl":"https:\/\/ouidou.fr\/blog\/wp-content\/uploads\/2022\/04\/image_2022-04-13_150237378.png","width":180,"height":180,"caption":"Ouidou"},"image":{"@id":"https:\/\/ouidou.fr\/blog\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/ouidou.fr\/blog\/#\/schema\/person\/e1d66085fb7c22ede319ce56adc373a4","name":"Sara Lourties","image":{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/secure.gravatar.com\/avatar\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/b2ef32f9fc1e16168b39587a2ec1dafedc70a9d41fa1b4a930ec7744b3e35ec7?s=96&d=mm&r=g","caption":"Sara Lourties"}}]}},"_links":{"self":[{"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/posts\/7852","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/comments?post=7852"}],"version-history":[{"count":6,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/posts\/7852\/revisions"}],"predecessor-version":[{"id":17955,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/posts\/7852\/revisions\/17955"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/media\/10167"}],"wp:attachment":[{"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/media?parent=7852"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/categories?post=7852"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ouidou.fr\/blog\/wp-json\/wp\/v2\/tags?post=7852"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}