Block #2,193,551

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2017, 1:56:10 AM · Difficulty 10.9527 · 4,651,765 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
898d6e982133256556279d4fdbd73288451827714372db4633f3035d89bca400

Height

#2,193,551

Difficulty

10.952706

Transactions

2

Size

1.14 KB

Version

2

Bits

0af3e485

Nonce

356,199,480

Timestamp

7/5/2017, 1:56:10 AM

Confirmations

4,651,765

Merkle Root

c7d1fd3f88828cecab59b191e4d2657b1bb3d9cecd5bfbad8b9e6a79c933e814
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.

3.990 × 10⁹⁶(97-digit number)
39907997529015775056…20304675654996705279
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
3.990 × 10⁹⁶(97-digit number)
39907997529015775056…20304675654996705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.981 × 10⁹⁶(97-digit number)
79815995058031550113…40609351309993410559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.596 × 10⁹⁷(98-digit number)
15963199011606310022…81218702619986821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.192 × 10⁹⁷(98-digit number)
31926398023212620045…62437405239973642239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.385 × 10⁹⁷(98-digit number)
63852796046425240090…24874810479947284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.277 × 10⁹⁸(99-digit number)
12770559209285048018…49749620959894568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.554 × 10⁹⁸(99-digit number)
25541118418570096036…99499241919789137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.108 × 10⁹⁸(99-digit number)
51082236837140192072…98998483839578275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.021 × 10⁹⁹(100-digit number)
10216447367428038414…97996967679156551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.043 × 10⁹⁹(100-digit number)
20432894734856076828…95993935358313103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.086 × 10⁹⁹(100-digit number)
40865789469712153657…91987870716626206719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,006,969 XPM·at block #6,845,315 · 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