Name: FrozenVoid 2011-10-07 11:37
:Latest news - Updated search algorithm:
1.file->arb. prec. int:X //scale_mod=(1<<(filesize)) !adaptive window
2.lowbound L= (X-(1<<(filesize) ))<<(filesize*8) //lower bound
3.hibound H= (X+(1<<(filesize)))<<(filesize*8) //upper bounds
4. result R must be H > R < L
5. R is sum of ((-/+)(e^K))+((-/+)(e^K))... with e=2.71...(the Logn constant)
6.K powers are positive powers of e, then multiplied by sign and stored as Long Double(10 bytes each).
7.scale_mod: calculated difference between X<<(filesize*8) and R
R is inside the window(H<>L), but is not R=X scaled, so scale_mod is required.
9. Output File:(sizeof(scale_mod);scale_mod+series of Long Double K's
1.file->arb. prec. int:X //scale_mod=(1<<(filesize)) !adaptive window
2.lowbound L= (X-(1<<(filesize) ))<<(filesize*8) //lower bound
3.hibound H= (X+(1<<(filesize)))<<(filesize*8) //upper bounds
4. result R must be H > R < L
5. R is sum of ((-/+)(e^K))+((-/+)(e^K))... with e=2.71...(the Logn constant)
6.K powers are positive powers of e, then multiplied by sign and stored as Long Double(10 bytes each).
7.scale_mod: calculated difference between X<<(filesize*8) and R
R is inside the window(H<>L), but is not R=X scaled, so scale_mod is required.
9. Output File:(sizeof(scale_mod);scale_mod+series of Long Double K's