Leaderboard

Union search is ready. You can input something like: 1;2;3;4 And search 4 number in one time. But it buggy. I worked on fix.

I later add instruction and example video.

Give logcat from this: GameGuardian.git_signed.apk

Everything is relative. Any protection can be hacked or bypassed. Just as to detect any application. Including GG. Just most developers rely on the package name, that's all. With regard to protection - my knowledge will be enough to make GG almost undetectable, but it is not my purpose. Therefore, I limit myself to change the package name, nothing more.

The first process is the main. This is the process of the game. He starts second and monitor its status. If the second process of dying, the first is completed. The second process as the debugger is connected to the first. If the first process stops or dies, the second process of killing himself and the first process. GG off the second process and freeze it because it can not be killed, else first die.

02-29 01:46:50.761 E/bulldog-daemon(14875): helper error start 13: Permission denied 02-29 01:46:50.761 D/bulldog-daemon(14875): helper: /data/app/com.machinezone.gw-1/lib/arm64/libhelper.so Error is still same. Something prevent run this file as executable.

I heard it was possible to search for some values by changing them (increasing and decreading) while using a search engine to locate the changing values. I only heard people having success on selected items or weapons. But the key to success was doubling the values. I believe I read this was because the game was built on some particular engine Sent from my SM-N920C using Tapatalk

Then root your phone otherwise. Without root, its impossible to use GameGuardian. Best help you get on http://forum.xda-developers.com Enter your phone model in the searchfield and read the stickys. Good luck

Test for floating window. Of course if in your firmware this is minimal size of view - it can be in ever place.

I researched this issue. GK uses memory to store data. The memory card is only used for the first fuzzy search and all. Further, it is not used at all. This decision can not be called successful. Yes, it allows you to quickly search for, but at what cost! Memory consumption is not limited in nature. As a result, the GK flies, the game. It depends on what will beat the system running out of memory. Here is an example: 1. Launch Minion Rush. 2. Launch GK. 3. I am fuzzy search. It found 40 million values. But they are in the buffer to disk. There is no problem. Memory consumption demon GK - 1,3 MB. 4. Now again looking for fuzzy search. I opt for not changed. GK starts looking devouring memory buffers: 125 MB, 188 MB, 215 MB, 237 MB, 259 MB, 278 MB, 298 MB, 316 MB, 348 MB, 387 MB ... Oh, what is it? GK was closed, and the game is closed. In my opinion, not worth the high speed flight games or utilities for hacking. Imagine that you have achieved some special situations in the game to hack it, and spent time and resources to do so. And then the game went and took off. All for nothing. Maybe all the same, it is better to look for more slowly, but with guarantees that the flight would not be? By the way, I still have this 1 GB of memory on board. What would happen if 512 or 256 MB? All will fly much earlier. And now we repeat the situation of GG: 1. Launch Minion Rush. 2. Run GG. 3. I am fuzzy search. It found 14.6 million values (the value is 0 or -1 are ignored, therefore 40 million in GK). Memory consumption demon GG - 774 KB. 4. Now again looking for fuzzy search. I opt for not changed. GG starts looking, memory consumption remains almost unchanged: 774 - 776 - 784 KB. Of course nothing is taken off, since there are no reasons for this. For fun, we spend the same with GH: 1. Launch GH. 2. I am fuzzy search. It found 39.5 million values. Memory consumption demon GH - 1.28 MB. 3. Now again looking for fuzzy search. I opt for not changed. GH begins to look, devouring memory: 259 MB - 338 MB - 384 MB ... Demon GH crashes interface GH is infinite Status. What's funny, the system even with gains GK. Well, at least the game is not relegated lucky today. Absolutely the same situation as with the GK. Conclusion: GG looking for with minimal memory consumption, but slower than the GK or GH, since it uses a memory card. But it ensures that no game, nor an attacker does not fly at the wrong time. What is more important for you, speed or reliability? Decide for yourself.

By the way, about the speed of the search. Starting with version 8.1.0 adds the ability to store data in memory. If you have enough RAM available, it can greatly speed up the search (10 times more). Go to settings and select the desired setting: Spoiler However, the application may crash if memory is insufficient. Therefore, this option is not enabled by default. If the application closes spontaneously, try to choose the lesser value, or disable this option entirely. On the emulator, the same as the BlueStacks, memory usage may be slower than the use of files. Try. Spoiler (General Recommendations) The search speed depends on the speed of reading and writing to the memory card. Therefore, to seek faster, it makes sense to put as much as possible high-speed memory card. Especially when using the fuzzy search. To make it clearer, citing figures. Displacement of the temporary file, depending on the situation, can reach 100-300 MB and above. Say it 100 MB. This is about 10 million dword values. Normal operation on the file is in its full reading and writing. Typically, reading faster than writing, so I will focus on the recording speed. Take the usual Class 2 memory card on which the maximum write speed will be about 2 MB / s. Record 100 MB will be carried out within 50 seconds. Now let us compare with the 10 class (10 Mb / s) - 10 seconds. Sensible difference. If you take more high-speed card, for example, SDCA10 from Kingston, and there speed (I was to write 25 MB / s) allows you to record 100 MB 4 seconds. Search time will not be less than the figures shown above. If we consider the search time, the distribution cost of time, in decreasing order of importance, is: Read / write to the memory card. Reading the memory process. Various mathematics (comparison, search, etc.) As can be seen, the basic search time is not strongly dependent on the program code, as defined by your device or equipment thereon. To speed up the search, you can do the following: As I wrote - to use the fastest memory card. Select only the necessary regions of memory and does not use slow regions (Others) - access to them can be very significantly slow searching. To reduce the maximum amount for the search. For example: after the start of a fuzzy search use the "not equals" rather than "is" because the memory addresses that have changed are always much smaller than those that have not changed. The search is performed on "fresh" start the game, if it is possible, because the longer the game runs, the greater the amount of memory used and the more space for the search. Try not to use the data type to "Auto", because there is a lot of checks carried out, which may be unnecessary in your case.

