Block #1,109,942

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2015, 11:38:22 AM · Difficulty 10.8646 · 5,706,604 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
53e3920d6ca7e2356ce75bcc1475cfbf344f04beff8b2cdcfe88fdbbbfa5448e

Height

#1,109,942

Difficulty

10.864603

Transactions

4

Size

1.29 KB

Version

2

Bits

0add56a7

Nonce

1,032,300,871

Timestamp

6/16/2015, 11:38:22 AM

Confirmations

5,706,604

Merkle Root

144901cf5d6b3982cf120aaac8b59a4454edbbaeacb01a5c26050b676cf2cfa9
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.

2.446 × 10⁹⁵(96-digit number)
24463763225842685559…38041500680621701119
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
2.446 × 10⁹⁵(96-digit number)
24463763225842685559…38041500680621701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.892 × 10⁹⁵(96-digit number)
48927526451685371119…76083001361243402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.785 × 10⁹⁵(96-digit number)
97855052903370742239…52166002722486804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.957 × 10⁹⁶(97-digit number)
19571010580674148447…04332005444973608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.914 × 10⁹⁶(97-digit number)
39142021161348296895…08664010889947217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.828 × 10⁹⁶(97-digit number)
78284042322696593791…17328021779894435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.565 × 10⁹⁷(98-digit number)
15656808464539318758…34656043559788871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.131 × 10⁹⁷(98-digit number)
31313616929078637516…69312087119577743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.262 × 10⁹⁷(98-digit number)
62627233858157275033…38624174239155486719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.252 × 10⁹⁸(99-digit number)
12525446771631455006…77248348478310973439
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,776,497 XPM·at block #6,816,545 · 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