Steve Dougherty | 1 May 2012 01:06
Favicon

Re: Statistics Project Update #1


On 04/28/2012 06:56 PM, Zlatin Balevsky wrote:
> In Gnutella we observed that long-lived nodes tend to be better 
> connected and that they also cluster with other high-uptime nodes.
> If the same is true for Freenet it's a good idea to keep an eye for
> side effects as you tweak the behavior.

Good to know - I'll look for that. Are there any particular effects
you had in mind? The Metropolis-Hastings correction in the new probes
should produce a fairly uniform distribution of endpoints despite
clustering and well-connected nodes, but explicitly simulating the
effects of high uptime could be helpful.

It occurs to me that the probe requests I hope to depreciate allow
reconstructing the actual network topology - perhaps we could run
simulations on top of it? The new probe requests are currently planned
to not report degrees or link length distributions, [1] which as far
as I can tell would mean no way to reconstruct the network as measured
in simulation. Does it seem reasonable to omit the ability to gather
such information?

On 04/28/2012 03:51 PM, Michael Grube wrote:
> Are you assuming opennet, darknet, a mix?

The simulation generates the graph in a way which effectively sort of
assumes darknet: it assigns locations, then iterates over the network
and connects nodes based on link length. [2] [3] I'm working under the
assumption that when using the same degree distribution as the network
is measured to have this is an accurate enough approximation. I will
include these and similar plots in this week's progress report.
(Continue reading)

Michael Grube | 1 May 2012 01:27
Picon
Gravatar

Re: Statistics Project Update #1



On Mon, Apr 30, 2012 at 7:06 PM, Steve Dougherty <steve-kVTqj8yhOEv2eFz/2MeuCQ@public.gmane.org> wrote:
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On 04/28/2012 06:56 PM, Zlatin Balevsky wrote:
> In Gnutella we observed that long-lived nodes tend to be better
> connected and that they also cluster with other high-uptime nodes.
> If the same is true for Freenet it's a good idea to keep an eye for
> side effects as you tweak the behavior.

Good to know - I'll look for that. Are there any particular effects
you had in mind? The Metropolis-Hastings correction in the new probes
should produce a fairly uniform distribution of endpoints despite
clustering and well-connected nodes, but explicitly simulating the
effects of high uptime could be helpful.

It occurs to me that the probe requests I hope to depreciate allow
reconstructing the actual network topology - perhaps we could run
simulations on top of it? The new probe requests are currently planned
to not report degrees or link length distributions, [1] which as far
as I can tell would mean no way to reconstruct the network as measured
in simulation. Does it seem reasonable to omit the ability to gather
such information?


On 04/28/2012 03:51 PM, Michael Grube wrote:
> Are you assuming opennet, darknet, a mix?

The simulation generates the graph in a way which effectively sort of
assumes darknet: it assigns locations, then iterates over the network
and connects nodes based on link length. [2] [3] I'm working under the
assumption that when using the same degree distribution as the network
is measured to have this is an accurate enough approximation. I will
include these and similar plots in this week's progress report.

Ah, ok. You're making a Kleinberg Small World graph. Nice.
 

My understanding is that a more thorough simulation of darknet would
randomly assign locations and reassign them with the location-swapping
algorithm used in Fred.

Right. Funnily enough, the swapping algorithm is most concisely described in the Pitch Black paper. I'd suggest that as a reference for quick implementation.
 
I think simulating opennet would be more work
both to implement and to run, as it would mean implementing
path-folding and randomly assigning locations and connections.

No doubt about that. Just curious. I did some work involving some very simple probes, but it was more of a theoretical simulation. We'll see how close theory matches reality I guess ;)

Thanks for answering.
 

[1] https://bugs.freenetproject.org/view.php?id=3568
[2]
https://github.com/Thynix/routing-simulator/blob/73dfd6c94156cef35815ac7de2fcfa934385ccae/Graph.java#L139
[3]
https://github.com/Thynix/routing-simulator/blob/73dfd6c94156cef35815ac7de2fcfa934385ccae/Graph.java#L52
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.11 (GNU/Linux)

