Block #1,356,297

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2015, 7:42:32 PM · Difficulty 10.8189 · 5,451,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4387e27a6fb056e155db13ef4802fabf317d4de530c6ea4b70680118d85d4824

Height

#1,356,297

Difficulty

10.818877

Transactions

3

Size

1.65 KB

Version

2

Bits

0ad1a1e6

Nonce

1,194,481,142

Timestamp

12/5/2015, 7:42:32 PM

Confirmations

5,451,501

Merkle Root

3de942350ee3f1da782ebce3fdf6b05258d4b2a775a7cc15e29f5561793ea0c7
Transactions (3)
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.518 × 10⁹⁵(96-digit number)
15180415888373639956…89875468213819644481
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.518 × 10⁹⁵(96-digit number)
15180415888373639956…89875468213819644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.036 × 10⁹⁵(96-digit number)
30360831776747279912…79750936427639288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.072 × 10⁹⁵(96-digit number)
60721663553494559825…59501872855278577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.214 × 10⁹⁶(97-digit number)
12144332710698911965…19003745710557155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.428 × 10⁹⁶(97-digit number)
24288665421397823930…38007491421114311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.857 × 10⁹⁶(97-digit number)
48577330842795647860…76014982842228623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.715 × 10⁹⁶(97-digit number)
97154661685591295721…52029965684457246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.943 × 10⁹⁷(98-digit number)
19430932337118259144…04059931368914493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.886 × 10⁹⁷(98-digit number)
38861864674236518288…08119862737828986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.772 × 10⁹⁷(98-digit number)
77723729348473036577…16239725475657973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.554 × 10⁹⁸(99-digit number)
15544745869694607315…32479450951315947521
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,706,417 XPM·at block #6,807,797 · 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