Block #2,287,757

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2017, 11:27:27 AM · Difficulty 10.9556 · 4,554,486 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
890ad747f04e64901abf52e2616ecf7f4f2681e27c632ebfb2700b439d6acb9f

Height

#2,287,757

Difficulty

10.955639

Transactions

30

Size

6.19 KB

Version

2

Bits

0af4a4c3

Nonce

121,980,408

Timestamp

9/8/2017, 11:27:27 AM

Confirmations

4,554,486

Merkle Root

8b2985e8544a2718f3be3890ec2589c8e306ff4b183cf7949b8e74ae579845e0
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.602 × 10⁹⁴(95-digit number)
36023820890794125068…35857148688849285121
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.602 × 10⁹⁴(95-digit number)
36023820890794125068…35857148688849285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.204 × 10⁹⁴(95-digit number)
72047641781588250137…71714297377698570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.440 × 10⁹⁵(96-digit number)
14409528356317650027…43428594755397140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.881 × 10⁹⁵(96-digit number)
28819056712635300055…86857189510794280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.763 × 10⁹⁵(96-digit number)
57638113425270600110…73714379021588561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.152 × 10⁹⁶(97-digit number)
11527622685054120022…47428758043177123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.305 × 10⁹⁶(97-digit number)
23055245370108240044…94857516086354247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.611 × 10⁹⁶(97-digit number)
46110490740216480088…89715032172708495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.222 × 10⁹⁶(97-digit number)
92220981480432960176…79430064345416990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.844 × 10⁹⁷(98-digit number)
18444196296086592035…58860128690833981441
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,982,342 XPM·at block #6,842,242 · 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