Block #2,223,729

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/26/2017, 1:06:28 PM · Difficulty 10.9463 · 4,601,967 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c4eb9d582c4c25221b9c2bd19e9e2ee9adc3cc3eb2b10d0738da4a856ea0d8da

Height

#2,223,729

Difficulty

10.946270

Transactions

15

Size

4.30 KB

Version

2

Bits

0af23ec7

Nonce

328,903,065

Timestamp

7/26/2017, 1:06:28 PM

Confirmations

4,601,967

Merkle Root

a0f2570c08b64fe43fa0cb8768bf7da545f377a067960682caf783262713dbca
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.596 × 10⁹³(94-digit number)
15968063892357444646…15549272586244420439
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.596 × 10⁹³(94-digit number)
15968063892357444646…15549272586244420439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.193 × 10⁹³(94-digit number)
31936127784714889293…31098545172488840879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.387 × 10⁹³(94-digit number)
63872255569429778587…62197090344977681759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.277 × 10⁹⁴(95-digit number)
12774451113885955717…24394180689955363519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.554 × 10⁹⁴(95-digit number)
25548902227771911435…48788361379910727039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.109 × 10⁹⁴(95-digit number)
51097804455543822870…97576722759821454079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.021 × 10⁹⁵(96-digit number)
10219560891108764574…95153445519642908159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.043 × 10⁹⁵(96-digit number)
20439121782217529148…90306891039285816319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.087 × 10⁹⁵(96-digit number)
40878243564435058296…80613782078571632639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.175 × 10⁹⁵(96-digit number)
81756487128870116592…61227564157143265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.635 × 10⁹⁶(97-digit number)
16351297425774023318…22455128314286530559
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,849,680 XPM·at block #6,825,695 · 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