Initial commit
This commit is contained in:
kuntz
parent
b6203e5f8b
commit
a205865ced
|
|
@ -0,0 +1,726 @@
|
|||
//----------------------------------------------------------------------------------------------------------------------
|
||||
// Copyright © 2021 by Brett Kuntz. All rights reserved.
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
#include "compress.h"
|
||||
#define SAMPLES_PER_TEST 8000
|
||||
static u64 * global_total;
|
||||
static sem_t csoutput;
|
||||
static const u64 BLAKE_IV = UINT64_C(0xA54FF53A5F1D36F1);
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
//#include <windows.h>
|
||||
si main(si argc, s8 ** argv)
|
||||
{
|
||||
/*if (SetPriorityClass(GetCurrentProcess(), IDLE_PRIORITY_CLASS))
|
||||
{
|
||||
printf("Low priority set\n");
|
||||
}*/
|
||||
|
||||
if (sem_init(&csoutput, 1, 1) == -1)
|
||||
{
|
||||
printf("sem_init error\n");
|
||||
return EXIT_FAILURE;
|
||||
}
|
||||
|
||||
if ((global_total = mmap(0, sizeof(u64), PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0)) == MAP_FAILED)
|
||||
{
|
||||
printf("mmap error\n");
|
||||
return EXIT_FAILURE;
|
||||
}
|
||||
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
// BRETT: DID YOU CONFIRM THE SUB-BLOCKS ARE CORRECT???
|
||||
|
||||
if (argc != 2) return EXIT_FAILURE;
|
||||
const ui CUTOFF = 7 + atoi(argv[1]);
|
||||
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
// BRETT: How about the printf's?
|
||||
|
||||
// Start
|
||||
printf("Starting\n");
|
||||
|
||||
const ui threads = get_nprocs();
|
||||
|
||||
printf("CUTOFF: %u\n", CUTOFF);
|
||||
printf("SAMPLES_PER_TEST: %lu\n", (ul)SAMPLES_PER_TEST);
|
||||
printf("threads: %u\n", threads);
|
||||
fflush(0);
|
||||
|
||||
for (ui t=0;t<threads;t++)
|
||||
{
|
||||
if (!fork())
|
||||
{
|
||||
check(37, 23, 17, 14, 11, 9, CUTOFF);
|
||||
|
||||
printf("Child Exiting\n");
|
||||
fflush(0);
|
||||
|
||||
exit(EXIT_SUCCESS);
|
||||
}
|
||||
}
|
||||
|
||||
cwait;
|
||||
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
// Change below
|
||||
|
||||
s8 buf[2048];
|
||||
const u64 total_samples = SAMPLES_PER_TEST * threads;
|
||||
const r64 avg_distance = (r64)*global_total / total_samples;
|
||||
sprintf(buf, "Test Params: find_hash20, find_p_hash20.%u, find_p_hash20.%u, find_p_hash20.%u, find_p_hash20.%u, find_p_hash20.%u, find_p_hash20.%u, find_p_hash20.%u\n", 37, 23, 17, 14, 11, 9, CUTOFF);
|
||||
sprintf(&buf[strlen(buf)], "n=%"PRIu64"\n", total_samples);
|
||||
sprintf(&buf[strlen(buf)], "Average Distance: %.4f\n\n", avg_distance);
|
||||
FILE * fout = fopen("output_results.txt", "ab");
|
||||
fputs(buf, fout);
|
||||
fclose(fout);
|
||||
|
||||
printf("Parent Exiting\n");
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void check(const u8 p2, const u8 p3, const u8 p4, const u8 p5, const u8 p6, const u8 p7, const u8 p8)
|
||||
{
|
||||
FILE * frand = fopen("/dev/urandom", "rb");
|
||||
|
||||
u64 total = 0;
|
||||
|
||||
const u64 start = tick();
|
||||
|
||||
for (u64 i=0;i<SAMPLES_PER_TEST;i++)
|
||||
{
|
||||
//if (i && !(i & 3))
|
||||
if (i)
|
||||
{
|
||||
const r64 m = (tick() - start) / 60000.;
|
||||
const r64 pm = i / m;
|
||||
const u64 rem = SAMPLES_PER_TEST - i;
|
||||
printf("%.1f mins\n", rem / pm);
|
||||
fflush(0);
|
||||
}
|
||||
|
||||
u8 input_iv[128], input_block[128], output_block[128];
|
||||
|
||||
fread( input_iv, 1, 128, frand);
|
||||
fread(input_block, 1, 128, frand);
|
||||
|
||||
{
|
||||
ui distance;
|
||||
u64 v[16], m[16];
|
||||
const u64 sub_block = i * 32;
|
||||
|
||||
find_hash(0, output_block, input_block, v, m, input_iv, sub_block + 0, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 1, p2, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 2, p3, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 3, p4, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 4, p5, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 5, p6, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
|
||||
find_p_hash(0, output_block, input_block, v, m, input_iv, sub_block + 6, p7, 20);
|
||||
|
||||
memcpy(input_block, output_block, 128);
|
||||
|
||||
find_p_hash(&distance, output_block, input_block, v, m, input_iv, sub_block + 7, p8, 20);
|
||||
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
// BE CAREFUL HERE
|
||||
|
||||
total += distance;
|
||||
}
|
||||
}
|
||||
|
||||
fclose(frand);
|
||||
|
||||
sem_wait(&csoutput);
|
||||
{
|
||||
*global_total += total;
|
||||
}
|
||||
sem_post(&csoutput);
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u64 find_p_hash(ui * const restrict distance, u8 * const restrict output_block, u8 const * const restrict input_block, u64 * const restrict v, u64 * const restrict m, u8 const * const restrict input_iv, const u64 block_n, const u8 cutoff, const ui limit)
|
||||
{
|
||||
u64 best_n = 0;
|
||||
ui best_distance = 0;
|
||||
const u64 total_n = (u64)1 << (limit - 1);
|
||||
|
||||
u64 RO_IV[16];
|
||||
memcpy(RO_IV, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
RO_IV[i] += BLAKE_IV * block_n;
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (u64 n=0;n<total_n;n++)
|
||||
{
|
||||
u8 block[128];
|
||||
p_hash(block, RO_IV, v, m, cutoff, input_block);
|
||||
|
||||
const si distance = labs(get_hash_score(block));
|
||||
|
||||
if (distance > best_distance)
|
||||
{
|
||||
best_n = n;
|
||||
best_distance = distance;
|
||||
}
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV;
|
||||
}
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV * best_n;
|
||||
}
|
||||
|
||||
p_hash(output_block, RO_IV, v, m, cutoff, input_block);
|
||||
|
||||
si temp_distance = get_hash_score(output_block);
|
||||
|
||||
if (temp_distance < 0)
|
||||
{
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
output_block[i] = ~output_block[i];
|
||||
}
|
||||
|
||||
temp_distance = -temp_distance;
|
||||
}
|
||||
|
||||
if (temp_distance != best_distance)
|
||||
{
|
||||
printf("ERROR: temp_distance [%d] != best_distance [%u]\nHash confirmation failed!!\n", temp_distance, best_distance);
|
||||
fflush(0);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
if (distance)
|
||||
{
|
||||
*distance = temp_distance;
|
||||
}
|
||||
|
||||
return best_n;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void p_hash(u8 * const restrict block, u64 const * const restrict RO_IV, u64 * const v, u64 const * const restrict m, const u8 cutoff, u8 const * const restrict input_block)
|
||||
{
|
||||
u8 const * const restrict vp = (u8 *)v;
|
||||
|
||||
memcpy(v, RO_IV, 128);
|
||||
|
||||
blake2b(v, m);
|
||||
|
||||
ui p = 0;
|
||||
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
if (p == 128)
|
||||
{
|
||||
p = 0;
|
||||
blake2b(v, m);
|
||||
}
|
||||
|
||||
u8 byte = 0;
|
||||
|
||||
for (u8 b=1;b;b<<=1)
|
||||
{
|
||||
const u8 n = vp[p++];
|
||||
|
||||
if (n < cutoff)
|
||||
{
|
||||
byte |= b;
|
||||
}
|
||||
}
|
||||
|
||||
block[i] = byte ^ input_block[i];
|
||||
}
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u64 find_hash2(ui * const restrict distance, u8 * const restrict output_block, u8 const * const restrict input_block, u64 * const restrict v, u64 * const restrict m, u8 const * const restrict input_iv, const u64 block_n, const r64 lbit_p, const r64 rbit_p, const ui limit)
|
||||
{
|
||||
u64 best_n = 0;
|
||||
ui best_distance = 0;
|
||||
const u64 total_n = (u64)1 << (limit - 1);
|
||||
|
||||
u64 RO_IV[16];
|
||||
memcpy(RO_IV, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
RO_IV[i] += BLAKE_IV * block_n;
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (u64 n=0;n<total_n;n++)
|
||||
{
|
||||
u8 block[128];
|
||||
hash2(block, RO_IV, v, m, lbit_p, rbit_p, input_block);
|
||||
|
||||
const si distance = labs(get_hash_score(block));
|
||||
|
||||
if (distance > best_distance)
|
||||
{
|
||||
best_n = n;
|
||||
best_distance = distance;
|
||||
}
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV;
|
||||
}
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV * best_n;
|
||||
}
|
||||
|
||||
hash2(output_block, RO_IV, v, m, lbit_p, rbit_p, input_block);
|
||||
|
||||
si temp_distance = get_hash_score(output_block);
|
||||
|
||||
if (temp_distance < 0)
|
||||
{
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
output_block[i] = ~output_block[i];
|
||||
}
|
||||
|
||||
temp_distance = -temp_distance;
|
||||
}
|
||||
|
||||
if (temp_distance != best_distance)
|
||||
{
|
||||
printf("ERROR: temp_distance [%d] != best_distance [%u]\nHash confirmation failed!!\n", temp_distance, best_distance);
|
||||
fflush(0);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
if (distance)
|
||||
{
|
||||
*distance = temp_distance;
|
||||
}
|
||||
|
||||
return best_n;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void hash2(u8 * const restrict block, u64 const * const restrict RO_IV, u64 * const v, u64 const * const restrict m, const r64 lbit_p, const r64 rbit_p, u8 const * const restrict input_block)
|
||||
{
|
||||
u8 const * const restrict vp = (u8 *)v;
|
||||
|
||||
memcpy(v, RO_IV, 128);
|
||||
|
||||
blake2b(v, m);
|
||||
|
||||
ui p = 0;
|
||||
const r64 unit = (lbit_p - rbit_p) / 127.;
|
||||
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
const r64 temp_hash_p = lbit_p - (i * unit);
|
||||
const u16 cutoff = round(65536 * temp_hash_p);
|
||||
|
||||
if (p == 64)
|
||||
{
|
||||
p = 0;
|
||||
blake2b(v, m);
|
||||
}
|
||||
|
||||
u8 byte = 0;
|
||||
|
||||
for (ui b=0;b<8;b++)
|
||||
{
|
||||
u16 n;
|
||||
memcpy(&n, &vp[p * 2], 2);
|
||||
|
||||
p++;
|
||||
byte <<= 1;
|
||||
|
||||
if (n < cutoff)
|
||||
{
|
||||
byte |= 1;
|
||||
}
|
||||
}
|
||||
|
||||
block[i] = byte ^ input_block[i];
|
||||
}
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void shuffle(u8 * const restrict block, u64 const * const restrict RO_IV, u64 * const restrict v, u64 const * const restrict m, u8 const * const restrict input_block)
|
||||
{
|
||||
memcpy(v, RO_IV, 128);
|
||||
|
||||
blake2b(v, m);
|
||||
|
||||
memcpy(block, input_block, 128);
|
||||
|
||||
ui p = 0;
|
||||
|
||||
for (ui i=1023;i;i--)
|
||||
{
|
||||
const ui j = rng(v, m, i, &p);
|
||||
|
||||
const ui bi = get_bit(block, i);
|
||||
const ui bj = get_bit(block, j);
|
||||
|
||||
set_bit(block, i, bj);
|
||||
set_bit(block, j, bi);
|
||||
}
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u64 find_shuffle(u32 * const restrict score, u8 * const restrict output_block, u8 const * const restrict input_block, u64 * const restrict v, u64 * const restrict m, u8 const * const restrict input_iv, const u64 block_n, const ui limit)
|
||||
{
|
||||
u64 RO_IV[16];
|
||||
memcpy(RO_IV, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
RO_IV[i] += BLAKE_IV * block_n;
|
||||
}
|
||||
|
||||
u64 best_n = 0;
|
||||
u32 best_score = 0;
|
||||
const u64 total_n = (u64)1 << (limit - 1);
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (u64 n=0;n<total_n;n++)
|
||||
{
|
||||
u8 block[128];
|
||||
shuffle(block, RO_IV, v, m, input_block);
|
||||
|
||||
const u32 score = labs(get_shuffle_score(block));
|
||||
|
||||
if (score > best_score)
|
||||
{
|
||||
best_score = score;
|
||||
best_n = n;
|
||||
}
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV;
|
||||
}
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV * best_n;
|
||||
}
|
||||
|
||||
shuffle(output_block, RO_IV, v, m, input_block);
|
||||
|
||||
s32 temp_score = get_shuffle_score(output_block);
|
||||
|
||||
if (temp_score < 0)
|
||||
{
|
||||
for (ui i=0;i<512;i++)
|
||||
{
|
||||
const ui bi = get_bit(output_block, i);
|
||||
const ui bj = get_bit(output_block, 1023 - i);
|
||||
|
||||
set_bit(output_block, i, bj);
|
||||
set_bit(output_block, 1023 - i, bi);
|
||||
}
|
||||
|
||||
temp_score = -temp_score;
|
||||
}
|
||||
|
||||
if (temp_score != best_score)
|
||||
{
|
||||
printf("ERROR: temp_score [%"PRIi32"] != best_score [%"PRIu32"]\nShuffle confirmation failed!!\n", temp_score, best_score);
|
||||
fflush(0);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
if (score)
|
||||
{
|
||||
*score = temp_score;
|
||||
}
|
||||
|
||||
return best_n;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u64 find_hash(ui * const restrict distance, u8 * const restrict output_block, u8 const * const restrict input_block, u64 * const restrict v, u64 * const restrict m, u8 const * const restrict input_iv, const u64 block_n, const ui limit)
|
||||
{
|
||||
u64 best_n = 0;
|
||||
ui best_distance = 0;
|
||||
const u64 total_n = (u64)1 << (limit - 1);
|
||||
|
||||
u64 RO_IV[16];
|
||||
memcpy(RO_IV, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
RO_IV[i] += BLAKE_IV * block_n;
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (u64 n=0;n<total_n;n++)
|
||||
{
|
||||
u8 block[128];
|
||||
hash(block, RO_IV, v, m, input_block);
|
||||
|
||||
const si distance = labs(get_hash_score(block));
|
||||
|
||||
if (distance > best_distance)
|
||||
{
|
||||
best_n = n;
|
||||
best_distance = distance;
|
||||
}
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV;
|
||||
}
|
||||
}
|
||||
|
||||
memcpy(m, input_iv, 128);
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
m[i] += BLAKE_IV * best_n;
|
||||
}
|
||||
|
||||
hash(output_block, RO_IV, v, m, input_block);
|
||||
|
||||
si temp_distance = get_hash_score(output_block);
|
||||
|
||||
if (temp_distance < 0)
|
||||
{
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
output_block[i] = ~output_block[i];
|
||||
}
|
||||
|
||||
temp_distance = -temp_distance;
|
||||
}
|
||||
|
||||
if (temp_distance != best_distance)
|
||||
{
|
||||
printf("ERROR: temp_distance [%d] != best_distance [%u]\nHash confirmation failed!!\n", temp_distance, best_distance);
|
||||
fflush(0);
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
|
||||
if (distance)
|
||||
{
|
||||
*distance = temp_distance;
|
||||
}
|
||||
|
||||
return best_n;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void hash(u8 * const restrict block, u64 const * const restrict RO_IV, u64 * const v, u64 const * const restrict m, u8 const * const restrict input_block)
|
||||
{
|
||||
u8 const * const restrict vp = (u8 *)v;
|
||||
|
||||
memcpy(v, RO_IV, 128);
|
||||
|
||||
blake2b(v, m);
|
||||
|
||||
for (ui i=0;i<128;i++)
|
||||
{
|
||||
block[i] = vp[i] ^ input_block[i];
|
||||
}
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
si get_hash_score(void const * const block)
|
||||
{
|
||||
u8 const * const restrict vp = (u8 *)block;
|
||||
|
||||
si population = 0;
|
||||
|
||||
for (ui i=0;i<16;i++)
|
||||
{
|
||||
u64 temp;
|
||||
memcpy(&temp, &vp[i * 8], 8);
|
||||
population += __builtin_popcountl(temp);
|
||||
}
|
||||
|
||||
return 512 - population;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
s32 get_shuffle_score(void const * const restrict block)
|
||||
{
|
||||
s32 score = 0, mscore = 0;
|
||||
|
||||
for (ui i=0;i<1024;i++)
|
||||
{
|
||||
if (!get_bit(block, i))
|
||||
{
|
||||
score += i;
|
||||
}
|
||||
|
||||
if (!get_bit(block, 1023 - i))
|
||||
{
|
||||
mscore += i;
|
||||
}
|
||||
}
|
||||
|
||||
return score > mscore ? score : -mscore ;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void blake2b(u64 * const restrict v, u64 const * const restrict m)
|
||||
{
|
||||
#define G(x, y, a, b, c, d) \
|
||||
do { \
|
||||
a = a + b + m[x]; \
|
||||
d = ((d ^ a) >> 32) | ((d ^ a) << 32); \
|
||||
c = c + d; \
|
||||
b = ((b ^ c) >> 24) | ((b ^ c) << 40); \
|
||||
a = a + b + m[y]; \
|
||||
d = ((d ^ a) >> 16) | ((d ^ a) << 48); \
|
||||
c = c + d; \
|
||||
b = ((b ^ c) >> 63) | ((b ^ c) << 1); \
|
||||
} while (0)
|
||||
|
||||
G(13, 11, v[ 0], v[ 4], v[ 8], v[12]);
|
||||
G( 7, 14, v[ 1], v[ 5], v[ 9], v[13]);
|
||||
G(12, 1, v[ 2], v[ 6], v[10], v[14]);
|
||||
G( 3, 9, v[ 3], v[ 7], v[11], v[15]);
|
||||
G( 5, 0, v[ 0], v[ 5], v[10], v[15]);
|
||||
G(15, 4, v[ 1], v[ 6], v[11], v[12]);
|
||||
G( 8, 6, v[ 2], v[ 7], v[ 8], v[13]);
|
||||
G( 2, 10, v[ 3], v[ 4], v[ 9], v[14]);
|
||||
|
||||
#undef G
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u64 tick(void)
|
||||
{
|
||||
struct timespec now;
|
||||
clock_gettime(CLOCK_MONOTONIC, &now);
|
||||
return ((u64)now.tv_sec * 1000) + ((u64)now.tv_nsec / 1000000);
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u16 rng(u64 * const restrict v, u64 const * const restrict m, const u16 n, ui * const restrict p)
|
||||
{
|
||||
u16 mask = n - 1;
|
||||
|
||||
mask |= mask >> 1;
|
||||
mask |= mask >> 2;
|
||||
mask |= mask >> 4;
|
||||
mask |= mask >> 8;
|
||||
|
||||
mask |= mask + 1;
|
||||
|
||||
u16 r;
|
||||
do r = rng_word(v, m, p) & mask;
|
||||
while (r > n);
|
||||
|
||||
return r;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
u16 rng_word(u64 * const v, u64 const * const restrict m, ui * const restrict p)
|
||||
{
|
||||
u8 const * const restrict vp = (u8 *)v;
|
||||
|
||||
if (*p == 64)
|
||||
{
|
||||
*p = 0;
|
||||
blake2b(v, m);
|
||||
}
|
||||
|
||||
u16 temp;
|
||||
memcpy(&temp, &vp[(*p)++ * 2], 2);
|
||||
return temp;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
ui get_bit(void const * const restrict stream, const ui address)
|
||||
{
|
||||
return (((u8 *)stream)[address / CHAR_BIT] >> ((CHAR_BIT - 1) - (address % CHAR_BIT))) & 1;
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void set_bit(void * const restrict stream, const ui address, const ui bit)
|
||||
{
|
||||
if (bit) ((u8 *)stream)[address / CHAR_BIT] |= (1 << ((CHAR_BIT - 1) - (address % CHAR_BIT)));
|
||||
else ((u8 *)stream)[address / CHAR_BIT] &= ~(1 << ((CHAR_BIT - 1) - (address % CHAR_BIT)));
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void print_bytes(s8 const * const restrict label, void const * const p, const ui l)
|
||||
{
|
||||
printf("%s: ", label);
|
||||
for (ui i=0;i<l;i++)
|
||||
{
|
||||
u8 const * const restrict s = (u8 *)p;
|
||||
printf("%02X", s[i]);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void print_population(s8 const * const restrict label, void const * const p)
|
||||
{
|
||||
u8 const * const restrict s = (u8 *)p;
|
||||
ui pop = 0;
|
||||
printf("%s: [ ", label);
|
||||
for (ui i=0;i<8;i++)
|
||||
{
|
||||
u64 temp1, temp2;
|
||||
memcpy(&temp1, &s[(i * 16) + 0], 8);
|
||||
memcpy(&temp2, &s[(i * 16) + 8], 8);
|
||||
const ui temp = __builtin_popcountl(temp1) + __builtin_popcountl(temp2);
|
||||
printf("%u ", temp);
|
||||
pop += temp;
|
||||
|
||||
}
|
||||
printf("] %u %.2f%% %lu\n", pop, (pop * 100.) / 1024, labs(get_shuffle_score(p)));
|
||||
}
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
|
|
@ -0,0 +1,65 @@
|
|||
//----------------------------------------------------------------------------------------------------------------------
|
||||
// Copyright © 2021 by Brett Kuntz. All rights reserved.
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
#include <assert.h>
|
||||
#include <limits.h>
|
||||
static_assert(CHAR_BIT == 8, "This code requires [char] to be exactly 8 bits.");
|
||||
static_assert(sizeof(long) == 8, "This code requires [long] to be exactly 8 bytes."); // __builtin_popcountl
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
#include <stdint.h>
|
||||
typedef unsigned char u8 ; typedef char s8 ;
|
||||
typedef uint16_t u16 ; typedef int16_t s16 ;
|
||||
typedef uint32_t u32 ; typedef int32_t s32 ;
|
||||
typedef uint64_t u64 ; typedef int64_t s64 ;
|
||||
typedef __uint128_t u128 ; typedef __int128_t s128 ;
|
||||
typedef unsigned int ui ; typedef int si ;
|
||||
typedef unsigned long ul ; typedef long sl ;
|
||||
typedef unsigned long long ull ; typedef long long sll ;
|
||||
typedef float r32 ; typedef double r64 ;
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
#define halt do { fflush(0); while (1) sleep(-1); } while (0)
|
||||
#define cwait do { fflush(0); sleep(1); do errno = 0, wait(0); while (errno != ECHILD); sleep(1); } while(0)
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
// 1st cut is 128 (p0.50)
|
||||
// 2nd cut is 37 (p0.14453125)
|
||||
// 3rd cut is 23 (p0.08984375)
|
||||
// 4th cut is 17 (p0.06640625)
|
||||
// 5th cut is 14 (p0.05468750)
|
||||
// 6th cut is 11 (p0.04296875)
|
||||
// 7th cut is 9 (p0.03515625)
|
||||
// 8th cut is ?? 8 ??
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <inttypes.h>
|
||||
#include <unistd.h>
|
||||
#include <time.h>
|
||||
#include <math.h>
|
||||
#include <semaphore.h>
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/sysinfo.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/wait.h>
|
||||
#include <sys/mman.h>
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
void check(const u8, const u8, const u8, const u8, const u8, const u8, const u8);
|
||||
u64 find_hash(ui * const restrict, u8 * const restrict, u8 const * const restrict, u64 * const restrict, u64 * const restrict, u8 const * const restrict, const u64, const ui);
|
||||
u64 find_hash2(ui * const restrict, u8 * const restrict, u8 const * const restrict, u64 * const restrict, u64 * const restrict, u8 const * const restrict, const u64, const r64, const r64, const ui);
|
||||
u64 find_p_hash(ui * const restrict, u8 * const restrict, u8 const * const restrict, u64 * const restrict, u64 * const restrict, u8 const * const restrict, const u64, const u8, const ui);
|
||||
u64 find_shuffle(u32 * const restrict, u8 * const restrict, u8 const * const restrict, u64 * const restrict, u64 * const restrict, u8 const * const restrict, const u64, const ui);
|
||||
void hash(u8 * const restrict, u64 const * const restrict, u64 * const, u64 const * const restrict, u8 const * const restrict);
|
||||
void hash2(u8 * const restrict, u64 const * const restrict, u64 * const, u64 const * const restrict, const r64, const r64, u8 const * const restrict);
|
||||
void p_hash(u8 * const restrict, u64 const * const restrict, u64 * const, u64 const * const restrict, const u8, u8 const * const restrict);
|
||||
void shuffle(u8 * const restrict, u64 const * const restrict, u64 * const restrict, u64 const * const restrict, u8 const * const restrict);
|
||||
si get_hash_score(void const * const);
|
||||
void blake2b(u64 * const restrict, u64 const * const restrict);
|
||||
u64 tick(void);
|
||||
void set_bit(void * const restrict, const ui, const ui);
|
||||
ui get_bit(void const * const restrict, const ui);
|
||||
u16 rng_word(u64 * const, u64 const * const restrict, ui * const restrict);
|
||||
u16 rng(u64 * const restrict, u64 const * const restrict, const u16, ui * const restrict);
|
||||
s32 get_shuffle_score(void const * const restrict);
|
||||
void print_bytes(s8 const * const restrict, void const * const, const ui);
|
||||
void print_population(s8 const * const restrict, void const * const);
|
||||
//----------------------------------------------------------------------------------------------------------------------
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
#!/usr/bin/bash
|
||||
|
||||
# Copyright © 2021 by Brett Kuntz. All rights reserved.
|
||||
|
||||
#clang compress.c -o compute -pthread -lm -Wall -Werror -Wfatal-errors -pipe -O3 -flto -fomit-frame-pointer -march=native -mtune=native
|
||||
clang compress.c -o compute.exe -pthread -lm -Wall -Werror -Wfatal-errors -pipe -O3 -fomit-frame-pointer -march=native -mtune=native
|
||||
Loading…
Reference in New Issue