Block #2,133,626

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2017, 3:57:16 PM · Difficulty 10.9094 · 4,705,934 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c694fac145580c2e9fb6149629e087a479512cc28836fedc0795f9505955676

Height

#2,133,626

Difficulty

10.909358

Transactions

2

Size

574 B

Version

2

Bits

0ae8cbb5

Nonce

895,291,270

Timestamp

5/26/2017, 3:57:16 PM

Confirmations

4,705,934

Merkle Root

781f0536e15477e8e6ef278982357afe76dd3b5b303f9a444f9e81ae10947f27
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.

1.010 × 10⁹⁵(96-digit number)
10100226544510684742…26365643626303758241
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
1.010 × 10⁹⁵(96-digit number)
10100226544510684742…26365643626303758241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.020 × 10⁹⁵(96-digit number)
20200453089021369485…52731287252607516481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.040 × 10⁹⁵(96-digit number)
40400906178042738971…05462574505215032961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.080 × 10⁹⁵(96-digit number)
80801812356085477943…10925149010430065921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.616 × 10⁹⁶(97-digit number)
16160362471217095588…21850298020860131841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.232 × 10⁹⁶(97-digit number)
32320724942434191177…43700596041720263681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.464 × 10⁹⁶(97-digit number)
64641449884868382354…87401192083440527361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.292 × 10⁹⁷(98-digit number)
12928289976973676470…74802384166881054721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.585 × 10⁹⁷(98-digit number)
25856579953947352941…49604768333762109441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.171 × 10⁹⁷(98-digit number)
51713159907894705883…99209536667524218881
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,960,764 XPM·at block #6,839,559 · 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.
Privacy Policy·

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