Re: Notes... The case for an open client

	And you have not yet found a way to calculate your search order in a 
	reasonable number of cycles. 144 cycles is far too many. Write the 
	code, and someone may implement it. That is the d.net way.

pre-computed 16 bit segments, sorted, and table indirect .. cycle or two
to fetch from cache on a typical cpu, stored in FPGA block ram as ROM, nearly
free in cost. So claiming a huge overhead without thinking about better ways
to implement the function is just how clueless?

I don't need to defend jack for expressing a preferrence that you turned into
a personal attack claiming absolute fore knowledge, and appear unable to defend
your assertions on the grounds that YOU don't know JACK about the deterministic
algorithms used to generate the keys for the challenge that you assert are pure
random in your not so professional attacks. So get off your hobby horse, and
start acting like a grownup.

So drop it OK ... this is not the forum for asserting you are GOD and calling
everyone else clueless shitheads for doing something you don't like or approve
of.

John
_______________________________________________
Hardware mailing list
Hardware-Ra3b/QYEcJ3d140v2zMXi0fjHoOT/h/[email protected]
http://lists.distributed.net/mailman/listinfo/hardware