Block #2,480,205

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2018, 10:33:08 AM · Difficulty 10.9663 · 4,361,296 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
90207235062599b98eee61ef9c7eee3bb7d312d45406b25eb9c92b8cf852546f

Height

#2,480,205

Difficulty

10.966329

Transactions

35

Size

7.90 KB

Version

2

Bits

0af76152

Nonce

209,537,195

Timestamp

1/19/2018, 10:33:08 AM

Confirmations

4,361,296

Merkle Root

5708ae670eeb411c208e79525587a8901653a0cb391a59d012abcb2e8a07fa76
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.

2.413 × 10⁹³(94-digit number)
24135468971366758263…18940802934047580919
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
2.413 × 10⁹³(94-digit number)
24135468971366758263…18940802934047580919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.827 × 10⁹³(94-digit number)
48270937942733516526…37881605868095161839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.654 × 10⁹³(94-digit number)
96541875885467033052…75763211736190323679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.930 × 10⁹⁴(95-digit number)
19308375177093406610…51526423472380647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.861 × 10⁹⁴(95-digit number)
38616750354186813221…03052846944761294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.723 × 10⁹⁴(95-digit number)
77233500708373626442…06105693889522589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.544 × 10⁹⁵(96-digit number)
15446700141674725288…12211387779045178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.089 × 10⁹⁵(96-digit number)
30893400283349450576…24422775558090357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.178 × 10⁹⁵(96-digit number)
61786800566698901153…48845551116180715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.235 × 10⁹⁶(97-digit number)
12357360113339780230…97691102232361431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.471 × 10⁹⁶(97-digit number)
24714720226679560461…95382204464722862079
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,976,386 XPM·at block #6,841,500 · 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