Block #360,210

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2014, 7:38:01 AM · Difficulty 10.3908 · 6,456,096 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e3e3500f147753ed22d4871746fb2f9d23f8fd0e10c0808c9193d678086e507e

Height

#360,210

Difficulty

10.390824

Transactions

4

Size

1.36 KB

Version

2

Bits

0a640d08

Nonce

286,747

Timestamp

1/15/2014, 7:38:01 AM

Confirmations

6,456,096

Merkle Root

ab25f1931280a1b20931fa87877b0c1ca4e8faa47b155262b149cc00a60d773f
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.

4.880 × 10⁹⁹(100-digit number)
48807551820638140331…38186162909265390401
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
4.880 × 10⁹⁹(100-digit number)
48807551820638140331…38186162909265390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.761 × 10⁹⁹(100-digit number)
97615103641276280663…76372325818530780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.952 × 10¹⁰⁰(101-digit number)
19523020728255256132…52744651637061561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.904 × 10¹⁰⁰(101-digit number)
39046041456510512265…05489303274123123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.809 × 10¹⁰⁰(101-digit number)
78092082913021024530…10978606548246246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.561 × 10¹⁰¹(102-digit number)
15618416582604204906…21957213096492492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.123 × 10¹⁰¹(102-digit number)
31236833165208409812…43914426192984985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.247 × 10¹⁰¹(102-digit number)
62473666330416819624…87828852385969971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.249 × 10¹⁰²(103-digit number)
12494733266083363924…75657704771939942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.498 × 10¹⁰²(103-digit number)
24989466532166727849…51315409543879884801
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,774,568 XPM·at block #6,816,305 · 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