 ô StrongED$mode = BasAsm -î …: î … ‡: ñ ö$;" at line ";ž:ÿ"Spool":à  bits%=17 challenge$="fluffybunny" output$="RAM:X-Hashcash"  length%=1500 	 
/Þ W% 83*4 :ô 80 words (plus a little spare) Þ dateblock% &24,UTC% 5 òzero(W%,80*4) ô zero blocks  today$=¤date("%YR%MN%DY") 2ô format is YYMMDD - dates can be 'faked' here   input$=today$+":"+challenge$  offset%=©(input$) cç offset%>=56 Œ ï7:ñ"This program will not work correctly with such a long challenge string!":à  Bô we are assuming that the string is fewer than 56 characters!  `ç bits%>31 Œ ï7:ñ"This program will not work correctly to find so many bits of collision!":à  blockstart%=0 workreg%=5 work2%=6 count%=4 )Hptr%=10:ô pointer to the data blocks  target%=1 !mask%=12 "result%=8 # $Þ ourcode% length% %L%=ourcode%+length% &òassemble(bits%) '	A%=W% (B%=Hblock ) *ñ "Speed test:" +*È™ "TaskWindow_TaskInfo" ¸ taskwindow% ,%ô are we running in a taskwindow? -'ç taskwindow%=0 Œ ÿ"Spool "+output$ .*ô if so redirect screen output to file /speed%=¤timedhash2 0 1!ñ speed%;" hashes per second" 2*ñ"Checking for ";Ã(bits%);"-bit match" 3 4( estimate$=¤hours((1<<bits%)/speed%) 52 ñ (1<<bits%);" estimated tries at ";estimate$ 6ñ 7 8*looplimit%=6:ç bits%>20 Œ looplimit%=1 9 :ã loop%=1 ¸ looplimit% ;  $W%=input$ < =	  T=‘ >  Ö ourcode% ? @  T$=¤hours((‘-T)/100) A  ç (!tries%)>0 Œ B8    ñ "X-Hashcash: "¤string(W%)'!tries%;" tries   "; C    ñ "Actual time ";T$ D  Ì E6    ñ "!!  Escape pressed - hashcash aborted  !!" F/    loop%=looplimit%+1:ô abort rest of loop G  Í H  òzero(W%,80*4) I Jí loop% K L:ç taskwindow%=0 Œ ÿ"Spool":ÿ"SetType "+output$+" Text" Mô close spooled file Nà O P>Ý ¤string(a%):ô Read &80-terminated string from work block Qê n% Rã n%=0 ¸ 64 ˆ 4 S W%!n%=¤endianBas(W%!n%) Tí U'ô reverse it back so we can read it V	n%=a% Wõ X
 n%+=1 Yý ?n%=&80 Z
?n%=13 [=$a% \ ] ^Ý òassemble(bits%) _ê pass% `%ô implement two passes and set up a%ô values for OPT at the same time b*ô first pass - enable only range check cô i.e. OPT 8 d(ô second pass - enable error report, e*ô range check and listing, i.e. OPT 11 fã pass% = 8 ¸ 10 ˆ 2 g" ô set P% to start of our code h ô on each pass i P% = ourcode% j ô now invoke the assembler k [OPT     pass% l1 STMFD    R13!,{14}     ;store return address m& ; set value of OPT as appropriate n o$; r0 points to start of block W% p.; r1 points to start of Hblock (constants) q rD MOV      Hptr%,r1 ;set up Hptr% (cannot pass to R10 from BASIC) sQ MOV      workreg%,r0; preserve block pointer (OS_ReadMonotonicTime corrupts) tT;------set up random seed------------------------------------------------------- u v).random ;generate two 32-bit integers w, SWI     "OS_ReadMonotonicTime";get seed x MOV      r3,r0 y LDR      r2,randseed z0 MLA      r3,r2,r3,r2   ;random number in r3 { |0 MOV      r0,workreg%; restore block pointer } ~T;------do first hash------------------------------------------------------------  €. MOV      work2%,#©(today$+":"+challenge$)  ;STMFD    R13!,{r0,r1,r2} ‚(  MOV      workreg%,work2%,LSL#3 ;*8 ƒ ¤endian „( STR      workreg%,[blockstart%,#60] …? ; poke length of string (in bits) into final word of block †2 MOV      workreg%,#%10000000;lefthand bit set ‡S STRB     workreg%,[blockstart%,work2%];poke in a bit after last byte of string ˆ9 ;remember, strings run from block%?0 to block%?(n-1) ‰ ŠL ;-----convert input---------------------------------------------------- ‹ Œ>  MOV      r7,blockstart% ;point to start of 16 word block  Ž,  ADD      work2%,r7,#16*4 ;point to end 
 .conv   LDR      workreg%,[r7] ‘  ¤endian ’1  STR      workreg%,[r7],#4;store & increment “  CMP      r7,work2% ”  Bne      conv •  ;LDMFD    R13!,{r0,r1,r2} – —T ;------------------------------------------------------------------------------ ˜ ™(BL       hash ;hash date+fluffybunny š! ;target value now in result% ›  ;r0 (blockstart%) preserved œT;---------initialise counter and flags------------------------------------------  ž+ MOV      count%,#0 ;initialise counter Ÿ MOV      mask%,#(1<<31)  ' MOV      mask%,mask%,ASR#(bits%-1) ¡K ;set bits starting from left end according to number required to match ¢ £7 €      target%,result%,mask% ;mask out bottom bits ¤ ¥ ;MOV      target%,result% ¦ §6  MOV      work2%,#©(today$+":"+challenge$+":")+16 ¨&  ;length of full test hash string © ª" MOV      r14,work2%,LSL#3 ;*8 «# STR      r14,[blockstart%,#60] ¬? ; poke length of string (in bits) into final word of block ­A; note - above section moved out of main loop for extra speed ® ¯ °T;=========main test loop======================================================== ± ²R;------write counter_hex values as string into hash buffer after challenge---- ³" .add64  ;get next counter hex ´ ADDS     r3,r3,#1 µA ADC      r2,r3,r2     ;64bit addition (number held in r2-r3) ¶ STMFD    R13!,{0-5} · MOV      R1,blockstart% ¸* MOV      R0,#©(today$+":"+challenge$) ¹ BL       reversewrite º TST      count%,#&F »K SWIeq    "OS_ReadEscapeState"  ;carry set if Escape condition detected ¼ LDMFD    R13!,{0-5} ½D Bcs      escaped ;jump out of loop, acknowledge escape and quit ¾ ¿T;--------hash combined string and check for match with target------------------- À Á# BL       hash ;hash the string Â@ ;blockstart%,target%,count%,r2-r3(hex regs),mask% preserved Ã$ ;hash value returned in result% Ä ADD      count%,count%,#1 Å*;check value in result% against target Æ7 €      result%,result%,mask% ;mask out bottom bits Ç5 CMP      target%,result% ;check for target found È8 Bne      add64 ;if not found try next random number É ÊT;===========tidy up and exit==================================================== Ë	.exit ÌL STR      count%,tries% ;write out number of tries into buffer at tries% Í5 LDMFD    R13!,{PC} ;restore return value into PC Î ÏT;==========subroutines follow=================================================== ÐT;-------call this if escape detected-------------------------------------------- Ñ.escaped Ò MOV      R0,#124 Ó1 SWI      "XOS_Byte" ; clear escape condition ÔG MVN      count%,#0 ;force count negative to signal aborted attempt Õ1 B        exit      ;branch to exit as normal Ö × ØT;----------main SHA-1 hash routine---------------------------------------------- Ù
 .hash Ú STMFD    R13!,{r0-r4,r14} Û5; > R0 points at endian-converted data (blockend) Ü; < R8=result (A) Ý Þ0; R0 is ptr throughout, R7 is an end pointer ß3; R10 points to block of 'special values' K1-K4 àT; corrupts r1-r6 (A%-E% + TEMP%), R8, R14 (work registers), R11 (special values) á; R12 (mask%) not used â ãP                ADD     R7, R0, #80*4 ;point to end of initial 80-word block ä.                ;SWI     "OS_BreakAddress" åK                ADD     R0, R0, #16*4 ;we subtract this at the start of æ4                                      ;each loop ç è'.stepb          SUB     R0, R0, #64 é5                LDMIA   R0, {R1-R5}    ; -64, -56 êO                ‚     R1, R1, R3  ;1st set - R1 holds t%-64, R3 holds t%-56 ëO                ‚     R2, R2, R4  ;2nd set - R2 holds t%-64, R4 holds t%-56 ìO                ‚     R3, R3, R5  ;3rd set - R3 holds t%-64, R5 holds t%-56 íH                ;note R3 is being used by *two* sets simultaneously! î<                ADD     R0,R0,#32       ;advance pointer ï ð0                LDMIA   R0, {R4-R6}    ; -32 ñP                ‚     R1, R1, R4 ;R1,R2,R3 hold running total for sets 1,2,3 òM                ‚     R2, R2, R5 ;R4,R5,R6 hold t%-32 for respective sets ó$                ‚     R3, R3, R6 ô<                ADD     R0,R0,#20       ;advance pointer õ ö1                LDMIA   R0!, {R4-R6}    ; -12 ÷$                ‚     R1, R1, R4 ø$                ‚     R2, R2, R5 ù$                ‚     R3, R3, R6 ú?                ;t%-64 ‚ t%-56 ‚ t%-32 ‚ t%-12 for each set û(                MOV     R1,R1,ROR#31 ü(                MOV     R2,R2,ROR#31 ý(                MOV     R3,R3,ROR#31 þ<                ;rotate result leftwards by one position ÿ(                STMIA   R0!, {R1-R3} 5                ;store at t% relative to each set"                CMP     R0, R7
.check!                Blo     stepbQ;‚ t%-12,t%-32,t%-56 and t%-64 together in parallel for consecutive addresses);using 3 pairs of registers at a timeK                SUB     R0, R7, #80*4;move pointer to start of W% block	>                ADD     R7, R0, #80  ;end pointer position

