Block #347,020

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 10:00:54 PM · Difficulty 10.2375 · 6,469,905 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
217bf0ab33b324b58b516ae95538c3a36965e6d599d49416f224591db62f93c1

Height

#347,020

Difficulty

10.237538

Transactions

2

Size

540 B

Version

2

Bits

0a3ccf4b

Nonce

167,341

Timestamp

1/6/2014, 10:00:54 PM

Confirmations

6,469,905

Merkle Root

21083dcc617793d6cb007864c019de9c5445d710c019a338830a4ded964bd931
Transactions (2)
1 in → 1 out9.5400 XPM109 B
2 in → 1 out99.9900 XPM339 B
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.986 × 10⁹⁹(100-digit number)
69869640095500916729…10364169617144690561
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.986 × 10⁹⁹(100-digit number)
69869640095500916729…10364169617144690561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.397 × 10¹⁰⁰(101-digit number)
13973928019100183345…20728339234289381121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.794 × 10¹⁰⁰(101-digit number)
27947856038200366691…41456678468578762241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.589 × 10¹⁰⁰(101-digit number)
55895712076400733383…82913356937157524481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.117 × 10¹⁰¹(102-digit number)
11179142415280146676…65826713874315048961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.235 × 10¹⁰¹(102-digit number)
22358284830560293353…31653427748630097921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.471 × 10¹⁰¹(102-digit number)
44716569661120586706…63306855497260195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.943 × 10¹⁰¹(102-digit number)
89433139322241173413…26613710994520391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.788 × 10¹⁰²(103-digit number)
17886627864448234682…53227421989040783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.577 × 10¹⁰²(103-digit number)
35773255728896469365…06454843978081566721
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,779,441 XPM·at block #6,816,924 · 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