iQIcBAEBAgAGBQJPnxsCAAoJECLJP19KqmFu+dsP/RsSyAcQEqqFM3UDjdlTtMBd
EtBWQ/7mfsLnZ4D3aHGZ1yV4F2jpU5T6ZVEcP520gwZ1fz7k+Yl4AVZYMyE0Ixbu
HiSGeoAQeyAJs+znhg+svKvIrcUzr6i2N6/1D3iZPZl8s//dXNtOfr5zfsoh3wrB
k7T5BmCBEGEIru4Z33EsMkVDTzJ8fy17fZew1MKfOs1HlBUr3hIrz4b/IlbxUprb
0SMosb/cc5W+pRM0d6nVlYn3vMgW/IHFTF2wFQGcd2oC9eE1RJ7J6CvsaVnjG1k+
MRv0nCQoVxztQ3CUS8Apkzb/SFpRcJFBist/hyCkL8eCHE8fjblisthRGZaoBN8d
aqcQw57xeRPJwdmZGWw6e/gMOTVVa44XlhuKiOap0iQSctWsG1rcpXA824VshasU
JDfMAiz67L/7QQ1q/zLAC22PPpxfliS+k4A+OF/4QQLeZ+3dfkpgg9LEzphVVOwH
nXw0/d8mg+i+dUir4irq15nharbiNtDbLAmVJYW+KnfVQIvVOl+4ZcIL9j4EanzK
egEMlm8y4y+tQYR2TsPhqrnrNax8lspqz6fp1H7dMm0aLxF/edBHE/m2C1xZ2tX0
7NpD4Hx7jV7qCFD86kxc1dbYZpgYh5i0BOWBjc+bLGY4gyO1cGJOLU8jknCmZ1vV
QDdK7+1G24/xn9Ju/Y9h
=GBrm
-----END PGP SIGNATURE-----

_______________________________________________
Devl mailing list
Devl@...
https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
Zlatin Balevsky | 1 May 2012 13:48
Picon

Re: Statistics Project Update #1

> On 04/28/2012 06:56 PM, Zlatin Balevsky wrote:
>> In Gnutella we observed that long-lived nodes tend to be better
>> connected and that they also cluster with other high-uptime nodes.
>> If the same is true for Freenet it's a good idea to keep an eye for
>> side effects as you tweak the behavior.
>
> Good to know - I'll look for that. Are there any particular effects
> you had in mind? The Metropolis-Hastings correction in the new probes
> should produce a fairly uniform distribution of endpoints despite
> clustering and well-connected nodes, but explicitly simulating the
> effects of high uptime could be helpful.

There was a study that higher uptime correlated with the probability
of further uptime so if you shift bias towards low-uptime nodes you
could end will lower overall reliability.  It was done on a different
network with different usage patterns but imho you should definitely
treat node uptime as a parameter in any simulations.
Martin Nyhus | 1 May 2012 20:11
Picon
Favicon

Freemail 0.1.1 and 0.2 released

After being in development for nearly a year Freemail 0.2 has been released.
The two main features in 0.2 is the new identity management which uses the Web
of Trust plugin, and a webmail client. This work was mostly done as part of
Google Summer of Code 2011. Due to the identity management changes this
version is incompatible with the earlier releases, but to ease the migration
the two versions can be used at the same time without any issues.

Version 0.1.1 fixes a number of bugs including one potential security issue
that could enable an attacker with access to the Freenet log files to fetch
emails from Freenet after they should have been inaccessible.

Both versions will be available through Freenet after the next update, and from
CHK <at> xXc1H2eh-1OtCoE4Z0-G4~5SfOFpTWa6YWOP~D4PyuA,dKRuAVWFlHd8ZNvFsIJj1Hzzuyoc7EfoVIXYgz-rfsg,AAIC--8/Freemail-0.1.1.jar
CHK <at> S0AnW~5CXyh3pLkzJHbRm5xj8kf26GyLcT3Zuf1UAsU,pt-TGV39s1ucWNTkZKMdo1dQyaxzaUsSjXlYtBAqfvc,AAIC--8/Freemail-0.2.jar

I am very interested in feedback about the reliability of Freemail, any bugs I
have missed and performance problems. This can be reported through the mailing
list, the bug tracker and on Freenet.

