1. #6,809,121TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #417,156

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/23/2014, 10:56:57 PM · Difficulty 10.3956 · 6,391,965 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
9b8a42d04b20466030e8c63df3e182589a7ac22356ce8b320d3b1dcea6ba4ece

Height

#417,156

Difficulty

10.395567

Transactions

2

Size

417 B

Version

2

Bits

0a6543e8

Nonce

402,733

Timestamp

2/23/2014, 10:56:57 PM

Confirmations

6,391,965

Merkle Root

8cb1d4d4b2f238546314dba0c362e4dd866ac48da9b6832c0d130d9f180f57b1
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

7.565 × 10⁹⁵(96-digit number)
75651215831656826949…51948821589582304001
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
7.565 × 10⁹⁵(96-digit number)
75651215831656826949…51948821589582304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.513 × 10⁹⁶(97-digit number)
15130243166331365389…03897643179164608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.026 × 10⁹⁶(97-digit number)
30260486332662730779…07795286358329216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.052 × 10⁹⁶(97-digit number)
60520972665325461559…15590572716658432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.210 × 10⁹⁷(98-digit number)
12104194533065092311…31181145433316864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.420 × 10⁹⁷(98-digit number)
24208389066130184623…62362290866633728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.841 × 10⁹⁷(98-digit number)
48416778132260369247…24724581733267456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.683 × 10⁹⁷(98-digit number)
96833556264520738495…49449163466534912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.936 × 10⁹⁸(99-digit number)
19366711252904147699…98898326933069824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.873 × 10⁹⁸(99-digit number)
38733422505808295398…97796653866139648001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,717,026 XPM·at block #6,809,120 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy