skip to main content


This content will become publicly available on June 24, 2025

Title: Addition is Most You Need: Efficient Floating-Point SRAM Compute-in-Memory by Harnessing Mantissa Addition
Award ID(s):
1942900 2416375
PAR ID:
10535381
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
IEEE/ACM
Date Published:
ISBN:
978-1-4503-9142-9
Format(s):
Medium: X
Location:
San Francisco, CA
Sponsoring Org:
National Science Foundation
More Like this
  1. Modern data privacy regulations such as GDPR, CCPA, and CDPA stipulate that data pertaining to a user must be deleted without undue delay upon the user’s request. Existing systems are not designed to comply with these regulations and can leave traces of deleted data for indeterminate periods of time, often as long as months. We developed Lethe to address these problems by providing fine-grained secure deletion on any system and any storage medium, provided that Lethe has access to a fixed, small amount of securely-deletable storage. Lethe achieves this using keyed hash forests (KHFs), extensions of keyed hash trees (KHTs), structured to serve as efficient representations of encryption key hierarchies. By using a KHF as a regulator for data access, Lethe provides its secure deletion not by removing the KHF, but by adding a new KHF that only grants access to still-valid data. Access to the previous KHF is lost, and the data it regulated securely deleted, through the secure deletion of the single key that protected the previous KHF. 
    more » « less
  2. Modern data privacy regulations such as GDPR, CCPA, and CDPA stipulate that data pertaining to a user must be deleted without undue delay upon the user’s request. Existing sys- tems are not designed to comply with these regulations and can leave traces of deleted data for indeterminate periods of time, often as long as months. We developed Lethe to address these problems by pro- viding fine-grained secure deletion on any system and any storage medium, provided that Lethe has access to a fixed, small amount of securely-deletable storage. Lethe achieves this using keyed hash forests (KHFs), extensions of keyed hash trees (KHTs), structured to serve as efficient representations of encryption key hierarchies. By using a KHF as a regulator for data access, Lethe provides its secure deletion not by re- moving the KHF, but by adding a new KHF that only grants access to still-valid data. Access to the previous KHF is lost, and the data it regulated securely deleted, through the secure deletion of the single key that protected the previous KHF. 
    more » « less
  3. Abstract

    We report the first enantioselective addition of pyrazoles to 1,3‐dienes. Secondary and tertiary allylic pyrazoles can be generated with excellent regioselectivity. Mechanistic studies support a pathway distinct from previous hydroaminations: a Pd0‐catalyzed ligand‐to‐ligand hydrogen transfer (LLHT). This hydroamination tolerates a range of functional groups and advances the field of diene hydrofunctionalization.

     
    more » « less