Block #674,150

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2014, 1:54:39 AM · Difficulty 10.9652 · 6,142,356 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b70caed3384e1e5e9c4323e6ddb8dc19f6d8299f3dea740e8c52eb944e3361ca

Height

#674,150

Difficulty

10.965219

Transactions

3

Size

803 B

Version

2

Bits

0af71897

Nonce

234,850,158

Timestamp

8/12/2014, 1:54:39 AM

Confirmations

6,142,356

Merkle Root

5859781ec289713086a2c4e22ed2c28e2f173ae00ee4da6dbeb6a8c4def28b0c
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.

8.041 × 10⁹⁵(96-digit number)
80418826360896572338…67560220937799678721
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
8.041 × 10⁹⁵(96-digit number)
80418826360896572338…67560220937799678721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.608 × 10⁹⁶(97-digit number)
16083765272179314467…35120441875599357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.216 × 10⁹⁶(97-digit number)
32167530544358628935…70240883751198714881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.433 × 10⁹⁶(97-digit number)
64335061088717257870…40481767502397429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.286 × 10⁹⁷(98-digit number)
12867012217743451574…80963535004794859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.573 × 10⁹⁷(98-digit number)
25734024435486903148…61927070009589719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.146 × 10⁹⁷(98-digit number)
51468048870973806296…23854140019179438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.029 × 10⁹⁸(99-digit number)
10293609774194761259…47708280038358876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.058 × 10⁹⁸(99-digit number)
20587219548389522518…95416560076717752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.117 × 10⁹⁸(99-digit number)
41174439096779045037…90833120153435504641
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,776,171 XPM·at block #6,816,505 · 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