.stepc9                LDMIA   Hptr%, {R1-R5}     ; R1-5=A-E';gollop five registers in from Hptr*                LDR     R11, special+0
.stepdA                ‚     R14, R3, R4             ; R14=work2=C^D<                €     R14, R2, R14            ;B € (C^D)D                ‚     R14, R4, R14            ;D ‚ (B € (C ‚ D))B ; equivalent to (b% € c%) „ ((¬ b%) € d%), one less operationN                ADD     R6, R14,R1, ROR#27      ;TEMP=shifted A plus total7                ADD     R6, R6, R5              ;+EG                LDR     R14, [R0],#4            ;load from W% block@                ADD     R6, R6, R14             ;add to TEMP:                ADD     R6, R6, R11             ; +K1%F;Now, instead of rotation... we rotate the sense, unroll the loop,H;and continue. The loop should have run 20 times, so we only have toF;check for termination after the 2nd of the six repeats (3*6+2=20) 0                ; E=D                   R4=E!0                ; D=C                   R3=D"D                MOV     R2, R2, ROR#2   ; R2=C (shift B left 30)#0                ; B=A                   R1=B$9                ; A=TEMP                R6=A, R5=TEMP%&=                ‚     R14, R2, R3             ; work2=C^D'&                €     R14, R1, R14(&                ‚     R14, R3, R14)J                ADD     R5, R14, R6, ROR#27 ;TEMP=shifted A plus total*&                ADD     R5, R5, R4+,(                LDR     R14, [R0],#4-'                ADD     R5, R5, R14.:                ADD     R5, R5, R11             ; +K1%/0                ; again1)                MOV     R1, R1, ROR#223M        CMP     R0, R7                          ; completed the 20th run?4        BCS     stepd_2056=                ‚     R14, R1, R2             ; work2=C^D7&                €     R14, R6, R148&                ‚     R14, R2, R149J                ADD     R4, R14, R5, ROR#27 ;TEMP=shifted A plus total:&                ADD     R4, R4, R3;<(                LDR     R14, [R0],#4='                ADD     R4, R4, R14>:                ADD     R4, R4, R11             ; +K1%?@                ; againA)                MOV     R6, R6, ROR#2BC=                ‚     R14, R6, R1             ; work2=C^DD&                €     R14, R5, R14E&                ‚     R14, R1, R14FJ                ADD     R3, R14, R4, ROR#27 ;TEMP=shifted A plus totalG&                ADD     R3, R3, R2HI(                LDR     R14, [R0],#4J'                ADD     R3, R3, R14K:                ADD     R3, R3, R11             ; +K1%LM                ; againN)                MOV     R5, R5, ROR#2OP=                ‚     R14, R5, R6             ; work2=C^DQ&                €     R14, R4, R14R&                ‚     R14, R6, R14S/                ADD     R2, R14, R3, ROR#27T&                ADD     R2, R2, R1UV(                LDR     R14, [R0],#4W'                ADD     R2, R2, R14X:                ADD     R2, R2, R11             ; +K1%YZ                ; again[)                MOV     R4, R4, ROR#2\]=                ‚     R14, R4, R5             ; work2=C^D^&                €     R14, R3, R14_&                ‚     R14, R5, R14`M                ADD     R1, R14, R2, ROR#27    ;TEMP=shifted A plus totala&                ADD     R1, R1, R6bc(                LDR     R14, [R0],#4d'                ADD     R1, R1, R14e:                ADD     R1, R1, R11             ; +K1%fg                ; finallyh)                MOV     R3, R3, ROR#2iI                B       stepd                   ; 20th is never here!j*;               ----------------------kl.stepd_20        ; R4=TEMPm                ; R3=En                ; R2=Do                ; R1=Cp                ; R6=Bq                ; R5=ArG                ADD     R7, R7, #80              ;end of next blocksJ                LDR     R11, special+4           ; next magic constanttu.stepd2v9                ‚     R14, R6, R1              ;B ‚ Cw=                ‚     R14, R14, R2             ;B ‚ C ‚ DxO                ADD     R4, R14, R5, ROR#27      ;TEMP=shifted A plus totaly8                ADD     R4, R4, R3               ;+Ez{(                LDR     R14, [R0],#4|'                ADD     R4, R4, R14}'                ADD     R4, R4, R11~H                ; once again, we rotate the sense, not the registers€)                MOV     R6, R6, ROR#2‚%                ‚     R14, R5, R6ƒ&                ‚     R14, R14, R1„K                ADD     R3, R14, R4, ROR#27  ;TEMP=shifted A plus total…&                ADD     R3, R3, R2†‡(                LDR     R14, [R0],#4ˆ'                ADD     R3, R3, R14‰'                ADD     R3, R3, R11Š‹                 ; once againŒ)                MOV     R5, R5, ROR#2Ž        CMP     R0, R7        BCS     stepd2_20‘%                ‚     R14, R4, R5’&                ‚     R14, R14, R6“J                ADD     R2, R14, R3, ROR#27 ;TEMP=shifted A plus total”&                ADD     R2, R2, R1•–(                LDR     R14, [R0],#4—'                ADD     R2, R2, R14˜'                ADD     R2, R2, R11™š                 ; once again›)                MOV     R4, R4, ROR#2œ%                ‚     R14, R3, R4ž&                ‚     R14, R14, R5ŸK                ADD     R1, R14, R2, ROR#27  ;TEMP=shifted A plus total &                ADD     R1, R1, R6¡¢(                LDR     R14, [R0],#4£'                ADD     R1, R1, R14¤'                ADD     R1, R1, R11¥¦                 ; once again§)                MOV     R3, R3, ROR#2¨©%                ‚     R14, R2, R3ª&                ‚     R14, R14, R4«J                ADD     R6, R14, R1, ROR#27 ;TEMP=shifted A plus total¬&                ADD     R6, R6, R5­®(                LDR     R14, [R0],#4¯'                ADD     R6, R6, R14°'                ADD     R6, R6, R11±²                 ; once again³)                MOV     R2, R2, ROR#2´µ%                ‚     R14, R1, R2¶&                ‚     R14, R14, R3·I                ADD     R5, R14, R6, ROR#27;TEMP=shifted A plus total¸&                ADD     R5, R5, R4¹º(                LDR     R14, [R0],#4»'                ADD     R5, R5, R14¼'                ADD     R5, R5, R11½¾                ; finally¿)                MOV     R1, R1, ROR#2À"                B       stepd2Á*;               ----------------------ÂÃ.stepd2_20       ; R2=TEMPÄ                ; R1=EÅ                ; R6=DÆ                ; R5=CÇ                ; R4=BÈ                ; R3=AÉ'                ADD     R7, R7, #80ÊK                LDR     R11, special+8           ; third magic constantËÌ.stepd3Í8                „R     R14, R5, R6            ;C „ DÎ=                €     R14, R4, R14           ;B € (C „ D)ÏK                €     R8, R5, R6              ;C € D  (R8=workreg here)ÐK                „R     R14, R8, R14            ;(B € (C „ D)) „ (C € D)ÑI ;equivalent to (b% € c%) „ (b% € d%) „ (c% € d%), one less operationÒÓJ                ADD     R2, R14, R3, ROR#27 ;TEMP=shifted A plus totalÔ-                ADD     R2, R2, R1  ; +E%ÕÖI                LDR     R14, [R0],#4 ;load from pointer and increment×'                ADD     R2, R2, R14Ø'                ADD     R2, R2, R11ÙÚ$                ; sense rotationÛ)                MOV     R4, R4, ROR#2ÜÝ&                „R     R14, R4, R5Þ&                €     R14, R3, R14ßC                €     R8, R4, R5              ; R8=workreg hereà'                „R     R14, R8, R14áI                ADD     R1, R14, R2, ROR#27;TEMP=shifted A plus totalâ&                ADD     R1, R1, R6ãä(                LDR     R14, [R0],#4å'                ADD     R1, R1, R14æ'                ADD     R1, R1, R11çè$                ; sense rotationé)                MOV     R3, R3, ROR#2ê        CMP     R0, R7ë        BCS     stepd3_20ìí&                „R     R14, R3, R4î&                €     R14, R2, R14ïC                €     R8, R3, R4              ; R8=workreg hereð'                „R     R14, R8, R14ñI                ADD     R6, R14, R1, ROR#27;TEMP=shifted A plus totalò&                ADD     R6, R6, R5óô(                LDR     R14, [R0],#4õ'                ADD     R6, R6, R14ö'                ADD     R6, R6, R11÷ø$                ; sense rotationù)                MOV     R2, R2, ROR#2úû&                „R     R14, R2, R3ü&                €     R14, R1, R14ýC                €     R8, R2, R3              ; R8=workreg hereþ'                „R     R14, R8, R14ÿI                ADD     R5, R14, R6, ROR#27;TEMP=shifted A plus total &                ADD     R5, R5, R4(                LDR     R14, [R0],#4'                ADD     R5, R5, R14'                ADD     R5, R5, R11$                ; sense rotation)                MOV     R1, R1, ROR#2	&                „R     R14, R1, R2
&                €     R14, R6, R14C                €     R8, R1, R2              ; R8=workreg here'                „R     R14, R8, R14I                ADD     R4, R14, R5, ROR#27;TEMP=shifted A plus total&                ADD     R4, R4, R3(                LDR     R14, [R0],#4'                ADD     R4, R4, R14'                ADD     R4, R4, R11$                ; sense rotation)                MOV     R6, R6, ROR#2*                MOV     R3, R4, ROR#27&                „R     R14, R6, R1&                €     R14, R5, R14C                €     R8, R6, R1              ; R8=workreg here'                „R     R14, R8, R14I                ADD     R3, R14, R4, ROR#27;TEMP=shifted A plus total&                ADD     R3, R3, R2(                LDR     R14, [R0],#4 '                ADD     R3, R3, R14!'                ADD     R3, R3, R11"#$                ; sense rotation$)                MOV     R5, R5, ROR#2%"                B       stepd3&*;               ----------------------'(.stepd3_20       ; R6=TEMP)                ; R1-R5=A-E*'                ADD     R7, R7, #80+J                LDR     R11, special+12           ; fourth magic value,-.stepd4.%                ‚     R14, R2, R3/6                ‚     R14, R14, R4 ;(b% ‚ c% ‚ d%)0J                ADD     R6, R14, R1, ROR#27 ;TEMP=shifted A plus total1-                ADD     R6, R6, R5  ; +E%23(                LDR     R14, [R0],#44'                ADD     R6, R6, R145'                ADD     R6, R6, R1167                ; rotate8)                MOV     R2, R2, ROR#29:%                ‚     R14, R1, R2;&                ‚     R14, R14, R3<I                ADD     R5, R14, R6, ROR#27;TEMP=shifted A plus total=&                ADD     R5, R5, R4>?(                LDR     R14, [R0],#4@'                ADD     R5, R5, R14A'                ADD     R5, R5, R11BC                ; rotateD)                MOV     R1, R1, ROR#2E        CMP     R0, R7F        BCS     stepd4_20GH%                ‚     R14, R6, R1I&                ‚     R14, R14, R2JI                ADD     R4, R14, R5, ROR#27;TEMP=shifted A plus totalK&                ADD     R4, R4, R3LM(                LDR     R14, [R0],#4N'                ADD     R4, R4, R14O'                ADD     R4, R4, R11PQ                ; rotateR)                MOV     R6, R6, ROR#2ST%                ‚     R14, R5, R6U&                ‚     R14, R14, R1VI                ADD     R3, R14, R4, ROR#27;TEMP=shifted A plus totalW&                ADD     R3, R3, R2XY(                LDR     R14, [R0],#4Z'                ADD     R3, R3, R14['                ADD     R3, R3, R11\]                ; rotate^)                MOV     R5, R5, ROR#2_`%                ‚     R14, R4, R5a&                ‚     R14, R14, R6bI                ADD     R2, R14, R3, ROR#27;TEMP=shifted A plus totalc&                ADD     R2, R2, R1de(                LDR     R14, [R0],#4f'                ADD     R2, R2, R14g'                ADD     R2, R2, R11hi                ; rotatej)                MOV     R4, R4, ROR#2kl%                ‚     R14, R3, R4m&                ‚     R14, R14, R5nI                ADD     R1, R14, R2, ROR#27;TEMP=shifted A plus totalo&                ADD     R1, R1, R6pq(                LDR     R14, [R0],#4r'                ADD     R1, R1, R14s'                ADD     R1, R1, R11tu                ; rotatev)                MOV     R3, R3, ROR#2w"                B       stepd4x*;               ----------------------yz.stepd4_20       ; R4=TEMP{                ; R5=A|}(                LDR     R14, [Hptr%]~J                ADD     result%, R5, R14             ; result=A+[Hptr]€; Result is in result%‚< LDMFD    R13!,{r0-r4,PC} ;restore return value into PC,ƒ) ;block pointer,hex regs,target value„…†T;=========write little-endian hex, non word-aligned!============================‡ˆ$; > R0=length of original string‰;   R1=bufferŠ?;   R2-R3=number to append (top nibble of R3 written first)‹; < R0-R5 corruptedŒ@.reversewrite    €     R4, R0, #3              ; byte offsetŽR                                         ;preserve right-hand bits of R0 in R4A                BIC     R0, R0, #3              ; word offsetP                ADD     R1, R1, R0              ; ptr to word containing the‘I                                                ; first byte to write’K                ‚     R0, R4, #3              ; REVERSE the byte offset“”;                MOV     R4, #58                 ; colon•F                STRB    R4, [R1,R0]             ; append to string–O                SUBS    R0, R0, #1              ; if we drop out the bottom—J                ADDMI   R1, R1, #4              ;  go to the next word˜K                MOVMI   R0, #3                  ;  and start at the top™šE                MOV     R5, #15                 ; 16 digits to do›C.digits          MOV     R4, R3, LSR#28          ; get a nibbleœ#                CMP     R4, #10'                ADDCS   R4, R4, #87žD                ADDCC   R4, R4, #48             ; convert to hexŸ ;                STRB    R4, [R1,R0]             ; store¡J                SUBS    R0, R0, #1              ; advance to next byte¢&                ADDMI   R1, R1, #4£"                MOVMI   R0, #3¤¥L                MOV     R3, R3, LSL#4           ; rotate 64bit number by¦<                „R     R3, R3, R2, LSR#28      ;  4 bits§)                MOV     R2, R2, LSL#4¨©@                SUBS    R5, R5, #1              ; next digitª"                BPL     digits«¬E                MOV     R4, #%10000000          ;lefthand bit set­F                STRB    R4, [R0,R1]             ; terminate string®#                MOV     PC, R14¯°±T;========speed test routine - count% hashes=====================================².speedstart³ STMFD      R13!,{r14}´
.timerµ BL         hash¶ STMFD    R13!,{0-2}·I ADDS     count%,count%,#0 ;clear carry flag returned by hash routine¸  ; (not needed in real loop)¹ TST      count%,#&Fº9 SWIeq      "OS_ReadEscapeState" ;scan for escape key» LDMFD    R13!,{0-2}¼> Bcs        escaped ;acknowledge and exit via main routine½  SUBS       count%,count%,#1¾ Bne        timer¿À LDMFD      R13!,{pc}ÁT;================debugging - call endian from BASIC=============================Â.switchÃ¤endianÄMOV      R0,R5Å,MOV      R15, R14          ;exit routineÆT;==========data blocks follow===================================================ÇÈ.randseedÉEQUD 1664525Ê.HblockËEQUD &67452301ÌEQUD &EFCDAB89ÍEQUD &98BADCFEÎEQUD &10325476ÏEQUD &C3D2E1F0ÐÑ.special ;'magic' constantsÒ EQUD &5A827999Ó EQUD &6ED9EBA1Ô EQUD &8F1BBCDCÕ EQUD &CA62C1D6Ö×.tries%Ø
EQUD 0Ù	ALIGNÚ ]Û$ô we have now left the assemblerÜí pass%Ý#ô OSCLI"BreakSet "+STR$~(check)ÞáßàáÝ òzero(block%,len%)âê n%ãã n%=0 ¸ len% ˆ 4ä  block%!n%=0åí n%æáçèéÝ ¤date(format$)êê r%ë?UTC%=3ìÈ™"OS_Word",14,UTC%í"ô current time in centisecondsîKÈ™"OS_ConvertDateAndTime",UTC%,dateblock%,&24,format$+½(0) ¸ ,r%:?r%=13ï=$dateblock%ð'ô Time in GMT (even for foreigners)ñòÝ ¤hours(sec%)óê a$,R%ôR%=sec% ƒ 60:sec%=sec%  60õa$=Ã(R%)+" sec"öR%=sec% ƒ 60:sec%=sec%  60÷)a$=Ã(sec%)+" hours "+Ã(R%)+" min "+a$ø=a$ùúÝ ¤endianû.ô macro this in instead of branching to itü[OPT pass%ýT;====reverse order of bytes in a register == big/little-endian==================þ(; data should be in r5, output in r5ÿ; corrupts R1 C         ‚ r1,r5,r5,ROR #16      ; (aEORc)(bEORd)(aEORc)(bEORd)E         BIC r1,r1,#&FF0000        ; (aEORc)   0   (aEORc)(bEORd)B         MOV r5,r5,ROR #8          ;    d      a      b      c@         ‚ r5,r5,r1,LSR #8       ;    d      c      b      a]=0Ý ¤endianBas(int%)	F%=int%
=º(switch)Ý ¤timedhash2 B%=Hblock
 A%=W% E%=1600:ô count%.õ E%=E%*20 ô put T=Time as last statement before call. T=‘ Ö speedstart T=(‘-T)/100	ý T>2- ñ T;" seconds to complete ";E%;" hashes"	=E%/Tÿ