@@ -56,10 +58,16 @@ This is us playing in BA earlier this year.
Notes:
-The game has three components:
-**click** the first is a game contract, which is something that we have taken care of. I will deploy it and run it on Rococo. The game contract runs the game loop. It invokes each player contract and it determines the score.
-**click** And the player.contract, that's your job. so we we have a template for a very basic player and you can basically modify it in any way you like. I will explain the scoring function in a moment.
-**click** Lastly, we have a front-end that we will put on the big screen here, but it's online, you can open it up on your laptop and follow the game locally.
+The game has three components:
+
+- **click** the first is a game contract, which is something that we have taken care of.
+ I will deploy it and run it on Rococo.
+ The game contract runs the game loop.
+ It invokes each player contract and it determines the score.
+- **click** And the player.contract, that's your job.
+ so we we have a template for a very basic player and you can basically modify it in any way you like.
+ I will explain the scoring function in a moment.
+- **click** Lastly, we have a front-end that we will put on the big screen here, but it's online, you can open it up on your laptop and follow the game locally.
---
@@ -73,13 +81,22 @@ The game has three components:
Notes:
-So the process is as follows:
-**click** - you brainstorm and create a contract that plays on your behalf ideally in a better way than the other contracts
-**click** - you deploy the contract to the Rococo testnet
-**click** - you register your contract as a player with the game contract. We will publish the addresses and it's it's not complicated you can just use contracts UI. I will also show it in a second
-**click** - then we start the game. We have a script that calls the game contract regularly and the front end will display the changes
-**click** - so the game will run for some minutes. Your contract will already be uploaded at this point - so you can't do anything. The contract will play on your behalf. Meaning it's hands off. I mean you can also change it with upgradable contract patterns and stuff, but in general, you won't have to. So you can just watch the game play out.
-If you're familiar with AI agents, that's also a similar idea, where you have an agent that plays a game on your behalf.
+So the process is as follows:
+
+- **click** - you brainstorm and create a contract that plays on your behalf ideally in a better way than the other contracts
+- **click** - you deploy the contract to the Rococo testnet
+- **click** - you register your contract as a player with the game contract.
+ We will publish the addresses and it's it's not complicated you can just use contracts UI.
+ I will also show it in a second
+- **click** - then we start the game.
+ We have a script that calls the game contract regularly and the front end will display the changes
+- **click** - so the game will run for some minutes.
+ Your contract will already be uploaded at this point - so you can't do anything.
+ The contract will play on your behalf.
+ Meaning it's hands off.
+ I mean you can also change it with upgradable contract patterns and stuff, but in general, you won't have to.
+ So you can just watch the game play out.
+ If you're familiar with AI agents, that's also a similar idea, where you have an agent that plays a game on your behalf.
---
@@ -100,8 +117,10 @@ You can see, it's a it's a coordinate grid.
Notes:
-this is X1 y0
-And the idea is for you, as a contract developer, to paint as many fields of this canvas of the script as possible. There's an API function for how to paint. I'll show it in a minute, but the idea is that in the end the contract that painted the most Fields wins.
+this is X1 y0.
+And the idea is for you, as a contract developer, to paint as many fields of this canvas of the script as possible.
+There's an API function for how to paint.
+I'll show it in a minute, but the idea is that in the end the contract that painted the most Fields wins.
---
@@ -111,7 +130,9 @@ And the idea is for you, as a contract developer, to paint as many fields of thi
Notes:
-So yeah, there's bit of scoring to be done. There's also scoreboard here on the side, where all players will be shown as well as their rank. You will be assigned a random color to your player contract.
+So yeah, there's bit of scoring to be done.
+There's also scoreboard here on the side, where all players will be shown as well as their rank.
+You will be assigned a random color to your player contract.
---
@@ -135,11 +156,20 @@ So yeah, there's bit of scoring to be done. There's also scoreboard here on the
Notes:
-This game was designed in a way where all of the best practices for smart contract development will make your player run better. We really tried to gamify some of the concepts that are really best practices of how you should develop a smart contract.
-**click** - first one is to use as little gas as possible to paint as many fields as possible. Gas consumption is a super big thing as user fees derived from that and the transaction throughput also relates to how big a contract is so the less complex your contract is the better it will do.
-**click** - There's a certain gas budget allocated per player and if you if you're above that then you just won't make a turn. So you have to stay in an optimal gas budget.
-**click** - the later in the in the game that you still manage to paint the field the better you score because what will happen is that there will be all kinds of fields painted and it will convert to a place where there's only a few left. so if you have a player that just randomly tries to paint things then at some at some point it just won't no longer work because it doesn't paint the unpainted fields. But in order to find those, you will have to have some more complex logic in your contract.
-**click** - and lastly, there's no overpainting. So the first player to paint a field owns it. So if you have a contract that just paints the same field over and over again, it will just not work. So you have to have some logic in there that checks whether a field is already painted or not.
+This game was designed in a way where all of the best practices for smart contract development will make your player run better.
+We really tried to gamify some of the concepts that are really best practices of how you should develop a smart contract.
+
+- **click** - first one is to use as little gas as possible to paint as many fields as possible.
+ Gas consumption is a super big thing as user fees derived from that and the transaction throughput also relates to how big a contract is so the less complex your contract is the better it will do.
+- **click** - There's a certain gas budget allocated per player and if you if you're above that then you just won't make a turn.
+ So you have to stay in an optimal gas budget.
+- **click** - the later in the in the game that you still manage to paint the field the better you score because what will happen is that there will be all kinds of fields painted and it will convert to a place where there's only a few left.
+ so if you have a player that just randomly tries to paint things then at some at some point it just won't no longer work because it doesn't paint the unpainted fields.
+ But in order to find those, you will have to have some more complex logic in your contract.
+- **click** - and lastly, there's no overpainting.
+ So the first player to paint a field owns it.
+ So if you have a contract that just paints the same field over and over again, it will just not work.
+ So you have to have some logic in there that checks whether a field is already painted or not.
---
@@ -169,17 +199,24 @@ mod player {
Notes:
-So this is a very basic player contract.
-We have a repository app set up with the template for this - I will share the link in a second. How it looks is - it's a contract that defines the player module,
-**click** - a super simple player doesn't have to contain any storage whatsoever.
-**click**- a super simple player also doesn't have to contain any Constructor arguments
-**click** - and it can just return a random constant value. So this is the most simple player ever.
-What your player needs to do is to have one message, that has a defined selector, so you don't have to think more about this. It's just that it needs to have this function and this function is called by the game with every round. And whatever you return from this function. This is your your turn for the game.
-So if in this case you return an option some(1,2), this would mean you paint the pixel at X1 Y2.
-In that case, it would be a very boring play.
-Who can tell me what would happen here?
-_(a player that only makes one turn - it always tries to paint the same field. And if someone else also chose the same magic numbers then it wouldn't even make a turn at all.)_
-**click** - So there's a couple things of how you can improve on that and I will show some hints later, but for now what we're gonna do is look at the repository and see how we can get started with this.
+So this is a very basic player contract.
+We have a repository app set up with the template for this - I will share the link in a second.
+How it looks is - it's a contract that defines the player module.
+
+- **click** - a super simple player doesn't have to contain any storage whatsoever.
+- **click**- a super simple player also doesn't have to contain any Constructor arguments
+- **click** - and it can just return a random constant value.
+ So this is the most simple player ever.
+ What your player needs to do is to have one message, that has a defined selector, so you don't have to think more about this.
+ It's just that it needs to have this function and this function is called by the game with every round.
+ And whatever you return from this function.
+ This is your your turn for the game.
+ So if in this case you return an option some(1,2), this would mean you paint the pixel at X1 Y2.
+ In that case, it would be a very boring play.
+ Who can tell me what would happen here?
+ _(a player that only makes one turn - it always tries to paint the same field_.
+ _And if someone else also chose the same magic numbers then it wouldn't even make a turn at all_.)
+- **click** - So there's a couple things of how you can improve on that and I will show some hints later, but for now what we're gonna do is look at the repository and see how we can get started with this.
---
@@ -208,7 +245,9 @@ It contains the cargo.toml file and the lib.rs, which is the player that I just
Notes:
-It contains the game metadata. You will need this in order to interact with the game itself, to register your player and so on. but yeah we will show that.
+It contains the game metadata.
+You will need this in order to interact with the game itself, to register your player and so on.
+but yeah we will show that.
---
@@ -229,8 +268,9 @@ The first is some instructions on General setup and the second one is in order t
Notes:
-So, the first thing that we are going to do is that I would ask all of you to go to this link here and follow the instructions.
-We will go around and help whoever has an issue. I think you might even have already used some of the requirements in there, so it may not be super complicated.
+So, the first thing that we are going to do is that I would ask all of you to go to this link here and follow the instructions.
+We will go around and help whoever has an issue.
+I think you might even have already used some of the requirements in there, so it may not be super complicated.
---
@@ -240,7 +280,8 @@ We will go around and help whoever has an issue. I think you might even have alr
Notes:
-For this stage, you will need the address of the game. We'll post it in the chat.
+For this stage, you will need the address of the game.
+We'll post it in the chat.
This is a simple example - we're just giving you exposure to the flow of uploading your player contract.
---
@@ -251,7 +292,8 @@ This is a simple example - we're just giving you exposure to the flow of uploadi
Notes:
-The next slides go over strategy. (maybe wait to to go through until you've played one game)
+The next slides go over strategy.
+(maybe wait to to go through until you've played one game)
---
@@ -277,21 +319,24 @@ The next slides go over strategy. (maybe wait to to go through until you've play
Notes:
-When you deployed it you already saw that there's different functions that you can call.
-There are a lot of functions that are ineresting.
-**click** - the game runner calls this - if you're interested, you can take a look how it works and there might be some hints for for the game.
-**click** - then there's a function to to query the board in order to find out if certain fields are already occupied or if they are still free.
-**click** - there's a function for the gas budget so you can find out how much gas your player is allowed to use per one round. Because worst thing is if you are above this gas budget, then you just won't execute any turn during that round.
-**click** - there's also function to query the game dimensions. same thing there, if you paint outside the bounds, then also you just missed one turn.
+When you deployed it you already saw that there's different functions that you can call.
+There are a lot of functions that are interesting.
+
+- **click** - the game runner calls this - if you're interested, you can take a look how it works and there might be some hints for for the game.
+- **click** - then there's a function to to query the board in order to find out if certain fields are already occupied or if they are still free.
+- **click** - there's a function for the gas budget so you can find out how much gas your player is allowed to use per one round.
+ Because worst thing is if you are above this gas budget, then you just won't execute any turn during that round.
+- **click** - there's also function to query the game dimensions.
+ Same thing there, if you paint outside the bounds, then also you just missed one turn.
---
## Things to consider 🧠
-- Develop a strategy for your player.
+- Develop a strategy for your player.
- Use as little gas as possible to paint as many fields as possible.
- Stay within your gas budget.
-- The later you manage to still paint a field, the better you score.
+- The later you manage to still paint a field, the better you score.
- No overpainting! First player to paint a field owns it.
- [paritytech/squink-splash-advanced](https://github.com/paritytech/squink-splash-advanced)
@@ -303,7 +348,9 @@ There are a lot of functions that are ineresting.
Notes:
-There's details in here. You could deploy locally to test things out. there's also commands you can use to deploy not using the UI.
+There's details in here.
+You could deploy locally to test things out.
+there's also commands you can use to deploy not using the UI.
---
@@ -332,9 +379,14 @@ There's details in here. You could deploy locally to test things out. there's al
Notes:
-**click** Lastly, some ideas for for your agent in the game you can you yourself can call your contract. as often as you want and this won't contribute to the gas used during the game. You can during the game you could also call a set of function of your contract if you want to adapt something.
-**click** You could also Generate random numbers. There are a couple of libraries out there, if you want to go along those lines you have to pay attention that it's a no standard Library. typically a random number generator libraries they typically have a feature that you need to enable in order to make them no standard compatible
-**click** A clever strategy would be a query which fields are free. that's a bit more complex with the with the code snippet that we have in this Advanced repository, this would give you a hint.
+- **click** Lastly, some ideas for for your agent in the game you can you yourself can call your contract.
+ As often as you want and this won't contribute to the gas used during the game.
+ You can during the game you could also call a set of function of your contract if you want to adapt something.
+- **click** You could also Generate random numbers.
+ There are a couple of libraries out there, if you want to go along those lines you have to pay attention that it's a no standard Library.
+ typically a random number generator libraries they typically have a feature that you need to enable in order to make them no standard compatible
+- **click** A clever strategy would be a query which fields are free.
+ that's a bit more complex with the with the code snippet that we have in this Advanced repository, this would give you a hint.
---
@@ -374,17 +426,17 @@ Solutions Explainer
-
+
-Use as little gas as possible to paint as many fields as possible.
-Stay within your gas budget.
-The later you manage to still paint a field, the better you score.
-No overpainting! First player to paint a field owns it.
+Use as little gas as possible to paint as many fields as possible.
+Stay within your gas budget.
+The later you manage to still paint a field, the better you score.
+No overpainting! First player to paint a field owns it.
-
-
+
+
[paritytech/squink-splash-advanced](https://github.com/paritytech/squink-splash-advanced)
@@ -415,14 +467,14 @@ No overpainting! First player to paint a field owns it.
## Board Dimensions
- Worst 😱
- - Cross-contract call to `game`
+ - Cross-contract call to `game`
```rust
#[ink(message)]
pub fn dimensions(&self) -> (u32, u32)
```
-
+
@@ -482,34 +534,43 @@ fn pay_winner(
---
-## Strategy 1
Return Random Numbers
+## Strategy 1
Return Random Numbers
---
-## Strategy 1
Return Random Number
+## Strategy 1
Return Random Number
- Wasm-compatible RNG
+
+
- Use Storage to hold seed for random number
+
+
- 📈 Uses little Gas
+
+
- 📉 Quickly runs into collisions
+
+
- 📉 Score function rewards players that late in game still paint fields
+
---
-## Strategy 2
Paint only free fields
+## Strategy 2
Paint only free fields
---
-## Strategy 2
Paint only free fields
+## Strategy 2
Paint only free fields
- Query board for free fields
- 📈 Succeeds late in game
@@ -523,16 +584,16 @@ fn pay_winner(
---
-## Strategy 3
Shift computation off-chain
+## Strategy 3
Shift computation off-chain
---
-## Strategy 3
Shift computation off-chain
+## Strategy 3
Shift computation off-chain
- Off-chain Script
- - Query board ➜ Search free field
+ - Query board ➜ Search free field
@@ -550,18 +611,20 @@ fn pay_winner(
---
-## Strategy 4
Exploit player sorting in game loop
+## Strategy 4
Exploit player sorting in game loop
---
-## Strategy 4
Exploit player sorting in game loop
+## Strategy 4
Exploit player sorting in game loop
- On top of Strategy 3 (off-chain computation).
+
- Game loop calls players in same order each time.
+
```rust
@@ -581,7 +644,7 @@ fn submit_turn(&mut self) {
---
-## Strategy 4
Exploit player sorting in game loop
+## Strategy 4
Exploit player sorting in game loop
```rust
impl
AddressGenerator for DefaultAddressGenerator {
@@ -608,7 +671,7 @@ impl AddressGenerator for DefaultAddressGenerator {
---
-## Strategy 5
Checking these slides already yesterday
+## Strategy 5
Checking these slides already yesterday
diff --git a/content/blockchain-contracts/ink/slides.md b/content/blockchain-contracts/ink/slides.md
index b4dcade..3b9f9e8 100644
--- a/content/blockchain-contracts/ink/slides.md
+++ b/content/blockchain-contracts/ink/slides.md
@@ -179,9 +179,9 @@ path = "lib.rs"
[features]
default = ["std"]
std = [
- "ink/std",
- "scale/std",
- "scale-info/std",
+ "ink/std",
+ "scale/std",
+ "scale-info/std",
]
```
@@ -259,7 +259,8 @@ Artifacts:
The contract was built in RELEASE mode.
-Your contract artifacts are ready. You can find them in:
+Your contract artifacts are ready.
+You can find them in:
/home/CloudStation/Blockchain-Academy/flipper/target/ink
- flipper.contract (code + metadata)
@@ -479,6 +480,7 @@ pub fn get(&self) -> bool {
- `#[ink(message)]` is how we tell ink! this is a function that can be called on the contract
- `&self` is a reference to the contract's storage
+
Notes:
@@ -538,7 +540,6 @@ pub fn spin(&mut self) -> Result<()> {
};
pub type Result = core::result::Result;
-
```
@@ -568,7 +569,6 @@ pub fn flip(&mut self) {
}
}
-
```
- what is the state of this contract if the tx is called in an odd block number?
@@ -624,7 +624,6 @@ pub fn flip(&mut self) {
}
}
-
```
- What happens to the events from reverted transactions?
@@ -726,8 +725,8 @@ Notes:
| Unsigned int | 42 | 0x2a00 | |
| Enum | enum IntOrBool { Int(u8), Bool(bool)} | 0x002a and 0x0101 | first byte encodes the variant index, remaining bytes encode the data |
| Tuple | (3, false) | 0x0c00 | concatenation of each encoded value |
-| Vector | [4, 8, 15, 16, 23, 42] | 0x18040008000f00100017002a00 | encoding of the vector length followed by conatenation of each item's encoding |
-| Struct | {x:30u64, y:true} | [0x1e,0x0,0x0,0x0,0x1] | names are ignored, Vec
-There are going to be forks. We need to decide which one is the real one.
+There are going to be forks.
+We need to decide which one is the real one.
-We can rule some forks out to reduce the problem space. Then we are left to decide which is canonical.
+We can rule some forks out to reduce the problem space.
+Then we are left to decide which is canonical.
Notes:
-Forks represent alternate courses that history could take. They arise every time there is a difference of opinion.
+Forks represent alternate courses that history could take.
+They arise every time there is a difference of opinion.
-You can think of them at a social level. Court cases, arguments, wars. Ideally we can resolve them peacefully
+You can think of them at a social level.
+Court cases, arguments, wars.
+Ideally we can resolve them peacefully
-You can think of them at a very low physics-y level. Every time an electron encounters a potential barrier it either reflects of tunnels. When consensus is high-quality, the result is as objective as the outcome of a physical process.
+You can think of them at a very low physics-y level.
+Every time an electron encounters a potential barrier it either reflects of tunnels.
+When consensus is high-quality, the result is as objective as the outcome of a physical process.
---
@@ -66,9 +76,12 @@ You can think of them at a very low physics-y level. Every time an electron enco
Notes:
-The first two aspects are relatively simple and I'll discuss them briefly right now. The third and fourth are the main topic of this lecture. The fifth is covered in detail two lectures from now in great detail.
+The first two aspects are relatively simple and I'll discuss them briefly right now.
+The third and fourth are the main topic of this lecture.
+The fifth is covered in detail two lectures from now in great detail.
-The first three aspects are about ruling possibilities out. The fourth and fifth are about deciding between any remaining possibilities.
+The first three aspects are about ruling possibilities out.
+The fourth and fifth are about deciding between any remaining possibilities.
---v
@@ -80,13 +93,15 @@ Some forks can be ruled out simply because they contain invalid state transition
Notes:
-Example spending more money than you have. Noting your present location such that you would have traveled faster than speed of light since last record. Calling a smart contract with invalid parameters.
+Example spending more money than you have.
+Noting your present location such that you would have traveled faster than speed of light since last record.
+Calling a smart contract with invalid parameters.
---v
## Arbitrary / Political Validity
-Similar to state machine validity.
Notes:
-These blockchains are supposed to be permissionless right? At least many of them are. Some are even very hardcore about that goal. So why would we want to restrict the authoring.
-Answer: So the nodes are not overwhelmed. Unthrottled authoring leads to fork chaos. If anyone authored at any moment there would be blocks raining down left and right. It would be impossible to check them all. It would be DOS central. So we need some organization / order to the process.
+These blockchains are supposed to be permissionless right? At least many of them are.
+Some are even very hardcore about that goal.
+So why would we want to restrict the authoring.
+Answer: So the nodes are not overwhelmed.
+Unthrottled authoring leads to fork chaos.
+If anyone authored at any moment there would be blocks raining down left and right.
+It would be impossible to check them all.
+It would be DOS central.
+So we need some organization / order to the process.
---v
@@ -139,7 +165,10 @@ The ability of the system to keep authoring new blocks
Notes:
-Before we go on, I want to introduce the concept of liveness. It is a desireable property that consensus systems want to have. Systems that have better liveness properties offer higher quality blockspace. Chains without liveness guarantees become stalled.
+Before we go on, I want to introduce the concept of liveness.
+It is a desireable property that consensus systems want to have.
+Systems that have better liveness properties offer higher quality blockspace.
+Chains without liveness guarantees become stalled.
---
@@ -164,13 +193,20 @@ Solve a Pre-image search - earn the right to author.
Notes:
-On the surface one big strength of PoW is that anyone can spin up a node and join at any time without anyone's permission. This is clearly how it was described in the whitepaper. In practice, many systems now have such a high hashrate that your home computer is useless. It is now permissioned by who can afford and acquire the right hardware.
+On the surface one big strength of PoW is that anyone can spin up a node and join at any time without anyone's permission.
+This is clearly how it was described in the whitepaper.
+In practice, many systems now have such a high hashrate that your home computer is useless.
+It is now permissioned by who can afford and acquire the right hardware.
-The reliance on an external resource is good in some sense because it is an objective measure of the market's valuation of the consensus system. This helps valuate the blockspace.
+The reliance on an external resource is good in some sense because it is an objective measure of the market's valuation of the consensus system.
+This helps valuate the blockspace.
The blindness is a good property because it makes it impossible to perform a targeted attack (DOS or physical) on the next leader to stall the network.
-Some attacks rely on the leader authoring two competing forks and gossiping them to different parts of the network. With PoW, it costs energy for every block you author. This makes it expensive to perform such attacks. This provides an economic incentive for authors to only author blocks on the "correct" fork.
+Some attacks rely on the leader authoring two competing forks and gossiping them to different parts of the network.
+With PoW, it costs energy for every block you author.
+This makes it expensive to perform such attacks.
+This provides an economic incentive for authors to only author blocks on the "correct" fork.
---v
@@ -186,11 +222,16 @@ Some attacks rely on the leader authoring two competing forks and gossiping them
Notes:
-Energy consumption is more often considered a negative property. Sometimes called proof of _waste_. I won't go that far, but in a world where climate change is a reality, it is certainly not ideal to be spending so much energy if we can get away with far less.
+Energy consumption is more often considered a negative property.
+Sometimes called proof of _waste_.
+I won't go that far, but in a world where climate change is a reality, it is certainly not ideal to be spending so much energy if we can get away with far less.
-Worth noting that some PoW schemes (eg Monero's) strive to minimize the energy impact by choosing algorithms that are "asic resistant". While these are decidedly better than Bitcoin's, they do not fundamentally solve the problem. Just alleviate it somewhat in practice.
+Worth noting that some PoW schemes (eg Monero's) strive to minimize the energy impact by choosing algorithms that are "asic resistant".
+While these are decidedly better than Bitcoin's, they do not fundamentally solve the problem.
+Just alleviate it somewhat in practice.
-Secondly, the block time is only probabilistically known. When waiting for block to be authored, there are sometimes spurts of blocks followed by long stretches without any.
+Secondly, the block time is only probabilistically known.
+When waiting for block to be authored, there are sometimes spurts of blocks followed by long stretches without any.
Although it seems permissionless on its face, in practice, to be a bitcoin miner you need to have expensive specialized hardware.
@@ -206,7 +247,10 @@ Notes:
If it costs energy to author blocks, why would anyone want to author to begin with?
-Mining only when you want to get your transaction in seems like a good idea to me. People who don't want to self author, can pay other a fee to do it for them. This is the purpose of transaction fees. Most chains have transaction fees specified in the transactions themselves which go to the author
+Mining only when you want to get your transaction in seems like a good idea to me.
+People who don't want to self author, can pay other a fee to do it for them.
+This is the purpose of transaction fees.
+Most chains have transaction fees specified in the transactions themselves which go to the author
Some networks also add an explicit incentives such as a 50BTC reward per block.
@@ -235,7 +279,9 @@ Prove your identity with a signature.
Notes:
-Stable block time is a property of high-quality block space. It allows applications that consume the blockspace to have expectations about throughput. In PoW you will occasionally have long periods without a block which can negatively affect applications.
+Stable block time is a property of high-quality block space.
+It allows applications that consume the blockspace to have expectations about throughput.
+In PoW you will occasionally have long periods without a block which can negatively affect applications.
---v
@@ -251,7 +297,8 @@ Stable block time is a property of high-quality block space. It allows applicati
Notes:
-Does anything bad happen if they misbehave? Not inherently. We will need an incentive for that.
+Does anything bad happen if they misbehave? Not inherently.
+We will need an incentive for that.
---
@@ -289,12 +336,9 @@ Cons:
**B**lind **A**ssignment for **B**lockchain **E**xtension
- In each slot, compute a VRF output.
-- If it is below a threshold, you are eligible to author.
-
-- If eligible, author a block showing VRF proof
-
-- If NOT eligible, do nothing
-
+- If it is below a threshold, you are eligible to author.
+- If eligible, author a block showing VRF proof
+- If NOT eligible, do nothing
Notes:
@@ -304,8 +348,8 @@ Pros:
Cons:
-- Some slots have no authors - There is a workaround for this
-- Other slots have multiple authors which leads to forks. There is no workaround for this
+- Some slots have no authors - There is a workaround for this.
+- Other slots have multiple authors which leads to forks - There is **no** workaround for this.
---v
@@ -389,9 +433,15 @@ Restores clear economic incentives
Notes:
-There is an economic game called staking as part of the state machine that allows selecting the authorities who will participate in the PoA scheme. Actually there isn't just _one_ way to do it, there are many. Kian will talk a lot more about this and about the way it is done in Polkadot later. I'll just give the flavor now.
+There is an economic game called staking as part of the state machine that allows selecting the authorities who will participate in the PoA scheme.
+Actually there isn't just _one_ way to do it, there are many.
+Kian will talk a lot more about this and about the way it is done in Polkadot later.
+I'll just give the flavor now.
-The basic idea is that anyone can lock up some tokens on chain (in the state machine). The participants with the most tokens staked are elected as the authorities. There is a state transition that allows reporting authority misbehavior (eg authoring competing blocks at the same height), and the authority loses their tokens. There are often block rewards too like PoW.
+The basic idea is that anyone can lock up some tokens on chain (in the state machine).
+The participants with the most tokens staked are elected as the authorities.
+There is a state transition that allows reporting authority misbehavior (eg authoring competing blocks at the same height), and the authority loses their tokens.
+There are often block rewards too like PoW.
---v
@@ -407,7 +457,13 @@ In Substrate there is a concept of a **Runtime API** - Consensus can read inform
Notes:
-So far I've presented consensus as orthogonal to the state machine. This is mostly true. But in practice it is extremely common for there to be some loose coupling. We already saw an example when we talked about block rewards. The consensus authors are rewarded with tokens (in the state machine) for authoring blocks. Now we see that they can have tokens slashed (in state machine) for breaking consensus protocol. And we see that even the very authorities can be elected in the state machine.
+So far I've presented consensus as orthogonal to the state machine.
+This is mostly true.
+But in practice it is extremely common for there to be some loose coupling.
+We already saw an example when we talked about block rewards.
+The consensus authors are rewarded with tokens (in the state machine) for authoring blocks.
+Now we see that they can have tokens slashed (in state machine) for breaking consensus protocol.
+And we see that even the very authorities can be elected in the state machine.
---
@@ -428,7 +484,9 @@ Each node's preference for which fork is best
Notes:
-The fork choice allows you, as a network participant, to decide which fork you consider best for now. It is not binding. Your opinion can change as you see more blocks appear on the network
+The fork choice allows you, as a network participant, to decide which fork you consider best for now.
+It is not binding.
+Your opinion can change as you see more blocks appear on the network
---v
@@ -442,12 +500,19 @@ Dropped transactions re-enter tx pool and re-appear in new blocks shortly
+
- Efficiency
+
+
- Tool Simplicity
+
+
- Support as Compilation Target
+
+
- Sandboxing
+
Notes:
@@ -268,10 +278,15 @@ Those things can't be addressed by the PAB itself but they can give good guideli
- Rust, C, C++ and many others
- Fast (with near-native performance)
+
+
- Safe (executed in a sandboxed environment)
+
+
- Open (programs can interoperate with their environment)
+
We have a double recursion of a PAB that embed itself
diff --git a/content/blockchain-contracts/coordination-trust/slides.md b/content/blockchain-contracts/coordination-trust/slides.md
index 45f2c3b..b9a5c58 100644
--- a/content/blockchain-contracts/coordination-trust/slides.md
+++ b/content/blockchain-contracts/coordination-trust/slides.md
@@ -7,7 +7,6 @@ description: Principles of coordination, contracts, smart contracts, and compari
Notes:
-Intro
In this module we're going to talk about Smart Contracts.
---
@@ -24,11 +23,12 @@ _aka Szabo definition_
+Personal trust - you can build it over time through a slow give and take like you do with your family or long term business partners.
Notes:
@@ -232,10 +235,10 @@ Anyone? (check for nods)
_So, some personal historical context on me_, when I was a newbie in the web3 space, I hadn’t heard this phrase (or slogan rather?).
I saw it on ppl’s shirts and felt sort of confused and honestly, kind of excluded from what felt like maybe an inside joke.
-I remember thinking, _wait, I trust people, does that make me wrong? Is that a bad thing?_
-I asked myself the question, _why is trust such a dirty world in our world?_
+I remember thinking, _wait, I trust people, does that make me wrong... Is that a bad thing_?
+I asked myself the question, _why is trust such a dirty world in our world_?
Well, in time, thanks to some of my fellow instructors in the room, I came to understand that this phrase is referring to the fact that life is not all sunshine and roses! Not all relationships and interactions are filled with trustful actors.
-In fact, most aren't!
+In fact, most aren't!
Literally every day we're in situations in which we are forced to treat complete strangers as if we've established real, authentic trust between one another.
Treat them as if they're a close friend or business partner.
And _that_ is definitely bad, and is a dirty word, and is a thing that we really shouldn't do.
@@ -261,7 +264,7 @@ So.
We know that we don't have the luxury of only interacting with people we truly personally trust.
It's impossible to get personal trust with every person you'd in theory like to because it takes a super long time to bootstrap that real kind of relationship.
And frankly, sometimes you want to interact with a stranger more immediately, say today, and not have to court them for years upon years.
-So, again, this should lead us to the question of - how do you handle these every day situations? How DO I trust that the coffee guy isn't going to run off with my credit card details?
+So, again, this should lead us to the question of - how do you handle these every day situations? How DO I trust that the coffee guy isn't going to run off with my credit card details?
CLICK - Well, that's where rational expectations come into play.
This is a game theory, incentives-based concept.
Where you believe credibly that a person _will_ act faithfully according to an agreement you've made - because the incentives make them do so.
@@ -278,7 +281,7 @@ Notes:
Again, I want to make sure you're all hearing me when I say that personal/familial trust is not wrong, or bad, or dirty.
I don’t want us all walking out here calling our moms and dissolving our trust with them.
-That just isn’t the scenario we speak to when we say 'trust is dirty'
+That just isn’t the scenario we speak to when we say 'trust is dirty'.
And further, if you have someone who you genuinely trust, you can actually get things done a whole lot faster and more efficiently by leveraging that trust.
So, it may be worth it to bootstrap genuine personal trust.
You know, start small, accept a small bit of risk and gradually increase that over time.
@@ -304,7 +307,7 @@ Often they are civic duty based - the fear that society or your town will turn o
OR they're morality or religion based - you know, you keep your promise to someone out of fear of otherwise going to hell.
Or they are based on the fact that you have a reputation to uphold.
You don't want to be known as a liar or a cheat.
-I think you get what I'm saying here, yeah?
+I think you get what I'm saying here, yeah?
It's social norms and expectations that keep people.
Reputation is on the line.
And this can get society pretty far.
@@ -344,7 +347,7 @@ I think this is his way of saying that we need some bigger and more resilient co
Notes:
-So how do we incentivize people to keep their promises beyond a civic duty?
+So how do we incentivize people to keep their promises beyond a civic duty?
Ding ding ding - Finally! This brings us to the idea of contracts.
They're basically, pretty much, promises.
They could involve money, a lot of them do, though they don't have to.
@@ -414,10 +417,11 @@ Notes:
So yeah, that's the goal and what we're trying to solve.
But, again, just before we go any further, let’s make sure we’re all on the same page about what a contract itself is.
A promise, made between parties, backed by the government, to coordinate together to accomplish something together.
-The notion of promise is very abstract:
-It could involve coordinating over time.
-It could involve money or even credit.
-It also could have multiple possible valid outcomes.
+The notion of promise is very abstract:
+
+- It could involve coordinating over time.
+- It could involve money or even credit.
+- It also could have multiple possible valid outcomes.
Okay.
Cool.
@@ -441,9 +445,7 @@ And together we'll develop and tease out those same comparisons here.
@@ -336,7 +336,7 @@ Up to this point, we covered:
## Reliable broadcast in practice
-
@@ -355,10 +355,10 @@ Atomic broadcast
## Randomness formalized
-
@@ -366,7 +366,7 @@ Randomness beacon
## Atomic broadcast: timeline
-
@@ -374,7 +374,7 @@ Randomness beacon
## Atomic broadcast: timeline
-
@@ -382,7 +382,7 @@ Randomness beacon
## Fun fact
-
@@ -446,10 +446,10 @@ Directed Acyclic Graph
## How does it relate to consensus?
-
@@ -457,7 +457,7 @@ Intuition: graph represents the dependencies between messages (units).
## Framework core
-
@@ -502,7 +502,7 @@ Intuition: graph represents the dependencies between messages (units).
## Randomness? Where is randomness?
-
@@ -594,7 +594,7 @@ Aleph Zero BFT protocol
## Building blocks
-
@@ -602,7 +602,7 @@ Aleph Zero BFT protocol
## Choosing head
-
@@ -610,7 +610,7 @@ Aleph Zero BFT protocol
## Availability determination
-
@@ -662,7 +662,7 @@ Sig`sk`(nonce)
## Standard way
-
@@ -672,7 +672,7 @@ Problem: need for trusted dealer!
## One simple trick
-
diff --git a/content/blockchain-contracts/econ-game-theory/slides.md b/content/blockchain-contracts/econ-game-theory/slides.md
index 26041aa..d246ca8 100644
--- a/content/blockchain-contracts/econ-game-theory/slides.md
+++ b/content/blockchain-contracts/econ-game-theory/slides.md
@@ -533,7 +533,7 @@ Things like Twitter, Facebook or Bitcoin are often deemed as valuable because of
## Nash Equilibrium
-
Notes:
@@ -992,8 +993,8 @@ And that's a very very hard task.
#### _Oracles_
Oracles are blockchain entities that provide information from the outside world to the blockchain.
-
Notes:
@@ -1034,8 +1035,8 @@ But what it is exactly?
#### _Oracles_
-
Notes:
@@ -1094,7 +1095,7 @@ Submitting the truth is the Schelling Point in here and it makes it easy to be h
@@ -1113,8 +1114,8 @@ But what if there are some attackers? What can we do about them?
@@ -1632,11 +1640,11 @@ His code was added to the state and now many nodes hold a copy of it.
@@ -1776,7 +1784,7 @@ So what we had originally is Bob paid for his smart contract and then simply wen
#### _Ethereum State Storage Issue_
-
@@ -1821,11 +1829,11 @@ When choosing between 10 and 30$ the opportunity cost of picking 30 is 10, the o
-
Notes:
@@ -532,13 +564,14 @@ Previously we talked about how a node's view of the best block can change, and t
## Modified Fork Choice Rule
-
Only extend best finalized chain
Notes:
-Once you have a finality gadget installed, you have to make sure you only ever author on top of finalized blocks. Even if another chain is longer.
+Once you have a finality gadget installed, you have to make sure you only ever author on top of finalized blocks.
+Even if another chain is longer.
---
@@ -547,7 +580,7 @@ Once you have a finality gadget installed, you have to make sure you only ever a
@@ -29,7 +29,7 @@ In an ideal world blockchains would look like this:
Things don't always go according to plan:
-
@@ -41,7 +41,7 @@ Things don't always go according to plan:
And sometimes they get extra messy:
-
@@ -86,9 +86,9 @@ It will cover most of the common terms and hopefully will not be as self-contrad
#### _Fork Confusion_
-
Notes:
@@ -108,7 +108,7 @@ Some of you might have heard about soft forks and hard forks, any idea which one
#### _Forks Family Tree_
-
Notes:
@@ -131,7 +131,7 @@ For that we'll talk about transitory forks.
#### _Transitory Forks_
-
Notes:
@@ -143,7 +143,7 @@ They are often also called short-lived forks or temporary forks.
## Transitory Forks
-
Notes:
@@ -169,7 +169,7 @@ Consensus forks.
#### _Consensus Forks_
-
Notes:
@@ -193,7 +193,7 @@ But first before we understand the intricacies of consensus forks we need to und
#### _Validity Set_
-
Notes:
@@ -203,7 +203,7 @@ You don't need to understand all the fields that are in it but for now take a lo
#### _Validity Set_
-
---v
@@ -212,7 +212,7 @@ You don't need to understand all the fields that are in it but for now take a lo
#### _Validity Set_
-
---v
@@ -221,7 +221,7 @@ You don't need to understand all the fields that are in it but for now take a lo
#### _Validity Set_
-
Notes:
@@ -237,7 +237,7 @@ So if there is a block D that for instance is too big, it's blocksize is bigger
#### _Validity Set_
-
Notes:
@@ -251,7 +251,7 @@ Only some of those data blobs are valid blocks.
#### _Validity Set_
-
Notes:
@@ -269,7 +269,7 @@ They only like when it's even so they band together and change the protocol to o
#### _Validity Set_
-
Notes:
@@ -314,7 +314,7 @@ To understand the example from a second ago we'll dive into soft forks.
#### _Soft Forks_
-
Notes:
@@ -363,7 +363,7 @@ Before we jump into demonstration is decreasing or increasing blocksize a soft f
Notes:
@@ -495,7 +495,7 @@ TL;DR the stuff we removed from the validity set wasn't even used despite being
---v
@@ -577,7 +577,7 @@ Notes:
- 
- 
---v
@@ -705,7 +705,7 @@ We only have permanent forks in soft forks with under 50% support and in hard fo
@@ -1337,7 +1334,7 @@ impl MyContract {
## Interacting with the state transition function
-
@@ -1623,7 +1620,7 @@ impl ChainExtension
-Uses an unspent transaction output (UTXO) model & Proof of Work (PoW) consensus.
+Uses an unspent transaction output (UTXO) model & Proof of Work (PoW) consensus.
+
+
Notes:
@@ -256,10 +278,10 @@ Let the market decide.
-A state machine can have different possible histories. These are called forks.
+A state machine can have different possible histories.
+These are called forks.
Notes:
-You can think of them like alternate realities. We need to decide which of the many possible forks is ultimately the "real" one. This is the core job of consensus and we will talk about it in two upcoming lessons in this module.
+You can think of them like alternate realities.
+We need to decide which of the many possible forks is ultimately the "real" one.
+This is the core job of consensus and we will talk about it in two upcoming lessons in this module.
---v
@@ -147,8 +170,10 @@ Before we even get to hardcore consensus, we can rule out _some_ possibilities b
Notes:
-The header is a minimal amount of information. In some ways it is like metadata.
-The body contains the real "payload". It is almost always a batch of state transitions.
+The header is a minimal amount of information.
+In some ways it is like metadata.
+The body contains the real "payload".
+It is almost always a batch of state transitions.
There are many name aliases for what is included in the body:
- Transitions
@@ -171,7 +196,8 @@ pub struct Block
@@ -762,7 +762,7 @@ Dynamic first-price auction with _random ending time._
## Sniping
-_Answer:_ **candle auctions.**
@@ -217,7 +217,6 @@ DownwardMessages: StorageMap
diff --git a/content/security/overview/slides.md b/content/security/overview/slides.md
index 68a630a..8e71448 100644
--- a/content/security/overview/slides.md
+++ b/content/security/overview/slides.md
@@ -77,7 +77,7 @@ Notes:
- 
@@ -242,14 +259,23 @@ needs of the future.
### 🤩 Generic, Modular and Extensible Design
- Multiple consensus engines (BABE/Grandpa/AURA/PoW/Sassafras)
+
+
- Multiple network protocols (QUIC, TCP)
+
+
- Multiple database implementations (ParityDB, RocksDB)
+
+
- Highly configurable, graph-based transaction-pool.
+
+
- Easy to change primitives: AccountId, Signature, BlockNumber, Header, Hash, and many more.
+
Notes:
@@ -288,10 +314,15 @@ particular implementation.
- We have correct code, and components are easy to swap, replace, and upgrade.
- What use is that, if we cannot agree on what to replace/upgrade?
- Governance!
+
+
- What use is governance, if the upgrade cannot be enacted?
+
+
- (trustlessly) Upgradeability!
+
Notes:
@@ -594,8 +625,11 @@ bug in it, everyone is affected.
- Yes, consensus is not a core part of a blockchain runtime. Why?
- Not part of your STF!
+
+
- The consensus protocol is to your runtime what HTTP is to Facebook.
+
Notes:
@@ -630,8 +664,11 @@ state is sometimes called "storage" asd well.
- Yes, data is stored outside of the runtime. Why?
- Wasm runtime does not have the means to store it.
+
+
- Yet, the interpretation of the data is up to the runtime.
+
---v
@@ -985,12 +1022,9 @@ Notes:
- 
diff --git a/content/xcm/pallet/slides.md b/content/xcm/pallet/slides.md
index a7b051e..651434d 100644
--- a/content/xcm/pallet/slides.md
+++ b/content/xcm/pallet/slides.md
@@ -84,14 +84,12 @@ Notes:
Executed on behalf of FRAME's signed origin.