Block #1,301,848

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/28/2015, 1:35:23 AM · Difficulty 10.8599 · 5,537,362 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
144914c7815fa7e0b0b49557a50ff2a5c7b7109b6cc1db88bbfa438d370974b8

Height

#1,301,848

Difficulty

10.859940

Transactions

3

Size

2.52 KB

Version

2

Bits

0adc2502

Nonce

1,720,749,905

Timestamp

10/28/2015, 1:35:23 AM

Confirmations

5,537,362

Merkle Root

60056fca11ac3ce437973d21b69ced2814be462929278af46cf4daab705175f6
Transactions (3)
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.

5.537 × 10⁹³(94-digit number)
55379659616823466571…84270283976705787839
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
5.537 × 10⁹³(94-digit number)
55379659616823466571…84270283976705787839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.107 × 10⁹⁴(95-digit number)
11075931923364693314…68540567953411575679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.215 × 10⁹⁴(95-digit number)
22151863846729386628…37081135906823151359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.430 × 10⁹⁴(95-digit number)
44303727693458773257…74162271813646302719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.860 × 10⁹⁴(95-digit number)
88607455386917546514…48324543627292605439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.772 × 10⁹⁵(96-digit number)
17721491077383509302…96649087254585210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.544 × 10⁹⁵(96-digit number)
35442982154767018605…93298174509170421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.088 × 10⁹⁵(96-digit number)
70885964309534037211…86596349018340843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.417 × 10⁹⁶(97-digit number)
14177192861906807442…73192698036681687039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.835 × 10⁹⁶(97-digit number)
28354385723813614884…46385396073363374079
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,957,961 XPM·at block #6,839,209 · 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