Block #2,528,599

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2018, 12:25:51 PM · Difficulty 10.9847 · 4,310,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6728a865c0c06f38d7c39db9e07c72983f369725ad22b1c59647d2b27d547cd

Height

#2,528,599

Difficulty

10.984656

Transactions

4

Size

1.26 KB

Version

2

Bits

0afc1272

Nonce

88,521,131

Timestamp

2/19/2018, 12:25:51 PM

Confirmations

4,310,082

Merkle Root

defbfebdb12b29e45792e23e6d4f76100f47d8fce7a3e784a3fb93450cddbba3
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.

3.645 × 10⁹³(94-digit number)
36459717318642452868…05707953227254958799
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
3.645 × 10⁹³(94-digit number)
36459717318642452868…05707953227254958799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.291 × 10⁹³(94-digit number)
72919434637284905737…11415906454509917599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.458 × 10⁹⁴(95-digit number)
14583886927456981147…22831812909019835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.916 × 10⁹⁴(95-digit number)
29167773854913962295…45663625818039670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.833 × 10⁹⁴(95-digit number)
58335547709827924590…91327251636079340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.166 × 10⁹⁵(96-digit number)
11667109541965584918…82654503272158681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.333 × 10⁹⁵(96-digit number)
23334219083931169836…65309006544317363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.666 × 10⁹⁵(96-digit number)
46668438167862339672…30618013088634726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.333 × 10⁹⁵(96-digit number)
93336876335724679344…61236026177269452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.866 × 10⁹⁶(97-digit number)
18667375267144935868…22472052354538905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.733 × 10⁹⁶(97-digit number)
37334750534289871737…44944104709077811199
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,953,710 XPM·at block #6,838,680 · 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