The section on "verifiable computation" is interesting: http://www.enchiladacode.nl/technology.html#verifyable

"Every ID of an Enchilada Value is calculated by taking the SHA1 hash of the Value's contents."

The docs suggest that this can be used in a consensus protocol. Many nodes can compute the same result, and quickly test for equality by comparing the ID. Seems nice to have this built-in to the language, but I have to wonder:

a) Why SHA1? Why not a member of the SHA2 family? b) If you're creating a distributed system and want to implement a consensus protocol, a hash ID isn't really sufficient. Who is going to end up using this feature?