http://pastebin.com/pR57e81a

This is giving me a headache. It's supposed to give me walls being drawn, getting progressively farther away, being detected off a pic, but It's not showing anything, probably due to a mistake in the formula that I can't find. 

Anyone have any helpful ideas/suggestions? even a completely new formula, I just want it to work.

I have a few suggestions/ideas.

If we do set up a massive attempt to find a factor for the nspire's RSA, we should do the Boot2 one. Why? because that one is the same for both calcs.

once (if ) it is cracked, instead of installing an OS as the boot2, we write another boot2 that has no RSA protection for the OS. Then, you could install the TI-OS or a Custom OS, whichever you prefer. It would boot much faster either way (Skip half the loading bar, after it flashes)

This would be the equivalent of RunOS. Plus, any OS would work on any nspire.


On a side note, did you know the nspire has a memory location mapped for an SD card host? 

So here's the idea:

Pt-Off clears an 8x8 area, and draws to the screen.
Pt-On only draws over what's there.

Neither way really lets you draw something without a box around it, but that has white inside of it. For instance, a Character on an RPG with a Black outline, but white inside. If you could have a value for transparent pixels (probably by using nybbles, or just 4 bits per 2 Pixels) Then the (other, not changing pt-off and pt-on) command would draw a sprite to the screen, erasing where a "White" pixel is, but leaving transparent marked pixels alone. Also, when using both buffers with B/W, Transparent should let the backbuffer through, but White shouldn't (I.E. A cursor)

What do you think?

The process is fairly simple:
Have 2 greyscale sprites
One Displays, then the other, in rapid succession.

easy code example:
[ffff0000ff00ff00]->Pic1F
[ff00ffff00ff00ff]->Pic1B
[ffffffff00000000]->Pic2F
[ffffff00ffff0000]->Pic2B
ClrDraw
ClrDrawr
repeat getkey(15)
Pt-Off(0,0,Pic1F)
Pt-Off(0,0,Pic1B)r
DispGraphrr
Pt-Off(0,0,Pic2F)
Pt-Off(0,0,Pic2B)r
DispGraphrr
End

It gives a very scanlined Grayscale, but the values go as follows:

(Value, 1st Pic Gray, 2nd Pic Gray, ranging 0-7 and 0-3 respectively)
0,0,0
1,1,0
2,1,1 (2,0 looks the same, but is more flickery)
3,0,3
4,1,2
5,1,3
6,2,3
7,3,3

Simple process. Some optimization (or Asm rewrites for built-in commands, dispgraphrrr anyone? ) and it could be rather smooth! On my nspire, they're all quite flickery, but I got to try it for a tiny bit on an 83+, and it looked much better. I had not yet tested all the shades, though.

While on Hackspire, I noticed this log file of the boot sequence of the nspire. (obtained through an rs232 cable linked to the dock
http://hackspire.unsads.com/files/log-philippburch-serial-boot.txt

Notice under "Boot Loader Stage 2" It says "Using Production Keys"

Something occurred to me: why state you are using a default if you can't change it?

Since the Boot2 is upgradeable, this means you could change the OS license key, and it appears you don't even need to go that far. The Boot1 is most likely capable (or maybe even some file in the system ) of forcing the boot2 to use a different key when loading the OS. That means two things:

1. If we discover the RSA key to the OS, TI could change it on us with a boot2 v2.5
2. If we can figure out how to force our own key, we could easily install our own OS!

Thoughts?

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?

in the commands html file, it says [picvar] absorbs a pic into Ram. Is there any way to make this pic then drawn to the screen? if not, is there an easier way to draw out a title screen? That's all I need it for at the moment.

So, I installed OS 1.1, put it in userfiles renamed right just in case, and ran ndless.

The output is as follows:
Setting up USB connectivity...
Connecting to the device...
Creating Ndless installation directory...
Checking if Ndless is already installed... No.
Preparing required files on the device:
 - Backuping overwritten files
 - Transferring loader
ERROR: The transfer cannot be completed because the computer file or folder could not be accessed.
Installation aborted.


Any help?