Block #2,297,805

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/16/2017, 4:30:11 AM · Difficulty 10.9457 · 4,529,304 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1261697006e180b519c1b5316655e61536dfa81819ebc089eefa51db18c911ae

Height

#2,297,805

Difficulty

10.945692

Transactions

4

Size

1.54 KB

Version

2

Bits

0af218da

Nonce

1,098,641,535

Timestamp

9/16/2017, 4:30:11 AM

Confirmations

4,529,304

Merkle Root

655f9faacf7be6f82677f24e52d77b28ef5d20e558c5e5ea25f1bdad9e2cae98
Transactions (4)
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.

6.636 × 10⁹⁴(95-digit number)
66369309437754620447…22916108362419087039
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
6.636 × 10⁹⁴(95-digit number)
66369309437754620447…22916108362419087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.327 × 10⁹⁵(96-digit number)
13273861887550924089…45832216724838174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.654 × 10⁹⁵(96-digit number)
26547723775101848179…91664433449676348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.309 × 10⁹⁵(96-digit number)
53095447550203696358…83328866899352696319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.061 × 10⁹⁶(97-digit number)
10619089510040739271…66657733798705392639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.123 × 10⁹⁶(97-digit number)
21238179020081478543…33315467597410785279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.247 × 10⁹⁶(97-digit number)
42476358040162957086…66630935194821570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.495 × 10⁹⁶(97-digit number)
84952716080325914172…33261870389643141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.699 × 10⁹⁷(98-digit number)
16990543216065182834…66523740779286282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.398 × 10⁹⁷(98-digit number)
33981086432130365669…33047481558572564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.796 × 10⁹⁷(98-digit number)
67962172864260731338…66094963117145128959
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,861,051 XPM·at block #6,827,108 · 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