NoPaste.ml Reviews

Auth0 Reviews

NoPaste.ml mentions (7)

• [2017 day 15] "at most 15 seconds on ten-year-old hardware", really?

  And as long as we're complaining about compute-heavy problems, 2016 day 5 is the worst; it took 3 hours and 11 minutes to complete in m4 on my hardware (computing md5 in python involves calling into a library which in turn probably uses pre-compiled C code rather than native python for the core computations, but computing it natively in m4 is just painfully slow). Source: about 3 years ago

• [2018 day 14][m4] reduced memory solution

  So I coded up something that I did not see mentioned anywhere in the megathread. Instead of storing just the recipe number in each array location, with an array entry for every recipe, I stored a tuple of recipe number and next array position. For a0-a22, the next number is pre-computed. But for a23 onwards, the next array position is exactly one larger - that is, the rest of my array stores ONLY the recipes... Source: about 3 years ago

• [2018 day 2][m4] optimizing the search for similar words

  So my next round did what many of the megathread solutions did: for each pair of input lines, determine if they are similar. This cuts the complexity from exponential O(2^n) to quadratic O(n^2), and runtime was down to 1.3s (a 300x speedup over regex abuse). Note that due to the use of substr, I risk inadvertent macro expansion if slicing a lower-case line forms a macro name such as 'nl', so I had to further... Source: about 3 years ago

• [2015 day 10][m4] optimizing by matrix multiplication

  Wow, that really made a difference! I got another ~250x speedup (best-case run from ~18.5s to 71ms) with this tweak. Instead of performing a full matrix multiply (O(1) work per iteration regardless of active rows, and O(log n) iterations), I take advantage of the sparseness of the initial few iterations. That is, I start out with only one row active; (however, by iteration 50 all 92 rows are active), as well as... Source: about 3 years ago

• [2017 day 15][m4] solution using signed 32-bit math and no division

  Or course, only after I had written my entire solution did I notice in the megathread that avoiding division when computing math modulo M31 (0x7fffffff) is already a known optimization. But I thought it was pretty cool that I was able to derive that optimization from something more general, and that my solution works without any 64-bit math or explicit division operators. Source: about 3 years ago

Auth0 mentions (181)

• Angular + Auth0 + .NET

  Today I started using Auth0 - a free Identity Provider by okta. They have a nice free plan that is very much enough for my little project and can be upgraded afterwards, if this project will ever go live and commercial. See my progress here. - Source: dev.to / about 6 hours ago

• Exploring Authentication Providers in Next.js

  Auth0 is a popular authentication and authorization platform that provides secure access for applications, devices, and users. - Source: dev.to / 4 days ago

• Developing SMART On FHIR Applications with Auth0 and InterSystems IRIS FHIR Server - Introduction

  Although we could delegate the authentication and authorization of users to another IRIS server deployed for this purpose, on this occasion we are going to use the service offered by Auth0. - Source: dev.to / 23 days ago

• How do I embed the Auth0 login page into my own web page?

  I am using Auth0's Universal Login, which looks like below:. - Source: dev.to / 25 days ago

• Building my own ChatGPT

  Auth0: User authentication made for developers. - Source: dev.to / 27 days ago