Block #2,242,635

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/8/2017, 3:32:26 PM · Difficulty 10.9472 · 4,584,376 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fe39385eed4f9358a879be0ff3f1ba72329b3b9c93e5779d9ef537f99d60f844

Height

#2,242,635

Difficulty

10.947250

Transactions

3

Size

2.37 KB

Version

2

Bits

0af27ef5

Nonce

1,301,177,144

Timestamp

8/8/2017, 3:32:26 PM

Confirmations

4,584,376

Merkle Root

3198fcd0e75c090bbea920906d7b098cf322863e155adf1fd4a20a42c492cf96
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.

2.047 × 10⁹⁴(95-digit number)
20478932306691093714…75182011826919901159
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.047 × 10⁹⁴(95-digit number)
20478932306691093714…75182011826919901159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.095 × 10⁹⁴(95-digit number)
40957864613382187429…50364023653839802319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.191 × 10⁹⁴(95-digit number)
81915729226764374859…00728047307679604639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.638 × 10⁹⁵(96-digit number)
16383145845352874971…01456094615359209279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.276 × 10⁹⁵(96-digit number)
32766291690705749943…02912189230718418559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.553 × 10⁹⁵(96-digit number)
65532583381411499887…05824378461436837119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.310 × 10⁹⁶(97-digit number)
13106516676282299977…11648756922873674239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.621 × 10⁹⁶(97-digit number)
26213033352564599955…23297513845747348479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.242 × 10⁹⁶(97-digit number)
52426066705129199910…46595027691494696959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.048 × 10⁹⁷(98-digit number)
10485213341025839982…93190055382989393919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.097 × 10⁹⁷(98-digit number)
20970426682051679964…86380110765978787839
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,860,265 XPM·at block #6,827,010 · 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