BCM » Historial » Versió 5
Anònim, 07-11-2017 21:02
1 | 1 | Axel Neumann | h1. BCM |
---|---|---|---|
2 | |||
3 | |||
4 | 2 | Axel Neumann | h2. Architecture Components |
5 | 1 | Axel Neumann | |
6 | * Block Chain Node |
||
7 | 4 | Anònim | * SOHO Node (cheap wireless router, smartphones,...) |
8 | 1 | Axel Neumann | * Internet GW Node |
9 | * Client Node |
||
10 | 5 | Anònim | * AP-client links |
11 | 4 | Anònim | * Mesh links |
12 | 1 | Axel Neumann | * Tunnel links |
13 | 5 | Anònim | * DAO Server (distributed) |
14 | - Hosted by Etherium platform |
||
15 | - May run in Ammbr HW |
||
16 | 1 | Axel Neumann | |
17 | 5 | Anònim | * Identity proving instance |
18 | * Digital Autonomous Organization (DAO): |
||
19 | | > agreement on code or smart contract (Not on central authority) |
||
20 | | > Voting on code changes |
||
21 | * Consensus based on PoET |
||
22 | * PoV used for |
||
23 | * 100 000 000 million round recursions takes 1ms vs 5secs |
||
24 | * sha(sha(sha(....))) |
||
25 | * 3 chip functions |
||
26 | - PK functionality, Identity generation |
||
27 | - PoET (consensus) |
||
28 | - PoV (Identity Validation) |
||
29 | 1 | Axel Neumann | |
30 | 5 | Anònim | |
31 | |||
32 | Questions |
||
33 | - who is challenging the randomly selected node? |
||
34 | - how is a node randomly selected? |
||
35 | - |
||
36 | |||
37 | 2 | Axel Neumann | h2. Block Chain Consensus |
38 | |||
39 | * PoV |
||
40 | > * Order of recursion depth |
||
41 | > * Instance particularity |
||
42 | > * Identity mapping/control |
||
43 | |||
44 | 3 | Anònim | |
45 | 1 | Axel Neumann | h2. BMX7 / Semtor features |
46 | 3 | Anònim | |
47 | 5 | Anònim | * Self signed identies |
48 | 3 | Anònim | * Signed node Profiles |
49 | > * Public key |
||
50 | > * List of trusted nodes |
||
51 | > * List of supported nodes |
||
52 | > * Path metric function and parametrization |
||
53 | > * Tunnel announcements |
||
54 | 1 | Axel Neumann | * Identity proven addresses (CGA) |
55 | 3 | Anònim | * Trusted paths set (destination address driven) |
56 | 4 | Anònim | * DH based shared key agreement (for links and tunnels) |
57 | 3 | Anònim | |
58 | |||
59 | |||
60 | 2 | Axel Neumann | h2. Challenges |
61 | |||
62 | * QoS Reservation |
||
63 | * Path changes |
||
64 | 1 | Axel Neumann | * Clustering |
65 | * Transaction recording traffic |
||
66 | 4 | Anònim | * Roaming |
67 | * Multi-path |
||
68 | 1 | Axel Neumann | |
69 | 4 | Anònim | |
70 | h2. |