## OpenID Authentication Method Reference Name for a code sent via email

Introduction:

I am currently implementing acr_values, acr & amr principles on a Open ID Provider server.

The claim amr (described in the OpenID RFC 1.0) has no standard clearly defined in this same RFC, but I would like to base the system on the RFC 8176 mentioned by IANA.

One of the server authentication method is about sending a confirmation code via email.

The server uses a cryptographically secure pseudo-random number generator and store a hash of it using argon2. It is sent to an email, then hash are compared on another request. There is a short expiration time for each code. This method is indeed not considered by the server as a secure method to prove an identity, but is still selectable when no access to any resource is required.

The question is:

What Authentication Method Reference Name would you use in this case ?

Most descriptions are quite strict so I only see mca as a possibility today. It is not an otp to me since it is not implementing https://tools.ietf.org/html/rfc4226.

Thanks for sharing.

## [ Law Enforcement & Police ] Open Question : In real life, could a burglar use the Home Alone method to rob houses?

In the original movie, Joe Pesci played a burglar who disguised himself as a police officer, and had the following conversation with Macaulay Culkin’s on screen father: Joe Pesci: “I’d like a word with you sir.” Mr. McCallister: “Am I under arrest or something?” Joe Pesci: “Oh no not at all sir, it’s Christmas time, there are always a lot of burglars around the holidays, and we’re just making sure everyones taking the proper precautions, that’s all.” Mr. McCallister: “Oh yes, well we have automatic timers for our lights, dead bolts for our doors, we can’t be too careful if we’re spending the holidays in Paris.” Joe Pesci: “Ah, you’re taking a trip to Paris?” Mr. McCallister: “Yes, we plan to leave tomarrow morning.” Joe Pesci: “Well don’t worry about your home, it’s in good hands.” *Flashes his shady gold tooth smile* Then he knew exactly when the house would be vacant, he knew exactly what they’d be up against when they enter the house, and he knew that none of the neighbors would spot him, because he already had the same conversation with those neighbors who told him of their own holiday travel plans. As long as the burglars don’t run into a crafty kid with a tarantula, could burglars use this method in real life? Dress up as a police officer and get all the information right from the horses mouth?

## Is there a spell, magical item, or any other method to accurately calculate how long ago an object/construct was created?

I’m interested in D&D 5e but I will also accept answers from previous D&D versions as well as similar systems (e.g., Pathfinder 1e/2e).

Janathiel II, famous historian, cartographer, and the Grand Wizard of Whitescar is studying the ancient structures of Ær-Toril known as Rhas.

These are gigantic and ancient structures/areas that cannot possibly have been created by nature. For example, Rhas Nolh is an almost perfect mountain pass that spans more than 100 kilometres, Rhas Aldhaen is an ancient forest that does not age (i.e., each tree is forever the same), etc.

Janathiel II has a theory: All of the Rhas constructs were created approximately during the same time period/era possibly by a technologically/magically advanced civilization.

To test this theory, however, he needs an accurate way of measuring how old an object is. Even worse, this method should be accurate even when counting thousands of years (if not hundreds of thousands).

If Janathiel II was living on Earth during the 21st century he could have used radiocarbon dating, but unfortunately for him, he lives in Ær-Toril.

Is there a spell, magical item, or any other method Janathiel II can use to accurately calculate how long ago an object/construct was created?

## What’s the best method to group/ungroup rows in a data table?

I’ve been struggling with a good solution to group/ungroup rows in a data table. We’ve initially implemented drag-n-drop but that was a nightmare to implement due to 3rd-party library restrictions, & a nightmare to use for end users.

I’ve come up with a different method that’s hopefully more straightforward to use, but I’m still not 100% happy with it. Check out the demo below and let me know how I could improve it.

Some items on my list:

• Make it more obvious what clicking on the checkbox will do. Maybe an edit mode or a tooltip?
• Somehow streamline the ways the “Group Items” buttons are displayed.

One other idea is to mimic how one would group/ungroup elements with a combination of Shift+Select elements > Right Click > Group/Ungroup and keyboard commands. However, with this being a browser app that’d also support touch-devices AND is geared toward an older demographic, I’m not sure if that’s a good idea.

YOUTUBE DEMO: Grouping & Ungrouping Rows in Data Table Demo

## Method to bypass \n in WAF (\n vulnerability)

I’m sorry if this is a noob question but I’ve looked everywhere and not find any good answer. So I have this application that has an input box where the data is going to be sent in a JSON format. The JSON payload might look like this

{“message”: “hello\nmy name is andi”}

But the problem is the \n is blocked by my WAF and so apparently the data is not being passed into the backend. I’ve tried encoding it into %0A and even tried double encoding it but still no luck. The security department says they did this on purpose. But as far as I know, this might only be vulnerable to CRLF injection which uses both \r and \n. So I guess it’s fine to just enable \n and disable \r without causing any potential security risks?

