Block #291,418

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2013, 4:27:44 AM · Difficulty 9.9898 · 6,525,209 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b9be6057dde020f7a2d7f3dcf7bd90a9622afee5121b9a8d41a7655242b2b68

Height

#291,418

Difficulty

9.989835

Transactions

1

Size

1004 B

Version

2

Bits

09fd65cc

Nonce

10,854

Timestamp

12/3/2013, 4:27:44 AM

Confirmations

6,525,209

Merkle Root

680c34769a6c27ef57ca73869b24a03b1ee0a25f96a0322b1ee1653640b394ce
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.179 × 10⁹⁶(97-digit number)
11799607494143965825…14529300321960448001
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.179 × 10⁹⁶(97-digit number)
11799607494143965825…14529300321960448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.359 × 10⁹⁶(97-digit number)
23599214988287931651…29058600643920896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.719 × 10⁹⁶(97-digit number)
47198429976575863303…58117201287841792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.439 × 10⁹⁶(97-digit number)
94396859953151726607…16234402575683584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.887 × 10⁹⁷(98-digit number)
18879371990630345321…32468805151367168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.775 × 10⁹⁷(98-digit number)
37758743981260690643…64937610302734336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.551 × 10⁹⁷(98-digit number)
75517487962521381286…29875220605468672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.510 × 10⁹⁸(99-digit number)
15103497592504276257…59750441210937344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.020 × 10⁹⁸(99-digit number)
30206995185008552514…19500882421874688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.041 × 10⁹⁸(99-digit number)
60413990370017105029…39001764843749376001
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,777,137 XPM·at block #6,816,626 · 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