Block #361,732

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 6:21:10 AM · Difficulty 10.4091 · 6,452,283 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00e80bb78bebffa655da75a35f137cbb927e0fc8a24f8a1b9c7f8637b8f449d6

Height

#361,732

Difficulty

10.409096

Transactions

2

Size

429 B

Version

2

Bits

0a68ba82

Nonce

10,160

Timestamp

1/16/2014, 6:21:10 AM

Confirmations

6,452,283

Merkle Root

95d7ee957768537171712596c8e5ca665f8cc3d226a3cba2621fd8a5f77e238b
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.

7.465 × 10⁹⁸(99-digit number)
74658381501206698963…60746347598772677119
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
7.465 × 10⁹⁸(99-digit number)
74658381501206698963…60746347598772677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.493 × 10⁹⁹(100-digit number)
14931676300241339792…21492695197545354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.986 × 10⁹⁹(100-digit number)
29863352600482679585…42985390395090708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.972 × 10⁹⁹(100-digit number)
59726705200965359170…85970780790181416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.194 × 10¹⁰⁰(101-digit number)
11945341040193071834…71941561580362833919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.389 × 10¹⁰⁰(101-digit number)
23890682080386143668…43883123160725667839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.778 × 10¹⁰⁰(101-digit number)
47781364160772287336…87766246321451335679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.556 × 10¹⁰⁰(101-digit number)
95562728321544574672…75532492642902671359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.911 × 10¹⁰¹(102-digit number)
19112545664308914934…51064985285805342719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.822 × 10¹⁰¹(102-digit number)
38225091328617829869…02129970571610685439
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,756,204 XPM·at block #6,814,014 · 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