Organizing a totally secret murder mystery

D

diynevala

I have an idea for murder mystery mechanics and I need helpful tips to build it up to a working game. So, I'm at a party, where guests are totally unaware of any upcoming murder mystery. Nothing fancy there yet. I want to hand out a card to a guest, in secret, containing the premise and rules for the murder mystery:

  1. Jack Smith has been murdered! This is Secret Murder Mystery and these are the rules.
  2. If you wish NOT to play, PLEASE return this envelope and PLEASE don't spoil the game.
  3. If you choose to play, tell [organizer's name] SECRETLY that you are in.

[organizer will hand out the rest of the rules here]

  1. You are NOT to reveal other guests ANYTHING about this murder mystery.
  2. You are your character, your normal occupation, relationships and hobbies.
  3. In addition, you have some in-game stuff, like:
    • murder weapon,
    • motive for the murder,
    • gossip or clues about other players and
    • tasks you need to complete in total secret
  4. In order to remain in secret, you should go about the party as usual, at the same time keep an eye on other possible players, if they are leaving behind evidence or clues that will help you to determine the murderer (in marked envelopes).

Possible tasks (different for each player):

  1. Recruit other players by handing out unopened envelopes secretly to other party-goers.
  2. Plant evidence by leaving marked envelopes in plain sight or handing them out to players you have identified.
  3. Reveal other players you have indentified to [organizer's name].
  4. Make deals with other players to provide alibis to each other.

Gameplay progress:

  1. Players are recruited and
  2. Tasks are performed until
  3. Players complete their tasks
  4. Completing tasks grants clues
  5. Someone figures out the murderer
  6. Players are revealed, game is announced and the murderer lost.

at any point, if the murder mystery game is no longer a secret among party-goers, the players are revealed, game is announced and the murderer won (escaped).

There are obviously much more to figure out for this game. Small ideas in comments, big ideas in answers..

Also, please tell me if I re-invented the wheel and such gameplay exists already.
 

Unreplied Threads

When an algebra isomorphism preserves positive involution

Let $A$ be a $K$-algebra where $K$ is a field with a unique ordering. We say a $K$-linear involution $*$ is positive if the map $A \to K$ via $a \mapsto tr(a^*a)$ is positive definite with respect to the ordering. Here, $tr(a)$ is the trace of the left multiplication map $a:x \mapsto ax$.

Suppose there is a $K$-algebra isomorphism $$\varphi: A \to B.$$

If there is a unique (up to isomorphism) positive involution in $A$ and $B$, can we say the involution must be preserved by the isomorphism $\varphi$: $$\varphi: (A, *_A) \to (B, *_B)?$$

Motivation:​


My question is motivated from representation theory. When $W$ is a real irreducible representation (irrep) of a finite group $G$, then $D:=End_G(W)$ is a division algebra by Schur's lemma. Additionally, Frobenius theorem on real associative division algebras implies that $D$ is isomorphic to either the reals $\mathbb{R}$, complexes $\mathbb{C}$, or quaternions $\mathbb{H}$. Let's call this isomorphism $\varphi$.

Suppose $W$ is endowed with an $G$-invariant inner product (i.e. $\langle g\cdot u, g\cdot v \rangle=\langle u , v \rangle$ for all $u,v \in W$ and $g \in G$). So, $W$ is an orthogonal irrep, and $D$ has the involution that acts as the adjoint corresponding to the $G$-invariant inner product. We know that $\mathbb{R}$, $\mathbb{C}$, and $\mathbb{H}$ all have involution. Furthermore, they are normed division algebras. The involution is the trivial map in $\mathbb{R}$, complex conjugate in $\mathbb{C}$, and the standard involution in $\mathbb{H}$ $\left((a+ib+jc+dk)^*=a-ib-jc-dk\right).$ We even do not need to define the involution in $\mathbb{R}$, $\mathbb{C}$, and $\mathbb{H}$ because the involution must be positive when we want to correspond involution to adjoint and there is a unique positive involution up to isomorphism in real central division algebras. My original question is how to prove that $\varphi$ preserves involution. Is this even true?

problem with armature after mirroring part of object

first of all, I'm totally new to blender, but couldn't find my answer after searching a lot. here is my problem in blender 4.2: in object edit mode, I've duplicated left shoulder top armor, mirrored, moved over right shoulder.

copied image

now the problem is; in pose mode if i rotate or modify left shoulder bone, that right mirrored armor part is moving too as in image:

bone rotate

I've tried to separate all object parts, then clear all parents from it, re-assign right shoulder bone as parent. but still it move with left shoulder bone as well as right shoulder bone.

any help appreciated.

blender file:

ps: is there anyway to select a bone and see which objects assigned to that bone? I know about weights and vertex groups, but in this object, non assigned to mirrored object.

What the garlic is that pt.2? (Plant identification help needed)

  • Derptastic
  • Social
  • Replies: 0
I have sown some garlic cloves in a pot (I only have a balcony, don't judge). And... something came out of the pot, but it's not garlic, and I'm very curious what it might be: Mystery plant Mystery plant, image two

I even mistook it for garlic initially, but it's completely inedible, and in fact, can barely be chewed through in any manner - the leaves are pretty tough. As far as I could tell by rummaging in the ground, there are no cloves to this beastie, and the roots seem to go quite far down. Google Lens identifies that as Chives, but I can guarantee you it's not (I actually do have chives, in a pot beside this one). In this case, you can see some actual garlic that caught on, chilling in the background, wondering what kind of neighbor is that. It definitely feels like a weed, but I still wanted to find out what it could be before it goes out.

Any educated guesses?

What would happen if you use warm base on a compressor ice cream machine?

  • Lenny Markus
  • Social
  • Replies: 0
Note: This question is for an ice cream machine WITH a compressor

Pretty much all recipes for ice cream/gelato call for completely chilling the mixture before starting to churn.

I get that for "passively" cooled machines (compressorless) it's important, so that you don't loose any of the pre-cooling you've done to the hardware.

Does it actually matter for a compressor-based machine? The machine can certainly cool it down without a hitch, but would it impact the final texture?

Attempting to simplify Fiege-Fiat-Shamir Identification

  • deeplyconfused
  • Technology
  • Replies: 0
My understanding of the Fiege-Fiat-Shamir protocol, sourced from "RSA and Public-Key Cryptography" by Richard A. Mollin is as below:

  1. A third party chooses two large primes $p$ and $q$, sharing $n = pq$.
  2. Alice has a secret value $s_a$ and shares a number $t_a = s_a^2 \mod n$.
  3. Alice picks a random $m \in \mathbb{N}$ and sends $w = m^2 \mod n$ to Bob.
  4. Bob picks a challenge $c \in \{0, 1\}$ and sends that to Alice.
  5. Alice computes $r = ms_a^c \mod m$ and sends that to Bob.
  6. Bob computes $r^2 = m^2s_a^{2c}$, and he can compare that to the publicly known $wt_a^2$, which should be identical if Alice does indeed know $s_a$. The security of this protocol is based on the fact that it is difficult to solve quadratic modular congruences with unfactored moduli.

My text elaborates that there is a method that an attacker can use to impersonate Alice with a 50% success rate, so this is done $a$ times and the probability that this works becomes $2^{-a}$.


If my understanding of this is correct, then one could use a similar protocol, but without the 50% chance of failure:

  1. As before, a third party selects $p$ and $q$, sharing $n = pq$.
  2. Alice picks a random $m$ and sends $w = m^2 \mod n$ to Bob.
  3. Alice sends $r = ms_a \mod n$ to Bob.
  4. Bob computes $r^2 \mod n$ and confirms that it's equal to $mt_a$.

Again, because neither $w$ nor $t_a$ are easy to compute, this seems secure.

I assume that this doesn't work. Why not? Why does Fiege-Fiat-Shamir require that Bob send a challenge?

Zencash uses your passphrase to identify AND unlock a wallet - how is this secure?

When looking into Zencash I stumbled into myzenwallet.io (by the Zencash creators), which gives you the option to enter a passphrase to generate a wallet (seems normal), but then after creating your wallet you can come back later and open your wallet by simply re-entering your passphrase again... this was unexpected and had me not only wondering about how it worked, but also wondering whether whatever means were used to achieve this would remain secure in the future.

Given that I don't need to identify the resource I'm unlocking, but rather just hand over the passphrase, I'm left to assume that their system generates a token by hashing my passphrase a number of times to generate my "master address" or "account ID" (I just made those terms up, because Zencash gives you many addresses, so I also assume you have some sort of master address / account ID), and then also using that same passphrase to lock / authenticate (not to encrypt though, right?) the wallet.

What common proverb does this string refer to?

What common proverb is referenced by this three-character string?

ᚷᛖᚨ
Top