Block #2,306,395

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/23/2017, 8:02:53 PM · Difficulty 10.9125 · 4,527,559 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db548d794256e11904c7725a2efc521201145429ea98cdb1eb92a1caa87f75ba

Height

#2,306,395

Difficulty

10.912466

Transactions

2

Size

628 B

Version

2

Bits

0ae9975d

Nonce

272,450,405

Timestamp

9/23/2017, 8:02:53 PM

Confirmations

4,527,559

Merkle Root

9f53741e738ed1c0926164006e7c930c3414daf733da4c37cdc06fca1f72a7f0
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.090 × 10⁹²(93-digit number)
50903396237185536063…29677114147091379199
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.090 × 10⁹²(93-digit number)
50903396237185536063…29677114147091379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.018 × 10⁹³(94-digit number)
10180679247437107212…59354228294182758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.036 × 10⁹³(94-digit number)
20361358494874214425…18708456588365516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.072 × 10⁹³(94-digit number)
40722716989748428850…37416913176731033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.144 × 10⁹³(94-digit number)
81445433979496857700…74833826353462067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.628 × 10⁹⁴(95-digit number)
16289086795899371540…49667652706924134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.257 × 10⁹⁴(95-digit number)
32578173591798743080…99335305413848268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.515 × 10⁹⁴(95-digit number)
65156347183597486160…98670610827696537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.303 × 10⁹⁵(96-digit number)
13031269436719497232…97341221655393075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.606 × 10⁹⁵(96-digit number)
26062538873438994464…94682443310786150399
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,915,862 XPM·at block #6,833,953 · 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