Releasing full AGI/evolution research

  • 276 Replies
  • 47957 Views
*

LOCKSUIT

  • Emerged from nothing
  • Trusty Member
  • *******************
  • Prometheus
  • *
  • 4514
  • First it wiggles, then it is rewarded.
    • Main Project Thread
Re: Releasing full AGI/evolution research
« Reply #270 on: May 03, 2021, 08:46:51 pm »
got a hash table working! I coded it myself and uses someone's simple generator:

input = 'walking down the street and saw some birds flying north'
HT = [None] * 50
for n in range(len(input) - 2):
  key = input[n:n+2]
  hashsum = 0
  for idx, c in enumerate(key):
      hashsum += (idx + len(key)) ** ord(c)
      hashsum = hashsum % 50
  if HT[hashsum] is None:
    HT[hashsum] = [input[n:n+3]]
  else:
    HT[hashsum].append(input[n:n+3])
print(HT)
Emergent

*

LOCKSUIT

  • Emerged from nothing
  • Trusty Member
  • *******************
  • Prometheus
  • *
  • 4514
  • First it wiggles, then it is rewarded.
    • Main Project Thread
Re: Releasing full AGI/evolution research
« Reply #271 on: May 04, 2021, 06:24:57 pm »
I had got holed matches working some days ago and might, along with time delayed matches, get my compression score down from 20.3MB to anywhere somewhere around 19.2 to 17MB. It isn't that hard for me to implement this but first I have to make my datastructure much faster/ memory efficient to handle the extra searches. I'm thinking I might use only for 1-3 context lengths the hash table, as tree is pretty fast for longer branches as there is no branch splits while stores the contexts as one in a branch unlike a hash table. But I'm talking to someone on this matter.
Emergent

*

MikeB

  • Electric Dreamer
  • ****
  • 105
Re: Releasing full AGI/evolution research
« Reply #272 on: May 05, 2021, 04:47:00 pm »
Hi Locksuit, I'm still working on a C++ conversion. It's 99% done. I also have a list of notes for your python version for possible speed improvements (centered around string checking removal). Do you have an email..?

The best overall text compressors seem to be in the range... (WinRAR 3.60b3)
30-60 seconds for 100MB (22MB. <256MB memory)
5-10 minutes for 1GB (220MB. <512MB memory)

If it could reach that you could claim best overall imo... all the other compressors take too long, or use too much resources, or just straight out use a GPU to process it

I think the speed will be within that for the C++ version.

*

LOCKSUIT

  • Emerged from nothing
  • Trusty Member
  • *******************
  • Prometheus
  • *
  • 4514
  • First it wiggles, then it is rewarded.
    • Main Project Thread
Re: Releasing full AGI/evolution research
« Reply #273 on: May 05, 2021, 05:27:50 pm »
That is amazing, wow, thank you for doing that. I will private message you my email.
« Last Edit: May 05, 2021, 10:50:47 pm by LOCKSUIT »
Emergent

*

infurl

  • Administrator
  • **********
  • Millennium Man
  • *
  • 1221
  • Humans will disappoint you.
    • Home Page
Re: Releasing full AGI/evolution research
« Reply #274 on: May 05, 2021, 10:28:59 pm »
It would be safer to use private messages to exchange email addresses. Posting email addresses publicly is ill-advised. MikeB please confirm when you have read this and I'll obfuscate the email address.

*

LOCKSUIT

  • Emerged from nothing
  • Trusty Member
  • *******************
  • Prometheus
  • *
  • 4514
  • First it wiggles, then it is rewarded.
    • Main Project Thread
Emergent

*

LOCKSUIT

  • Emerged from nothing
  • Trusty Member
  • *******************
  • Prometheus
  • *
  • 4514
  • First it wiggles, then it is rewarded.
    • Main Project Thread
Re: Releasing full AGI/evolution research
« Reply #276 on: June 19, 2021, 06:03:42 am »
I tried cmix's pre-processor with my program - like how other top programs use pre-processors. Decompression matched. I got 19,477,251 bytes for the enwik8 file.
Emergent