Block #917,924

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2015, 12:57:11 AM · Difficulty 10.9225 · 5,909,212 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0afc2f7969c980fa87075ff5c93b8b204bc9f2a3f7452f116b2cfd720677f96d

Height

#917,924

Difficulty

10.922473

Transactions

9

Size

2.98 KB

Version

2

Bits

0aec2731

Nonce

424,604,354

Timestamp

2/1/2015, 12:57:11 AM

Confirmations

5,909,212

Merkle Root

d0d91bd6eedd8497f3e585519dbd8234e1f35c2e0bbe8397eabff5393e94010b
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.178 × 10⁹⁵(96-digit number)
11785602991577951850…82632957172891369821
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.178 × 10⁹⁵(96-digit number)
11785602991577951850…82632957172891369821
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.357 × 10⁹⁵(96-digit number)
23571205983155903701…65265914345782739641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.714 × 10⁹⁵(96-digit number)
47142411966311807403…30531828691565479281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.428 × 10⁹⁵(96-digit number)
94284823932623614807…61063657383130958561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.885 × 10⁹⁶(97-digit number)
18856964786524722961…22127314766261917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.771 × 10⁹⁶(97-digit number)
37713929573049445923…44254629532523834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.542 × 10⁹⁶(97-digit number)
75427859146098891846…88509259065047668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.508 × 10⁹⁷(98-digit number)
15085571829219778369…77018518130095336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.017 × 10⁹⁷(98-digit number)
30171143658439556738…54037036260190673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.034 × 10⁹⁷(98-digit number)
60342287316879113476…08074072520381347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.206 × 10⁹⁸(99-digit number)
12068457463375822695…16148145040762695681
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 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
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 2CC formula:

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