Block #1,612,759

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2016, 7:34:40 PM · Difficulty 10.6013 · 5,203,587 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
206601916f041f13880606075d22dd19b79684a53b47914469639615862ca2f3

Height

#1,612,759

Difficulty

10.601317

Transactions

2

Size

32.50 KB

Version

2

Bits

0a99efe2

Nonce

2,149,037

Timestamp

6/3/2016, 7:34:40 PM

Confirmations

5,203,587

Merkle Root

2d8cfc5b38e962a54c02d23255e3b0e3da680d736f555c76fa359da800288f4e
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.

1.210 × 10⁹⁷(98-digit number)
12102039978394282148…64891029308961597439
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.210 × 10⁹⁷(98-digit number)
12102039978394282148…64891029308961597439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.420 × 10⁹⁷(98-digit number)
24204079956788564297…29782058617923194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.840 × 10⁹⁷(98-digit number)
48408159913577128595…59564117235846389759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.681 × 10⁹⁷(98-digit number)
96816319827154257190…19128234471692779519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.936 × 10⁹⁸(99-digit number)
19363263965430851438…38256468943385559039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.872 × 10⁹⁸(99-digit number)
38726527930861702876…76512937886771118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.745 × 10⁹⁸(99-digit number)
77453055861723405752…53025875773542236159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.549 × 10⁹⁹(100-digit number)
15490611172344681150…06051751547084472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.098 × 10⁹⁹(100-digit number)
30981222344689362300…12103503094168944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.196 × 10⁹⁹(100-digit number)
61962444689378724601…24207006188337889279
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,774,892 XPM·at block #6,816,345 · 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