Jump to content

Leaderboard

Popular Content

Showing content with the highest reputation on 08/10/2022 in all areas

  1. New version 10.6.0.2.16 released!
    3 points
  2. 2 points
  3. 2 points
  4. We support only latest version. All error report about old versions will be ignored. If you have problems with the GG - create topic on help forum: https://gameguardian.net/forum/forum/14-help/, do not forget to add the necessary data: 1. Logcat shot during the problem. How to collect Logcat: https://gameguardian.net/forum/topic/7419-how-to-collect-logcat/ - REQUIRED!!! 2. Video with a problem. (if possible or applicable) Speed of solution your problem depends on availability of these data! No logcat - No help!!! Useful links: How to determine why speedhack does not work How config speedhack / How report a problem in speedhack
    1 point
  5. Version 12.2.2.4.3

    8,436 downloads

    REAL RACING 3 CAR CHANGER Working RR3: 12.2.2 Current version: 12.2.2.4.3 Description: Change car at will. Instructions: Execute Step 1 in the garage by selecting the desired car, then go to the race and replace the car with the one previously selected by running Step 2 Known issues: May not work in some devices. Search mode does not work in omp (x64) Video:
    1 point
  6. Version 12.6.8.6.3

    31,042 downloads

    REAL RACING 3 CARS/EVENTS UNLOCKER Current version: 12.6.8.6.3 Working RR3: 12.6.8 Description: Run this script to unlock all cars and old closed events/races!!! Instructions: Run the script wherever you want, then go to the garage and get any car for free (also old nascar cars). Script will re-open old finished events Known issues: May not work on all devices/emulators. Note: Video:
    1 point
  7. Version 3.0

    1,931 downloads

    Class.lua I modified RxHacker job Original Script Field Offset Finder Use Script Tool or Dump.cs 32 Bit Use Region ANONYMOUS only How To Use https://youtu.be/6kCjoMslAgo
    1 point
  8. Hello all, After seeing many of our regular and engaged members...ascend to the Ascended group, I figured it may be helpful to have a higher group who help above and beyond even that. This new group is Contributor! The main criteria for this elite group is post count, membership time, community and reputation rank, showing that the community here finds them helpful. I am pleased to welcome @cisco72563, @sammax71, @CmP, @HEROGAMEOfficial, @Collen, @MAARS and @MonkeySAN as our first Contributors You will continue to see people being promoted as they are more active and post more as well.
    1 point
  9. Hello Jennie1998, Please note: Value is dword. Value is different for each progress rate and object location Decreasing value = increasing % per play How value is found: First thing to try would be searching for nearby values because i could not find that process rate value directly either. Since the game starts with the Cafe i look there. Start with group searching the values from up to down(ignore symbols first): 75;60;19:: I get results, refine to 75. Use increment by 1 on the results to see if anything happens to desired value. 75 became 84, refine 84(make sure you reverted all other values to avoid crash) We must go to address of the value..to inspect if your process rate value is there. We first should analyze the structure, so we know more or less the range in which we should edit. We can see values that represent the same as on the board. 84, 60 and 19. As shown on the board. Since they are all dword values properly structured it seems to resemble a some data that represents stats. The stats visible on that board. We don't see anywhere the value 100, yet in memory it shows that value. Since it is a dword value between the 60 and 19 (known values) it should not be harmful to edit that value. I edit it to zero. Then switch board and return so that effects have taken. Value changed from 0% to NaN%, We play a game, you finish it in one go.
    1 point
  10. I try it on my Noxplayer(64bit) as the passage tell me for hours.But it doesnt work,although it can run normally.I dont know why.
    1 point
  11. One of the best apps I have ever seen...
    1 point
  12. Impossible bc currency is server sided
    1 point
  13. this region does not have static addresses like the Code App, you can’t use offsets, only search.
    1 point
  14. gg.searchNumber('100', gg.TYPE_QWORD) local varTable = gg.getResults(gg.getResultsCount()) for i=1,#varTable do print(varTable[i]['value']) end if you show your code, I can give a more accurate answer, but the principle of work will be the same.
    1 point
  15. This post cannot be displayed because it is in a forum which requires at least 1 post to view.
  16. Hi folks, I doubt you guys are looking for 'encryption', but instead, are looking for 'obfuscation'. To know the difference between the two, let me explain what they mean: - Encryption: "the process of converting information or data into a code, especially to prevent unauthorized access." - Obfuscation: "the action of making something obscure, unclear, or unintelligible." The problem is that Encryption is what you want as it's the best at 'securing' your code from unauthorized access, however the receiver of your code will most likely 'decrypt' the code to use it, making it completely obsolete. The solution is Obfuscation as the Lua script will be transformed into something that still has the same functionality, however it has been "transformed' in the worst possible way so that humans will have a very hard time understanding what it does. Good obfuscation means it is simply to hard/difficult to understand what the script does for a human. So where do you get obfuscation? you can use free online tools such as https://luaobfuscator.com/, I have no experience with other tools as most of them are pay to use. Example use of LuaObfuscator.com: -- sample snippet to calculate prime numbers: do function sieve_of_eratosthenes(n) local is_prime = { } for i = 1, n do is_prime[i] = 1 ~= i end for i = 2, math.floor(math.sqrt(n)) do if is_prime[i] then for j = i* i, n, i do is_prime[j] = false end end end return is_prime end local primes = sieve_of_eratosthenes(420) for key, value in pairs(primes) do if (value) then print("Prime found: " .. key) end end end Obfuscated output (CFFv1, Strings, Minifiy ) local v0 = string.char; local v1 = string.byte; local v2 = string.sub; local v3 = bit32 or bit; local v4 = v3.bxor or v3.bxor; local v5 = table.concat; local v6 = table.insert; local function v7(v8, v9) local v12 = {}; for i = 1, #v8 do v6(v12, v0(v4(v1(v2(v8, i, i + 1)), v1(v2(v9, 1 + ((i - 1) % #v9), 1 + ((i - 1) % #v9) + 1))) % 256)); end return v5(v12); end do local v10 = 0; local v11; while true do if (v10 == 1) then for key, value in pairs(v11) do if value then print(v7("\3\43\133\37\54\121\138\39\38\55\136\114\115", "\83\89\236\72") .. key); end end break; end if (v10 == 0) then function sieve_of_eratosthenes(v13) local v14 = 0; local v15; while true do if (v14 == 0) then v15 = {}; for i = 1, v13 do v15[i] = 1 ~= i; end v14 = 1; end if (v14 == 1) then for i = 2, math[v7("\205\90\58\188\217", "\171\54\85\211")](math[v7("\7\152\255\8", "\116\233\141\124\175\201\74\192")](v13)) do if v15[i] then for j = i * i, v13, i do v15[j] = false; end end end return v15; end end end v11 = sieve_of_eratosthenes(420); v10 = 1; end end end
    1 point
  17. First of all, what kind source that you're going to apply encryption, lua files?. If you're willing to use some Advanced way, you can use JWT or SHA hashing but for LUA Files; i think you should also obfuscate your script and then encrypting it. Yes, most of LUA encryption are decryptable so you need to atleast make it more harder to read. For example; you can calling another LUA Files from the first Lua, etc.
    1 point
  18. 1 point
  19. can u make one for unlimited currency?
    1 point
  20. Possible not necessary mean "valid". Usually app pointers not present in Other memory ranges.
    1 point
  21. No Support Android Q currently. Maybe in future.
    1 point
  22. Upload the script. For me scripts loads fine. And explain in more detail what you mean by "not loading."
    1 point
  23. View File Notepad + 32-bit Support + 64-Bit Support Requires Android: Android 4.0.3 (Ice Cream Sandwich MR1) or later. There is support for x86. Video: Before installing the optimized version, uninstall the version from Google Play. Differences of the optimized version: no error 105. About second apk (32-Bit Support): About third apk (Notepad_Vault_64bits_Support_Library) You do not need to install it if you do not intend to crack 64-bit games. Submitter Enyby Submitted 06/09/2019 Category Virtual spaces (no root)  
    1 point
  24. View File Phone (Dialer Vault) + 32-bit Support + 64-bit Support Requires Android: Android 4.0.3 (Ice Cream Sandwich MR1) or later. There is support for x86. Video: Before installing the optimized version, uninstall the version from Google Play. Differences of the optimized version: no error 105. About second apk (32-Bit Support): About third apk (64-Bit Support): You do not need to install it if you do not intend to crack 64-bit games. Submitter Enyby Submitted 06/09/2019 Category Virtual spaces (no root)  
    1 point
  25. View File Dual App + 32-bit Support + 64-Bit Support Requires Android: Android 4.0.3 (Ice Cream Sandwich MR1) or later. There is support for x86. Video: Before installing the optimized version, uninstall the version from Google Play. Differences of the optimized version: no error 105. About second apk (32-Bit Support): About third apk (64-Bit Support): You do not need to install it if you do not intend to crack 64-bit games. Submitter Enyby Submitted 06/09/2019 Category Virtual spaces (no root)  
    1 point
  26. View File App Hider Lite + 64-Bit Support Requires Android: Android 4.0 (Ice Cream Sandwich) or later. There is support for x86. Video: Before installing the optimized version, uninstall the version from Google Play. Differences of the optimized version: no error 105. About second apk (64-Bit Support): You do not need to install it if you do not intend to crack 64-bit games. Submitter Enyby Submitted 06/09/2019 Category Virtual spaces (no root)  
    1 point
  27. gg.searchNumber('1.85', gg.TYPE_FLOAT) local t = gg.getResults(2) t[2].value = '99999' gg.setValues({t[2]})
    1 point
  28. use setValues for set values.
    1 point
  29. Known problem devices and firmware Huawei / Honor devices ptrace call is broken, some GG functions do not work. Devices with Android Go since Android Q, the floating icon will not work. Any devices / emulators on x86 / x86_64 architecture problems with speedhack and not only. Strongly customized Chinese firmware, for example MIUI, EMUI problems of any kind.
    1 point
  30. Sell iOS, buy Android and download.
    1 point
  31. Load not all. load "only two or three value" and call editAll. gg.getResults(2) or gg.getResults(3) Or use setValues.
    1 point
  32. 1 point
  33. Maybe. Use now scripts for this.
    1 point
  34. Sell iPad, buy Android device.
    1 point
  35. GG closed by system low memory killer.
    1 point
  36. Here test apk. You can try find pointers in any known way. GGPointers_signed.apk
    1 point
  37. You can try to do something in a test form on the scripts. If you get something worthwhile that can be applied to many games, we can consider the possibility of implementing outside of scripts as an embedded feature. While this is not, nothing to talk about. Provide a workable concept so that you can talk about something. So far, everything looks like an unviable idea, which is not worth wasting time. There are many other tasks that are real and more useful. Scripts provide you with the ability to store intermediate search data in tables, not limited to one saved list. It may be convenient for your task. You can write a simple test application with pointers and try to make a script for it. Well, or find a simple game that is guaranteed to fit your criteria. Although it can be difficult. And then try to write a search for the desired pointer using scripts.
    1 point
  38. From pdf: Even on PC it is very slow. Even with powerful CPU. A typical PC processor does not care about power consumption and dissipates 50-100 watts. A typical Android device processor is not able to dissipate even 1 watt for a long time without risking to melt the device or burn the battery. The fact that the PC is looking for 10 minutes, on Android you will search for hours. Another problem is the amount of memory. The amounts of memory for processing are approximately the same, but you will not have free space to process them, since the entire memory has most often been taken by the game. And it also consumes CPU, resources, which are already lacking. Add here another RISC architecture, where memory access is quite expensive, and caches are not very large and you will get even more slowdown. When the memory for GG runs out, it has to use a memory card to store data. The speed of which is extremely small. Summarizing all of the above, I can say that there can be no common and simple tool. What will be, will be slow, work only in some particular case. And all this will be so complicated that only a few will be able to use it, if anyone can at all.
    1 point
  39. It all depends on how it works. How deep is the chain of pointers. Most often, there is not one level. If you look at the picture, this will be the case with Gold3. Suppose the World Object has not been moved, and pointerPlayer has remained the same. But you do not know offset6 and offset7. Most often you cannot reduce the number of results until the pointers are unchanged. Therefore, you have hundreds of thousands of values and find the right problematic. How will you search for the desired pointer chain after level overload? Even if you have 1 level of pointers, this is already a problem. And this is all seen in the context of static pointers. If you have a garbage collector, for example, a game in C# (Unity), then all this does not work. Pointers can be moved at any time during garbage collection. And you cannot know whether it happened or not. We continue. If arrays with offsets are used somewhere, then pointers can change their offset. So it is make more complicated.
    1 point
  40. You can set any speed in speedhack options.
    1 point
  41. Look at this post and the picture to it: Using Offsets (#5nf243is) I also advise you to read the whole topic there. Just discussed your question. Usually, the depth of the pointers does not allow to restore the path to the value, especially because offsets are unknown and can be quite large. This is for the case of restarting. If the games have allocated a pointer to the stack (a rare case, but possible), then you generally will not have any chance to find something, because the starting address will not be tied to the library memory space. [added 2 minutes later] Here is another discussion you should read: Finding real offsets of IDA (#8cdn5dao)
    1 point
  42. ArtMoney was written for Windows when there was no ASLR. Android was originally created, taking into account the ASLR. Therefore, many methods ArtMoney inapplicable. I think that now, on the latest versions of Windows, they also do not work if ASLR and DEP are enabled. And they are included for all processes, except for exceptions running in compatibility mode. Plus it's Windows and Linux. They have different concepts of work. Therefore, not everything that works on Windows can be transferred to Linux.
    1 point
  43. If you all know and understand so - describe in detail and step by step what should be the algorithm for finding pointers with an indefinite offset. And what is the refine algorithm, after that. At least to the depth of one pointer. Even for a very good and convenient number, you will have at least 1000 results in the first search. For uncomfortable and small numbers you will have hundreds of thousands of results. You offer to spend hundreds of thousands of searches, for the reverse of the pointer? And do not forget that the search is not instant. If you are looking for something for a long time, the pointers may already change. Even if the process can be paused, there are time limits after which the network connections are closed, the system will detect that the application is not responding and can close it without asking.
    1 point
  44. Manually it open each pointer context menu - go to pointer - watch value in memory editor - remember it. Repeat 65 times. You can not do this in simple way without script. [added 1 minute later] Scripts are not just automation of actions through the interface. On the basis of scripts, you can do something that can not be done through the interface. And your task, just from such.
    1 point
  45. Write script for fast check. Manually it can be really long and boring.
    1 point
  46. Try. I think your device with small amount of ram. Or present some memory killer/cleaner.
    1 point
  47. 1 point
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.