ProgrammerHumor
okSureButWithAdditionalSteps
Discussion
just store the numbers as binary string uwu
no need to care about cpu architecture ever again.
need a 6827891 bit number? sure, just set up your string and get working
And what about mathemetical operations like add and subtract, do string operations on them?
i mean, this is somewhat how bigInt works, just that it works with decimals instead of binary.
but yea, you make a class, define an add and subtract method, then then does an index by index addition/subtraction, and then returns the value in the end or updates the value in the object directly.
it obviously isnt as efficient as working with normal ints and so on, but it gets the job done in situations where you need extremely large numbers as you arent bound to 32 or 64 bit anymore.
added bonus, it works on every platform.
I know how bigint works, but you don't use it everywhere , because each operation requires karatsuba and fft. While using computer architecture to solve arithmetic operations is better for integer because each bit operation is done together. Hence we work on integers not on bigint unless necessary.
well yea, they are very inefficient, as such their usage is pretty limited.
One such use case would be RSA for example, with the MASSIVE exponents that you use to generate keypairs.
No bigfloat yet, even though it's extremely easy if we're willing to make the same math operations tradeoff.
i would go as far as to say, the main use case for bigInts is when you are doing RSA for example, calculating with massive exponents and so on.
as for floats/doubles, i suppose those just arenr as useful to make them a default thing.
but yea, functionality wise, they would work the same way
Just concatenate the operation into the string.
Store it as a decimal digit string like Cobol. You can even save memory by using only 2 digits for the year.
yes, but binary is fun uwu
Why would in do that when add and adc is significantly faster?
for some operations you need massive numbers, for example when calculating the public and private keys for RSA
there you work with exponents that are like 256 or more bits long, that is bigger than any cpu i am aware of is capable of working with out of the box, meaning you need such an intermediate structure.
that is also one of the reasons why you woudnt encrypt a file with RSA.
you would encrypt the file with a symetrical method such as AES for example, and then use RSA merely to encrypt the key for the semetrical algorithm
I was writing some assembly not too long ago where I needed to do 64bit adds in 32bit code. This is where I leaned that x86 has instructions for arbitrary precision arithmetic.
It has add carry and extending multiplication. arm also has those.
processor explodes
Some years ago I needed/wanted 64 bit variables at a 8 bit PIC microcontroller...
I had to use another compiler for that, but then it worked.
Use BCD and you can work with numbers almost as big as yo momma
bro is colossal
Bro exceeds INT32_MAX
He’s so obese the recursive function calculating his mass resulted in a stack overflow
Bro is about to overflow for the second time
Bro so thicc the stack overflow wrapped around the memory array and wrapped back into the valid memory addresses lol
Bro that’s DJ Khaled
Suffering from overflow
i refuse to believe
looks like "Gordão da XJ", a brazilian influencer
As the British would day;
Big, in't?
Legends foretold the coming of Huge Endian