Hal Finney presents rough notes taken from a talk by Ron Rivest (1.5M PPT) about the MD6 hash function. MD6 will be a SHA-3 candidate and is tree-based and thus highly parallelizable (while remaining serializable). It appears to be designed to resist known forms of attack.