Block #1,611,047

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2016, 2:08:46 PM · Difficulty 10.6053 · 5,220,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4172082f7380d3edc8c045b090db7e7328743f70986d5ff5e30b34306cb7c17c

Height

#1,611,047

Difficulty

10.605302

Transactions

2

Size

1.28 KB

Version

2

Bits

0a9af50c

Nonce

136,797,421

Timestamp

6/2/2016, 2:08:46 PM

Confirmations

5,220,190

Merkle Root

95529c7d8a400bcbadc0ab3ef941332e3a200074f8fdfc53d00f621752bd406e
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.

1.348 × 10⁹⁵(96-digit number)
13487830338475664616…20964525249927231039
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
1.348 × 10⁹⁵(96-digit number)
13487830338475664616…20964525249927231039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.697 × 10⁹⁵(96-digit number)
26975660676951329233…41929050499854462079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.395 × 10⁹⁵(96-digit number)
53951321353902658466…83858100999708924159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.079 × 10⁹⁶(97-digit number)
10790264270780531693…67716201999417848319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.158 × 10⁹⁶(97-digit number)
21580528541561063386…35432403998835696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.316 × 10⁹⁶(97-digit number)
43161057083122126773…70864807997671393279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.632 × 10⁹⁶(97-digit number)
86322114166244253546…41729615995342786559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.726 × 10⁹⁷(98-digit number)
17264422833248850709…83459231990685573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.452 × 10⁹⁷(98-digit number)
34528845666497701418…66918463981371146239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.905 × 10⁹⁷(98-digit number)
69057691332995402836…33836927962742292479
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,894,045 XPM·at block #6,831,236 · 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