Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Discuss - 0033-fake-account-packet #134

Open
rossmuir opened this issue May 12, 2016 · 2 comments
Open

Discuss - 0033-fake-account-packet #134

rossmuir opened this issue May 12, 2016 · 2 comments

Comments

@rossmuir
Copy link
Contributor

RFC > https://github.com/maidsafe/rfcs/tree/master/text/0033-fake-account-packet
PR Discussion > #128

@afck
Copy link
Contributor

afck commented May 12, 2016

As discussed in #128, I'd be in favour of using the actual data chunk (immutable or structured - it doesn't matter) that's closest to the requested (nonexistent) one as a seed. That information - which one is the closest existing chunk to that address - should also be known by only the close group of that data, and as soon as there are much more data chunks than nodes, the close group of a nonexistent data name will almost always be identical with the close group of a close existing chunk, so their responses will accumulate.

@Fraser999
Copy link
Contributor

I also favour this approach.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants