## Darkness Point of Origin on an Object [duplicate]

If the Darkness spell is cast on a point that is on the end of a 10 foot pole or a glaive or some other large object, does the center of the sphere stick to that end or does it emanate from the "center" of that object?

## Wares Point

Why are you selling this site?
I am not a marketing guru, I'm a programmer who picked the site up to make some extra money and I do not want to prioritize learning scaling & marketing on top of what I'm already doing and loving. A hobby that turned into a business I won't be able to manage.

How is it monetized?

Does this site come with any social media accounts?
I'd be 100% willing to transfer over any social account directly…

Wares Point

## Is there any point in using PGP or S/MIME when your receipients mostly don’t use it?

For an average company how much does it make sense to implement S/MIME or PGP for providing their E-mails the verification functionality (please correct me if I’m wrong), which most E-mail clients to my best of knowledge support, even though the contacts of the company usually don’t use any kind of E-mail encryption.

## Is machine epsilon the largest relative error in representing a number as a floating point number?

Is machine epsilon the largest relative error in representing a number as a floating point number?

There are so many definitions of machine epsilon. I’m starting to get confused. Isn’t the machine epsilon the smallest?

## Finding a valid equation for fixed point problem

I currently am working on learning more about fixed point method. Finding equations that satisfy the constraints of a g function can sometimes require a bit of engineering. I have come across one that many would consider simple. Yet, I have been stuck on it for some time now.

Here it is $$f(x) = x^2 – x – 2 = 0$$ on $$[1.5,3]$$.

I have tried many things; however, I have yet to successfully discover one that maps domain to range for both $$g$$ and $$g^\prime$$.

Would anyone be able to give me a guiding hand?

Many projects offering binaries, also offer checksums (e.g. SHA256) of those binaries, e.g. as ASC files. This isn’t to protect against network-caused corruption, as that’s ensured by the TCP protocol.

Given that the binary and the .ASC file are downloaded from the same server (example from very sensitive software), what attack scenarios does this technique prevent?

If an attacker managed to tamper with the binary, why wouldn’t they tamper the signatures in the same way? Same for the attacker performing MITM and tampering the download in transit.

I can imagine that a separate, secret, monitoring bot hosted on a completely different system, could download the signature file every minute (given its tiny size) and check it against tampering, but I haven’t heard of this being done.

## Insecure VPN entry point

If I use an insecure router as an entry point of a VPN, does this effectively bypass all of the privacy benefits of using a VPN?

## Maximal subsets of a point set which fit in a unit disk

Suppose that there are a set $$P$$ of $$n$$ points on the plane, and let $$P_1, \dots, P_k$$ be not necessarily disjoint subsets of $$P$$ such that every point in $$P_i|\ 1 \leq i \leq k$$ fits inside a unit disk $$D_i$$.

Moreover, each $$P_i$$ is maximal. This means that if the corresponding unit disk $$D_i$$ moves to cover another point, then one point which was inside the disk will be uncovered.

Here is an example:

In the above figure, there are three maximal subsets.

I don’t know whether this problem has a name or was studied before, but my question is:

1. Can $$k$$ be $$O(1)^n$$?
2. If not, then can we find those subsets in polynomial time w.r.t. $$n$$?

## minimum travel from point to point with incremental steps

It’s my first time to make a question here. I have a curious problem about algorithm, in the center of Cartesian plane (0,0) I need to go to another point (x,y) but I only can use horizontaly and verticaly steps and this steps increases one by one.

For example, I need to go to (1,1) point and steps are:

• Go to (1,0), a step of 1 unit.
• Go to (1,-2) a step of 2 units.
• Finally, go to (1,1) a step of 3 units.

Obviously, there are several ways to go to a point from center but the problem needs the minimal.

Are there a formula or an algorithm to answer this question? Thanks for read this and for your questions.

## New way of representing floating point

I want to create a new way of representing floating point. In standard IEEE floating point, we have 1 bit to represent sign, 8 bits to represent exponential and 23 bits to represent significand. In the new floating point system, I keep the breakdown of sign/exp/significand but there is no implicit 1 (assume there is no denormalized numbers). For example, in this new scheme to represent 3, we have sign bit 0, exponential bit 0x7F and significand 0x000003. Does this new system of floating point represent a larger unique numeric values than IEEE standard point? My thought is that since both systems have the same breakdown they represent the same number of unique numeric values