Detailed changelog for 0.1.1 (also included in 0.2):
  o Security fixes:
    - Log message fetch and insert keys at debug instead of normal/error. If a
      collision occurred the new slot would be logged at error, which
      would break the forward secrecy of the slot system until the log was
      deleted. This would enable an attacker with access to the log files to
      retrieve messages from Freenet.

  o Bugfixes:
    - Folders deleted using a mail client are now deleted properly
    - Fixes a crash that could occur if a mail client connected while Freemail
      was shutting down
    - The startup message now shows the correct licence (GPL)
    - Fixes a bug where certain email addresses would cause received messages to
      be empty
    - Fixes a race condition which could lead to Freemail hanging
    - Don't delete CC headers from a message before sending
    - Always print a log message when Freemail isn't connected to the node
    - IMAP: Remove extra space that was printed in a fetch response without a range
    - IMAP: Fix error message when the end of a range was invalid
    - IMAP: Handle strange sequence number ranges
    - IMAP: Remove \* from permanent flags since they were not stored
    - IMAP: Fix append with two or more flags
    - IMAP: Reply with error if the append length couldn't be parsed
    - Fix various locking issues
    - Don't log the recently failed fetch result as an error

  o Improvements:
    - Improve the explanations on the create account page
    - Only resend the RTS once per two days instead of once per message in the
      outbox per two days, reducing resource usage for unacked messages
    - Send messages in the order they will be received, improving performance
      when sending a large amount of messages
    - Alternate between sending and receiving, stopping sending/receiving a large
      number of messages from blocking other operations

  o Build improvements:
    - Compile for Java 1.6
    - Include git describe output in version
    - Enable warnings when building
    - Make Ant and Eclipse output files to the same location (build/)

  o Code changes:
    - Add unit tests for various classes (mostly IMAP)
    - Improve errors returned/thrown by HighLevelFCPClient
    - Add type parameters to all code
    - Add missing  <at> Override annotations
    - Throw AssertionError in some cases that should be impossible
    - Use constants for config file keys
    - Respond to interrupts in the FCP code
_______________________________________________
Devl mailing list
Devl@...
https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
Ian Clarke | 2 May 2012 04:54
Gravatar

Re: Freemail 0.1.1 and 0.2 released

Looks like great work Martin, congratulations on the release!


Ian.

On Tue, May 1, 2012 at 1:11 PM, Martin Nyhus <martin.nyhus-KK0ffGbhmjU@public.gmane.org> wrote:
After being in development for nearly a year Freemail 0.2 has been released.
The two main features in 0.2 is the new identity management which uses the Web
of Trust plugin, and a webmail client. This work was mostly done as part of
Google Summer of Code 2011. Due to the identity management changes this
version is incompatible with the earlier releases, but to ease the migration
the two versions can be used at the same time without any issues.

Version 0.1.1 fixes a number of bugs including one potential security issue
that could enable an attacker with access to the Freenet log files to fetch
emails from Freenet after they should have been inaccessible.

Both versions will be available through Freenet after the next update, and from
CHK <at> xXc1H2eh-1OtCoE4Z0-G4~5SfOFpTWa6YWOP~D4PyuA,dKRuAVWFlHd8ZNvFsIJj1Hzzuyoc7EfoVIXYgz-rfsg,AAIC--8/Freemail-0.1.1.jar
CHK <at> S0AnW~5CXyh3pLkzJHbRm5xj8kf26GyLcT3Zuf1UAsU,pt-TGV39s1ucWNTkZKMdo1dQyaxzaUsSjXlYtBAqfvc,AAIC--8/Freemail-0.2.jar

I am very interested in feedback about the reliability of Freemail, any bugs I
have missed and performance problems. This can be reported through the mailing
list, the bug tracker and on Freenet.


Detailed changelog for 0.1.1 (also included in 0.2):
 o Security fixes:
   - Log message fetch and insert keys at debug instead of normal/error. If a
     collision occurred the new slot would be logged at error, which
     would break the forward secrecy of the slot system until the log was
     deleted. This would enable an attacker with access to the log files to
     retrieve messages from Freenet.

 o Bugfixes:
   - Folders deleted using a mail client are now deleted properly
   - Fixes a crash that could occur if a mail client connected while Freemail
     was shutting down
   - The startup message now shows the correct licence (GPL)
   - Fixes a bug where certain email addresses would cause received messages to
     be empty
   - Fixes a race condition which could lead to Freemail hanging
   - Don't delete CC headers from a message before sending
   - Always print a log message when Freemail isn't connected to the node
   - IMAP: Remove extra space that was printed in a fetch response without a range
   - IMAP: Fix error message when the end of a range was invalid
   - IMAP: Handle strange sequence number ranges
   - IMAP: Remove \* from permanent flags since they were not stored
   - IMAP: Fix append with two or more flags
   - IMAP: Reply with error if the append length couldn't be parsed
   - Fix various locking issues
   - Don't log the recently failed fetch result as an error

 o Improvements:
   - Improve the explanations on the create account page
   - Only resend the RTS once per two days instead of once per message in the
     outbox per two days, reducing resource usage for unacked messages
   - Send messages in the order they will be received, improving performance
     when sending a large amount of messages
   - Alternate between sending and receiving, stopping sending/receiving a large
     number of messages from blocking other operations

 o Build improvements:
   - Compile for Java 1.6
   - Include git describe output in version
   - Enable warnings when building
   - Make Ant and Eclipse output files to the same location (build/)

 o Code changes:
   - Add unit tests for various classes (mostly IMAP)
   - Improve errors returned/thrown by HighLevelFCPClient
   - Add type parameters to all code
   - Add missing <at> Override annotations
   - Throw AssertionError in some cases that should be impossible
   - Use constants for config file keys
   - Respond to interrupts in the FCP code

_______________________________________________
Devl mailing list
Devl-RdDMkVZAZeuJnvDnx1genB2eb7JE58TQ@public.gmane.org
https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl



--
Ian Clarke
Founder, The Freenet Project
Email: ian-RdDMkVZAZeuJnvDnx1genB2eb7JE58TQ@public.gmane.org
_______________________________________________
Devl mailing list
Devl@...
https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
Steve Dougherty | 5 May 2012 07:43
Favicon

Statistics Project Update #2


I've completed an initial run of simulation work on probes. The code is
available, [1] as well as the simulation results from which the plots
were generated. [2] The point of immediate interest though is the plots
themselves, [3] which show the predicted network coverage of different
probe routing techniques on networks with ideal degree distribution
(more on this later) and that following the degree distribution of
Freenet as measured. [4] Link lengths and locations do not factor into
this simulation because probes take only degree into account and are not
seeking any given destination; their goal is only to average out to
distribute endpoints uniformly throughout the network.

The ideal network distribution has each node add a fixed number of
remote connections without regard for the number of connections it or
the nodes it's connecting to have. I don't know whether this or having
each node have the same number of total connections is the ideal. The
results of the simulation did not appear to greatly change with
network size, as shown by the consistent behavior between the 12,000
and 45,000 node versions of the MH-corrected degree-conforming
simulation. [5]

As expected, the plots suggest that using Metropolis-Hastings correction
will be an immense improvement in endpoint uniformity over the current
uniform random routing, but specifically suggest that an HTL of around
20 hops is close enough to a baseline uniform endpoint probability to be
a good starting point. I've noticed that these CDFs aren't a very good
format for demonstrating closeness of distributions, given overlapping
lines, but I don't understand the Kolmogorov–Smirnov test yet, so I'm
planning to just use these results as a guideline and begin implementing
the new probes next week.

The gnuplot scripts to generate the degree and link length distribution
plots are part of pyProbe, [6] and GNU parallel [7] is used in test.sh
to run simulations in parallel. In the simulator source there are
scripts from an earlier effort to plot coverage as percentages, but that
was even less clear than the CDFs.

Comments and suggestions are very welcome!

Thanks,
operhiem1

[1] https://github.com/Thynix/routing-simulator/tree/dev
[2] http://asksteved.com/plot-source.tar.xz
[3] http://imgur.com/a/Z8SBS#2
[4] http://i.imgur.com/ehfBP.png
[5] http://i.imgur.com/rtRIB.png
[6] https://github.com/Thynix/pyProbe
[7] http://www.gnu.org/software/parallel/
Steve Dougherty | 5 May 2012 07:52
Favicon

Re: Statistics Project Update #1


On 04/30/2012 07:27 PM, Michael Grube wrote:
>> Right. Funnily enough, the swapping algorithm is most concisely 
>> described in the Pitch Black paper. I'd suggest that as a 
>> reference for quick implementation.

Thanks for the suggestion; will do.

On 05/01/2012 07:48 AM, Zlatin Balevsky wrote:
> There was a study that higher uptime correlated with the 
> probability of further uptime so if you shift bias towards 
> low-uptime nodes you could end will lower overall reliability.  It 
> was done on a different network with different usage patterns but 
> imho you should definitely treat node uptime as a parameter in any 
> simulations.

So simulating this would mean an initial connection, then
disconnection and reconnection cycles as low-uptime nodes be
low-uptime? As far as bias towards low-uptime nodes affecting
reliability, it's worth noting that all this talk of
Metropolis-Hastings is only relevant to the new probe routing and
doesn't affect the existing routing behaviors. If this routing
includes low-uptime nodes that's good! It would mean a more uniform
selection of endpoints which allows more accurate and comprehensive
measurement of the network.
Chetan Hosmani | 5 May 2012 14:14
Picon

