Block #1,329,919

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2015, 11:04:06 PM · Difficulty 10.8440 · 5,485,145 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ff4f09af696f04c422e6885391f61990b5739a9b6aa9108c1b368e43842d85f2

Height

#1,329,919

Difficulty

10.843961

Transactions

2

Size

1.01 KB

Version

2

Bits

0ad80dd2

Nonce

675,358,799

Timestamp

11/16/2015, 11:04:06 PM

Confirmations

5,485,145

Merkle Root

c4e70a7e1c89a93772ce3961744bb57f9b8bf0fd071288810edc1afa4519bb24
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.137 × 10⁹³(94-digit number)
51376455494090872776…89973005837563009919
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.137 × 10⁹³(94-digit number)
51376455494090872776…89973005837563009919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.027 × 10⁹⁴(95-digit number)
10275291098818174555…79946011675126019839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.055 × 10⁹⁴(95-digit number)
20550582197636349110…59892023350252039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.110 × 10⁹⁴(95-digit number)
41101164395272698221…19784046700504079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.220 × 10⁹⁴(95-digit number)
82202328790545396442…39568093401008158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.644 × 10⁹⁵(96-digit number)
16440465758109079288…79136186802016317439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.288 × 10⁹⁵(96-digit number)
32880931516218158576…58272373604032634879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.576 × 10⁹⁵(96-digit number)
65761863032436317153…16544747208065269759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.315 × 10⁹⁶(97-digit number)
13152372606487263430…33089494416130539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.630 × 10⁹⁶(97-digit number)
26304745212974526861…66178988832261079039
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,764,604 XPM·at block #6,815,063 · 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