Block #446,642

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/16/2014, 5:20:55 PM · Difficulty 10.3595 · 6,369,983 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c6291ee491717aa835ea5a36b0fdfe19044d1ae4ad459110cea651e7ccfb54e0

Height

#446,642

Difficulty

10.359513

Transactions

2

Size

879 B

Version

2

Bits

0a5c090f

Nonce

166,554

Timestamp

3/16/2014, 5:20:55 PM

Confirmations

6,369,983

Merkle Root

9bb7cf5ab900b90551cd8ce31fad57ec5879885bc5c2eb0e154023f6411fd2ef
Transactions (2)
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.332 × 10¹⁰⁴(105-digit number)
13320463589428735114…27793428021769556159
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.332 × 10¹⁰⁴(105-digit number)
13320463589428735114…27793428021769556159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.664 × 10¹⁰⁴(105-digit number)
26640927178857470228…55586856043539112319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.328 × 10¹⁰⁴(105-digit number)
53281854357714940457…11173712087078224639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.065 × 10¹⁰⁵(106-digit number)
10656370871542988091…22347424174156449279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.131 × 10¹⁰⁵(106-digit number)
21312741743085976182…44694848348312898559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.262 × 10¹⁰⁵(106-digit number)
42625483486171952365…89389696696625797119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.525 × 10¹⁰⁵(106-digit number)
85250966972343904731…78779393393251594239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.705 × 10¹⁰⁶(107-digit number)
17050193394468780946…57558786786503188479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.410 × 10¹⁰⁶(107-digit number)
34100386788937561892…15117573573006376959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.820 × 10¹⁰⁶(107-digit number)
68200773577875123785…30235147146012753919
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,777,123 XPM·at block #6,816,624 · 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