Transport Plugins: Update (GSoC 2012)

Hello,

This is an update on the first stage of my project. I have been
working out the details regarding modifications in the core to
simplify the implementation of the transport plugins. This refactoring
stage will involve some minor modifications and some major ones. These
are based on the discussions on #freenet and #freenet-chat. However I
would like to avoid doing changes that would bring about major
differences in the way things function at present.

I have planned to finish refactoring by May 21 (official coding begins
for GSoC). I intend to do that in 3 stages. I have also simultaneously
discussed the entire implementation of transport plugins here. I will
review the feedback and this report, to evaluate what constitutes the
refactoring. After those changes are made I can work on implementing
the needed core level changes, which mostly involve design for
streams.

1) Cryptography and Node

This will involve mainly the classes NodeCrypto and Node. I intend to
make NodeCrypto function purely for keys and not do any network
related task. Presently it also handles binding to the port, selection
of ports for Darknet mode and Opennet mode.
I am considering moving these portions to TransportManager and
PortManager classes.

TransportManager - A registry of registered transports with other
information. Initially I ll dump the refactor changes of UDP into it.
Later on, once UDP is ready as a plugin, along with TCP, it ll be a
generic class for any transport. There will be two objects of this -
one each for opennet and darknet modes.  NodeCrypto e.g. queries
TransportManager to find all the transports' addresses (as strings) to
put in the noderef.

Now UDPSocketHandler is equivalent to a UDP transport plugin, only
it's currently part of the core of freenet. So for the moment
TransportManager can communicate with UDPSocketHandler. That I believe
will be an intermediate step before actually converting
UDPSokcetHandler to a plugin.

PortManager - A registry of all active ports used by freenet - 1) List
of ports on fproxy page 2) List of ports for UPnP
Must contain - 1)Port number 2)Socket(TCP/UDP) 3)Forwarded
4)Description 5)Transport reference
However PortManager is second priority, and will not be addressed if
time does not permit.

Also a major refactoring change would be regarding the fact that
objects no longer take a socket or a port for granted. All queries
must go through the TransportManager. I would need help at certain
places to figure out how this can achieved. For e.g.
NodeCrypto/Node/some other classes assume that an unique darknet port
exists. toad suggested we use a debugging identifier here(some default
number, etc). That makes it simpler for me too.

2) Messages and Packets

These part have been discussed on #freenet(and #freenet-chat) and here
are some issues and conclusions-

a. The existing architecture supports only packet based transports.
The first step would be to draw a clear distinction between
packet-based(connectionless sockets) and stream-based(connection-based
sockets). Thus we will need separate classes for streams(with a base
class for streams and packets), that will handle Message-in-flight and
Packets-in-flight, tracking them, allowing for transports to be
switched midway. This will be handled differently in streams. For
Packets the existing classes can be used, however with modifications
to address the following.

b. For streams we need two features - To handle messages as a whole
entity, and acknowledge once an entire message has been received; and
To support partial messages, if for e.g. we have just switched from
UDP to TCP or we are sending a really large message on TCP.

c. NewPacketFormat currently 1) takes a byte[] from UdpSocketHandler
and decodes it 2) creates and sends a packet. Now the idea is to
create NewStreamFormat that handles streams, and also provide a pair
of streams StreamConnectionHandler for the plugin to write/read.
NewPacketFormat handles the list of message-in-flight. A new object
must be used for this purpose while NewPacketFormat performs lesser
tasks. Both NewPacketFormat and NewStreamFormat can communicate with
it.

Question: MessageWrapper tracks a message-in-flight. But is it really
necessary to create a base class for MessageWrapper and create
StreamMessageWrapper too. Or would it be simple to make necessary
modifications(if there are any) to MessageWrapper.
Please explain the purpose of doing so, as I have very little
understanding, as of now, of the object Message. Also how it will be
treated differently for streams against packets.

d. Another issue is regarding FNPPacketMangler. This is an important
aspect of freenet, as it deals with the handshake between two nodes,
and the exchange of cryptographic keys. So the issue being whether per
NodeCrypto we have an object or per transport we have an object, of
the FNPPacketMangler type. And assuming these are packet based
transports.

Question: How can the equivalent of FNPPacketMangler be created for
stream based connections. I don't think this was discussed at all or
in detail on the IRC. Some suggestions here would be helpful. My
knowledge is that the JFK protocol works for packet based transports,
specifically UDP. How would this function in case of streams?

