Block #507,269

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 3:18:27 PM · Difficulty 10.8157 · 6,309,037 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47f85845a7dd7fac0a6d9bf6fbfd61f5701d19d4804b4e59ee09fa5fd0e9f7f2

Height

#507,269

Difficulty

10.815682

Transactions

7

Size

2.09 KB

Version

2

Bits

0ad0d08d

Nonce

19,229

Timestamp

4/23/2014, 3:18:27 PM

Confirmations

6,309,037

Merkle Root

1f6f9bca42bdef29971ba6d2e135222deddfaaa8582d05cee72c50e425c67cb2
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.

2.212 × 10⁹⁶(97-digit number)
22125152529519888196…66024676319362342401
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
2.212 × 10⁹⁶(97-digit number)
22125152529519888196…66024676319362342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.425 × 10⁹⁶(97-digit number)
44250305059039776393…32049352638724684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.850 × 10⁹⁶(97-digit number)
88500610118079552787…64098705277449369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.770 × 10⁹⁷(98-digit number)
17700122023615910557…28197410554898739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.540 × 10⁹⁷(98-digit number)
35400244047231821115…56394821109797478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.080 × 10⁹⁷(98-digit number)
70800488094463642230…12789642219594956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.416 × 10⁹⁸(99-digit number)
14160097618892728446…25579284439189913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.832 × 10⁹⁸(99-digit number)
28320195237785456892…51158568878379827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.664 × 10⁹⁸(99-digit number)
56640390475570913784…02317137756759654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.132 × 10⁹⁹(100-digit number)
11328078095114182756…04634275513519308801
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,774,568 XPM·at block #6,816,305 · 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