The   Verifiable Credentials Working Group   invites implementations of the following Candidate Recommendation Snapshots: Verifiable Credential Data Integrity 1.0  describes mechanisms for ensuring the authenticity and integrity of Verifiable Credentials and similar types of constrained digital documents using cryptography, especially through the use of digital signatures and related mathematical proofs. Data Integrity EdDSA Cryptosuites v1.0  describes a Data Integrity cryptographic suite for use when creating or verifying a digital signature using the twisted Edwards Curve Digital Signature Algorithm (EdDSA) and Curve25519 (ed25519). Data Integrity ECDSA Cryptosuites v1.0  describes a Data Integrity Cryptosuite for use when generating a digital signature using the Elliptic Curve Digital Signature Algorithm (ECDSA). Verifiable Credentials JSON Schema Specification : Among other things, the  [VC-DATA-MODEL-2.0]  specifies the models used for Ver...

  W3C has approved the   updated 2023 Process Document , which takes effect today. The only change is expanding the W3C Technical Architecture Group ( TAG ) from 6 elected and 3 appointed participants to 8 elected and 3 appointed participants.  The TAG consists of: Tim Berners-Lee who is a life member; 3 participants appointed by the W3C Team; 8 participants elected by the W3C Advisory Committee following the  AB/TAG nomination and election process .  You can read the  Disposition of Comments  for rationale or peruse the  diff  from the previous version.  W3C Process Document is developed by the Advisory Board’s Process Task Force working within the  W3C Process Community Group . Comments and feedback on the Process Document may be sent as issues in the  public GitHub Repository .

  The   RDF Dataset Canonicalization and Hash Working Group   invites implementations of the   RDF Dataset Canonicalization   Candidate Recommendation Snapshot. RDF [ RDF11-CONCEPTS ] describes a graph-based data model for making claims about the world and provides the foundation for reasoning upon that graph of information. At times, it becomes necessary to compare the differences between sets of graphs, digitally sign them, or generate short identifiers for graphs via hashing algorithms. This document outlines an algorithm for normalizing   RDF datasets such that these operations can be performed.