Can't the be done except by moving real goods around. But this is mainly by definition,, I use the term to model monetary queues in abstract networks, and these network have no mass. How close are sand box to real shopping?
Consider the mall, every person a smart card, every product a smart beacon. Shoppers wander the mall tapping beacons, and scanning price, possibly dropping a bit in. The bid runs up to the computer, upstairs, runs the pit, gets squashed, and product down stairs signals that is bought, the fulfillment contract. The person knows he bough the thing at a fair price that is affordable, with small change somewhere in the system. The card handles that fairly.
The machine, upstairs is running a combined S&L, semi-ixed price, download the sofware, verified, and runs as a money issuer. I mean a real money issuer, it may run a negative bit error for quite some time, under the proper conditions. But, mathematicians, in their brilliance, can prove that almost every where the aggregate bit error is bound. And bit error can be aggregated into coin (I think)
OK, so far we are close to pure sandbox, what about spawn.
Here is where we hack it. The society of teenagers is going to make a run at the sneaker market. They plot, arrive at the same time and all start buying sneakers before the price can rise, because price cannot rise until another pit is spawned! . The machine, upstairs, has to issue more bit error!, but the software is restricted. So, it takes a second to spawn, there it is, the hackable moment. .
The poor clerks is taking off one price beacon, and plying it onto to another, as fast as the teenagers tap away. The pure sandbox was beaten for about a second, but teenagers are good, if they figure this out. They would stock pile an extra pair at home, giving themselves leeway to plan the attack. They always buy in bunches, and pick random days, outfoxing some inventory bot prowling about. Eventually the hack gets priced.
No comments:
Post a Comment