Block #2,278,899

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2017, 6:55:01 AM · Difficulty 10.9559 · 4,537,241 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e63333068f55dc52248dcf9432f0456514bc2d420ab3365295be93e1b4b58700

Height

#2,278,899

Difficulty

10.955881

Transactions

3

Size

65.22 KB

Version

2

Bits

0af4b4a5

Nonce

846,987,095

Timestamp

9/2/2017, 6:55:01 AM

Confirmations

4,537,241

Merkle Root

90a424f07f2ded1ab73aaf2e63c698c9466bc0f38e5d561db77ace044ec75848
Transactions (3)
1 in → 1 out8.9900 XPM110 B
445 in → 1 out104488.3887 XPM64.37 KB
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.408 × 10⁹³(94-digit number)
74081423086915932684…71324177804765038719
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.408 × 10⁹³(94-digit number)
74081423086915932684…71324177804765038719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.481 × 10⁹⁴(95-digit number)
14816284617383186536…42648355609530077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.963 × 10⁹⁴(95-digit number)
29632569234766373073…85296711219060154879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.926 × 10⁹⁴(95-digit number)
59265138469532746147…70593422438120309759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.185 × 10⁹⁵(96-digit number)
11853027693906549229…41186844876240619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.370 × 10⁹⁵(96-digit number)
23706055387813098459…82373689752481239039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.741 × 10⁹⁵(96-digit number)
47412110775626196918…64747379504962478079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.482 × 10⁹⁵(96-digit number)
94824221551252393836…29494759009924956159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.896 × 10⁹⁶(97-digit number)
18964844310250478767…58989518019849912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.792 × 10⁹⁶(97-digit number)
37929688620500957534…17979036039699824639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,773,240 XPM·at block #6,816,139 · 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