Leaderboard
Popular Content
Showing content with the highest reputation on 12/02/2022 in all areas
-
based on both @MainC@CmP i come up with this solution I cluster the operation in a 100K value table, and remove 4 value of 1 mean remove 4 address every 1 address, since what the author wanna do i guess, if not just modify that logic in the code. as you guessed it, my approach is, we start with all values then remove the unwanted one. but this is still slow af, and rn i dont see anyway to speed this up another way to get rid of the value you dont want is to filter by address, since you want to skip by offset 4 DWORD address are set up like this address = 0x0 next = previous address + 4 = 0x4 next = previous +4 = 0x8 and so on. then you just need to keep address that end with 4 in case you skip the first of the list, else you keep those that end with 0 or 8 index.lua approach 1 index.lua approach 22 points
-
The main issue is with the approach itself. Processing all results/values at once isn't going to work when there are millions of them. There is simply not enough memory that is available to Java part of the application neither to load millions of results at once nor to build a table in Lua script that represents millions of values. The solution is to process results/values in parts. Reasonable choice for part size is around 100k, since in practice GG can load 100k results fine in most cases. Another issue is related to efficiency as MAARS also mentioned above. First thing to avoid is using "gg.loadResults" function when it's not necessary. If it's applicable, use searches to get all results for processing, then process them in parts by getting results and removing them after the part is processed. Alternatively build a table with part of values to process, but then don't use results list, proceed to getting/setting values directly using corresponding API functions, then repeat for remaining parts.2 points
-
Hi! Just shedding some Idea: - The codes keep storing a new Key to a global variable, the performance decrease could be because of the programs having a hard time to resize the table. It's not the global scope at fault, but the I/O Operation that should be blamed. - When dealing with this, I usually use cache for storing and delete them automaticly after recursion ends. You might need to limit I/O operation here. Maybe storing specific number of item into the table and immediately process them in Anon, the result are dumped into cache files and the cycle continue. More or less, I do agree with Mars. The Emulator part can be different from Native because most Emulator are using VBox that are slow by default compared to Qemu/Cemu. The thing is: even it's "Hard" operation, personally, I wouldn't rely on Emulator result but rather to test it directly on Native environment. EDIT1: Testing the script on an 8GB with 6GB Free Ram (Phone), Also freezes but not crashing.2 points
-
Appreciate the info about memory occupation in Lua and thanks as well for the script examples! Although your scripts are way more efficient, I assumed the 100k method would be faster to reach the full address range of a segment. Reason i don't want to use search is because i miss the data that gets allocated at unused memory addresses while old data gets replaced or cleared due to memory management techniques. Being dependable on addresses being used or not was in this case out of option to me, so i thought i should and could get all addresses in a reasonable time frame. And thats my mistake for thinking that was even optional with loops of 1m+ CmP is basically pointing out that it is not possible to do that(having a table that has all those addresses stored) because of memory. And if by your own method it still would take long time to process then i guess i have to work towards something else because its just not pleasant to work like that. The scripts you provided where educational for efficiency!1 point
-
for instance this is approximately how much value you are dealing with in Ca region, it is a nightmare, i have 16GB RAM PC 8GB RAM Emulator but it still take decade, you need to change your approach, this will never succeed. code used for test gg.setRanges(gg.REGION_C_ALLOC) gg.searchFuzzy('0', gg.SIGN_FUZZY_EQUAL, gg.TYPE_DWORD, 0, -1, 0) this is the approach i used, at least no crash but it take too long as well gg.clearResults() gg.setRanges(gg.REGION_C_ALLOC) gg.searchFuzzy('0', gg.SIGN_FUZZY_EQUAL, gg.TYPE_DWORD, 0, -1, 0) local resultsCount = gg.getResultsCount() if (resultsCount == 0) then print('No results found') return end local results = gg.getResults(resultsCount) for i = 1, resultsCount, 4 do results[i] = nil end gg.clearResults() gg.loadResults(results)
1 point -
additionnal issue found. the first loop is useless, you already flitered range using "anon:libc_malloc" that mean the returned ranges list state will only be "Ca".1 point
-
for me the main problem is optimization, the problem i have noticed you are using global variable everywhere Use local variable, they are more fast can you explain why you double loop here ? The first loop might be ok but the second one i think there is to much iteration going on here, an address divided by 4 still result a big number i think after test, this his approximately how much time you loop every time, the list still go down, so it is totally normal that you crash. code used for test local ranges = gg.getRangesList("anon:libc_malloc") for i, v in ipairs(ranges) do print('( v["end"] - v.start ) / 4 => ', (v["end"] - v.start) / 4) end You just override a native libary Unless you voluntary does it, table is a native library, so when you use it as a variable name you just override everything from it You are using #identifiant +1 to set your table index this is a big performance problem, unless you are looping just 10 or 20 time that might be ok, but here you will loop more that 1000 time i guess event more,what the # operator does on a table ? actually it will also loop to count every item on your table so as you guess, when you have a 10k+ item on your table imagine how slow and memory that will take. in the beginning you say you must load value within offset of 4 but since you are using DWORD, offset 4 mean just the next address, since DWORD value are 8bit encoded
1 point
-
Paid script.1 point -
Version 2.0
1,510 downloads
Fear trap values no more! Edit anything without ban or crash! Contact me: User123456789#6424 on discord What are trap values? One of the many ways the developers protect their game from gameguardian hacks is having the game automatically generate 'trap values'. Trap values are values that mimic real values that store game data, but actually instantly ban you when you edit them. This script removes trap values, so you can edit things safely. What does the script do, and how does it work? This script has two features: Useless value removal and trap value removal. To remove useless values, it removes every dword value that is not in the range of encrypted values. This feature may not always be 100% accurate, but it should work most of the time. To remove trap values, it uses very simple logic which relies on bad game design (which is why almost all pg3d scripts exist xD). I found out through testing that trap values are placed multiple times in memory. However, real values should only appear once, or rarely a couple times. The script simply searches each values and removes any value that a bunch of results come up for. There may be exceptions, so this method isn't 100% accurate. How to use the script: Just run the script when you have values in your search results, and the script will put all of the values that are not trap values or useless values into the saved list. You can then use "selected as search result" to put the results back in. Practical uses of the script: -Finding weapon ids for pixel gun 3d weapon unlocker without getting banned by trap values -Using fuzzy search to find encrypted values, then using the script to remove useless and trap values -Using a value encryption disabler or value decryptor hack (if you have one) and only editing real values Credits: The script is coded and the method is invented 100% by me The UI is heavily inspired by DarkOctet#5778 Q&A/Troubleshooting Q: What is a trap value? A: See the 'what are trap values' tab in the script. Q: Why are the time left and percent processed counters so inaccurate? A: The script uses multiple optimizations to run faster. It has to do more work on some values than others. The script may progressively get faster, get stuck for a long time on some areas, or go really fast on some areas because of this. The time left counter expects all values to need to be tested, but sometimes the script already knows a value is not a trap value. The 'Remove Useless Values' option will make the script run so much faster that it may halve the time left counter each second, in some cases! Q: Why does the script say it is processing less results than I originally had? A: When you have the 'Remove Useless Values' option enabled, the script automatically removes values that it knows aren't trap values or useful values before it checks each one by one. For some values, the script does not know until it checks one by one. Q: Why does the script take so long? A: The script has many optimizations to speed it up, and a progress monitor to try to make it easier to sit through. Still, though, it may take a while - because it has to do tests on each value, one by one. The script is designed for you only having at most a few thousand values. Q: Is this script 100% safe? A: No. The script uses all the methods I know of to remove trap values, but that doesn't mean there won't be mistakes. I don't know how effective this script is for removing trap values, but I know it works.to some degree. If you have under 100 results after running the script, it should be safe to edit, but I can't guarantee it. Q: How does this script work? A: See the 'How Script Works' section in the script. Q: What is considered a useless value? A: Any value that is not in the range of encrypted values is a useless value, because generally all useful values are encrypted. If a value isn't encrypted, don't use this script! Q: How long did this script take? A: A week, about 12 hours of combined work, and 3 very late nights. I put in a lot of effort to make these free script, thanks for asking! Still have questions, comments, or concerns? Contact User123456789#6424 on discord!1 point -
YouTube its nothing tutorial if not lib offset, its personal methode (local).1 point
-
not free1 point
-
2,726 downloads
Game Name: Days After: Survival games Package: PLAY STORE Architecture: 64 Bit Version: 10.3.1 FEATURES: 1- MAX DURABILITY 2- NO HUNGRY & NO THIRSTY & NO INFECTION 3- ENEMY NOT ATTACK 4- MAX LEVEL 5- FREE CRAFT 6- FREE UPGRADE 7- INSTANT OPEN CHESTS 8- INSTANT TRAVEL 9- FREE SPEED UP WORKBENCH & ADD 255 GOLD 10- UNLIMITED FUEL CREDITS: LATOM & QUOAN Telegram: https://t.me/LATOM_HACKER Follow me for any update Enjoyed0 points
