Block #673,710

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/11/2014, 6:23:17 PM · Difficulty 10.9653 · 6,127,337 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fdfa3452fd9c96acc73e2a3a2620f38e56d86f7f8230e8589406ee810fb3496e

Height

#673,710

Difficulty

10.965282

Transactions

3

Size

2.78 KB

Version

2

Bits

0af71cb2

Nonce

566,424,052

Timestamp

8/11/2014, 6:23:17 PM

Confirmations

6,127,337

Merkle Root

527895071ae79a486069c7aca89c75e8538b5e18c6172c33e056ddd6dc6629a9
Transactions (3)
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.393 × 10⁹⁸(99-digit number)
13935976069536442286…44088977095546816001
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.393 × 10⁹⁸(99-digit number)
13935976069536442286…44088977095546816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.787 × 10⁹⁸(99-digit number)
27871952139072884572…88177954191093632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.574 × 10⁹⁸(99-digit number)
55743904278145769144…76355908382187264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.114 × 10⁹⁹(100-digit number)
11148780855629153828…52711816764374528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.229 × 10⁹⁹(100-digit number)
22297561711258307657…05423633528749056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.459 × 10⁹⁹(100-digit number)
44595123422516615315…10847267057498112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.919 × 10⁹⁹(100-digit number)
89190246845033230630…21694534114996224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.783 × 10¹⁰⁰(101-digit number)
17838049369006646126…43389068229992448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.567 × 10¹⁰⁰(101-digit number)
35676098738013292252…86778136459984896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.135 × 10¹⁰⁰(101-digit number)
71352197476026584504…73556272919969792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.427 × 10¹⁰¹(102-digit number)
14270439495205316900…47112545839939584001
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,652,442 XPM·at block #6,801,046 · 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.