Block #752,562

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/4/2014, 10:10:08 PM · Difficulty 10.9728 · 6,058,073 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6aa7a20109a47e5f0818f60efc24b6602b9067cb03c0bc73f9613803f9ad3386

Height

#752,562

Difficulty

10.972812

Transactions

7

Size

1.50 KB

Version

2

Bits

0af90a3b

Nonce

622,701,410

Timestamp

10/4/2014, 10:10:08 PM

Confirmations

6,058,073

Merkle Root

2d61d87cae0cea69bfa9331e3df77e4c930b500d00d9f570d650725749a9f68a
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.

4.679 × 10⁹³(94-digit number)
46791762981515100165…08785046809386508801
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
4.679 × 10⁹³(94-digit number)
46791762981515100165…08785046809386508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.358 × 10⁹³(94-digit number)
93583525963030200330…17570093618773017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.871 × 10⁹⁴(95-digit number)
18716705192606040066…35140187237546035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.743 × 10⁹⁴(95-digit number)
37433410385212080132…70280374475092070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.486 × 10⁹⁴(95-digit number)
74866820770424160264…40560748950184140801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.497 × 10⁹⁵(96-digit number)
14973364154084832052…81121497900368281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.994 × 10⁹⁵(96-digit number)
29946728308169664105…62242995800736563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.989 × 10⁹⁵(96-digit number)
59893456616339328211…24485991601473126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.197 × 10⁹⁶(97-digit number)
11978691323267865642…48971983202946252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.395 × 10⁹⁶(97-digit number)
23957382646535731284…97943966405892505601
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,729,167 XPM·at block #6,810,634 · 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.

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