Block #446,066

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/16/2014, 7:30:25 AM · Difficulty 10.3610 · 6,363,486 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
035bd3575986701eff9086a052bf7b3959dc862fd8475fec09e9f1c208136e3d

Height

#446,066

Difficulty

10.360952

Transactions

9

Size

1.97 KB

Version

2

Bits

0a5c675e

Nonce

91,252

Timestamp

3/16/2014, 7:30:25 AM

Confirmations

6,363,486

Merkle Root

b42db731fe400af1a41e1e2580b9ab7737286a6c6dc03f12f138b3e862c8393a
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.396 × 10¹⁰²(103-digit number)
13962757515190894342…67258076246892959999
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.396 × 10¹⁰²(103-digit number)
13962757515190894342…67258076246892959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.792 × 10¹⁰²(103-digit number)
27925515030381788684…34516152493785919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.585 × 10¹⁰²(103-digit number)
55851030060763577369…69032304987571839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.117 × 10¹⁰³(104-digit number)
11170206012152715473…38064609975143679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.234 × 10¹⁰³(104-digit number)
22340412024305430947…76129219950287359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.468 × 10¹⁰³(104-digit number)
44680824048610861895…52258439900574719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.936 × 10¹⁰³(104-digit number)
89361648097221723791…04516879801149439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.787 × 10¹⁰⁴(105-digit number)
17872329619444344758…09033759602298879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.574 × 10¹⁰⁴(105-digit number)
35744659238888689516…18067519204597759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.148 × 10¹⁰⁴(105-digit number)
71489318477777379033…36135038409195519999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,720,490 XPM·at block #6,809,551 · 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.

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