I know about the loop myself (caused by the absence of appropriate input?) and I've advised my peers to stay with the oldschool models.

You can use Ndless.

If you have a black basic TI-Nspire, you have to replace the TouchPad keypad by a ClickPad keypad and install OS 1.7 + Ndless 1.7.

If you have a black CAS TI-Nspire, you have to install OS 1.4 + Ndless 1.4.


Ndless 1.4 supports programs built for Ndless 1.7. Ndless 1.4 is simply a port of Ndless 1.7 on OS 1.4.

Ndless does not modify any part of the OS filesystem, only the data loaded to RAM (which is wiped upon reset). Ndless cannot permanently do anything to the Nspire OS. Ndless programs, on the other hand, can do anything they want. But I seriously doubt any developers would want to sneak any malware into their programs, though.

I did not check, but I don't think there is one. You need to compile the source code yourself.

Welcome on the forums by the way.

Follow the directions in doc/Ndless-Development.txt.  Hackspire also might have some information relevant to this.

When I use the make command I get this error:

make all in libndls...
make[1]: Entering directory '/c/ndless/libndls'
nspire-gcc -os -nostdlib -c any_key_pressed.c
./nspire-gcc: line 27: arm-none-eabi-gcc: command not found
make[1]: *** [any_key_pressed.o] Error 127
make[1]: Leaving directory '/c/ndless/libndls'
make: *** [subdirs] Error 1

No. I installed the MinGW

EDIT: I installed YAGARTO and now i'm getting this error:

any_key_pressed.c:22:16: fatal error: os.h: No such file or directory
compilation terminated
make[1]: ***[any_key_pressed.o] Error 1

the malware-filled (not to mention illegal) OS dumps from rapidshare

Well, since the Nspire OS images are signed with 1024-bit RSA keys, third-party-modified versions cannot be transferred to a calculator without it rejecting them

That is, unless someone knows TI's private key, which makes them able to re-sign those images... However, the normal way of getting a private RSA key is factoring the public key - with the minor issue that factoring 1024-bit RSA keys is years ahead the state of the art in factoring algorithm implementations. The state of the art is the factorization of a 768-bit RSA key ( http://www.mersenneforum.org/showthread.php?t=12958 ), and factorization of a 1024-bit RSA key is "just" between 1e3 and 1e4 times harder, i.e. it should require at least ten thousand terabytes (!!) of storage space and end up with fiddling with a quasi-square matrix of several billion elements on each side

You're more likely to win the lottery 18 times in a row (probability is approximately 2^-493) than you are to guess one of the 512-bit factors at random (probability 2^-512).