Block #1,226,751

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2015, 2:26:21 AM · Difficulty 10.7351 · 5,588,300 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f471daf042b49a1444c4c4f4dd861d06fe281e739407e7362a5ac16930486930

Height

#1,226,751

Difficulty

10.735064

Transactions

7

Size

8.62 KB

Version

2

Bits

0abc2d2a

Nonce

2,147

Timestamp

9/8/2015, 2:26:21 AM

Confirmations

5,588,300

Merkle Root

cad9c443d432b4596402a64bf3ff3ada821bf702b1d7ab9f4c2a69b147703ef4
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.

6.845 × 10¹⁰⁴(105-digit number)
68451509727015781665…53462856098911354881
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
6.845 × 10¹⁰⁴(105-digit number)
68451509727015781665…53462856098911354881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.369 × 10¹⁰⁵(106-digit number)
13690301945403156333…06925712197822709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.738 × 10¹⁰⁵(106-digit number)
27380603890806312666…13851424395645419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.476 × 10¹⁰⁵(106-digit number)
54761207781612625332…27702848791290839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.095 × 10¹⁰⁶(107-digit number)
10952241556322525066…55405697582581678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.190 × 10¹⁰⁶(107-digit number)
21904483112645050133…10811395165163356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.380 × 10¹⁰⁶(107-digit number)
43808966225290100266…21622790330326712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.761 × 10¹⁰⁶(107-digit number)
87617932450580200532…43245580660653424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.752 × 10¹⁰⁷(108-digit number)
17523586490116040106…86491161321306849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.504 × 10¹⁰⁷(108-digit number)
35047172980232080212…72982322642613698561
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,764,499 XPM·at block #6,815,050 · 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