18 Apr
2007
18 Apr
'07
11:05 a.m.
Step 1: Get it to work. Mostly done. Some things need doing still, but it's looking good. Step 2: Get it to work *fast* Removed big chunks of CPU time for a simple clear-text password test In some cases, hashes are faster than trees (read: constantly changing data). In others, trees are faster than hashes (data that doesn't change). And caching pointers makes the code a little more complicated, but much faster. Right now it's about 20% faster than 1.x for the same test. Alan DeKok. -- http://deployingradius.com - The web site of the book http://deployingradius.com/blog/ - The blog