Block #1,354,481

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2015, 7:26:11 PM · Difficulty 10.8053 · 5,486,597 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cf86b7ce62a2afa17797fac1e64b5ce8cd5fe1d051cf1c2825ff8f16259146d9

Height

#1,354,481

Difficulty

10.805328

Transactions

2

Size

4.76 KB

Version

2

Bits

0ace29f9

Nonce

58,668,314

Timestamp

12/4/2015, 7:26:11 PM

Confirmations

5,486,597

Merkle Root

d9f65e062aa2fd3f4aa67e48779d57cf3971371a7afaa0bee34a13d008329140
Transactions (2)
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.342 × 10⁹⁶(97-digit number)
43423926602221918852…54850288369566229761
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.342 × 10⁹⁶(97-digit number)
43423926602221918852…54850288369566229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.684 × 10⁹⁶(97-digit number)
86847853204443837704…09700576739132459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.736 × 10⁹⁷(98-digit number)
17369570640888767540…19401153478264919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.473 × 10⁹⁷(98-digit number)
34739141281777535081…38802306956529838081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.947 × 10⁹⁷(98-digit number)
69478282563555070163…77604613913059676161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.389 × 10⁹⁸(99-digit number)
13895656512711014032…55209227826119352321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.779 × 10⁹⁸(99-digit number)
27791313025422028065…10418455652238704641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.558 × 10⁹⁸(99-digit number)
55582626050844056130…20836911304477409281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.111 × 10⁹⁹(100-digit number)
11116525210168811226…41673822608954818561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.223 × 10⁹⁹(100-digit number)
22233050420337622452…83347645217909637121
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,972,986 XPM·at block #6,841,077 · 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