Block #735,165

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/22/2014, 10:57:13 AM · Difficulty 10.9750 · 6,075,992 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08a76b95a8e998df82068b0c1a671e3bb8a47f153a5a85643ea5d3381bac86fc

Height

#735,165

Difficulty

10.975047

Transactions

4

Size

888 B

Version

2

Bits

0af99cb5

Nonce

113,321,519

Timestamp

9/22/2014, 10:57:13 AM

Confirmations

6,075,992

Merkle Root

47962db10176dbd35062340b06961c551b287e2876aa2d915d1d9f0e996c4b8f
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.

9.265 × 10⁹⁶(97-digit number)
92650020383624577621…15010890404190848641
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
9.265 × 10⁹⁶(97-digit number)
92650020383624577621…15010890404190848641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.853 × 10⁹⁷(98-digit number)
18530004076724915524…30021780808381697281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.706 × 10⁹⁷(98-digit number)
37060008153449831048…60043561616763394561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.412 × 10⁹⁷(98-digit number)
74120016306899662097…20087123233526789121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.482 × 10⁹⁸(99-digit number)
14824003261379932419…40174246467053578241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.964 × 10⁹⁸(99-digit number)
29648006522759864838…80348492934107156481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.929 × 10⁹⁸(99-digit number)
59296013045519729677…60696985868214312961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.185 × 10⁹⁹(100-digit number)
11859202609103945935…21393971736428625921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.371 × 10⁹⁹(100-digit number)
23718405218207891871…42787943472857251841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.743 × 10⁹⁹(100-digit number)
47436810436415783742…85575886945714503681
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,733,367 XPM·at block #6,811,156 · 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