Block #358,541

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 4:27:22 AM · Difficulty 10.3850 · 6,458,400 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f58a9c483d9c8baa0f3c9b2594727034bcac7b4f657c8a4b8b3f4ddd7c3c8635

Height

#358,541

Difficulty

10.384967

Transactions

2

Size

1.37 KB

Version

2

Bits

0a628d2c

Nonce

133,706

Timestamp

1/14/2014, 4:27:22 AM

Confirmations

6,458,400

Merkle Root

3e1f47f07f00b1275be586246d1057d2066d6c03b2b2b460a2f5af83f5fa43ce
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.

6.093 × 10⁹⁰(91-digit number)
60932152732679321430…46660117020100797799
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
6.093 × 10⁹⁰(91-digit number)
60932152732679321430…46660117020100797799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.218 × 10⁹¹(92-digit number)
12186430546535864286…93320234040201595599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.437 × 10⁹¹(92-digit number)
24372861093071728572…86640468080403191199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.874 × 10⁹¹(92-digit number)
48745722186143457144…73280936160806382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.749 × 10⁹¹(92-digit number)
97491444372286914288…46561872321612764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.949 × 10⁹²(93-digit number)
19498288874457382857…93123744643225529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.899 × 10⁹²(93-digit number)
38996577748914765715…86247489286451059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.799 × 10⁹²(93-digit number)
77993155497829531430…72494978572902118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.559 × 10⁹³(94-digit number)
15598631099565906286…44989957145804236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.119 × 10⁹³(94-digit number)
31197262199131812572…89979914291608473599
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,779,570 XPM·at block #6,816,940 · 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