1. 18 Jan, 2015 2 commits
  2. 14 Jan, 2015 2 commits
  3. 13 Jan, 2015 13 commits
  4. 12 Jan, 2015 12 commits
  5. 11 Jan, 2015 1 commit
  6. 06 Jan, 2015 2 commits
    • Jeromy's avatar
      implement recursive indirect blocks · e3cf8936
      Jeromy authored
      improve efficiency of multilayered indirect blocks
      
      clean up tests
      
      panic cleanup
      
      clean up logic, improve readability
      
      add final root node to the dagservice upon creation
      
      importer: simplified dag generation
      
      test: updated hashes using latest code
      
      @whyrusleeping this is why the sharness tests
      were failing: the hashes are added manually to
      make sure our generation doesn't change.
      
      cleanup after CR
      
      fix merkledag tests
      
      fix small block generation (no subblocks!)
      e3cf8936
    • Juan Batiz-Benet's avatar
      bootstrap addrs: moved parsing around · 517d3e99
      Juan Batiz-Benet authored
      this commit:
      * moves parsing of bootstrap peers into config
      * moves location of bootstrap addrs into core/commands
      * refactor `*BootstrapPeer -> BootstrapPeer
      517d3e99
  7. 05 Jan, 2015 1 commit
  8. 04 Jan, 2015 2 commits
  9. 02 Jan, 2015 4 commits
    • Juan Batiz-Benet's avatar
      crypto -> p2p/crypto · cc0d7c9b
      Juan Batiz-Benet authored
      The crypto package moves into p2p. Nothing in it so far is ipfs
      specific; everything is p2p-general.
      cc0d7c9b
    • Juan Batiz-Benet's avatar
      introducing p2p pkg · 89f5cd4c
      Juan Batiz-Benet authored
      I think it's time to move a lot of the peer-to-peer networking
      but-not-ipfs-specific things into its own package: p2p.
      This could in the future be split off into its own library.
      The first thing to go is the peer.
      89f5cd4c
    • Jeromy's avatar
      address comments from PR · 14fc4188
      Jeromy authored
      14fc4188
    • Jeromy's avatar
      rewrite of provides to better select peers to send RPCs to · 07b06401
      Jeromy authored
      refactor test peer creation to be deterministic and reliable
      
      a bit of cleanup trying to figure out TestGetFailure
      
      add test to verify deterministic peer creation
      
      switch put RPC over to use getClosestPeers
      
      rm 0xDEADC0DE
      
      fix queries not searching peer if its not actually closer
      07b06401
  10. 23 Dec, 2014 1 commit
    • Juan Batiz-Benet's avatar
      peer change: peer.Peer -> peer.ID · c84a714b
      Juan Batiz-Benet authored
      this is a major refactor of the entire codebase
      it changes the monolithic peer.Peer into using
      a peer.ID and a peer.Peerstore.
      
      Other changes:
      - removed handshake3.
      -	testutil vastly simplified peer
      -	secio bugfix + debugging logs
      -	testutil: RandKeyPair
      -	backpressure bugfix: w.o.w.
      -	peer: added hex enc/dec
      -	peer: added a PeerInfo struct
        PeerInfo is a small struct used to pass around a peer with
       	a set of addresses and keys. This is not meant to be a
       	complete view of the system, but rather to model updates to
       	the peerstore. It is used by things like the routing system.
      -	updated peer/queue + peerset
      -	latency metrics
      -	testutil: use crand for PeerID gen
       	RandPeerID generates random "valid" peer IDs. it does not
       	NEED to generate keys because it is as if we lost the key
       	right away. fine to read some randomness and hash it. to
       	generate proper keys and an ID, use:
       	  sk, pk, _ := testutil.RandKeyPair()
       	  id, _ := peer.IDFromPublicKey(pk)
       	Also added RandPeerIDFatal helper
      - removed old spipe
      - updated seccat
      - core: cleanup initIdentity
      - removed old getFromPeerList
      c84a714b