mirror of
https://github.com/kwsch/PKHeX
synced 2024-11-12 23:37:07 +00:00
c6a961bda6
Due to how the game generates the Pokémon data, the first two (or three) RNG calls are used to set the 32-bit `EncryptionConstant` and `PID`. With 2x 32-bit and 1x 64-bit values, we can algorithmically reverse the movement & manipulation of bits to recover the initial seed. Notably, certain bits of the initial state are not captured by our first two (or three) outputs, so we must brute-force guess at the initial state, and verify the RNG's output yields the expected values. **With the ability for real-time Xoroshiro128+ seed reversal, we can now validate RNG correlations for SW/SH raid encounters natively within the program.** For now, the legality fail error message is extremely vague and any validated seed won't be "remembered" for the Legality Parse like other RNG methods. These seeds are 64bit, while every other "remembered" `PID/IV` seed-info is 32-bit. Co-Authored-By: SciresM <8676005+SciresM@users.noreply.github.com>
42 lines
1.7 KiB
C#
42 lines
1.7 KiB
C#
using System;
|
|
using FluentAssertions;
|
|
using Xunit;
|
|
|
|
namespace PKHeX.Core.Tests.Legality;
|
|
|
|
public class RaidTests
|
|
{
|
|
public const string Charizard = "65E79FC0000085F1060060045CF0A3AA142C10005E00140015010000EE5501E2080A00000000000004FCFC0000000000000000008800000000001C0000000000000000000000000000000000000000008AAD000000000000430068006100720069007A00610072006400000000000000000035001E024C009B01181010080303030300000000000000002901FF7F1E3F0A000000000000000000000000000000000000000000000056006900630074006F0072006900610000000000000000000000010201000000320104080000000000000000000000000000000000002C000000020000000000FF0000000000000000000000000000004100720063006800690074000000000000000000000000000000FF000000000000000000140117000000A20009372804000000000000000100000200000000000000000000000000000000000000000064002901B700C10048013D01CE000000";
|
|
|
|
[Theory]
|
|
[InlineData(Charizard, 0xbefd08cf9e027d0a)]
|
|
public void CheckMatch(string raw, ulong seed)
|
|
{
|
|
byte[] data = raw.ToByteArray();
|
|
var pk8 = new PK8(data);
|
|
|
|
bool found = false;
|
|
var seeds = new XoroMachineSkip(pk8.EncryptionConstant, pk8.PID);
|
|
foreach (var s in seeds)
|
|
{
|
|
if (s != seed)
|
|
continue;
|
|
found = true;
|
|
break;
|
|
}
|
|
found.Should().BeTrue();
|
|
|
|
var la = new LegalityAnalysis(pk8);
|
|
var enc = la.EncounterMatch;
|
|
|
|
var compare = enc switch
|
|
{
|
|
EncounterStatic8N r => r.Verify(pk8, seed),
|
|
EncounterStatic8ND r => r.Verify(pk8, seed),
|
|
EncounterStatic8NC r => r.Verify(pk8, seed),
|
|
EncounterStatic8U r => r.Verify(pk8, seed),
|
|
_ => throw new ArgumentException(nameof(enc)),
|
|
};
|
|
compare.Should().BeTrue();
|
|
}
|
|
}
|