kylefang/stacks-puppet-node
1
0
Fork 0
mirror of https://github.com/alexgo-io/stacks-puppet-node.git synced 2026-04-30 04:35:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

globally unique preorders in the example contract. add note about full BNS contract.

Browse Source
This commit is contained in:
Aaron Blankstein
2018-11-29 16:05:29 -06:00
parent 8a1e7bed4b
commit f5087221bc
1 changed files with 21 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
sip/sip-002-smart-contract-language.md
View File

@@ -251,6 +251,7 @@ and _register_. The requirements of the system are as follows:
4. A preorder must have paid at least the price of the name. Names 4. A preorder must have paid at least the price of the name. Names
are represented as integers, and any name less than 100000 costs are represented as integers, and any name less than 100000 costs
1000 microstacks, while all other names cost 100 microstacks. 1000 microstacks, while all other names cost 100 microstacks.
5. Preorder hashs are _globally_ unique.
In this simple scheme, names are represented by integers, but in In this simple scheme, names are represented by integers, but in
practice, a buffer would probably be used. practice, a buffer would probably be used.
@@ -263,8 +264,8 @@ practice, a buffer would probably be used.
(defmap name-map (defmap name-map
((name integer)) ((buyer principal))) ((name integer)) ((buyer principal)))
(defmap preorder-map (defmap preorder-map
((name-hash (buffer 160)) (buyer principal)) ((name-hash (buffer 160)))
((paid integer))) ((buyer principal) (paid integer)))
(define (tx-preorder (define (tx-preorder
(buyer-principal principal) (buyer-principal principal)
@@ -273,9 +274,9 @@ practice, a buffer would probably be used.
(if (stacks-transfer! (if (stacks-transfer!
buyer-principal name-price burn-address name-price) buyer-principal name-price burn-address name-price)
(insert-entry! preorder-map (insert-entry! preorder-map
(tuple #name-hash name-hash (tuple #name-hash name-hash)
#buyer buyer-principal) (tuple #paid name-price
(tuple #paid name-price)) #buyer buyer-principal))
false)) false))
(define (tx-register (define (tx-register
@@ -284,11 +285,9 @@ practice, a buffer would probably be used.
(name integer) (name integer)
(salt integer) (salt integer)
(if (signed-by? buyer-principal) (if (signed-by? buyer-principal)
(let ((preorder-lookup (let ((preorder-entry
(tuple #name-hash (hash160 name salt) (fetch-entry preorder-map
#buyer buyer-principal)) (tuple #name-hash (hash160 name salt))))
(preorder-entry
(fetch-entry preorder-map preorder-lookup))
(name-entry (name-entry
(fetch-entry name-map (tuple #name name)))) (fetch-entry name-map (tuple #name name))))
(if (and (if (and
@@ -298,12 +297,22 @@ practice, a buffer would probably be used.
(eq? name-entry 'null) (eq? name-entry 'null)
;; preorder must have paid enough ;; preorder must have paid enough
(<= (price-funcion name) (<= (price-funcion name)
(get #paid preorder-entry))) (get #paid preorder-entry))
;; preorder must have been buyer-principle
(eq? buyer-principle
(get #buyer preorder-entry)))
(begin (begin
(delete-entry! preorder-lookup)
(insert-entry! name-table (insert-entry! name-table
(tuple #name name) (tuple #name name)
(tuple #owner recipient))) (tuple #owner recipient)))
false)) false))
false))) false)))
``` ```
Note that Blockstack PBC intends to supply a full BNS (Blockstack
Naming System) smart contract, as well as formal proofs that certain
desirable properties hold (e.g. "names are globally unique", "a
revoked name cannot be updated or transferred", "names cost stacks
based on their namespace price function", "only the principal can
reveal a name on registration", etc.).