The original had you lose 20 rings, that's a lot of new objects. you could reduce the dropped rings to 10, like some later games do, and reduce the strain

Wait, so, will the battle engine support multiple sprites? I don't mean at once, but different enemies. It seems like that would take up a whole lot of space. Or, are you planning on having one per type? That would make the most sense to me.

Or, perhaps you could do like Notch did in minecraft, and have half tiles that actually take up a whole tile, but you land midway through it. You'd have to use Pxl-test for colliion, though.

Meh, I've tried docks and found that most of what I do is in only 1 or 2 programs, and my start menu has more than enough room for them. Plus, since it's a linux OS I can make the bar small enough to be unnoticeable.

Ooooh! scary! will you be able to script bullets to bombpresses? trap bombs would be cool.

As you can probably deduce, this is about RSA

Here's the idea. Instead of trying to find primes, what about eliminating many non-primes? the calculation is much faster, since, if you do it in a reasonable way, you are dividing an extremely large number by a fairly small one (probably max of 32768 or so, at least at first) instead of two extremely large ones.

Once you eliminate, say, 30-50% (not counting even numbers ) of all the non-primes, any method of testing would be much faster. Plus, you can manage it in a very community-friendly way, by having one computer test all of the numbers for one number as a factor, gradually moving up the list itself.

Here's an example with very low numbers, but expandable.

original list, 1-50
cut out evens (divide by two)
take lowest number on list (3) and divide all remaining, looking for non-decimal divisions
this gives 9, among others, that you then remove from the list
from there, you move to 5, being next on the list, knowing both 5 and 3 are primes.

Repeat until you reach the point that it would be better just to use the remaining numbers in an algorithm.

For a community-based version: Server has a database with all said numbers (it might be practical to start higher than one )
Server gets a request from a PC, sends lowest number and list.
Server gets another request, sends next lowest number and the same list (since the first results aren't back yet)
First returns results, server removes nonprimes from list (if the current lowest untested is nonprime, it bumps it to the next one, no point in dividing by nonprimes)
Second returns results, server removes any remaining nonprimes that were missed by the first, ignores those already removed.

What do you think?

how illegal would it be to disassemble the original SEGA rom and use their method?

Umm, I actually had the issue I was referring to......with No-stub. It was back when I first got my nspire.