e. Another thing that needs clarification is regarding who decides
when to send the packets. Since stenography is all about the timing
and the format of the packet, the plugin must have control. However
that would make some other transport plugins difficult to write. toad
suggested the following. To quote him- "PacketSender constantly loops
over peers to send packets to them. We'll probably have two separate
mechanisms for packet-based - one where we are just wrapping packets
with different headers, so the node decides when to send a packet, and
one where the plugin decides when to send a packet and demands data to
fill it from the node. The latter is "constant bitrate", or really
accurate fakery; it's a long term project, as is how to fill up the
packets when there's nothing to send." This sounds acceptable, however
when I get there I will discuss how this should be implemented. But I
believe that it will not affect the initial stages of the project.

Question: How does the same work for streams? Firstly the transport
must have its own flow control mechanism to decide when to send. Also
there must be a way to let the node know this. I am guessing
NewStreamFormat handle this? It must also create
StreamConnectionHandler for the plugin to read/write. Must also do
encryption using existing BlockCiphers? It must convert the encrypted
data into a stream? I suppose I can draw parallels to NewPacketFormat
and do it.

3) Plugins, streams, transports

I will need to create a base class for transports - TransportPlugin.
This is designed as per the developer's requirements. However the
major idea is that it would open sockets, and listen for connections.
For a packet-based plugin as mentioned it is called by PacketSender to
send data. If it wishes to for stenographic reasons, can send dummy
data by itself. Also it will handle all necessary parsing and encoding
for whichever protocol it is trying to mimic. It creates its own
threads to copy data from freenet and send it.
For a stream-based plugin, it runs its own loop of getting/writing
data from/to StreamConnectionHandler(node-side), encoding/decoding,
and sending/receiving to its socket. It must have its own flow control
mechanism.

To be discussed-

One major point I haven't discussed is how multiple transports work.
For e.g. a node might be able to communicate using several transports,
while its peer might not be able to do so. It had been the case that
for datagrams one needed a single port that sent messages to all its
clients. But with multiple transports, the node needs a record of
active transports for each peer. Apart from this we need to discuss
how the messages are distributed between transports. This also means
some transports might be slow, or the user prefers one of the
transports. Although I wish to address it within the timeline of GSoC,
I am not sure how it will turn out. But for the moment my idea is to
be able to choose the needed transport, although the framework to use
them simultaneously or switch from one to another will be supported.
If I find that the logic to implement selection of transports is easy,
then I can implement it. But I assume that needs some usage analysis
as well. Based on that we can comment.
My objective is to atleast get a functional freenet that will atleast
figure one way to connect to a peer, and this can be different for
different peers.
I need your opinions on this. But atleast some modification of
PeerNode to keep track of which transport works is a must.

This is a haphazard report, that has questions, issues as well as
conclusions. Based on feedback and suggestions, for the next two weeks
I wish to work on refactoring changes to support the above. Also
thanks to toad for making it very simple for me, and the fact that
over a month, all his design implementation ideas mentioned on email
and irc are consistent and complementary to each other.

I will work on a separate branch and I am not sure how it follows from
now on, as I submit code. The present idea is to create a branch for
every task, to be completed every week. Comments and suggestions are a
must!

Regards,
Chetan Hosmani
Chetan Hosmani | 5 May 2012 14:16
Picon

Re: Transport Plugins: Update (GSoC 2012)

Oh crap, that is very long. Nevermind. If any part is relevant do comment!
Israel Leiva | 8 May 2012 17:15
Picon
Gravatar

Re: GsoC - FCP Library

It's been a while since the GSoC results but I would like to mention that eventhough I didn't get accepted this year, I'll still work on this new Perl FCP library, mainly because I strongly believe in the reasons I gave for doing it in the first place and also because I believe it'll help me to get a better understanding of how Freenet works. It'll be a just for fun project, so it could take a while.


Best regards.

2012/4/5 Israel Leiva <leiva.israel-Re5JQEeQqe8AvxtiuMwx3w@public.gmane.org>
El 05/04/12 08:09, Matthew Toseland escribió:
Anyone interested in mentoring this? I really don't think I'm the right person to mentor a perl project.

I finished the proposal: http://www.google-melange.com/gsoc/proposal/review/google/gsoc2012/ilv/1


--
Israel Leiva

_______________________________________________
Devl mailing list
Devl@...
https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl

Gmane