Block #1,906,161

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2016, 6:15:15 PM · Difficulty 10.7714 · 4,930,685 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f450f84bf934a609febde7704de818e4b25909af3e023906425a57067293c434

Height

#1,906,161

Difficulty

10.771424

Transactions

2

Size

1.71 KB

Version

2

Bits

0ac57c13

Nonce

1,483,944,028

Timestamp

12/22/2016, 6:15:15 PM

Confirmations

4,930,685

Merkle Root

49f629186b395b5f671a0a8d6e74e2cb86bd4c4009e3f24e136ae623d49fd45d
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.

5.046 × 10⁹⁶(97-digit number)
50465843171543297565…14898336858883071999
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.046 × 10⁹⁶(97-digit number)
50465843171543297565…14898336858883071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.009 × 10⁹⁷(98-digit number)
10093168634308659513…29796673717766143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.018 × 10⁹⁷(98-digit number)
20186337268617319026…59593347435532287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.037 × 10⁹⁷(98-digit number)
40372674537234638052…19186694871064575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.074 × 10⁹⁷(98-digit number)
80745349074469276104…38373389742129151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.614 × 10⁹⁸(99-digit number)
16149069814893855220…76746779484258303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.229 × 10⁹⁸(99-digit number)
32298139629787710441…53493558968516607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.459 × 10⁹⁸(99-digit number)
64596279259575420883…06987117937033215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.291 × 10⁹⁹(100-digit number)
12919255851915084176…13974235874066431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.583 × 10⁹⁹(100-digit number)
25838511703830168353…27948471748132863999
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,939,057 XPM·at block #6,836,845 · 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