Login

r/theprimeagen

▲ 3 r/theprimeagen

Impact of Claude Mythos on Antropic's own products.

Anthropic got cold feet, and while trembling, decided that we the common people can't have access to the revolutionary Claude Mythos. It's so good that it is too scary and we common folk can't handle it; but it will be stupid for Anthropic to not let its employees use it to improve its own software, and since I think is safe to say that Anthropic has been sitting on Mythos for quite some time now, I want to ask the people who uses Anthropic's products daily: how are they faring? Are they any better? Since this model is supposed to be so godlike that can't be released, Anthropic should be leaving the competition in the dust with the quality it produces. Someone who uses Anthropic's software could enlighten me and tell me how things are going?

I checked Claude Code's GitHub and it now has more than 9.000 issues open( https://github.com/anthropics/claude-code/issues ), last time I checked it had 5.000. So I wonder, how are bugs bypassing Mythos' legendary watch? I also checked the security tab, and it seems that a security problem has arisen recently, and in the recently leaked source code people have found critical vulnerabilities( https://www.cve.org/CVERecord?id=CVE-2026-35022, https://www.cve.org/CVERecord?id=CVE-2026-35021, https://www.cve.org/CVERecord?id=CVE-2026-35020 ) and many many fumbles, so how did these security issues slip under Mythos' infalible nose? I thought cybersecurity was its forte... Mmm something seems fishy here…

u/Gil_berth — 1 hour ago
▲ 1 r/theprimeagen

Quadyster May Have 4 Jobs Available...

The IT Contractors Union sent out 2,000 emails to Employers matching NAICS Code 541, for LCAs matching SOC Code 15-0000, filed in 2025, where a Secondary Entity is defined.

These are most likely "consultancies".

The results of the campaign are still being tallied, however, one company did respond positively.

Please see the attached images for more info.

This is what The IT Contractors Union does.

u/ITContractorsUnion — 5 hours ago
▲ 1 r/theprimeagen+2 crossposts

slowerThanSlowSort

Ngl it's kinda gay.

Anyways here's the pseudocode for N partition version

procedure GaySort(A[], low, high):
    // Base case: surrender
    if high - low <= 0:
        return

    // Step 1: Partition into k sub-arrays (k = 2, 3, or 4)
    pivots[] := PartitionK(A[], low, high)
    // pivots[] contains the final sorted positions of k-1 pivot elements
    // This creates k sub-arrays between them

    // Step 2: Recursively sort each sub-partition
    // (wasteful first pass — we're about to throw it all away)
    prev := low
    for each pivot in pivots[]:
        GaySort(A[], prev, pivot - 1)
        prev := pivot + 1
    GaySort(A[], prev, high)             // sort final sub-partition

    // Step 3: Find the maximum across all sub-partitions
    // (each sub-partition's max is its last element, since we just sorted them)
    max_idx := FindMax(A[], low, high)

    // Step 4: Swap max to the end of the current range
    swap(A[max_idx], A[high])

    // Step 5: Re-sort everything except the placed max
    // (this makes the previous recursive calls completely pointless)
    GaySort(A[], low, high - 1)

and the the partition 2 variant:

procedure GaySort(A[], low, high):
    // Base case: surrender
    if high - low <= 0:
        return

    // Step 1: Partition into 2 sub-arrays using max as right pivot
    pivot := Partition2(A[], low, high)
    // pivot contains the final sorted position of the max element
    // This creates 2 sub-arrays: [low..pivot-1] and [pivot+1..high]
    // Note: right partition [pivot+1..high] is always empty since pivot = max

    // Step 2: Recursively sort each sub-partition
    // (wasteful first pass — we're about to throw it all away)
    GaySort(A[], low, pivot - 1)
    // GaySort(A[], pivot + 1, high) -- always empty, pivot is max

    // Step 3: Find the maximum across all sub-partitions
    // (each sub-partition's max is its last element, since we just sorted them)
    // Note: max is already at A[pivot] == A[high] since pivot = max
    max_idx := pivot

    // Step 4: Swap max to the end of the current range
    // Note: already there, this is a no-op
    swap(A[max_idx], A[high])

    // Step 5: Re-sort everything except the placed max
    // (this makes the previous recursive calls completely pointless)
    GaySort(A[], low, high - 1)
youtu.be
u/Rare-Paint3719 — 15 hours ago
Week