Block #2,262,318

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/22/2017, 12:22:49 AM · Difficulty 10.9522 · 4,578,020 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c5dc9db496e46f5524d875054bb9b144c11e8ae7d08bcba185f294e2603ff75c

Height

#2,262,318

Difficulty

10.952151

Transactions

3

Size

652 B

Version

2

Bits

0af3c027

Nonce

1,083,814,715

Timestamp

8/22/2017, 12:22:49 AM

Confirmations

4,578,020

Merkle Root

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

3.853 × 10⁹⁵(96-digit number)
38535952508587510164…32957109531315978239
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.853 × 10⁹⁵(96-digit number)
38535952508587510164…32957109531315978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.707 × 10⁹⁵(96-digit number)
77071905017175020328…65914219062631956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.541 × 10⁹⁶(97-digit number)
15414381003435004065…31828438125263912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.082 × 10⁹⁶(97-digit number)
30828762006870008131…63656876250527825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.165 × 10⁹⁶(97-digit number)
61657524013740016263…27313752501055651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.233 × 10⁹⁷(98-digit number)
12331504802748003252…54627505002111303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.466 × 10⁹⁷(98-digit number)
24663009605496006505…09255010004222607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.932 × 10⁹⁷(98-digit number)
49326019210992013010…18510020008445214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.865 × 10⁹⁷(98-digit number)
98652038421984026020…37020040016890429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.973 × 10⁹⁸(99-digit number)
19730407684396805204…74040080033780858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.946 × 10⁹⁸(99-digit number)
39460815368793610408…48080160067561717759
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:57,967,026 XPM·at block #6,840,337 · 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