Block #1,378,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2015, 10:31:42 AM · Difficulty 10.8102 · 5,446,223 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1c1c4ac57327a68993b63b2cc71fc37a6311c111eb69dea44a8a9bb66d497cb

Height

#1,378,524

Difficulty

10.810199

Transactions

2

Size

6.05 KB

Version

2

Bits

0acf693a

Nonce

221,050,595

Timestamp

12/21/2015, 10:31:42 AM

Confirmations

5,446,223

Merkle Root

1aecddc331bf8d0c792ab93214922b2698f0d45f292e342d41a2a799b8f85382
Transactions (2)
1 in → 1 out8.8800 XPM109 B
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.

4.717 × 10⁹⁵(96-digit number)
47179957604828396376…31562404633902069761
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
4.717 × 10⁹⁵(96-digit number)
47179957604828396376…31562404633902069761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.435 × 10⁹⁵(96-digit number)
94359915209656792753…63124809267804139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.887 × 10⁹⁶(97-digit number)
18871983041931358550…26249618535608279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.774 × 10⁹⁶(97-digit number)
37743966083862717101…52499237071216558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.548 × 10⁹⁶(97-digit number)
75487932167725434202…04998474142433116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.509 × 10⁹⁷(98-digit number)
15097586433545086840…09996948284866232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.019 × 10⁹⁷(98-digit number)
30195172867090173681…19993896569732464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.039 × 10⁹⁷(98-digit number)
60390345734180347362…39987793139464929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.207 × 10⁹⁸(99-digit number)
12078069146836069472…79975586278929858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.415 × 10⁹⁸(99-digit number)
24156138293672138944…59951172557859717121
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,842,047 XPM·at block #6,824,746 · 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