Block #2,204,977

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/13/2017, 10:30:32 AM · Difficulty 10.9470 · 4,637,850 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11f2d6782e8ff1cbfcd08fa51a742e71fc2e17f88e2faea91d6ef9ee056964a0

Height

#2,204,977

Difficulty

10.947014

Transactions

2

Size

870 B

Version

2

Bits

0af26f82

Nonce

267,308,867

Timestamp

7/13/2017, 10:30:32 AM

Confirmations

4,637,850

Merkle Root

7686d8b37ca916ef71775f74d9fbf9bb49c93d1e291bc50f9b445e3801a1b17a
Transactions (2)
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.

1.386 × 10⁹⁵(96-digit number)
13862257722828254291…26982023345523768321
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
1.386 × 10⁹⁵(96-digit number)
13862257722828254291…26982023345523768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.772 × 10⁹⁵(96-digit number)
27724515445656508583…53964046691047536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.544 × 10⁹⁵(96-digit number)
55449030891313017166…07928093382095073281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.108 × 10⁹⁶(97-digit number)
11089806178262603433…15856186764190146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.217 × 10⁹⁶(97-digit number)
22179612356525206866…31712373528380293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.435 × 10⁹⁶(97-digit number)
44359224713050413733…63424747056760586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.871 × 10⁹⁶(97-digit number)
88718449426100827466…26849494113521172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.774 × 10⁹⁷(98-digit number)
17743689885220165493…53698988227042344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.548 × 10⁹⁷(98-digit number)
35487379770440330986…07397976454084689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.097 × 10⁹⁷(98-digit number)
70974759540880661972…14795952908169379841
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,986,959 XPM·at block #6,842,826 · 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