2023-03-30
1804
#blockchain#go
Solomon Esenyi
84441
Mar 30, 2023 â‹… 6 min read

How to build a blockchain with Go

Solomon Esenyi Python/Golang developer and Technical Writer with a passion for open-source, cryptography, and serverless technologies.

Recent posts:

Using Rust And Leptos To Build Beautiful Declarative User Interfaces

Using Rust and Leptos to build beautiful, declarative UIs

Leptos is an amazing Rust web frontend framework that makes it easier to build scalable, performant apps with beautiful, declarative UIs.

Eze Sunday
Nov 30, 2023 â‹… 10 min read
5 Best JavaScript Multi-Dimensional Array Libraries

5 best JavaScript multidimensional array libraries

Learn more about the 5 best JavaScript libraries for dealing with multidimensional arrays, such as ndarray, math.js, and NumJs.

Pascal Akunne
Nov 30, 2023 â‹… 4 min read
Dom Scandinaro Leader Spotlight

Leader Spotlight: Leading by experience with Dom Scandinaro

We spoke with Dom about his approach to balancing innovation with handling tech debt and to learn how he stays current with technology.

Jessica Srinivas
Nov 30, 2023 â‹… 6 min read
Vite Adoption Guide Overview Examples And Alternatives

Vite adoption guide: Overview, examples, and alternatives

Vite is a versatile, fast, lightweight build tool with an exceptional DX. Let’s explore when and why you should adopt Vite in your projects.

David Omotayo
Nov 29, 2023 â‹… 16 min read
View all posts

3 Replies to "How to build a blockchain with Go"

  1. With the above code, I’m getting prevHash : 30 for the first block while printing the block data. It should be empty right?

    I’m using the below function to print the data of the block :

    func printBlockInformation(block Block) {
    fmt.Printf(“\ttime: %s\n”, block.timestamp.String())
    fmt.Printf(“\tprevHash: %x\n”, block.previousHash)
    fmt.Printf(“\tHash: %x\n”, block.hash)

    }

    Can someone please help?

  2. What is the point of the proof of work step? Why can’t you simply calculate the hash once, and be done? Why do you have to waste CPU cycles on a loop, calculating millions of hashes just to prove that you did work? What is the practical point of the proof of work step?

Leave a Reply