« previous next »
Pages: [1]

Author Topic: 64-bit bignums  (Read 619 times)

tenkey

  • Member
  • **
  • Posts: 51
64-bit bignums
« on: January 17, 2023, 04:00:09 AM »
I found 64-bits to be wonderful for multiprecision division. I haven't yet coded Collatz or Fibonacci for my bignum package. A little inconvenient because I make the caller responsible for all memory management.
Logged

jack

  • Member
  • **
  • Posts: 231
Re: 64-bit bignums
« Reply #1 on: January 17, 2023, 05:34:06 AM »
hello tenkey
would you post an example using your routines?
Logged

tenkey

  • Member
  • **
  • Posts: 51
Re: 64-bit bignums
« Reply #2 on: January 19, 2023, 07:51:46 AM »
I’m currently working on a Fibonacci demo.
Logged

jack

  • Member
  • **
  • Posts: 231
Re: 64-bit bignums
« Reply #3 on: January 19, 2023, 08:49:44 AM »
 :thup:
Logged

tenkey

  • Member
  • **
  • Posts: 51
Re: 64-bit bignums
« Reply #4 on: February 02, 2023, 06:27:43 AM »
Fibonacci example.

It uses over-allocation of bignum buffers to make it easy to reuse them. Not used are some wrapper functions which have not been tested yet. The wrapper functions make things slower, but the auto-allocation relieves you from calculating the memory needs of temporary buffers and result buffers.
Logged

HSE

  • Member
  • *****
  • Posts: 2494
  • AMD 7-32 / i3 10-64
Re: 64-bit bignums
« Reply #5 on: February 15, 2023, 01:04:08 AM »
 :thumbsup: Very interesting.
Logged
Equations in Assembly: SmplMath
Pages: [1]
« previous next »