22 ms·

Unfortunately, no. Not at this time. Your node calibrates itself and interprets what it sees in each 2D video frame into the real 3D world by 'knowing' where it

Unfortunately, no. Not at this time. Your node calibrates itself and interprets what it sees in each 2D video frame into the real 3D world by 'knowing' where its 'virtual self' is placed in the 3D map of the real world that you'll find in the GUI. When you set up your node, you have to do set this calibration once, manually using the GUI and its accuracy in space is down to half a centimetre on the earth's surface and its accuracy in time is down to a millisecond. If it was on the top of the car, the node would have to be constantly updated automatically. But GPS is no where near that accurate. I guess you could use a combination involving LIDAR to constantly tell the node where it is so the car's position is updated in Grassland. But it would make more computational/economic sense for the government and economically self-interested citizens (interested in mining Grassland's coin) to line the streets with ip cameras which grassland nodes can read from to analyze and broadcast car and pedestrian locations/speed etc. etc. millisecond by millisecond. Which self driving cars could pick up and 'know' everything going on around them even things they can't 'see' themselves.

raidicy 8y ago
What's stopping me from finding all the unsecured IP cameras in my city and using them to "mine" data? Further, if I could do that what's stopping others from reusing the nodes that I set up?
- david_at 8y ago
  > What's stopping me from finding all the unsecured IP cameras in my city and using them to "mine" data? Absolutely nothing. > Further, if I could do that what's stopping others from reusing the nodes that I set up? Right now, nothing. Nodes could overlap other nodes. But they're still using compute cycles so they're still spending money. The only issue is, who gets theirs into the tree first. And if the hash is the same, you better be first or you're just wasting time. Keep in mind, I've still got a lot of work to do. And until today, I've been working on this by myself. And pretty much since last summer. You can see the list of tasks that I need to complete on the site under "Beta Version".
  - raidicy 8y ago
    Thanks for answering my question. And I want to say I appreciate what you're doing. Information is power and it's being leveraged against individuals practically unchecked. If I had to guess some state actor would have come up with (or already has) with a technology like this eventually. Everything in that system would be kept private and be leveraged against the individual without consent. Tools would be built with it that contain their own biases and uses. The appeal of using this system against others would be too great, either for those in power or those who seek to sell the ability. For that reason I like the ubiquitous access _everyone_ would have. Distributing this to everyone reminds me of the end of "The Stars My Destination" To continue with my original question though; I'm guessing whatever system has faster compute cycles will win the race of who hashes first? Will you be able to tell who's hash gets there first
    - david_at 8y ago
      > I'm guessing whatever system has faster compute cycles will win the race of who hashes first? Will you be able to tell who's hash gets there first Yes, but it's not just about hashing power though. And there's no nonce like Bitcoin. It's mostly about deep learning inference power. You can see the process described on the website under "Unrewriteable History And Reasonable Storage Requirements" (though I'll probably change that title soon and call it "[something] Merkle Tree"). I've copied the last bullet point here... * The process of producing the next Merkle Tree is a competition any node can compete in. A person who cultivates real trees is an Arborist so we'll use that term. Our "arborists" will also need to perform inference on the frames that were randomly selected for evaluation based on the last Merkle root, and will need to publish each frame's digest tuple and the "reserved digest" (see diagram). If the original node holding the reserved digest signs the arborist's digest, it generates that node's reward coins and a percentage goes to the arborist. But that will only propogate if that arborist's tree is also accepted by a majority of the network. Therefore, as long as (1) there is always active competition to compute the Merkle Tree by statistically verifying the work of all other nodes and (2) over 50% of every active node prevents inflation of the money supply by rejecting trees that don't pass their proof-of-work, then all rational (self-interested) nodes will have to be honest.
lovich 8y ago
If the accuracy is down to half a centimeter , this is something that would need to be re-calibrated several times a year. The tectonic plates move over 1 cm per year, and any type of earthquake can shift land by significantly more than a half centimeter

raidicy 8y ago

What's stopping me from finding all the unsecured IP cameras in my city and using them to "mine" data? Further, if I could do that what's stopping others from reusing the nodes that I set up?

david_at 8y ago
> What's stopping me from finding all the unsecured IP cameras in my city and using them to "mine" data? Absolutely nothing. > Further, if I could do that what's stopping others from reusing the nodes that I set up? Right now, nothing. Nodes could overlap other nodes. But they're still using compute cycles so they're still spending money. The only issue is, who gets theirs into the tree first. And if the hash is the same, you better be first or you're just wasting time. Keep in mind, I've still got a lot of work to do. And until today, I've been working on this by myself. And pretty much since last summer. You can see the list of tasks that I need to complete on the site under "Beta Version".
- raidicy 8y ago
  Thanks for answering my question. And I want to say I appreciate what you're doing. Information is power and it's being leveraged against individuals practically unchecked. If I had to guess some state actor would have come up with (or already has) with a technology like this eventually. Everything in that system would be kept private and be leveraged against the individual without consent. Tools would be built with it that contain their own biases and uses. The appeal of using this system against others would be too great, either for those in power or those who seek to sell the ability. For that reason I like the ubiquitous access _everyone_ would have. Distributing this to everyone reminds me of the end of "The Stars My Destination" To continue with my original question though; I'm guessing whatever system has faster compute cycles will win the race of who hashes first? Will you be able to tell who's hash gets there first
  - david_at 8y ago
    > I'm guessing whatever system has faster compute cycles will win the race of who hashes first? Will you be able to tell who's hash gets there first Yes, but it's not just about hashing power though. And there's no nonce like Bitcoin. It's mostly about deep learning inference power. You can see the process described on the website under "Unrewriteable History And Reasonable Storage Requirements" (though I'll probably change that title soon and call it "[something] Merkle Tree"). I've copied the last bullet point here... * The process of producing the next Merkle Tree is a competition any node can compete in. A person who cultivates real trees is an Arborist so we'll use that term. Our "arborists" will also need to perform inference on the frames that were randomly selected for evaluation based on the last Merkle root, and will need to publish each frame's digest tuple and the "reserved digest" (see diagram). If the original node holding the reserved digest signs the arborist's digest, it generates that node's reward coins and a percentage goes to the arborist. But that will only propogate if that arborist's tree is also accepted by a majority of the network. Therefore, as long as (1) there is always active competition to compute the Merkle Tree by statistically verifying the work of all other nodes and (2) over 50% of every active node prevents inflation of the money supply by rejecting trees that don't pass their proof-of-work, then all rational (self-interested) nodes will have to be honest.

lovich 8y ago

If the accuracy is down to half a centimeter , this is something that would need to be re-calibrated several times a year. The tectonic plates move over 1 cm per year, and any type of earthquake can shift land by significantly more than a half centimeter