Page not found – Information Security Stack Exchange

Stack Exchange Network

Stack Exchange network consists of 177 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

“Portable” MySQL and logging – Database Administrators Stack Exchange

I’m using “portable” Mysql(not installed and should be started by batch file)
“@echo off
@color B
echo Starting the MySQL
mysql5binmysqld.exe –console –max_allowed_packet=64M”

it has inside 2db, and I want to log any queries for only one db.
But I can’t find the config(lol) It has 5 configs inside: my-huge, my-innodb-heavy-4G, my-large and so on.
What config should I edit?

Termux: airmon-ng: Permission denied – Android Enthusiasts Stack Exchange

I want to run airmon-ng but when I do it seems like the airmon-ng skript can’t access other tools and it looks like this:

% sudo airmon-ng start wlan0
/data/data/com.termux/files/usr/bin/airmon-ng: 59: id: Permission denied
Unable to determine user id, permission errors may occur.
/data/data/com.termux/files/usr/bin/airmon-ng: 75: uname: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 171: ls: Permission denied

/data/data/com.termux/files/usr/bin/airmon-ng: 1085: ls: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 1095: sed: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 1098: sort: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 982: grep: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 989: grep: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 1008: ps: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 1008: grep: Permission denied
/data/data/com.termux/files/usr/bin/airmon-ng: 1013: [: -gt: unexpected operator
/data/data/com.termux/files/usr/bin/airmon-ng: 1024: [: -gt: unexpected operator

PHY Interface   Driver      Chipset

In the first place I thought it is about the permissons of airmon-ng itself and I tried to change its permissions resulting in no changes of its behavior.
To me it seems like it can’t be due to id‘s permissions:

% ls -l id
lrwxrwxrwx 1 u0_a129 u0_a129 9 Jul  9 19:40 id -> coreutils

I already run termux-setup-storage and restarted. As this should not influence the issue it did not change anything as well.

Now I’m running out of clues and can’t find similar issues. Got someone an idea?

dnd 5e – Does the Spirit Guardians spell stack with multiple casters?

Half speed does not stack, but damage should

The effects of different spells add together while the durations of those spells overlap. The effects of the same spell cast multiple times don’t combine, however. Instead, the most potent effect — such as the highest bonus — from those castings applies while their durations overlap.

If damage is an effect of the spell, funny things can happen. Imagine two clerics (C1 radiant, and C2 necrotic) using this spell, in partially overlapping areas. Two enemies (E1 and E2) are running past them. E2 gets the damage twice, but E1 only once, as the radiant field “protects” him when he would enter the necrotic field.
I really hope this is not intentional.

overlapping Spirit Guardians

It seems it is up to us to decide what is an effect and what is not. I think if damage is not an effect, but a separate property of a spell, the game provides better simulation, while still keeping balance.


Two Dire Wolfs bite you, you get the damage twice (2x 2d6+3), but once you are prone, you won’t get proner.

Analogously, you are in the area of two Spirit Guardians. You get the damage twice, but your speed is only halved once. Makes sense.


Assume C1 has the Light domain, and he casts Wall of Fire in a 4th level slot, while C2 casts Spirit Guardians in a 3rd level slot. The enemy now takes 3d8+5d8 damage. Casting Spirit Guardians in this 4th level slot would decrease this damage to 3d8+4d8, so it is far from overpowered.

On the other hand, adding two (or more) Blesses together would be clearly overpowered, trivializing GWM for example. But Bless does not do damage, rather it is more like a condition.


You might call it interpretation, you might call it houserule, the bottom line is the game makes more sense if damage is added together, but the conditions (effects) are not.

SEO Keyword Density Issue – Webmasters Stack Exchange

I have a website that has a keyword density of 8% and 4% for my keywords, but I only used the keyword once. The website doesn’t have a lot of actual text. Does this high keyword density hurt my site’s SEO even though I only used it once? I checked my keyword density using the SEO Review Tools density checker.

Magento2 Impact of Setup:upgrade – Magento Stack Exchange

I am preparing for certification and I came across one of the questions and I wanted to confirm the options. I know option 4 is correct for sure, confused between 1 and 2. I know setup:upgrade does not clear Magento cache. any help will be appreciated

You have to install a new module on the production environment. All the module is adding a new product attribute. You enabled maintenance mode, copied the module code, run bin/magento setup: upgrade and
disabled maintenance mode.

What two risks does this process pose? (Choose two.)

  1. It will clean all caches which will cause performance degradation
  2. The new attribute will be invisible on the storefront until the cache is cleaned manually
  3. It will void all active sessions
  4. It will clean static assets from the pub/static folder

Transaction verification scripts – Bitcoin Stack Exchange

I’m working on a Bitcoin thesis for my master’s degree and i have some doubts of my understanding how bitcoin transaction works, so please correct me in everything i got wrong. Sorry for really long question, this is only my second posting, but i have so many wholes in my understanding of this.
Ok, so:

  1. Persons A and B are Bitcoin network nodes. A wants to send bitcoins to B. He (his wallet) needs to create transaction to do so.
  2. Every transaction has inputs and outputs and inputs of every transaction are just references to some previous outputs of some other, older, transaction that someone made towards A. After bitcoins arrived for A they reside in his UTXO (every single person in network has their own UTXO database with their own collection of unspent outputs related to address they are in control of).
  3. To send bitcoins A needs to resolve the puzzle given in scriptPubKey of previous transaction’s output by using his scriptSig which his wallet generates upon making a transaction. Basically A just needs to confirm that he is in control of private key that is related to public key and therefor to Bitcoin address of his wallet.
  4. B receives bitcoins, his wallet stores them in UTXO, and they just lay there until B decides to send those bitcoins further.
  5. And circle goes on. I skipped detail about change address because i its not relevant for this question.

If we are talking about p2pkh:
Puzzle scriptPubKey that A needs to solve (along with other operators) contains publicKeyhash, operator OP_HASH160 and operator OP_EQUALVERIFY that should compare value of publicKeyHash with public hashed key of person A (public key is included in his scriptPubKey, so taking the operator OP_HASH160 will produce hash of public key).
But how the person that sent bitcoins to A knows value of publicKeyHash so he can populate his scriptPubKey? My assumption is that he reverse steps of generating Bitcoin address, by decoding it with Base58 and taking out the control bit? But i couldn’t find confirmation of this online, sorry if missed it.

If we are talking about m of n transaction:
Assume that A is controlling an address that requires multisig for future use of bitcoins.
Someone wants to send A bitcoins and needs to create scriptPubKey and it should look like this
m pubKey_1, pubkey_2, …pubKey_m n OP_CHECKMULTISIGVERIFY
How does the person that wans to send A bitcoins knows public keys of people that are related to A’s bitcoin address? And further more, how does he knows the value of ‘m’? Isn’t it logical that A determines what is the minimal number of signatures? If i understood this transaction has no use no more, but still i want to understand how did it work.

If we are talking about P2SH:
if A is in control of P2SH address, how does the scriptPubKey looks for person that creates transaction towards A? Does that person needs to be in control of P2SH?

When A wants to send bitcoins, I understand that whole scriptSig now contains the scriptPubKey operators and operands, but new generated scriptPubKey is now the part that confuses me.

OP_HASH160 hash(scriptSig) OP_EQUAL should be the look of scriptPubKey.
And person that receives bitcoins from A should know how to solve this. But my question is how? How can he solve this when his scriptSig will be different than one written down in scriptPubKey. I know im missing a lot here since this protocol is wide popular, and to me is not making any sense.

Last question:
What is the correct moment of verifying this scripts and transaction itself. As i said above, i assume scriptPubKey and scriptSig, after they are concatenated are evaluated when person wants to send bitcoins. But what happens to transaction after that? Does it travel around the network and other client wallets verify them by checking sender’s UTXO base (which is available for everyone?). Is there any additional checks by those other nodes?
After checking is done is it only then that transaction goes to memory pool and waits there until miner picks it up?
After miner include it in block, is transaction checked again trough some protocol that is checking the block?
Does miner checks the transaction himself again?
Again, sorry for a lot of questions and thank you in advance. Stay healthy.

c++ – Primiitve calculator – Code Review Stack Exchange

So, the problem task is:

Given an integer 𝑛, compute the minimum number of operations(+1, x2, x3) needed
to obtain the number 𝑛 starting from the number 1.

I did this using this code:

using namespace std;
int main()
    int n;
    cin >> n;
    vector<int> v(n+1, 0);
    v(1) = 1;
    for(int i = 1; i < v.size(); i++)
        if((v(i + 1) == 0) || (v(i + 1) > v(i) + 1))
            v(i + 1) = v(i) + 1;
        if((2*i <= n) && (v(2*i) == 0 || v(2*i) > v(i) + 1))
            v(2*i) = v(i) + 1;
        if((3*i <= n) && (v(3*i) == 0 || v(3*i) > v(i) + 1))
            v(3*i) = v(i) + 1;
    cout << v(n) - 1 << endl;
    vector<int> solution;
    while(n > 1)
        if(v(n - 1) == v(n) - 1)
            n = n-1;
        else if(n%2 == 0 && v(n/2) == v(n) - 1)
            n = n/2;
        else if(n%3 == 0 && v(n/3) == v(n) - 1)
            n = n/3;
    reverse(solution.begin(), solution.end());
    for(size_t k = 0; k < solution.size(); k++)
        cout << solution(k) << ' ';




1 2 4 5

Do you have any optimized way to do this?

Best Benchmark plugins – User Experience Stack Exchange

Stack Exchange Network

Stack Exchange network consists of 177 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange