[ANN][GRS][DMD][DGB] Pallas optimized groestl opencl kernels

[utahjohn]

Any chance of getting your latest OCL source to try on 280x (Hawaii)

[1714121278]

1714121278

[1714121278]

1714121278

[1714121278]

1714121278

[1714121278]

1714121278

[pallas]

Any chance of getting your latest OCL source to try on 280x (Hawaii)

I assume you meant Tahiti.
I've acquired a 280x myself: it's not worth using v2 on it, hashrate is lower than with v1.

[utahjohn]

Any chance of getting your latest OCL source to try on 280x (Hawaii)

I assume you meant Tahiti.
I've acquired a 280x myself: it's not worth using v2 on it, hashrate is lower than with v1.

Doh, yeah Tahiti 2 wavefronts not possible?

[pallas]

Any chance of getting your latest OCL source to try on 280x (Hawaii)

I assume you meant Tahiti.
I've acquired a 280x myself: it's not worth using v2 on it, hashrate is lower than with v1.

Doh, yeah Tahiti 2 wavefronts not possible?

Both me and Wolf0 tried that and (at least for me) stopped trying after a while. Funny no longer ;-)

[pallas]

Any chance of getting your latest OCL source to try on 280x (Hawaii)

I assume you meant Tahiti.
I've acquired a 280x myself: it's not worth using v2 on it, hashrate is lower than with v1.

Doh, yeah Tahiti 2 wavefronts not possible?

Both me and Wolf0 tried that and (at least for me) stopped trying after a while. Funny no longer ;-)

I think I've beaten your ASM with pure OpenCL on 290X.

Some of your last tips (and smolen's) can be applied to this kernel as well, I think it can reach 38/40 Mh/s ;-)

[sp_]

Good work on the groest. Smolens quark miner does around 2 mhash on the 280x.
My gtx 980 does 20mhash. The competition is sleeping...

[pallas]

Good work on the groest. Smolens quark miner does around 2 mhash on the 280x.
My gtx 980 does 20mhash. The competition is sleeping...

I think that just applying some well known tricks, already available on public kernels, will bring quark hashrate to around 10.
Thing is, it's not funny. Optimizing single kernel algos is much more interesting, imho.

[sp_]

15 years ago I worked for a company in the silicon valley. My collegues earned xxx.xxx$ a year but I was a student at san francisco state u.

[pallas]

15 years ago I worked for a company in the silicon valley. My collegues earned xxx.xxx$ but I was a student at san francisco state u.

20 years ago I started programming professionally.
Still, a lot of my work is free or almost free :-)
I was wondering if us (miner developers) should unite to take the best out of it.

[sp_]

Today i earn $xxx.xxx  a year. Optimizing is just a hobby..

[pallas]

Today i earn $xxx.xxx  a year. Optimizing is just a hobby..

same for me.
still, if a fun job also remunerates, it's even better ;-)

[sp_]

I've also lived and worked in st. Petersburg Russia. My collegues are some of the best programmers in the world.

[pallas]

I've also lived and worked in st. Petersburg Russia. My collegues are some of the best programmers in the world.

Ok but it looks like you mistaken this thread for a job search one :-D

[qwep1]

I've also lived and worked in st. Petersburg Russia. My collegues are some of the best programmers in the world.

Ok but it looks like you mistaken this thread for a job search one :-D

[sp_]

Nah.  I don't need to work.. My program is making money

[smolen]

Good work on the groest. Smolens quark miner does around 2 mhash on the 280x.
My gtx 980 does 20mhash. The competition is sleeping...

Some of competitors are awake, taking exercises with pen and paper to get all AES-wannabees at once Doing it all by hand, algo by algo will be just boring.

15 years ago I worked for a company in the silicon valley. My collegues earned xxx.xxx$ a year but I was a student at san francisco state u.

I've also lived and worked in st. Petersburg Russia. My collegues are some of the best programmers in the world.

Triangulated

Some of your last tips (and smolen's) can be applied to this kernel as well, I think it can reach 38/40 Mh/s ;-)

Last but one trick in my WhirlpoolX kernel. Anyway, I'm going to abandon table approach, no much sense to keep it secret.

Code:

static const CONSTANT UINT64 arrPrecalc_post_l27[256] = ...
#define baseL27 ((UINT32)&arrPrecalc_post_l27[0])
#define TC0off8_l27(off8) (*(const CONSTANT UINT64*)&(((const CONSTANT UINT8*)0)[off8]))
#define LUT3_r3(v) ASX64(TC0off8_l27(bitselect(baseL27, (UINT32)(as_ulong(v) >> 24), 0x7F8U)))

[smolen]

I was wondering if us (miner developers) should unite to take the best out of it.

Cartel will take all the fun out of game and possibly destroy PoW world. On the other hand, PoS landscape could benefit from some polishing

[smolen]

That's about as far as my parse got before I went, "Is that a fucking NULL pointer dereference?"

Yes Indexed address is calculated in bitselect. LUT0 and LUT4 indexing is just single AND operation.
EDIT: Oh, wait UINT8 is byte, not int vector. I probably went too far redefining every type
X64/ASX64 macros keep code debugable on CPU - MSVC is too handy

Code:

#ifdef __OPENCL_VERSION__
	#define X64 uint2
	#define ASX64(v) (as_uint2(v))
#else
	#define X64 UINT64
	#define ASX64(v) (v)
#endif

[smolen]

That's about as far as my parse got before I went, "Is that a fucking NULL pointer dereference?"

Yes Indexed address is calculated in bitselect. LUT0 and LUT4 indexing is just single AND operation.
EDIT: Oh, wait UINT8 is byte, not int vector. I probably went too far redefining every type

Okay... I'm guessing that you've removed bits from the tables and are regenerating them on the fly, but I can't quite figure out how. Then again, bitwise ops aren't really my best subject...

Tables are constant, just prerotated left by 3 bit (size of one uint2 when used as index). Well, this stuff needs comments, if kernel will be published. Money are in X11 and Monero, not so much value in Whirlpool code, I could just drop it somewhere, but it will give everyone free boost in X11

[pallas]

That's about as far as my parse got before I went, "Is that a fucking NULL pointer dereference?"

Yes Indexed address is calculated in bitselect. LUT0 and LUT4 indexing is just single AND operation.
EDIT: Oh, wait UINT8 is byte, not int vector. I probably went too far redefining every type

Okay... I'm guessing that you've removed bits from the tables and are regenerating them on the fly, but I can't quite figure out how. Then again, bitwise ops aren't really my best subject...

Tables are constant, just prerotated left by 3 bit (size of one uint2 when used as index). Well, this stuff needs comments, if kernel will be published. Money are in X11 and Monero, not so much value in Whirlpool code, I could just drop it somewhere, but it will give everyone free boost in X11

Maybe not: people are using wolf0's precompiled x11 binaries, just adding your trick to stock kernels will not come close to them speed-wise.