Block #2,120,279

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/17/2017, 6:47:05 AM · Difficulty 10.9119 · 4,721,050 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fba3beb66b10d79dc146bead872297bd3ebf4358f311c440799507b5426a852f

Height

#2,120,279

Difficulty

10.911866

Transactions

3

Size

653 B

Version

2

Bits

0ae9700f

Nonce

423,737,094

Timestamp

5/17/2017, 6:47:05 AM

Confirmations

4,721,050

Merkle Root

18900fbe6d77726814eac3b8211d67b99a5b8bea9ce7f5963300ce4f6976a84c
Transactions (3)
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.411 × 10⁹³(94-digit number)
14115908046343747963…12933826221817407039
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.411 × 10⁹³(94-digit number)
14115908046343747963…12933826221817407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.823 × 10⁹³(94-digit number)
28231816092687495926…25867652443634814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.646 × 10⁹³(94-digit number)
56463632185374991852…51735304887269628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.129 × 10⁹⁴(95-digit number)
11292726437074998370…03470609774539256319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.258 × 10⁹⁴(95-digit number)
22585452874149996740…06941219549078512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.517 × 10⁹⁴(95-digit number)
45170905748299993481…13882439098157025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.034 × 10⁹⁴(95-digit number)
90341811496599986963…27764878196314050559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.806 × 10⁹⁵(96-digit number)
18068362299319997392…55529756392628101119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.613 × 10⁹⁵(96-digit number)
36136724598639994785…11059512785256202239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.227 × 10⁹⁵(96-digit number)
72273449197279989570…22119025570512404479
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,974,995 XPM·at block #6,841,328 · 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