In version 7.2.0, you can search for more / less. For example, to 100.0 without decimal places, looking for all that and more is less than 101.0 100.0. Here's a video with the burglary: Hacking Star Bus Rush search very rapidly changing values Breaking distance runner in Champions Riding Trails 3D example of a float variable search range Endless life in the GTA: Vice City hacking and freezing the variable

Using filters The annex contains the filters, which is not in any similar application. Currently filters work with Java code. This means that they are not very fast, and can consume a lot of memory. In the future, filters will be improved and rewritten in C. So, what is a filter? Filters are special rules used to filter the current results. Unlike dropout filters do not affect the status of the search. Once you remove the filters, everything was back to the same state it was in before filtration. What is comfortable? You can search for any special significance, not being afraid to make a mistake and lose the rest. Filters are available on "..." button, click Filter. After his selection will be shown the settings window filters: Consider the order of each field: Filter, not more than - specifies the number of entries to filtration See, no more than - specifies the number of entries displayed in the search results Then came various filters, which we will consider later. So far, the return to the mechanism of the filters in order to understand why we need these two numbers. I must say about the second - is the number of results you see at the end of the search. It always works, even if you do not select any filter. It is necessary to bring the first 1000 results, please enter 1000 and presses apply. At least 10 million. The value is not limited in any way. But remember, the more results you upload, the more memory consumption. Then the memory is not enough, and the system washes GG. So do not put very many. We looked at how many found: In this case, we found 8,674,304 results and shows the first 100, and you need 10 000. So you put the filters in the second number 10 000. And get your 10 000 results, and then change them all. And then the game because of it flies, as you there is something broken. But that's another story. Let's go back to the first field in the filters. To understand what it means, you need to talk a little bit about how filters work. So, imagine that we have included filters and found 10 million results. The application will receive the results and check each against all filters. Get results the program is not everything, but no more than that number, which is indicated in the first field. Why not more? Because as soon as the typed number to display, continue to receive will be discontinued. Returning to the example. 10 million total results. Filter we will be 1000, and output 100. This means that there will be obtained the first 1000 results and tested for the filters. Those that have passed, but no more than 100 will show. I hope it is clear. Here you can still make an analogy with a sieve. The first number is the amount that you ship in a sieve, and the second - the maximum amount of results of the last sieve. If it has a screen more than the second number, it will be only the first of them. So now on the filters themselves. Their is 5 pieces: Skip similar addresses - if this filter is enabled, after the result which matches the rest of filters, will be missed all the results, the distance to less than or equal to the specified number. Let me explain with an example: is the number 10, it fits the filter, followed at a distance of 8 bytes is the number 11, which is under the filter is not suitable, but if you have activated the filter "to pass close to the address" with a value of not less than 8, then 11, also fall into conclusion. What is comfortable? For example, you know that after the number 10 goes to 12 bytes the desired value. You are filtering by value and turn the filter parameter 12. Example of usage. Address > - skips all options that address more than the specified number. This way you can portions of, for example, 1000, to view all found each time putting here the last address of the found variants. Address < - same as above, but applies to all addresses less parameter. Value > - similar and values. Here there is only a small problem - all values are treated as dword, regardless of what they actually are. So this will work fine only dword. This will be corrected once. Value < When the filter is the number of results displayed, not as a single number or two, but as three numbers. For example, I asked a search of 101 in the first 1000 results: But he was not there: If the filters are included, there are always three numbers: the first - the number of results found, and the second - the number of results submitted to the input filter, and the third - the number of results past the filters. If the filter is not enabled, there may be one or two numbers. If the number is one, it means that all results have shown results. For example, "(20)" means that we have found 20 results, and they are all displayed. If the two numbers, the first number is the number found, and the second - the number shown. For example, "(20/10)" - found only 20 and 10 are shown first. Let's go back to the filters. I still want to find her 101. Somewhere as it should be. And I do not weed out hunting. Therefore, I will increase the number of results submitted to the input filters. By the way, the more of them, the slower will be updated list. Take 100 000 for example: And then we are fine: You can now with these values do something - to remember to change or something else. That's all. Oh yes. When you enter values or addresses, you can enter it in hexadecimal by adding the letter h at the end: 100 = 64h 102 = 66h The result is the same as above, as a record of the same filter, just in a different form. This option can be used in almost every place where you need to enter the number: Edit the values of the variable parameters of filters and so on.