Block #366,083

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2014, 4:45:28 AM · Difficulty 10.4259 · 6,450,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36f6f3592670c49a5712a67b4b6bc676c9c39b4da42f6ad4910073246c5ceaaa

Height

#366,083

Difficulty

10.425928

Transactions

2

Size

1.17 KB

Version

2

Bits

0a6d0996

Nonce

10,898

Timestamp

1/19/2014, 4:45:28 AM

Confirmations

6,450,086

Merkle Root

96447518692719c72b4d39f7b960620978c2e96a3363589e944460346e685e89
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.740 × 10¹⁰⁰(101-digit number)
47408432507028211630…66950407958814061441
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.740 × 10¹⁰⁰(101-digit number)
47408432507028211630…66950407958814061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.481 × 10¹⁰⁰(101-digit number)
94816865014056423261…33900815917628122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.896 × 10¹⁰¹(102-digit number)
18963373002811284652…67801631835256245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.792 × 10¹⁰¹(102-digit number)
37926746005622569304…35603263670512491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.585 × 10¹⁰¹(102-digit number)
75853492011245138608…71206527341024983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.517 × 10¹⁰²(103-digit number)
15170698402249027721…42413054682049966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.034 × 10¹⁰²(103-digit number)
30341396804498055443…84826109364099932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.068 × 10¹⁰²(103-digit number)
60682793608996110887…69652218728199864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.213 × 10¹⁰³(104-digit number)
12136558721799222177…39304437456399728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.427 × 10¹⁰³(104-digit number)
24273117443598444354…78608874912799457281
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,773,475 XPM·at block #6,816,168 · 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