Subscribe to the latest project news! Follow @ardor_world

REDDIT

TWITTER

TWITTER

RSS
#### Jelurida’s Weekly Wins - February 15, 2019

Jelurida’s Weekly Wins - February 15, 2019
Updated Product Roadmaps Underway; Load Testing Lab Setup; Jelurida Pitches in Lucerne; Ardor Interview Featured on CoinBureau; Ardor Javascript Wrappers Now on Github; Resource Roundup Is Entering Phase II; ICYMI: Ardor Lite Wallet on iOS and Android
Read more about Jelurida’s Weekly Wins - February 15, 2019

Feb. 15, 2019, 10:52 p.m.

Open Link

Feb. 15, 2019, 10:52 p.m.

Open Link

TWITTER

TWITTER

Simple Zero Knowledge Proof Example https://t.co/NQFNZPcyGq based on my own understanding

Open Link

@lioryaffe

Feb. 15, 2019, 2:16 p.m.

Feb. 15, 2019, 2:16 p.m.

Open Link

RSS
#### Zero Knowledge Proof Example

Jigsaw Puzzle by MadfoxZero knowledge proofs are becoming the new buzzword in blockchain circles. But how can you explain it to your 13 year-old son?As a thought experiment, I decided to role play my own sample of a zero knowledge proof, which requires only minimal math knowledge. Please bear in mind that this is not an academic paper.Here we go:Say, Alice and Bob are master builders of jigsaw puzzles. They want to compete to see who assembles a 1000 piece puzzle faster when neither one knows what the finished puzzle should look like.They ask Charlie, a random man they met outside the toy store, to buy two sets of the same puzzle model. On the complete set, they ask Charlie to enumerate the pieces of both puzzles randomly with unique numbers between 0 and 999. Charlie uses the same number for the same piece on the different sets (i.e. piece numbered 255 on set #1 is the same piece numbered 255 on set #2, and so on). Charlie then shuffles both sets, throws the pieces of each puzzle in a plastic bag, and gives one set of 1000 numbered pieces to Alice and the other set to Bob. Charlie then goes back to the store and destroys every remaining copy of the puzzle set.At this point, Charlie is relieved of his duty and both parties no longer use his services ever again.The competition begins.Alice, being the faster of the two, completes her puzzle first. She now wants to prove to Bob that she’s holding a complete set, but since she doesn’t trust Bob not to copy her set and claim victory, she wants to prove her win to Bob without revealing what the completed puzzle looks like.Given these circumstances, Alice is the “prover” and Bob is the “verifier”, they both perform the following procedure.Bob selects a random piece from his yet unassembled puzzle set and sends Alice the piece number. Alice then photographs this assembled piece connected to other pieces from every side on her puzzle (edge pieces will have one side unconnected and corner pieces two sides unconnected). She sends the photo to Bob to convince him that, indeed, this random piece he selected is part of the assembled puzzle. Bob compares the piece in Alice’s photo to his own copy of the piece and verifies the match. Consider that by doing so, Bob did not learn anything about the structure of the puzzle that he could not deduce by looking at his piece, except that he now knows that this piece is included in Alice’s puzzle.If Alice completed only half of the puzzle at this point, she only has about 50% chance to correctly photo a random assembled piece.They now repeat the process again and again, with each photo of assembled piece Alice sends that shows an assembled piece, Bob becomes more convinced that Alice indeed holds a fully assembled set of the puzzle.If Alice only completed half of the puzzle, her chance of misleading Bob 128 times in a row is 1 in 2¹²⁸, which is clearly impossible. Even if she completed a higher proportion of the puzzle but not the whole set, repeating this process enough times will eventually expose her bluff.Still, even after 128 attempts, Bob did not learn anything about the full structure of the puzzle.The beauty of this system is that even if the puzzle has a million or a billion or 2²⁵⁶ pieces, the same method can be used to prove to Bob that Alice completed the puzzle with the same guarantees.This method is called an interactive zero knowledge proof. Alice has proven a statement to Bob without Bob learning anything about this statement.But can Alice prove the same without the tedious interactive communication with Bob? It turns out that she can!Given that the first number received from Bob is x, Alice can calculate x² mod 1000, x³ mod 1000, … ,x¹²⁸ mod 1000 and send Bob 128 photos of the resulting piece numbers.Calculation mod 1000 is very simple, all you need to do is use the last three digits of any resulting number.Examples:0 mod 1000 = 0, 1 mod 1000 = 1, 2 mod 1000 = 2, … ,999 mod 1000 = 999, 1000 mod 1000 = 0, 1001 mod 1000 = 1, … ,2003 mod 1000 = 3, …, 987654321 mod 1000 = 321Addition works like this:(2 + 3) mod 1000 = 5(2 + 999) mod 1000 = 1001 mod 1000 = 1Multiplication and powers:(7*11*13) mod 1000 = 1001 mod 1000 = 12¹⁰ mod 1000 = (2*2*2*2*2*2*2*2*2*2) mod 1000 = 1024 mod 1000 = 24Using this method, assuming the random number provided by Bob is 255, Alice starts to calculate powers of this number, she calculates 255² = 255*255 = 65025, she then calculates 65025 mod 1000 to receive 25 as the 2nd number. She then calculates x³, i.e. 255 * 255 * 255 = 25 * 255 = 6375 and, this time, uses the last 3 digits 375 as the next number. She then calculates 375*255 = 95625 to get 625 and so on. If one of the numbers repeats, she adds 1 to it until receiving a new number, wrapping around from 999 to 0 if necessary, and then continuing to multiply by 255.She then takes the resulting 128 unique numbers and sends the corresponding photos of these assembled pieces to Bob in a single message. Bob can repeat the calculation and verify that indeed these 128 photos correspond to pieces derived from his initial random number, which Alice could not have known in advance.Bob is now convinced beyond a shadow of a doubt that Alice completed the puzzle with only a single message to Alice and a single response from her. But still Bob, even though he has to admit his defeat, knows nothing he did not already know about the full structure of the puzzle.It turns out similar methods, albeit much more sophisticated, can be used in the blockchain world to improve privacy and optimize performance. But more on this in another article.Zero Knowledge Proof Example was originally published in Hacker Noon on Medium, where people are continuing the conversation by highlighting and responding to this story.

Feb. 15, 2019, 2:15 p.m.

Open Link

Feb. 15, 2019, 2:15 p.m.

Open Link

RSS
#### Zero Knowledge Proof Example

Jigsaw Puzzle by MadfoxZero knowledge proofs are becoming the new buzzword in blockchain circles. But how can you explain it to your 13 year-old son?As a thought experiment, I decided to role play my own sample of a zero knowledge proof, which requires only minimal math knowledge. Please bear in mind that this is not an academic paper.Here we go:Say, Alice and Bob are master builders of jigsaw puzzles. They want to compete to see who assembles a 1000 piece puzzle faster when neither one knows what the finished puzzle should look like.They ask Charlie, a random man they met outside the toy store, to buy two sets of the same puzzle model. On the complete set, they ask Charlie to enumerate the pieces of both puzzles randomly with unique numbers between 0 and 999. Charlie uses the same number for the same piece on the different sets (i.e. piece numbered 255 on set #1 is the same piece numbered 255 on set #2, and so on). Charlie then shuffles both sets, throws the pieces of each puzzle in a plastic bag, and gives one set of 1000 numbered pieces to Alice and the other set to Bob. Charlie then goes back to the store and destroys every remaining copy of the puzzle set.At this point, Charlie is relieved of his duty and both parties no longer use his services ever again.The competition begins.Alice, being the faster of the two, completes her puzzle first. She now wants to prove to Bob that she’s holding a complete set, but since she doesn’t trust Bob not to copy her set and claim victory, she wants to prove her win to Bob without revealing what the completed puzzle looks like.Given these circumstances, Alice is the “prover” and Bob is the “verifier”, they both perform the following procedure.Bob selects a random piece from his yet unassembled puzzle set and sends Alice the piece number. Alice then photographs this assembled piece connected to other pieces from every side on her puzzle (edge pieces will have one side unconnected and corner pieces two sides unconnected). She sends the photo to Bob to convince him that, indeed, this random piece he selected is part of the assembled puzzle. Bob compares the piece in Alice’s photo to his own copy of the piece and verifies the match. Consider that by doing so, Bob did not learn anything about the structure of the puzzle that he could not deduce by looking at his piece, except that he now knows that this piece is included in Alice’s puzzle.If Alice completed only half of the puzzle at this point, she only has about 50% chance to correctly photo a random assembled piece.They now repeat the process again and again, with each photo of assembled piece Alice sends that shows an assembled piece, Bob becomes more convinced that Alice indeed holds a fully assembled set of the puzzle.If Alice only completed half of the puzzle, her chance of misleading Bob 128 times in a row is 1 in 2¹²⁸, which is clearly impossible. Even if she completed a higher proportion of the puzzle but not the whole set, repeating this process enough times will eventually expose her bluff.Still, even after 128 attempts, Bob did not learn anything about the full structure of the puzzle.The beauty of this system is that even if the puzzle has a million or a billion or 2²⁵⁶ pieces, the same method can be used to prove to Bob that Alice completed the puzzle with the same guarantees.This method is called an interactive zero knowledge proof. Alice has proven a statement to Bob without Bob learning anything about this statement.But can Alice prove the same without the tedious interactive communication with Bob? It turns out that she can!Given that the first number received from Bob is x, Alice can calculate x² mod 1000, x³ mod 1000, … ,x¹²⁸ mod 1000 and send Bob 128 photos of the resulting piece numbers.Calculation mod 1000 is very simple, all you need to do is use the last three digits of any resulting number.Examples:0 mod 1000 = 0, 1 mod 1000 = 1, 2 mod 1000 = 2, … ,999 mod 1000 = 999, 1000 mod 1000 = 0, 1001 mod 1000 = 1, … ,2003 mod 1000 = 3, …, 987654321 mod 1000 = 321Addition works like the same:(2 + 3) mod 1000 = 5(2 + 999) mod 1000 = 1001 mod 1000 = 1Multiplication and powers:(7*11*13) mod 1000 = 1001 mod 1000 = 12¹⁰ mod 1000 = (2*2*2*2*2*2*2*2*2*2) mod 1000 = 1024 mod 1000 = 24Using this method, assuming the random number provided by Bob is 255, Alice starts to calculate powers of this number, she calculates 255² = 255*255 = 65025, she then calculates 65025 mod 1000 to receive 25 as the 2nd number. She then calculates x³, i.e. 255 * 255 * 255 = 25 * 255 = 6375 and, this time, uses the last 3 digits 375 as the next number. She then calculates 375*255 = 95625 to get 625 and so on. If one of the numbers repeats, she adds 1 to it until receiving a new number, wrapping around from 999 to 0 if necessary, and then continuing to multiply by 255.She then takes the resulting 128 unique numbers and sends the corresponding photos of these assembled pieces to Bob in a single message. Bob can repeat the calculation and verify that indeed these 128 photos correspond to pieces derived from his initial random number, which Alice could not have known in advance.Bob is now convinced beyond a shadow of a doubt that Alice completed the puzzle with only a single message to Alice and a single response from her. But still Bob, even though he has to admit his defeat, knows nothing he did not already know about the full structure of the puzzle.It turns out similar methods, albeit much more sophisticated, can be used in the blockchain world to improve privacy and optimize performance. But more on this in another article.

Feb. 15, 2019, 2:15 p.m.

Open Link

Feb. 15, 2019, 2:15 p.m.

Open Link

RSS
#### Zero Knowledge Proof Example

Jigsaw Puzzle by MadfoxZero knowledge proofs are becoming the new buzzword in blockchain circles. But how can you explain it to your 13 year-old son?As a thought experiment, I decided to role play my own sample of a zero knowledge proof, which requires only minimal math knowledge. Please bear in mind that this is not an academic paper.Here we go:Say, Alice and Bob are master builders of jigsaw puzzles. They want to compete to see who assembles a 1000 piece puzzle faster when neither one knows what the finished puzzle should look like.They ask Charlie, a random man they met outside the toy store, to buy two sets of the same puzzle model. On the complete set, they ask Charlie to enumerate the pieces of both puzzles randomly with unique numbers between 0 and 999. Charlie uses the same number for the same piece on the different sets (i.e. the piece numbered 255 on set #1 is the same piece numbered 255 on set #2, and so on). Charlie then shuffles both sets, throws the pieces of each puzzle in a plastic bag, and gives one set of 1000 numbered pieces to Alice and the other set to Bob. Charlie then goes back to the store and destroys every remaining copy of the puzzle set.At this point, Charlie is relieved of his duty and both parties no longer use his services ever again.The competition begins.Alice, being the faster of the two, completes her puzzle first. She now wants to prove to Bob that she’s holding a complete set, but since she doesn’t trust Bob not to copy her set and claim victory, she wants to prove her win to Bob without revealing what the completed puzzle looks like.Given these circumstances, Alice is the “prover” and Bob is the “verifier”, they both perform the following procedure.Bob selects a random piece from his yet unassembled puzzle set and sends Alice the piece number. Alice then photographs this assembled piece connected to other pieces from every side on her puzzle (edge pieces will have one side unconnected and corner pieces two sides unconnected). She sends the photo to Bob to convince him that, indeed, this random piece he selected is part of the assembled puzzle. Bob compares the piece in Alice’s photo to his own copy of the piece and verifies the match. Consider that by doing so, Bob did not learn anything about the structure of the puzzle that he could not deduce by looking at his piece, except that he now knows that this piece is included in Alice’s puzzle.If Alice completed only half of the puzzle at this point, she only has about 50% chance to correctly photo a random assembled piece.They now repeat the process again and again, with each photo of assembled piece Alice sends that shows an assembled piece, Bob becomes more convinced that Alice indeed holds a fully assembled set of the puzzle.If Alice only completed half of the puzzle, her chance of misleading Bob 128 times in a row is 1 in 2¹²⁸, which is clearly impossible. Even if she completed a higher proportion of the puzzle but not the whole set, repeating this process enough times will eventually expose her bluff.Still, even after 128 attempts, Bob did not learn anything about the full structure of the puzzle.The beauty of this system is that even if the puzzle has a million or a billion or 2²⁵⁶ pieces, the same method can be used to prove to Bob that Alice completed the puzzle with the same guarantees.This method is called an interactive zero knowledge proof. Alice has proven a statement to Bob without Bob learning anything about this statement.But can Alice prove the same without the tedious interactive communication with Bob? It turns out that she can!Given that the first number received from Bob is x, Alice can calculate x² mod 1000, x³ mod 1000, … ,x¹²⁸ mod 1000 and send Bob 128 photos of the resulting piece numbers.Calculation mod 1000 is very simple, all you need to do is use the last three digits of any resulting number.Examples:0 mod 1000 = 0, 1 mod 1000 = 1, 2 mod 1000 = 2, … ,999 mod 1000 = 999, 1000 mod 1000 = 0, 1001 mod 1000 = 1, … ,2003 mod 1000 = 3, …, 987654321 mod 1000 = 321Addition works like this:(2 + 3) mod 1000 = 5(2 + 999) mod 1000 = 1001 mod 1000 = 1Multiplication and powers:(7*11*13) mod 1000 = 1001 mod 1000 = 12¹⁰ mod 1000 = (2*2*2*2*2*2*2*2*2*2) mod 1000 = 1024 mod 1000 = 24Using this method, assuming the random number provided by Bob is 255, Alice starts to calculate powers of this number, she calculates 255² = 255*255 = 65025, she then calculates 65025 mod 1000 to receive 25 as the 2nd number. She then calculates x³, i.e. 255 * 255 * 255 = 25 * 255 = 6375 and, this time, uses the last 3 digits 375 as the next number. She then calculates 375*255 = 95625 to get 625 and so on. If one of the numbers repeats, she adds 1 to it until receiving a new number, wrapping around from 999 to 0 if necessary, and then continuing to multiply by 255.She then takes the resulting 128 unique numbers and sends the corresponding photos of these assembled pieces to Bob in a single message. Bob can repeat the calculation and verify that indeed these 128 photos correspond to pieces derived from his initial random number, which Alice could not have known in advance.Bob is now convinced beyond a shadow of a doubt that Alice completed the puzzle with only a single message to Alice and a single response from her. But still Bob, even though he has to admit his defeat, knows nothing he did not already know about the full structure of the puzzle.It turns out similar methods, albeit much more sophisticated, can be used in the blockchain world to improve privacy and optimize performance. But more on this in another article.https://medium.com/media/3c851dac986ab6dbb2d1aaa91205a8eb/hrefZero Knowledge Proof Example was originally published in HackerNoon.com on Medium, where people are continuing the conversation by highlighting and responding to this story.

Feb. 15, 2019, 2:15 p.m.

Open Link

Feb. 15, 2019, 2:15 p.m.

Open Link

TWITTER

Have a #physical or #digital product to sell? Why not try listing and selling it in the #Nxt #Marketplace? It's the… https://t.co/gH2BOHIqio

Open Link

@NxtCommunity

Feb. 15, 2019, 1:14 p.m.

Feb. 15, 2019, 1:14 p.m.

Open Link

TWITTER

RT @AvdiuSazan: Ardor (ARDR) – Should You Invest in Ardor?
What is Ardor?
Ardor is focussed on Blockchain-as-a-Service and makes it easy fo…

Open Link

@Ardor_Nxt_Group

Feb. 15, 2019, 11:46 a.m.

Feb. 15, 2019, 11:46 a.m.

Open Link

TWITTER

RT @ArdorBlockchain: Use #Ardor Lite Wallet on your phone for $ARDR $IGNIS $AEUR $BITS $MPG transactions from your #mobile. Links to the…

Open Link

@Ardor_Nxt_Group

Feb. 15, 2019, 11:43 a.m.

Feb. 15, 2019, 11:43 a.m.

Open Link

TWITTER

Stop worrying. Start transacting on the #blockchain with no risk of sending funds to the wrong account address than… https://t.co/NZedfunQbV

Open Link

@ArdorPlatform

Feb. 15, 2019, 9:27 a.m.

Feb. 15, 2019, 9:27 a.m.

Open Link

TWITTER

TWITTER

RT @NxtCommunity: Happy Valentine's Day to all Nxters! 💙🚀😍We are lucky to have one of the greatest communities in the #blockchain world! Jo…

Open Link

@NxtCommunity

Feb. 14, 2019, 3:44 p.m.

Feb. 14, 2019, 3:44 p.m.

Open Link

TWITTER

With Ardor, participation matters. Become a Forger securing transactions across each #blockchain of #Ardor platform… https://t.co/jjl3QozRla

Open Link

@ArdorPlatform

Feb. 14, 2019, 2:50 p.m.

Feb. 14, 2019, 2:50 p.m.

Open Link

TWITTER

TWITTER

RT @bl0kphile: #ArdorInsights wishes you a happy #ValentinesDay! Do some good for your loved ones and give them the perfect gift: a new #Ar…

Open Link

@ArdorPlatform

Feb. 14, 2019, 1:38 p.m.

Feb. 14, 2019, 1:38 p.m.

Open Link

TWITTER

ArdorJS an #API wrapper for developers on the #Ardor #blockchain has been released thanks to @aajaji_m More than 25… https://t.co/sRJt89mpYz

Open Link

@Ardor_Nxt_Group

Feb. 14, 2019, 1:25 p.m.

Feb. 14, 2019, 1:25 p.m.

Open Link

TWITTER

RT @Malnemark1: The #Ardor community started a state-of-the-art, #RxJS observable based javascript API. Thats great news, well done @aajaji…

Open Link

@Ardor_Nxt_Group

Feb. 14, 2019, 12:14 p.m.

Feb. 14, 2019, 12:14 p.m.

Open Link

TWITTER

There's a lot to learn if you are new to #blockchain & distributed #ledger- join our community discussion on… https://t.co/EwF1o5dWuN

Open Link

@IGNISguide

Feb. 14, 2019, 11:52 a.m.

Feb. 14, 2019, 11:52 a.m.

Open Link

TWITTER

Happy Valentine's Day to our dedicated community! Thanks for the hours spent using, testing, & supporting #Ardor. M… https://t.co/IElVst97wl

Open Link

@ArdorPlatform

Feb. 14, 2019, 9:27 a.m.

Feb. 14, 2019, 9:27 a.m.

Open Link

TWITTER

While @Jelurida is hard at work updating the company website to better reflect the value proposition of our product… https://t.co/8ufvp6sbUQ

Open Link

@IGNISguide

Feb. 13, 2019, 8:58 p.m.

Feb. 13, 2019, 8:58 p.m.

Open Link

TWITTER

Starting my long way home after a wonderful week in Lugano. Team #Jelurida made a lot of progress with strategy and… https://t.co/6M4IpLSQ3M

Open Link

@lioryaffe

Feb. 13, 2019, 5:45 p.m.

Feb. 13, 2019, 5:45 p.m.

Open Link

TWITTER

TWITTER

RT @takpol13: #Triffic One Pager from the https://t.co/uqYPZ2UOz5 https://t.co/E3ziKuWrNW

Open Link

@IGNISguide

Feb. 13, 2019, 3:46 p.m.

Feb. 13, 2019, 3:46 p.m.

Open Link

TWITTER

RT @CryptoDemetrius: There is an opportunity for a real conversation to happen here, but only if we are open and honest about the current s…

Open Link

@IGNISguide

Feb. 13, 2019, 3:10 p.m.

Feb. 13, 2019, 3:10 p.m.

Open Link

TWITTER

What is #Ardor, what can it do, and how do I fund my account? Visit https://t.co/XPyzOuCzxb and get started on your… https://t.co/qeXfflAKr5

Open Link

@ArdorPlatform

Feb. 13, 2019, 2:50 p.m.

Feb. 13, 2019, 2:50 p.m.

Open Link

TWITTER

RT @TarascaD: An editorial is going to publish a game of physical cards with our creatures! More info coming soon. https://t.co/aiU9F5dsWH

Open Link

@Ardor_Nxt_Group

Feb. 13, 2019, 11:42 a.m.

Feb. 13, 2019, 11:42 a.m.

Open Link

TWITTER

RT @ArdorBlockchain: Hint: don't let the kids play with the #crypto 😀Use #Ardor Lite Wallet on your phone for $ARDR $IGNIS $AEUR $BITS $M…

Open Link

@Ardor_Nxt_Group

Feb. 13, 2019, 11:42 a.m.

Feb. 13, 2019, 11:42 a.m.

Open Link

TWITTER

RT @ShopBitswift: New #Bitswift.shop is under development and you all are going to like it!

Open Link

@Ardor_Nxt_Group

Feb. 13, 2019, 11:42 a.m.

Feb. 13, 2019, 11:42 a.m.

Open Link

TWITTER

RT @ArdorBlockchain: $IGNIS #assets on #Ardor support most of the #erc20 operations out of the box and are ready to work with Lightweight #…

Open Link

@Ardor_Nxt_Group

Feb. 13, 2019, 11:41 a.m.

Feb. 13, 2019, 11:41 a.m.

Open Link

TWITTER

RT @bl0kphile: #ArdorInsights Privacy is still one of the Top #Blockchain trends. But it does not necessarily have to be associated with cr…

Open Link

@ArdorPlatform

Feb. 13, 2019, 9:39 a.m.

Feb. 13, 2019, 9:39 a.m.

Open Link

TWITTER

Get your #Ardor, #Nxt and #Ignis crypto swag and use it as a starting point to let the world know about the $ARDR,… https://t.co/95aMlyHMWh

Open Link

@Ardor_Nxt_Group

Feb. 13, 2019, 9 a.m.

Feb. 13, 2019, 9 a.m.

Open Link

TWITTER

ICYMI: #Nxt is ongoing performance optimizations and the improvements will be available in the next release $NXT… https://t.co/O4GZzrFy80

Open Link

@NxtCommunity

Feb. 12, 2019, 5:06 p.m.

Feb. 12, 2019, 5:06 p.m.

Open Link

TWITTER

TWITTER

Get the Ardor Lite app on your #iPhone and #Android devices NOW! Managing your #Ardor and #Ignis tokens on-the-go h… https://t.co/F6BP07VVs3

Open Link

@ArdorPlatform

Feb. 12, 2019, 2:50 p.m.

Feb. 12, 2019, 2:50 p.m.

Open Link

TWITTER

RT @Matze19741: If you stop to consider the bloat issues of #Ethereum, why would anyone build another #ERC-20 dApp? Choose a more elegant…

Open Link

@IGNISguide

Feb. 12, 2019, 11:11 a.m.

Feb. 12, 2019, 11:11 a.m.

Open Link

REDDIT

TWITTER

Check out this demo of the winning Identity Verification contract from the recent #Ardor Online Hackathon 2018 - Li… https://t.co/ObilKPocIr

Open Link

@ArdorPlatform

Feb. 11, 2019, 9:27 a.m.

Feb. 11, 2019, 9:27 a.m.

Open Link

TWITTER

RT @bl0kphile: #ArdorInsights Be part of a great community and join 6000 others in Slack! #Ardor #NXT Community is amazing. Happy to see yo…

Open Link

@ArdorPlatform

Feb. 10, 2019, 9:42 p.m.

Feb. 10, 2019, 9:42 p.m.

Open Link

TWITTER

We spent an amazing weekend giving our blockchain projects the run of their lives. We made lot's of experiments, te… https://t.co/NdpHqPbEMp

Open Link

@lioryaffe

Feb. 10, 2019, 9:19 p.m.

Feb. 10, 2019, 9:19 p.m.

Open Link

TWITTER

Public opinion research, #elections, shareholders' voting - all is possible with #Nxt's flexible #decentralized Vot… https://t.co/R8MAvNCqLz

Open Link

@NxtCommunity

Feb. 10, 2019, 9:02 p.m.

Feb. 10, 2019, 9:02 p.m.

Open Link

TWITTER

RT @blockchainguide: @farl @crypto_blkbeard I even got the Nxt book. 😄 Must read for crypto lovers. https://t.co/tKaaA8dSAJ

Open Link

@NxtCommunity

Feb. 10, 2019, 7:28 p.m.

Feb. 10, 2019, 7:28 p.m.

Open Link

TWITTER

RT @AvdiuSazan: @blockchainguide @farl @crypto_blkbeard NXT back in November 2013. Also got the book ✌️ https://t.co/Yh4OaWfpVq

Open Link

@NxtCommunity

Feb. 10, 2019, 7:27 p.m.

Feb. 10, 2019, 7:27 p.m.

Open Link

REDDIT
#### Nxt optimizations

First results from the performance optimization testing of Nxt: the total blockchain download time is twice as fast now! The improvements will be available in the next Nxt release [https://twitter.com/Jelurida/status/1094652108559785986](https://twitter.com/Jelurida/status/1094652108559785986)

/r/Nxt

Feb. 10, 2019, 5:57 p.m.

Open Link

/r/Nxt

Feb. 10, 2019, 5:57 p.m.

Open Link

TWITTER

TWITTER

TWITTER

No one likes transaction fees - particularly volatile fees. That's why the #blockchain "bundling" system on #Ardor… https://t.co/R4P5eK8SBj

Open Link

@ArdorPlatform

Feb. 10, 2019, 9:27 a.m.

Feb. 10, 2019, 9:27 a.m.

Open Link

Previous
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
Next
50

© 2021 “Ardor.World”.

Support: support@ardor.world

Donate ARDOR: ARDOR-P5GE-WNF8-M5CP-8GENB

Donate NXT: NXT-P5GE-WNF8-M5CP-8GENB