Added in this fork

fixed

.

Thank you for a suggestion. I have updated it.

OP solved it, closing

It was certainly my intention that the pile should only be burned when it is full. (This reflects the fact that in reality, I do not interrupt my raking to burn a partial pile.) I will amend the description to reflect this fact.

I made some changes to the description. Is it more clear now?

So many users have solved this kata and noone has the courtesy of pointing out how the specification should be interpreted .. this so called mid-endian format follows a zig-zag path:

• start with a source in big endian order, and a target as empty string
• prepend a null byte to the source if the parity is odd
• as long there are bytes left in source, pop (shift) the next byte from the left of the source:
  • toggle between append / prepend that byte as hex in target

Also one of the tests which fails should not be failing because the test is wrong/

This description confuses me as well, very vague. It's also not clear what is the most significant couple in case of mid endian.

Ok, I modified the description

Hm, I see. What do you think should be added to the description to make it better? I'm not sure what to write to make it clearer. Would something like:

The expected output is the status of the memory after the application of the algorithm

be enough?

I agree with OP the expected output can be described more clearly. The input is specified; datatype and meaning of the expected output should also be specified explicitly.

Examples should clarify, not specify - the description should be just as complete without the example as with it.

flipped

By the way, there is a new kata in this "series" which is in beta right now, feel free to solve it and suggest some changements in its description if it's not good enough