Block #223,727

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/23/2013, 6:01:52 AM · Difficulty 9.9377 · 6,584,121 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
59ab8d0328b9e95d46cb204fce6fc3bf5cc93e2a15ff88908a945cd09d835fae

Height

#223,727

Difficulty

9.937653

Transactions

4

Size

1.98 KB

Version

2

Bits

09f00a04

Nonce

70,089

Timestamp

10/23/2013, 6:01:52 AM

Confirmations

6,584,121

Merkle Root

56b03eb35e172c790feac5a089392212c1d084cc7cd06ee9ddc67ce3c813bbbf
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.176 × 10⁹³(94-digit number)
11766934524809211624…60926148212925740801
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.176 × 10⁹³(94-digit number)
11766934524809211624…60926148212925740801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.353 × 10⁹³(94-digit number)
23533869049618423249…21852296425851481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.706 × 10⁹³(94-digit number)
47067738099236846498…43704592851702963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.413 × 10⁹³(94-digit number)
94135476198473692997…87409185703405926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.882 × 10⁹⁴(95-digit number)
18827095239694738599…74818371406811852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.765 × 10⁹⁴(95-digit number)
37654190479389477199…49636742813623705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.530 × 10⁹⁴(95-digit number)
75308380958778954398…99273485627247411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.506 × 10⁹⁵(96-digit number)
15061676191755790879…98546971254494822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.012 × 10⁹⁵(96-digit number)
30123352383511581759…97093942508989644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.024 × 10⁹⁵(96-digit number)
60246704767023163518…94187885017979289601
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,706,823 XPM·at block #6,807,847 · 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