FreeBASIC

[JRS]

he NSA have a facility in Utah, well suited to this enterprise

A great way to reduce the national debt. I know too funny and we all know where the bucks will end up.

Curious. The more BitCoin is mined, does it make it just that much harder to find the next coin? How did the early pioneers with a standard PC generate so many BitCoins?

[Charles Pegge]

Operations can be defined in inline assembler, so there is very little loss of efficiency.

Re BitCoins: I understand they are like prime numbers. The brute processing involved in finding new ones, increases exponentially. It's perfect for a pyramid scheme.

[edcronos]

for me it's complicated, I researched and read about it,
but for the variety of answers it seems to be tricky even for seasoned programmers
in Vba I used 4 32-bit integers for the process, but ended up not fitting at all what I wanted to do, besides complicating the whole process
basically I use only Or, And, Xor, Not, and bitcount,

[JRS]

It's perfect for a pyramid scheme.

Can you imagine the US government not being able to print money on demand? 

[Charles Pegge]

basically I use only Or, And, Xor, Not, and bitcount,

logic, addition and subtraction is very easy to implement in any binary width. Multiplication and division are the trick operations. I'm still fine-tuning the operator system, but this illustrates what a 128-bit logic operator set would look like, without Assembly code:

Code: [Select]

type i128 int i1,i2,i3,i4

macro i128_op(a,  p)
  macro .ops(p,a)
    ac.i1 p a.i1
    ac.i2 p a.i2
    ac.i3 p a.i3
    ac.i4 p a.i4
  end macro
  macro ."save"(a)
    i128 ac
    a.i1=ac.i1
    a.i2=ac.i2
    a.i3=ac.i3
    a.i4=ac.i4
  end macro
  macro ."load"(a)
    dim i128 ac
    i128_op.ops(=,a)
  end macro
  macro ."and"(a)
    i128_op.ops(and=,a)
  end macro
  macro ."or"(a)
    i128_op.ops(or=,a)
  end macro   
  macro ."xor"(a)
    i128_op.ops(xor=,a)
  end macro   
  macro ."not"(a)
    i128_op.ops(=not,a)
  end macro   
end macro

'TEST
dim u,v,w,x as i128
u=v and (w or x)


[edcronos]

thank you
I've been a bit busy, but still searched for asm, I was already working on some things to use 32bit and 64bit, I noticed it's quite complicated to implement 128bit
I do not know if it's possible something like that.
__int64a;
__int64 b;
__int64 c;
int Count;
asm {
  mov rax, a
  mov rbx b
   and rax, rbx
   mov c rax
     popcnt Count, rax
}

I am waiting for the new version of the Oxygen to try to migrate my functions, some not even use but can serve something like the ones that generate the csn "Combinational Sequence Number" by the combination and that generates the combination by csn

there are people who learn to program specifically because of lotteries, in the forum there is one that has learned Delphi even made a program for personal use, and now he is learning Python to be able to take advantage of the available resources, but unlike me he makes bets,