Block #723,621

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/16/2014, 5:50:33 AM · Difficulty 10.9578 · 6,090,854 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9cdb00ef8ac3072f1bccbd81c9a1c1978786afe20d4575b13518ede54538744f

Height

#723,621

Difficulty

10.957789

Transactions

6

Size

1.73 KB

Version

2

Bits

0af531a8

Nonce

1,150,985,443

Timestamp

9/16/2014, 5:50:33 AM

Confirmations

6,090,854

Merkle Root

180eace4527a88f8d17c07345a2efadbdab6da5bd043128ae7796fb6931cd2eb
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.

6.401 × 10⁹³(94-digit number)
64014960568710416813…81843449475135239361
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
6.401 × 10⁹³(94-digit number)
64014960568710416813…81843449475135239361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.280 × 10⁹⁴(95-digit number)
12802992113742083362…63686898950270478721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.560 × 10⁹⁴(95-digit number)
25605984227484166725…27373797900540957441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.121 × 10⁹⁴(95-digit number)
51211968454968333450…54747595801081914881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.024 × 10⁹⁵(96-digit number)
10242393690993666690…09495191602163829761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.048 × 10⁹⁵(96-digit number)
20484787381987333380…18990383204327659521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.096 × 10⁹⁵(96-digit number)
40969574763974666760…37980766408655319041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.193 × 10⁹⁵(96-digit number)
81939149527949333521…75961532817310638081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.638 × 10⁹⁶(97-digit number)
16387829905589866704…51923065634621276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.277 × 10⁹⁶(97-digit number)
32775659811179733408…03846131269242552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.555 × 10⁹⁶(97-digit number)
65551319622359466817…07692262538485104641
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,759,875 XPM·at block #6,814,474 · 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