Block #2,290,648

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/10/2017, 12:28:41 PM · Difficulty 10.9553 · 4,545,902 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4243f125d50d9bfd6358f6ae3f19fcddcd8cf86c4c5a078e658139083ad803d7

Height

#2,290,648

Difficulty

10.955296

Transactions

3

Size

1.00 KB

Version

2

Bits

0af48e43

Nonce

1,602,133,280

Timestamp

9/10/2017, 12:28:41 PM

Confirmations

4,545,902

Merkle Root

52d3b1bc9fc0cebebc9f40dee4df2dd69f300e56459120beb6bb46e4d44cd311
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.

8.117 × 10⁹⁴(95-digit number)
81175335929616547423…51306643408405635119
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
8.117 × 10⁹⁴(95-digit number)
81175335929616547423…51306643408405635119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.623 × 10⁹⁵(96-digit number)
16235067185923309484…02613286816811270239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.247 × 10⁹⁵(96-digit number)
32470134371846618969…05226573633622540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.494 × 10⁹⁵(96-digit number)
64940268743693237938…10453147267245080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.298 × 10⁹⁶(97-digit number)
12988053748738647587…20906294534490161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.597 × 10⁹⁶(97-digit number)
25976107497477295175…41812589068980323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.195 × 10⁹⁶(97-digit number)
51952214994954590350…83625178137960647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.039 × 10⁹⁷(98-digit number)
10390442998990918070…67250356275921295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.078 × 10⁹⁷(98-digit number)
20780885997981836140…34500712551842590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.156 × 10⁹⁷(98-digit number)
41561771995963672280…69001425103685181439
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,936,664 XPM·at block #6,836,549 · 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