Block #2,277,304

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/1/2017, 5:24:53 AM · Difficulty 10.9552 · 4,556,312 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
744d73eccea4969467042f1ea4707ac2b3a36a1bdd9226141f757e6390f6b1d3

Height

#2,277,304

Difficulty

10.955228

Transactions

3

Size

2.95 KB

Version

2

Bits

0af489d5

Nonce

273,861,078

Timestamp

9/1/2017, 5:24:53 AM

Confirmations

4,556,312

Merkle Root

23598b1f6cf2ea554cc82944c39e61a613c2c5068dfa867345bc0137d73d7856
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.

7.382 × 10⁹⁶(97-digit number)
73823584604951183966…10660070274853867519
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
7.382 × 10⁹⁶(97-digit number)
73823584604951183966…10660070274853867519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.476 × 10⁹⁷(98-digit number)
14764716920990236793…21320140549707735039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.952 × 10⁹⁷(98-digit number)
29529433841980473586…42640281099415470079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.905 × 10⁹⁷(98-digit number)
59058867683960947173…85280562198830940159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.181 × 10⁹⁸(99-digit number)
11811773536792189434…70561124397661880319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.362 × 10⁹⁸(99-digit number)
23623547073584378869…41122248795323760639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.724 × 10⁹⁸(99-digit number)
47247094147168757738…82244497590647521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.449 × 10⁹⁸(99-digit number)
94494188294337515476…64488995181295042559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.889 × 10⁹⁹(100-digit number)
18898837658867503095…28977990362590085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.779 × 10⁹⁹(100-digit number)
37797675317735006190…57955980725180170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.559 × 10⁹⁹(100-digit number)
75595350635470012381…15911961450360340479
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,913,138 XPM·at block #6,833,615 · 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