feat(runtime): Optimize == for lists

[spotandjake]

This optimizes == for specifically for lists and also refactors it to use early return. Instead of the recursive approach used in the general case for adt's because we know lists will always have two elements (item, nextItemPtr) we handle it in an iterative manner avoiding the stack overflow.

Notes:

• The smallest program size increased because == is bundled to every grain program.
• == would now lock with a cyclic list, however from my understanding such a list would be impossible to build in grain.
  • If we want to handle cycles we can but it adds overhead as we need to go back through the scanned items and do the unmarking after.
  • This will all need to get refactored with the wasm gc changes we plan to make so I think it's fine to take the perf improvement for now.
• We should be able to support any list size now however it seems we start running into issues with List.init around 5005 elements.

Closes: #2246

[ospencer]

Should we add a test with a very very long list?

[spotandjake]

I added that test and this should be ready to merge now.