./gpuowl
2020-06-01 14:30:39 gpuowl v6.11-309-gca2d00b
2020-06-01 14:30:39 Note: not found 'config.txt'
2020-06-01 14:30:39 device 0, unique id ''

what do I do from here? using ubuntu 19.10

[QUOTE=Cheetahgod;546960]./gpuowl
2020-06-01 14:30:39 gpuowl v6.11-309-gca2d00b
2020-06-01 14:30:39 Note: not found 'config.txt'
2020-06-01 14:30:39 device 0, unique id ''

what do I do from here? using ubuntu 19.10[/QUOTE]

I get that stuff at whenever I fire up the program, but it should be followed by a line showing the exponent of the current run, FFT length, etc.

Sounds like you haven't yet run the tools/primenet.py script to create/update your worktodo.txt file. One '.' at start here if you are running from the same dir as the executable, '..' if from within a run-subdir underneath it, as I do for my 2-runs-per-card setup on my Radeon VIIs:

'../tools/primenet.py -u [your primenet uid] -p [primenet pwd]', cat the contents of the resulting worktodo.txt to see if they are as expected, then if so, restart the program.

(The program has a multi-task set of flags, but I find it easier to just create 2 dirs run0 and run1 under the main-dir, cd into each to init/update the worktodo and 'nohup sudo ../gpuowl [-d [optional device id]] &').

[QUOTE=Cheetahgod;546960]./gpuowl
2020-06-01 14:30:39 gpuowl v6.11-309-gca2d00b
2020-06-01 14:30:39 Note: not found 'config.txt'
2020-06-01 14:30:39 device 0, unique id ''

what do I do from here? using ubuntu 19.10[/QUOTE]


Do you have a Exponent in the worktodo.txt File? f.e.
DoubleCheck=B9FA5FA90A509BAC97C206CECF58B325,54957319,74,1

Compilation should start automatically....

[QUOTE=kriesel;546940]2[SUP]9[/SUP] full size residues is a lot of disk space to commit to one exponent.
How low a power is adequate?
[/QUOTE]

For each one-step-down of the power, the temporary disk space needed to store the residues is halved, the effort to generate the proof is [more than] halved, and the effort to verify the proof is doubled.

For power==9, the verification effort is 1/512 of the full PRP test. For power==7, the verification cost is 1/128 of the full PRP test. Thus I'd say power==7 is the smallest that's practical. For 100M exponents (the current wavefront) I think power 8 or 9 would be appropriate. For much higher exponents, e.g. 320M, I would consider power 10.

One more thing to consider here is that in practice the proof would be generated once, but verified at least 2 times (or more), so probably it's worth to tip the balance towards putting more work in the proof generation than in the verification.

[QUOTE]
If -proof n is included in config.txt for prp work, does gpuowl properly ignore it and function correctly when the work is LLDC or P-1?[/QUOTE]
Yes that's the idea.

I put a exponent in worktodo.txt but it hangs when I run the command. How do I check if opencl is working?

[QUOTE=Cheetahgod;546988]I put a exponent in worktodo.txt but it hangs when I run the command. How do I check if opencl is working?[/QUOTE]

Please be more explicit in your errors by posting in code tags the last few lines where it hangs

Did you precede your command with sudo? I.e, [C]sudo ./gpuowl[/C].

[QUOTE=Cheetahgod;546988]How do I check if opencl is working?[/QUOTE]

Try running clinfo

The PRP Proof spec is now here:
[url]https://github.com/preda/gpuowl/wiki/PRProof-File-Spec[/url]

and gpuowl should now be conforming to that spec.

It seems like I have a problem with the rocm installation.

[QUOTE=Cheetahgod;547000]It seems like I have a problem with the rocm installation.[/QUOTE]

What does [C]uname -a[/C] report?

And [C]ls -d /opt/roc*[/C]?

And what happens when you run (in the gpuowl directory) [C]sudo ./gpuowl[/C]?

gpuowl-win v6.11-310 failed to build
 

See the error about ambiguous overload
[CODE]ProofSet.h:196:77: error: ambiguous overload for 'operator*' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<__gmp_expr<__mpz_struct [1], __mpz_struct [1]> >, __gmp_expr<__mpz_struct [1], __mpz_struct [1]> >::value_type' {aka '__gmp_expr<__mpz_struct [1], __mpz_struct [1]>'} and 'std::array<long long unsigned int, 4>::value_type' {aka 'long long unsigned int'})
196 | for (int i = 0; i < (1 << (p - 1)); ++i) { hashes.push_back(hashes[i] * hash[0]); }
[/CODE]