Block #1,111,212

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2015, 9:26:52 PM · Difficulty 10.8818 · 5,714,497 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
81bbe749030cc3cce25ea7b2ad357cbdddaba5ae91d284a296f1d4d0ef219eb0

Height

#1,111,212

Difficulty

10.881789

Transactions

2

Size

9.96 KB

Version

2

Bits

0ae1bce8

Nonce

34,525,823

Timestamp

6/16/2015, 9:26:52 PM

Confirmations

5,714,497

Merkle Root

bd8c11210ff1dd8fc33ca9126b6cc4c00ae832e76c9538b372780ba04f21ff36
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.

9.132 × 10⁹⁵(96-digit number)
91327448067707051832…19818737039427205119
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
9.132 × 10⁹⁵(96-digit number)
91327448067707051832…19818737039427205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.826 × 10⁹⁶(97-digit number)
18265489613541410366…39637474078854410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.653 × 10⁹⁶(97-digit number)
36530979227082820733…79274948157708820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.306 × 10⁹⁶(97-digit number)
73061958454165641466…58549896315417640959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.461 × 10⁹⁷(98-digit number)
14612391690833128293…17099792630835281919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.922 × 10⁹⁷(98-digit number)
29224783381666256586…34199585261670563839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.844 × 10⁹⁷(98-digit number)
58449566763332513172…68399170523341127679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.168 × 10⁹⁸(99-digit number)
11689913352666502634…36798341046682255359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.337 × 10⁹⁸(99-digit number)
23379826705333005269…73596682093364510719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.675 × 10⁹⁸(99-digit number)
46759653410666010538…47193364186729021439
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,849,776 XPM·at block #6,825,708 · 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