Block #1,348,023

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2015, 10:26:15 PM · Difficulty 10.8256 · 5,478,938 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e118dce1e1fdfc4705598219ea380ce40b2f5d2756912baa20f9a6f39aadabcf

Height

#1,348,023

Difficulty

10.825593

Transactions

2

Size

722 B

Version

2

Bits

0ad35a0f

Nonce

482,607,869

Timestamp

11/29/2015, 10:26:15 PM

Confirmations

5,478,938

Merkle Root

29c6f4746c7dc1f528f24a89544cfc16c6cf7b409d7f1bb0e4ba4d90adfdffbd
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.

3.401 × 10⁹⁶(97-digit number)
34010157430748028925…49702020610922874881
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
3.401 × 10⁹⁶(97-digit number)
34010157430748028925…49702020610922874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.802 × 10⁹⁶(97-digit number)
68020314861496057850…99404041221845749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.360 × 10⁹⁷(98-digit number)
13604062972299211570…98808082443691499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.720 × 10⁹⁷(98-digit number)
27208125944598423140…97616164887382999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.441 × 10⁹⁷(98-digit number)
54416251889196846280…95232329774765998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.088 × 10⁹⁸(99-digit number)
10883250377839369256…90464659549531996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.176 × 10⁹⁸(99-digit number)
21766500755678738512…80929319099063992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.353 × 10⁹⁸(99-digit number)
43533001511357477024…61858638198127984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.706 × 10⁹⁸(99-digit number)
87066003022714954048…23717276396255969281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.741 × 10⁹⁹(100-digit number)
17413200604542990809…47434552792511938561
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,859,864 XPM·at block #6,826,960 · 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