Block #2,271,798

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 11:37:51 AM · Difficulty 10.9540 · 4,554,999 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff8e1904e3d7eff5c817560574ec8b5aaba3089d7d3ab3acf363576b1761b579

Height

#2,271,798

Difficulty

10.954005

Transactions

5

Size

1.80 KB

Version

2

Bits

0af439ad

Nonce

257,949,607

Timestamp

8/28/2017, 11:37:51 AM

Confirmations

4,554,999

Merkle Root

1b14601f5f27ca2fe61b53fa292b4eaa5639c74be0a9727e650d8844e7c1a918
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.820 × 10⁹³(94-digit number)
38205964267602473775…08373573254501376001
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.820 × 10⁹³(94-digit number)
38205964267602473775…08373573254501376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.641 × 10⁹³(94-digit number)
76411928535204947550…16747146509002752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.528 × 10⁹⁴(95-digit number)
15282385707040989510…33494293018005504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.056 × 10⁹⁴(95-digit number)
30564771414081979020…66988586036011008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.112 × 10⁹⁴(95-digit number)
61129542828163958040…33977172072022016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.222 × 10⁹⁵(96-digit number)
12225908565632791608…67954344144044032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.445 × 10⁹⁵(96-digit number)
24451817131265583216…35908688288088064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.890 × 10⁹⁵(96-digit number)
48903634262531166432…71817376576176128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.780 × 10⁹⁵(96-digit number)
97807268525062332865…43634753152352256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.956 × 10⁹⁶(97-digit number)
19561453705012466573…87269506304704512001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,858,539 XPM·at block #6,826,796 · 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