Block #1,362,633

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2015, 5:05:42 PM · Difficulty 10.8436 · 5,463,942 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9f6517acf10ef3d8fe992ec672d636c73b0ff049b6181ac6dd71e51c497f1f3a

Height

#1,362,633

Difficulty

10.843643

Transactions

2

Size

903 B

Version

2

Bits

0ad7f8fb

Nonce

435,534,035

Timestamp

12/9/2015, 5:05:42 PM

Confirmations

5,463,942

Merkle Root

a4c1e4e6d5b860543c6a9ecaf97e25336ba748ee88acf1c85478930a89f6620b
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.455 × 10⁹⁷(98-digit number)
14551373092356654215…89478024524444610561
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.455 × 10⁹⁷(98-digit number)
14551373092356654215…89478024524444610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.910 × 10⁹⁷(98-digit number)
29102746184713308431…78956049048889221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.820 × 10⁹⁷(98-digit number)
58205492369426616862…57912098097778442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.164 × 10⁹⁸(99-digit number)
11641098473885323372…15824196195556884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.328 × 10⁹⁸(99-digit number)
23282196947770646744…31648392391113768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.656 × 10⁹⁸(99-digit number)
46564393895541293489…63296784782227537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.312 × 10⁹⁸(99-digit number)
93128787791082586979…26593569564455075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.862 × 10⁹⁹(100-digit number)
18625757558216517395…53187139128910151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.725 × 10⁹⁹(100-digit number)
37251515116433034791…06374278257820303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.450 × 10⁹⁹(100-digit number)
74503030232866069583…12748556515640606721
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,856,749 XPM·at block #6,826,574 · 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