## Getting error>: ‘invalid use of non-static member function’ when passing a child class method to a father (public-inherited) method

Hope everybody is doing just fine.

I’m writing this piece of code where i have a class called XZStage (child) that inherits every public method from the library/class SerialCommand (father) and on a method of the XZStage i’m passing to a father method, a child method as argument.

The error i’m getting is: ‘invalid use of non-static member function’

A little piece of advice to do a refined search would be great.

## Is there an official treasure generation method to limit magic item rolls based on dungeon level or some other factor?

I’m running an AD&D campaign for a party of usually-three PCs, who were first level until our most recent session. (As for what they are now, we’ll get to that…) I have the 1e DMG (door cover) and Unearthed Arcana, and a Monster Manual that might be older than that, judging by its condition. The players are using the 2e PHB; these are all inherited books, and the previous owner only ever DM’d in 1e and PC’d in 2e.

My issue is with treasure generation– I’ve been using the standard dungeon generation tables from the DMG, and it works well except for the outcome of treasure rolls. Specifically, magic items don’t seem to be segregated by dungeon level. That first-level party happened upon a Mirror of Mental Prowess, which had some fairly powerful effects but nothing game-breaking, and was worth five thousand experience. Divided among the party, this alone was enough to bring the priest and rogue to second level. Combined with the remainder of the treasure, those two reached level three, and the ranger reached level two.

Now building a dungeon for a later adventure, another magic item roll came up, resulting in… a Ring of Three Wishes. I simply vetoed that and re-rolled, getting something more reasonable this time, but now the question is in my mind of whether this is actually correct.

So, the simple version of the question:
Is there a method in AD&D to limit magic item rolls for treasure based on dungeon level or some other factor, or does this need to be created manually by the DM?

Note that this is not the same question as “What can I do when I accidentally gave out an overpowered item?” This relates purely to the RAW methods for generating magical treasures.

## What’s a good method of showing user progression of a dynamic questionaire with a varying amount of questions?

What are the best practices around showing the length and stage in a questionnaire, where the length of said questionnaire changes and branches dynamically based on answers? I’m going to create a questionnaire where the user sees one question at a time. I want the user to get some sort of sense of how much longer they have and their place in the process but without misleading them. I don’t want them to think a single questionnaire could have 50 questions to answer. But to give a tangible number, they could have have to answer 7 questions or it could have 15 questions for them to go through depending on their answers.

## how to use transient method?

It was suggested to use a transient method to remove the duplicate queries Duplicate Queries

Why does this don’t work? Is it the wrong way to use it

 private function get_acf_list()   {       if(!class_exists('acf')){         return array();       }       global $wpdb; if ( false === ($  pgggo_qry = get_transient( 'pgggo_acf_query_results' ) ) ) {         // It wasn't there, so regenerate the data and save the transient         $pgggo_qry = "SELECT post_excerpt as 'field_name', post_title as 'field_label' FROM {$  wpdb->prefix}posts where post_type = 'acf-field'";         set_transient( 'pgggo_acf_query_results', $pgggo_qry, 12 * 7200 ); }$  pgggo_list_results = $wpdb->get_results($  pgggo_qry, ARRAY_A);       $acf_field_array = array(); if (!empty($  pgggo_list_results)) {           foreach ($pgggo_list_results as$  value) {               $acf_field_array[$  value['field_name']] = $value['field_label']; } } return$  acf_field_array;   } 

## Time-complexity analysis using constants method

I am trying to analyze some algorithms using constants methods and I’m not sure if i’m doing it right so I’m posting here the algorithm and my attempt:

Algorithm1(A[0..n], n)                | Cost           Freq s = 0                                 | c1             1 for i = 1..n                          | c2             n     if A[i] > 0                       | c3             n - 1         for j = 1..i                  | c4             sum_{i = 1}^n t_i*i             if A[j] mod 2 == 0        | c5              x                 for k = 1..j          | c6              y                     s = s + i + j + k | c7              z         } return s 

x = $$sum_{i = 1}^n sum_{j = 1}^i t_i*p_j*i*(j – 1)$$ y = $$sum_{i = 1}^n sum_{j = 1}^i sum_{k = 1}^j t_i*p_j*i*(j – 1)*k$$ z = $$sum_{i = 1}^n sum_{j = 1}^i sum_{k = 1}^j t_i*p_j*i*(j – 1)*(k – 1)$$

With $$t_i$$ the boolean value of the condition if A[i] > 0, $$t_i\in\{0, 1\}$$ With $$p_j$$ the boolean value of the condition if A[i] mod 2 == 0, $$p_j\in\{0, 1\}$$