Jump to content
Sign in to follow this  
dieterle

GG8.x Features and Request

Recommended Posts

1 hour ago, geribaldi said:

 

AoB scanning

What is this?

Share this post


Link to post
Share on other sites

What is this?

Scanning for aob = scanning array of bytes=op scan

You can find the real offset of a function

Gesendet von meinem SM-G925F mit Tapatalk

Share this post


Link to post
Share on other sites
4 minutes ago, geribaldi said:

You can find the real offset of a function

What is mean by this?

Share this post


Link to post
Share on other sites

You know the problem of changing adresses in a game. For example the adress for ammo in a game. Adress can change after one round in a lot of games. With aob scanning you can find the real adress not the virtual where changed by android

Gesendet von meinem SM-G925F mit Tapatalk

Share this post


Link to post
Share on other sites

How? Give me example with test data.

Share this post


Link to post
Share on other sites

This is not a answer.

The main problem is that you have no guarantee that your data is a pointer there.
For example you have a field that you want to hack. But it does not have pointers in memory, and all because it is a field in the structure. And the reference to it is through a pointer to the structure plus the offset. But you do not know what the offset, and whether it is at all. Therefore, you can not find the pointer.

Share this post


Link to post
Share on other sites

Im not a coder enyby but all our hacks with chams, wallhacks, norecoil, nospread, onhitkill, aimbot, triggerbots whatever based on offsets. It means, we sell one hack running on every pc.

For example:

If you develope a game and you want to give a weapon a recoil value, you save it to a specified adress the offset.

The coder must find this offset if he want to sell a hack.

There are tools like cheatengine, with its possible to find it. I dont know whether its possible on android. But android its c+ or java, so it must be possible

Gesendet von meinem SM-G925F mit Tapatalk

If you need any help, give a look on http://www.unknowncheats.me its a good platform to teach yourself. Advance your coding skills, learn how to bypass anticheats on multiple ways....you find everything on this site

Gesendet von meinem SM-G925F mit Tapatalk

Share this post


Link to post
Share on other sites

If you write hack for some game - you can test possible offsets. If you write common tool - it can not be doned. Offset can be any.

But I describe most simplest example. In real life can be many levels of pointer. And it make impossible found needed values. 

I do not help on this. I known - it is impossible in common case.

Maximum - we can test some cases. For example stay mean offset as zero. For  some app it can be worked. But not for all.

Share this post


Link to post
Share on other sites
4 hours ago, Enyby said:

If you write hack for some game - you can test possible offsets. If you write common tool - it can not be doned. Offset can be any.

But I describe most simplest example. In real life can be many levels of pointer. And it make impossible found needed values. 

I do not help on this. I known - it is impossible in common case.

Maximum - we can test some cases. For example stay mean offset as zero. For  some app it can be worked. But not for all.

I feel it could be possible... 

Need to find a value that's always the same value (unique value) and then the offset from that location to other values sometimes it's same distance away. Rarely values are stored in same memory location, but common they are same offset. I think that's what @geribaldiis getting at. 

Share this post


Link to post
Share on other sites

Memory most of them getted with malloc or realloc. It position depends of very many factors. It vary if order of allocation vary. It is typical on multithreaded apps - most of apps.

Is first problem.

Another consist in other. You have address in memory - how you find this "unique" value? Give me example.

Share this post


Link to post
Share on other sites

You would do a union search with that and a few other values. If floating then use the dword value. Basically create a single search that can only return those values. 

Great example: 

 

 

I don't think the values I search had much meaning, but, got me a reference point to find the smaller values. 

Edited by NoFear1183

Share this post


Link to post
Share on other sites

I undserstand nothing. You use 24 as offset from one value. 24? Where you get this number?

 

I repeat my question - user search for value. User find value it located on memory address A and have value B. Give me algorithm for found "unique" value or some other way for find this variable in memory on next game run.

Share this post


Link to post
Share on other sites

Browsing nearby memory of the values I knew I wanted to edit. I found values that were large/unique.  Finding those values will always have same distance to the value I originally found and want to edit. 

Not sure you can entirely 'automate' this...  But wondering if that's how sbgamehacker had a list of titles that was basically a one click hack.  

Would be a per game basis. Not a 1 code hack all and I think that's what you're thinking. 

Share this post


Link to post
Share on other sites

I mean automated algorithm. But it impossible. Need search one and save all memory near, then run game again - search again and compare memory. But between runs alue can be changed. Or same value may be coincedence.

Because of that I say it is impossible in common case.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

×
×
  • Create New...