I assume that when doing a look-up in a dictionary it needs to hash the key you are giving it and then use that hash to find the object you are looking for.
If this is so, does using larger objects as keys slow down this look-up significantly or have other consequences that would not be encountered by using a string or simple data type as a key?