Block #2,335,749

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/13/2017, 10:07:42 PM · Difficulty 10.9205 · 4,496,851 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
74ac8f44de74511111e8f5cebe7d799f748ce4aaf4410fef83a8292ef7fc5011

Height

#2,335,749

Difficulty

10.920485

Transactions

11

Size

2.41 KB

Version

2

Bits

0aeba4e0

Nonce

494,923,764

Timestamp

10/13/2017, 10:07:42 PM

Confirmations

4,496,851

Merkle Root

67fff76c09f9085f67bd3c4607a40fdc9488442054735b61cd85fd467770b9aa
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.706 × 10⁹²(93-digit number)
17066172611636068124…40543090040763848561
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.706 × 10⁹²(93-digit number)
17066172611636068124…40543090040763848561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.413 × 10⁹²(93-digit number)
34132345223272136248…81086180081527697121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.826 × 10⁹²(93-digit number)
68264690446544272496…62172360163055394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.365 × 10⁹³(94-digit number)
13652938089308854499…24344720326110788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.730 × 10⁹³(94-digit number)
27305876178617708998…48689440652221576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.461 × 10⁹³(94-digit number)
54611752357235417997…97378881304443153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.092 × 10⁹⁴(95-digit number)
10922350471447083599…94757762608886307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.184 × 10⁹⁴(95-digit number)
21844700942894167198…89515525217772615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.368 × 10⁹⁴(95-digit number)
43689401885788334397…79031050435545231361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.737 × 10⁹⁴(95-digit number)
87378803771576668795…58062100871090462721
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,904,951 XPM·at block #6,832,599 · 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